{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4TBOTY3C5573MSS2OUV2ZZLDPN","short_pith_number":"pith:4TBOTY3C","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"},"canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","source":{"kind":"arxiv","id":"2512.21112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.21112","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"2512.21112v2","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21112","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"4TBOTY3C5573","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_16","alias_value":"4TBOTY3C5573MSS2","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_8","alias_value":"4TBOTY3C","created_at":"2026-07-28T02:24:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4TBOTY3C5573MSS2OUV2ZZLDPN","target":"record","payload":{"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"},"canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","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"},"source_kind":"arxiv","source_id":"2512.21112","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-28T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7C4VhlRnoAoXTRHBOX4vzEel1CDjKm/1zTcgL6ELzojWJ3EtnZIORlQb8eIxwYxjv3yUPF0zkhgmPrX1H8NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:33:49.964427Z"},"content_sha256":"51395c93df05c63c3424484a198ee4653b10bf084ed40679f8232bba90968366","schema_version":"1.0","event_id":"sha256:51395c93df05c63c3424484a198ee4653b10bf084ed40679f8232bba90968366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4TBOTY3C5573MSS2OUV2ZZLDPN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-28T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dDKw97PA4x9UC+5NOS9spEcE6xOy9FTjU4G8L3KZMS1pDci5QZyyii3T8BhUvYvxXt2sITyHVHI/PCCBcguBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:33:49.964948Z"},"content_sha256":"5e0aaa473ef691890900375a0cff9a94e6cc12fbcb18d5684b5768bc02da77da","schema_version":"1.0","event_id":"sha256:5e0aaa473ef691890900375a0cff9a94e6cc12fbcb18d5684b5768bc02da77da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/bundle.json","state_url":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T09:33:49Z","links":{"resolver":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN","bundle":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/bundle.json","state":"https://pith.science/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TBOTY3C5573MSS2OUV2ZZLDPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4TBOTY3C5573MSS2OUV2ZZLDPN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c17290657bde68de293bd6a9eeb5f0e8db15e054e667c35e939627d16204fe8","cross_cats_sorted":["math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-12-24T11:20:29Z","title_canon_sha256":"915cfefe4687f215401bb37aff8049f11d495c3ec912eeafdd5fae1d8a83acbc"},"schema_version":"1.0","source":{"id":"2512.21112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.21112","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"2512.21112v2","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21112","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"4TBOTY3C5573","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_16","alias_value":"4TBOTY3C5573MSS2","created_at":"2026-07-28T02:24:17Z"},{"alias_kind":"pith_short_8","alias_value":"4TBOTY3C","created_at":"2026-07-28T02:24:17Z"}],"graph_snapshots":[{"event_id":"sha256:5e0aaa473ef691890900375a0cff9a94e6cc12fbcb18d5684b5768bc02da77da","target":"graph","created_at":"2026-07-28T02:24:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.21112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cheuk Ting Li","cross_cats":["math.IT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.21112","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:51395c93df05c63c3424484a198ee4653b10bf084ed40679f8232bba90968366","target":"record","created_at":"2026-07-28T02:24:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c17290657bde68de293bd6a9eeb5f0e8db15e054e667c35e939627d16204fe8","cross_cats_sorted":["math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-12-24T11:20:29Z","title_canon_sha256":"915cfefe4687f215401bb37aff8049f11d495c3ec912eeafdd5fae1d8a83acbc"},"schema_version":"1.0","source":{"id":"2512.21112","kind":"arxiv","version":2}},"canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c2e9e362ef7fb64a5a752bace5637b7c3bc0b8b676da940d39064dfd00bf60","first_computed_at":"2026-07-28T02:24:17.998394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:24:17.998394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOnlkv57mlVfGWHJuh9bUjtBdylDhBfQtDXswg0qT6ScO/32z0Rh1IyKD8zjrsVKHHhSqWATpWVXovhVK4yiBw==","signature_status":"signed_v1","signed_at":"2026-07-28T02:24:18.000069Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.21112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51395c93df05c63c3424484a198ee4653b10bf084ed40679f8232bba90968366","sha256:5e0aaa473ef691890900375a0cff9a94e6cc12fbcb18d5684b5768bc02da77da"],"state_sha256":"7a9e54d7cef6eb9d34caaf237f93dcc2e887a5e24cd0c22a7aef283cd0fed312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHrhfXeHGo7yLiFqQTiC0PE89A3qKF1I6MlVSsQ3Ojp1oAE5n4MmzY9pUOA4RsuZZPQAOn9JowiadWEKYo0tAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:33:49.969647Z","bundle_sha256":"9fd4731750ac977a1259284ac7a1a1105a3c4df5bbd36ef0b49c964fbdeee533"}}