{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4TBOTY3C5573MSS2OUV2ZZLDPN","short_pith_number":"pith:4TBOTY3C","schema_version":"1.0","canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","source":{"kind":"arxiv","id":"2512.21112","version":2},"attestation_state":"computed","paper":{"title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.LO"],"primary_cat":"cs.IT","authors_text":"Cheuk Ting Li","submitted_at":"2025-12-24T11:20:29Z","abstract_excerpt":"We propose using confusion hypergraph (hyperconfusion) as a model of information. In contrast to the conventional approach using random variables, we can now perform conjunction, disjunction and implication of information, forming a Heyting algebra. Using the connection between Heyting algebra and intuitionistic logic, we can express the requirements of a communication network (e.g., network coding, index coding, Slepian-Wolf coding) as a logical formula, allowing us to use the hypergraph Heyting algebra to directly compute the optimal coding scheme. The optimal communication cost is simply gi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2512.21112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-12-24T11:20:29Z","cross_cats_sorted":["math.IT","math.LO"],"title_canon_sha256":"915cfefe4687f215401bb37aff8049f11d495c3ec912eeafdd5fae1d8a83acbc","abstract_canon_sha256":"0c17290657bde68de293bd6a9eeb5f0e8db15e054e667c35e939627d16204fe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:18.000069Z","signature_b64":"EOnlkv57mlVfGWHJuh9bUjtBdylDhBfQtDXswg0qT6ScO/32z0Rh1IyKD8zjrsVKHHhSqWATpWVXovhVK4yiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","last_reissued_at":"2026-07-28T02:24:17.998394Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:17.998394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.LO"],"primary_cat":"cs.IT","authors_text":"Cheuk Ting Li","submitted_at":"2025-12-24T11:20:29Z","abstract_excerpt":"We propose using confusion hypergraph (hyperconfusion) as a model of information. In contrast to the conventional approach using random variables, we can now perform conjunction, disjunction and implication of information, forming a Heyting algebra. Using the connection between Heyting algebra and intuitionistic logic, we can express the requirements of a communication network (e.g., network coding, index coding, Slepian-Wolf coding) as a logical formula, allowing us to use the hypergraph Heyting algebra to directly compute the optimal coding scheme. The optimal communication cost is simply gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.21112","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.21112/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2512.21112","created_at":"2026-07-28T02:24:17.999065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.21112v2","created_at":"2026-07-28T02:24:17.999065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21112","created_at":"2026-07-28T02:24:17.999065+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TBOTY3C5573","created_at":"2026-07-28T02:24:17.999065+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TBOTY3C5573MSS2","created_at":"2026-07-28T02:24:17.999065+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TBOTY3C","created_at":"2026-07-28T02:24:17.999065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.10868","citing_title":"A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN","json":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN.json","graph_json":"https://pith.science/api/pith-number/4TBOTY3C5573MSS2OUV2ZZLDPN/graph.json","events_json":"https://pith.science/api/pith-number/4TBOTY3C5573MSS2OUV2ZZLDPN/events.json","paper":"https://pith.science/paper/4TBOTY3C"},"agent_actions":{"view_html":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN","download_json":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN.json","view_paper":"https://pith.science/paper/4TBOTY3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.21112&json=true","fetch_graph":"https://pith.science/api/pith-number/4TBOTY3C5573MSS2OUV2ZZLDPN/graph.json","fetch_events":"https://pith.science/api/pith-number/4TBOTY3C5573MSS2OUV2ZZLDPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/action/storage_attestation","attest_author":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/action/author_attestation","sign_citation":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/action/citation_signature","submit_replication":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/action/replication_record"}},"created_at":"2026-07-28T02:24:17.999065+00:00","updated_at":"2026-07-28T02:24:17.999065+00:00"}