{"id":"https://openalex.org/W7225313131","doi":"https://doi.org/10.5281/zenodo.23980540","title":"Glyphic Residuum: Exact Structural Factorization and Self-Certifying DAG Compression for Formal Proofs, Reasoning Traces, and Symbolic State Trajectories","display_name":"Glyphic Residuum: Exact Structural Factorization and Self-Certifying DAG Compression for Formal Proofs, Reasoning Traces, and Symbolic State Trajectories","publication_year":2026,"publication_date":"2026-11-05","ids":{"openalex":"https://openalex.org/W7225313131","doi":"https://doi.org/10.5281/zenodo.23980540"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23980540","doi":"https://doi.org/10.5281/zenodo.23980540","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23980540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23980540","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5160755439","display_name":"Dylan C. Kawalec","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kawalec, Dylan C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5160755439"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8008000254631042,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8008000254631042,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.18469999730587006,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sha-256-digests","display_name":"SHA-256 digests","score":0.734000027179718},{"id":"https://openalex.org/keywords/lean-4","display_name":"Lean 4","score":0.8550000190734863},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.38100001215934753},{"id":"https://openalex.org/keywords/subgraph-isomorphism","display_name":"subgraph isomorphism","score":0.8140000104904175},{"id":"https://openalex.org/keywords/content-addressed-storage","display_name":"content-addressed storage","score":0.5379999876022339}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7103000283241272},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49950000643730164},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.49639999866485596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43560001254081726},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.373199999332428},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29760000109672546},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.2605000138282776},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2603999972343445},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5281/zenodo.23980540","doi":"https://doi.org/10.5281/zenodo.23980540","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23980540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.5281/zenodo.23980541","doi":"https://doi.org/10.5281/zenodo.23980541","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23980541","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.5281/zenodo.23982245","doi":"https://doi.org/10.5281/zenodo.23982245","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23982245","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"doi:10.5281/zenodo.23980540","doi":"https://doi.org/10.5281/zenodo.23980540","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23980540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7162459750","https://openalex.org/W7140199127","https://openalex.org/W2606952915","https://openalex.org/W2585222631","https://openalex.org/W6964466277","https://openalex.org/W2138947530","https://openalex.org/W7206209212","https://openalex.org/W3185216534","https://openalex.org/W4297926500","https://openalex.org/W7100613889"],"abstract_inverted_index":{"Background":[0],"&":[1,228,392],"Problem:":[2],"Machine-checked":[3],"formal":[4],"verification":[5],"corpora,":[6],"autonomous":[7],"AI":[8],"reasoning":[9,75],"trees,":[10],"and":[11,36,44,53,82,94,123,140,159,197,248,261,279,285,331,372,382,418,421,430,453],"symbolic":[12,474],"state":[13],"trajectories":[14,334],"exhibit":[15],"massive":[16],"structural":[17,145,320],"redundancy":[18],"across":[19,77,282],"documents,":[20],"yet":[21],"resist":[22],"conventional":[23],"byte-stream":[24],"compression.":[25],"Because":[26],"sealed":[27],"proof":[28,300],"artifacts":[29],"(such":[30],"as":[31,63,209],"Lean":[32,234,366],"4":[33,235,367],"kernel":[34],"receipts":[35],"content-addressed":[37,137],"intermediate":[38],"representations)":[39],"bind":[40],"every":[41,275],"syntax":[42],"node":[43,160],"document":[45],"envelope":[46],"with":[47,306,348,387,426],"64-character":[48],"SHA-256":[49,126],"digests,":[50],"standard":[51],"statistical":[52],"dictionary":[54],"compressors":[55],"(gzip,":[56],"zstd,":[57],"LZMA2)":[58],"treat":[59],"deterministic":[60],"cryptographic":[61,280],"hashes":[62],"incompressible":[64],"high-entropy":[65],"literals\u2014achieving":[66],"only":[67,142,311],"3.6\u00d7":[68],"to":[69,327,337,342,471],"14.0\u00d7":[70],"compression":[71,101,339],"while":[72],"duplicating":[73],"identical":[74],"subgraphs":[76],"files.":[78],"Method":[79],"(Structural":[80],"Factorization":[81],"the":[83,116,143,148,153,231,240,318,323,404,415],"Residuum":[84],"Law):":[85],"This":[86],"paper":[87],"presents":[88],"Glyphic":[89],"Residuum,":[90],"a":[91,135,169,176,190,210,243,249,262,298,353],"partial,":[92],"injective,":[93],"self-certifying":[95,170],"domain":[96,416],"codec":[97,241],"that":[98,204,296],"achieves":[99],"two-orders-of-magnitude":[100],"by":[102,175,185,200,363,413],"factoring":[103],"admitted":[104],"corpora":[105],"into":[106,134],"four":[107],"persistence":[108],"classes":[109],"(G0\u2013G3).":[110],"Rather":[111],"than":[112],"compressing":[113],"serialized":[114],"text,":[115],"encoder":[117],"strips":[118],"all":[119,205],"decoder-owned":[120],"grammar":[121],"(G0)":[122],"deterministically":[124],"regenerable":[125],"node/seal":[127],"digests":[128],"(G1),":[129],"collapses":[130],"cross-file":[131],"subgraph":[132],"isomorphism":[133],"single":[136],"bulk":[138],"DAG,":[139],"persists":[141],"irreducible":[144],"remainder":[146],"(G2,":[147],"residuum":[149],"\u03c1).":[150],"To":[151],"break":[152],"circular":[154],"dependency":[155],"between":[156,194],"graph":[157],"adjacency":[158],"ordering":[161],"without":[162,450,469],"storing":[163],"explicit":[164],"pointer":[165],"tables,":[166],"we":[167],"introduce":[168],"incremental":[171,289],"Kahn":[172],"replay":[173],"governed":[174],"gated":[177],"topological":[178,212],"priority":[179,192],"functional.":[180],"Weighting":[181],"each":[182],"internal":[183,195],"constructor":[184],"its":[186,304],"RED-child":[187],"count":[188],"establishes":[189],"strict":[191,354],"gap":[193],"constructors":[196],"zero-arity":[198],"leaves\u2014guaranteeing":[199],"our":[201,291],"Leaf-Suffix":[202],"Theorem":[203],"leaf":[206],"nodes":[207],"flush":[208],"contiguous":[211],"suffix":[213],"whose":[214],"1-byte":[215],"wire":[216,325,385],"span":[217],"never":[218],"overflows":[219],"whenever":[220],"unique":[221],"leaves":[222],"satisfy":[223],"B":[224,341,344],"\u2264":[225],"256.":[226],"Results":[227],"Verification:":[229],"On":[230,288],"frozen":[232],"24-file":[233],"reference":[236],"corpus":[237],"(2,598,463":[238],"bytes),":[239],"produces":[242],"13,303-byte":[244],"standalone":[245],"archive":[246,309,314],"(195.3\u00d7)":[247],"13,157-byte":[250],"wrapped":[251],"container":[252],"(197.5\u00d7)\u2014a":[253],"54.5\u00d7":[254],"improvement":[255,264],"over":[256,265],"gzip":[257],"-9":[258],"(716,622":[259],"B)":[260],"14.1\u00d7":[263],"XZ/LZMA9e":[266],"(185,600":[267],"B)\u2014while":[268],"guaranteeing":[269],"100%":[270],"source-free,":[271],"byte-for-byte":[272],"reconstruction":[273],"of":[274,303],"filename,":[276],"JSON":[277],"body,":[278],"seal":[281],"bit-identical":[283],"Python":[284],"Rust":[286],"implementations.":[287],"workloads,":[290],"marginal":[292,313],"novelty":[293],"engine":[294],"demonstrates":[295],"appending":[297],"53,193-byte":[299],"sharing":[301],"74.2%":[302],"structure":[305],"an":[307,373,438],"existing":[308],"requires":[310],"+253":[312],"bytes":[315],"(210.2\u00d7).":[316],"Extending":[317],"same":[319],"factorization":[321],"above":[322],"core":[324],"format":[326],"multi-frame":[328],"procedural":[329],"animations":[330],"UI":[332],"session":[333],"yields":[335],"303.8\u00d7":[336],"427.0\u00d7":[338],"(12,747":[340],"16,622":[343],"for":[345],"75\u201390":[346],"frames)":[347],"sub-millisecond":[349],"warm":[350],"seeks":[351],"under":[352],"1":[355],"MiB":[356],"retained-content":[357],"memory":[358],"ceiling.":[359],"Correctness":[360],"is":[361],"backed":[362],"27":[364],"mechanized":[365],"theorems,":[368],"TLA+":[369],"safety":[370],"models,":[371],"adversarial":[374],"test":[375],"gauntlet":[376],"spanning":[377],"211,680":[378],"exhaustive":[379],"single-bit":[380],"flips":[381],"128":[383],"checksum-repaired":[384],"mutations":[386],"zero":[388],"partial":[389],"outputs.":[390],"Scope":[391],"Theoretical":[393],"Boundaries:":[394],"Nothing":[395],"in":[396],"this":[397],"construction":[398],"violates":[399],"Shannon":[400],"information":[401],"theory":[402],"or":[403],"pigeonhole":[405],"counting":[406],"bound:":[407],"high":[408],"ratios":[409],"are":[410],"achieved":[411],"strictly":[412],"restricting":[414],"D":[417],"eliminating":[419],"representational":[420],"cross-document":[422],"redundancy.":[423],"We":[424],"conclude":[425],"rigorous":[427],"boundary":[428],"audits":[429],"falsification":[431],"controls,":[432],"proving":[433],"why":[434,441,454],"trajectory":[435],"indirection":[436],"obeys":[437],"index-amortization":[439],"law,":[440],"bounded-width":[442],"resolution":[443],"saturates":[444],"on":[445],"K4":[446],"Tseitin":[447],"parity":[448],"counterexamples":[449],"collapsing":[451],"NP,":[452],"already":[455],"entropy-coded":[456],"media":[457],"bitstreams":[458],"(H.264/MP4":[459],"at":[460],"H0":[461],"=":[462],"8.0000":[463],"bits/byte)":[464],"cannot":[465],"be":[466],"structurally":[467],"factored":[468],"access":[470],"their":[472],"pre-rendered":[473],"scene":[475],"state.":[476]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-11-06T00:00:00"}