{"as_of":"2026-08-16T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88f6037e7ed6763c43d679b625a5ea101dd7901357a60f50854b980ca5d9bd62","coverage":[{"denominator":75,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":75,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T14:18:46.291346Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T16:40:03.769171Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T08:50:58.194968Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"cited_work":{"arxiv_id":"2512.21112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2512.21112","snapshot_observed_at":"2026-07-28T03:24:07.654185Z","title":"Coding-logic correspondence: Turning information and communication networks into logical formulae via hypergraph Heyting algebra","venue":null,"work_id":"8f07e1cd-23b6-470d-814e-d1bb52cab9af","year":2025},"citing_paper":{"arxiv_id":"2604.10868","last_updated":"2026-07-27T16:43:43Z","snapshot_observed_at":"2026-08-14T15:34:32.373215Z","submitted_at":"2026-04-13T00:35:52Z","title":"A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T16:28:39.042995Z"},"links":{"cited_paper":"/paper/2512.21112","citing_paper":"/paper/2604.10868"},"observation_digest":"sha256:f12436b3827206a0f6fc63621da42454b821d1487e5ab58f79ddd264bee90488","observation_id":"8ec433fe-8cdc-4a63-93d2-2584c43d2a16","resolution":{"observed_at":"2026-07-28T03:24:07.654185Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.21112","snapshot_observed_at":"2026-08-02T16:40:03.769171Z","title":"Coding-logic correspondence: Turning information and communication networks into logical formulae via hypergraph Heyting algebra,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.10868","last_updated":"2026-07-27T16:43:43Z","snapshot_observed_at":"2026-08-14T15:34:32.373215Z","submitted_at":"2026-04-13T00:35:52Z","title":"A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T16:40:03.769171Z"},"links":{"cited_paper":"/paper/2512.21112","citing_paper":"/paper/2604.10868"},"observation_digest":"sha256:61f658a98f7a14326214af7cf7d29ae9e01526c5131e181b958c4ea09f3c3a2a","observation_id":"c3ebf445-c830-4d02-acdb-04c8709f4b0c","resolution":{"observed_at":"2026-08-02T16:40:03.769171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2512.21112/citation-record","integrity":"/paper/2512.21112/integrity","json":"/paper/2512.21112/citation-record.json","paper":"/paper/2512.21112"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:38.797988Z","title":"On the amount of information,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:38.797988Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:5861e9474c1e850d1c0f5657921345ad8ca43d317a8c676afe9832cf6ab579b2","observation_id":"3b8a7045-36f8-4d62-94e6-bad5482d1dcb","resolution":{"observed_at":"2026-08-03T14:18:38.797988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:38.898706Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:38.898706Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:ccb01da0b66b45a19410f027ae5248a724eddebcb45727d03aead8840b65c53f","observation_id":"f2cf6e5a-7d75-4e3a-a53f-2fd33394139d","resolution":{"observed_at":"2026-08-03T14:18:38.898706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.014407Z","title":"A new outlook on Shannon’s information measures,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.014407Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:5b6f0ab9f6a3771f6f2ee02cee04694bf33eda554e0201b4510f80d0e413230e","observation_id":"d81a74bb-450b-408d-9dd1-b8b64bcba5dd","resolution":{"observed_at":"2026-08-03T14:18:39.014407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.150688Z","title":"An introduction to partition logic,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.150688Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:6033edc792b6d5fc6ecb5c401d05fedbc175b9340c43643fc239d85cc89e248c","observation_id":"13964d48-9291-4503-9664-124787e7bfde","resolution":{"observed_at":"2026-08-03T14:18:39.150688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.306456Z","title":"Logical information theory: new logical foundations for information theory,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.306456Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:a39b1f272115ec77f1a00c87d6bfecb9bdd77cccf0a3b5e5455a2cb99a14d321","observation_id":"1f6c7626-e4dc-4312-8419-e6001c7831b5","resolution":{"observed_at":"2026-08-03T14:18:39.306456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.447885Z","title":"Logical entropy: Introduction to classical and quantum logical information theory,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.447885Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:ae466e2937f55cd8c2d4a758a3ca7ac0c2857c02294147a554b06fcefd801b7b","observation_id":"f333e028-8296-48c5-9490-a42fde7a8fc4","resolution":{"observed_at":"2026-08-03T14:18:39.447885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.565134Z","title":"A logarithmic decomposition for information,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.565134Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:0b5f5e2958451441023a498a21df07242b35be8f8ea4b0aa3a573dcda25ec5eb","observation_id":"2e90427d-6610-4dd9-b11a-9c0de98f229f","resolution":{"observed_at":"2026-08-03T14:18:39.565134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.687710Z","title":"A Poisson decomposition for information and the information-event diagram,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.687710Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:ad4bf46c83e623df9c98f4dbd5773b74f82433de3c277ca007a190e8e673ea7f","observation_id":"0f59be03-2b1f-4b72-b64b-525317471e04","resolution":{"observed_at":"2026-08-03T14:18:39.687710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.839161Z","title":"On the capacity of uniform hypergraphs,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.839161Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:43e7aadf3a802ba6bffb4249554e5b5adaa0279d443d9fb070649eb3b04832c0","observation_id":"d9b14de6-27fe-4ada-a78c-19127913237d","resolution":{"observed_at":"2026-08-03T14:18:39.839161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:39.991403Z","title":"Entanglement-assisted zero-error communication,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:39.991403Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:049bc0898b7418910a340aeddb56b262937a772e051f93ff9995c07082c9a664","observation_id":"12f3af48-ff14-48f1-9dfc-ec4fd48c25bc","resolution":{"observed_at":"2026-08-03T14:18:39.991403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.165172Z","title":"Die formalen regeln der intuitionistischen logik,","venue":null,"work_id":null,"year":1930},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.165172Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:670a8d5a913a407893eaf1139b3abf678fd2010d54defb57d60eff8c76536338","observation_id":"56923dee-0a0c-44a6-aed2-14fd987d6c86","resolution":{"observed_at":"2026-08-03T14:18:40.165172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.276804Z","title":"Esakia,Heyting Algebras: Duality Theory, ser","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.276804Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:371434ccf933d3637b04c51950a70c66b70f675f5e660da841947e5ca643000e","observation_id":"88b605f0-8e3d-4f20-a7f5-2933c492137d","resolution":{"observed_at":"2026-08-03T14:18:40.276804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.387236Z","title":"Finite problems,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.387236Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:83bbfd99ace90e6acdab70db15f795d69be2f6c88f4adc1d4bbb06607a20a78f","observation_id":"222bf0c0-a351-4ed7-831c-3e9cb8746158","resolution":{"observed_at":"2026-08-03T14:18:40.387236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.510679Z","title":"Intermediate logics and factors of the Medvedev lattice,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.510679Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:473fc9b7166bad97232859ad2016ea234392fa171580cba4c12521b81ad2b4b7","observation_id":"cd1ff303-afe6-41ae-baf7-a2e0b6ea2eca","resolution":{"observed_at":"2026-08-03T14:18:40.510679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.599072Z","title":"Network information flow,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.599072Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:5c3c4e5840a089a9c5e83e1a7c7d421685bb59e04216ac60b53ff844b98c54e4","observation_id":"b7670f4e-1a6c-4437-a784-6bcdffff64d3","resolution":{"observed_at":"2026-08-03T14:18:40.599072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.679525Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.679525Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:21e85b220736357256aae30ce0287cd005771084c781e1a603dcdaca84021aa1","observation_id":"9da9a1ff-0d18-4236-a46f-4675ee21128a","resolution":{"observed_at":"2026-08-03T14:18:40.679525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.797858Z","title":"Über die bausteine der mathematischen logik,","venue":null,"work_id":null,"year":1924},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.797858Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:1afe4cebe9e15203340d1a30c1bc8c27eb9dcd10f1064a49ff01283585054da8","observation_id":"08f8745d-bd5f-4473-bc1f-1cdc93d83f98","resolution":{"observed_at":"2026-08-03T14:18:40.797858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:40.929466Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:40.929466Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:3eeffe8afb1f2c91997b628ddcff5ff37b9cb3f1178a6f28bc9b858f1a2d88de","observation_id":"9da1ca5d-986a-4ced-97f1-aaf1abec0fa5","resolution":{"observed_at":"2026-08-03T14:18:40.929466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.008915Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.008915Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:efaa24a2f4515e6686030f7c0bc2f9b28d05085ec69f474c8699ec9b717601bd","observation_id":"31513787-2a01-4438-b317-726220799170","resolution":{"observed_at":"2026-08-03T14:18:41.008915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.132383Z","title":"Linear network coding,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.132383Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:77531c1d23fed9c0bc140d67cd84cb94081ae63318b69841c68e1575b372c77f","observation_id":"c92ff724-ddcf-4395-90a6-9d7d7da089d6","resolution":{"observed_at":"2026-08-03T14:18:41.132383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.224132Z","title":"Informed-source coding-on-demand (ISCOD) over broadcast channels,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.224132Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:32ff249931907ef81bf76c4ce877b027d4ffad830f462a93e5ff0c4de733b7a1","observation_id":"e7c7d68e-0450-46aa-b7f8-b68d0d0d60f5","resolution":{"observed_at":"2026-08-03T14:18:41.224132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.281735Z","title":"Index coding with side information,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.281735Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:1760137a100c8ade9aed16f9a9312be9e5e6dad4024c926b66222480bbafa741","observation_id":"04b8bc0e-f0ae-4fd1-859d-4a223b236ca8","resolution":{"observed_at":"2026-08-03T14:18:41.281735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.406058Z","title":"On the index coding problem and its relation to network coding and matroid theory,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.406058Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:62a0acd5762e7120c88076be70666675ca28d131a9487facf48c374b751a4f58","observation_id":"60ffe334-8f59-4e60-a21e-1a6b9f4f437f","resolution":{"observed_at":"2026-08-03T14:18:41.406058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.545853Z","title":"Noiseless coding of correlated information sources,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.545853Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:071e6fa92ca8254da84dbef0dfba2eee94c5baa28ee92b2a3c7c92733860d87e","observation_id":"710b73f9-ce9b-475a-b3d8-1f04c0c20b0d","resolution":{"observed_at":"2026-08-03T14:18:41.545853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.718739Z","title":"Source coding for a simple network,","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.718739Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:1a222fa1da7aaf2154296f15fd74aa1159589dc02eb432f36d20620c542924d0","observation_id":"a203f1fc-e23a-47eb-8088-0bfa7a291cd0","resolution":{"observed_at":"2026-08-03T14:18:41.718739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.879477Z","title":"The formulae-as-types notion of construction,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.879477Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:17f2f1c8259f78d831e3de3b96fad84b2bb6fd3c4fa48b39337403a61a2eed3b","observation_id":"42cd0300-0a19-4845-93dd-642085d8b85b","resolution":{"observed_at":"2026-08-03T14:18:41.879477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:41.999091Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:41.999091Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:149f1f34211b1dc368ce8ddc5940131a2b35ea8a7462c1963cd49088e8b7201b","observation_id":"fcaab7b7-d82d-4627-a85b-e0d45520ec5f","resolution":{"observed_at":"2026-08-03T14:18:41.999091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.080509Z","title":"New bounds for perfect hashing via information theory,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.080509Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:b7cb1234491e251fd1b4cb03d8e7e7f3996737335a9f2d1a0916be42a3bf3298","observation_id":"c9779ce3-a890-4cd6-b06f-24987f9edfe1","resolution":{"observed_at":"2026-08-03T14:18:42.080509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.166262Z","title":"Graph entropy: a survey,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.166262Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:77b3801a1fe396443a2876696ae94993139fafe752837ffbceaff7dfa4c3385f","observation_id":"7b9e2759-d332-4318-bd1d-4a6748a85d88","resolution":{"observed_at":"2026-08-03T14:18:42.166262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.251733Z","title":"Coding of an information source having ambiguous alphabet and the entropy of graphs,","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.251733Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:f9d3ad210d026f211d060fdbf84f5d31371d47907daf37142079ebea539a3e06","observation_id":"819d06a0-daa7-42e9-ac22-589a2f09a5fc","resolution":{"observed_at":"2026-08-03T14:18:42.251733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.381581Z","title":"A method for the construction of minimum-redundancy codes,","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.381581Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:efd9798a3da6c4e0f51e133f9a65a38c97a331b959fc8c2ed3013098c73b7500","observation_id":"d9af92ec-0f17-4f43-8b9b-9915f9d9775a","resolution":{"observed_at":"2026-08-03T14:18:42.381581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.429225Z","title":"Strong functional representation lemma and applications to coding theorems,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.429225Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:74fee0c904e7aacbb6917465e867be0d8019367d92a47416597af0a49683521a","observation_id":"b6f81dc9-e7fb-421e-ab47-43ba17517c8f","resolution":{"observed_at":"2026-08-03T14:18:42.429225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.508766Z","title":"Discrete layered entropy, conditional compression and a tighter strong functional representation lemma,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.508766Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:85cc814759f5f38ebcf4f04b9a612a7e365b79eebbf02cfcd047aaae5d1b79ef","observation_id":"99794afa-06b0-4ad0-bdae-9d9998434635","resolution":{"observed_at":"2026-08-03T14:18:42.508766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.623942Z","title":"The zero error capacity of a noisy channel,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.623942Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:88232fa646aeebf21815a316dd56a97c213b247ce39363c249658eef0d1fc53c","observation_id":"aba798b2-d9aa-49a4-9ee9-61b2cb22fe04","resolution":{"observed_at":"2026-08-03T14:18:42.623942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.711176Z","title":"The Shannon capacity of a graph and the independence numbers of its powers,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.711176Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:31e939d09391e5045fd08891a321f316b39de392dce71001dd9a0b94948618e9","observation_id":"cf22165f-a60c-4880-9750-cbffb79a2e50","resolution":{"observed_at":"2026-08-03T14:18:42.711176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.781000Z","title":"Zero error capacity under list decoding,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.781000Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:f63ea6766b4d7fb95203378c150328583081ff532f931368e3014c386d5891d9","observation_id":"4f8d293e-cea2-4f8f-aad0-fdafdd920d29","resolution":{"observed_at":"2026-08-03T14:18:42.781000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:42.910020Z","title":"A formulae-as-type notion of control,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:42.910020Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:782f3c53c85744c9b080ee55adbeac2e0f72ed917bf7577c7c2129792d364609","observation_id":"dbc0362c-e4b3-453a-bed9-619b9e9b76da","resolution":{"observed_at":"2026-08-03T14:18:42.910020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.039168Z","title":"Logic of infinite problems and Kripke models on atomic semilattices of sets,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.039168Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:105be0b9d0304fa2d0ad180f598835f021a4fe7487ce3fed21e9ea6d108a6c95","observation_id":"5275ef8e-b859-43f3-b944-ea6fb8e37015","resolution":{"observed_at":"2026-08-03T14:18:43.039168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.100546Z","title":"Common information is far less than mutual information,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.100546Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:51411aaa98533ac4a4da1ebf396e402f2f2b5cc14200da8d2f98b917b5c0501a","observation_id":"d069e337-3b86-45be-9804-5f5b7f5a2a36","resolution":{"observed_at":"2026-08-03T14:18:43.100546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.203083Z","title":"Information lattices and subgroup lattices: Isomorphisms and approximations,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.203083Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:7da0a5dc1498188504838be906aa092c2ff39fbd1959f4d1ff9b1b5a15a96ad6","observation_id":"c82dee0f-0a5a-4f18-a8b0-a35770c75e5a","resolution":{"observed_at":"2026-08-03T14:18:43.203083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.285628Z","title":"Possible generalization of Boltzmann-Gibbs statistics,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.285628Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:898a9e5b8fc58770482b236690ef400f8eb3e2ce112e83fda08b8582efce3aaf","observation_id":"f30347d5-5a6a-4755-a359-ec56b5c49ce7","resolution":{"observed_at":"2026-08-03T14:18:43.285628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.376734Z","title":"The common information of two dependent random variables,","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.376734Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:f1894f65187c9db986354d3841d802cab5dfc765404058d90269178d2776de76","observation_id":"d31ba857-8faa-42a9-b27d-c87015e8d07d","resolution":{"observed_at":"2026-08-03T14:18:43.376734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.445440Z","title":"Exact common information,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.445440Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:2d21e6d746101571412abe479953dbdfc13f88e41945ea0e060e9d35a3ab2b76","observation_id":"9e6b7502-67d3-470e-b11a-51cad01b0a46","resolution":{"observed_at":"2026-08-03T14:18:43.445440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.539344Z","title":"Extended Gray–Wyner system with complementary causal side information,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.539344Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:11deaa7d71ebc192f25f0207b4e77bb045a73991e55e521f4fb8c1db71b25dba","observation_id":"9c84be6e-d895-4a83-bc20-54c25ca2b7ba","resolution":{"observed_at":"2026-08-03T14:18:43.539344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.627995Z","title":"An inequality on guessing and its application to sequential decoding,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.627995Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:77f3b785fa88d0eeaec9712f7dcca03f2c61fcc1ac3c6985855891074ff58325","observation_id":"547dd81f-69c0-4bbe-9934-8afe91bd7232","resolution":{"observed_at":"2026-08-03T14:18:43.627995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.725641Z","title":"Encoding tasks and rényi entropy,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.725641Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:f6ae3e7fdda8f9fd553ed42775f219e3655da626ff18c8834c51297f925bc71c","observation_id":"53450418-d3ed-4703-a2a9-afce08f2324a","resolution":{"observed_at":"2026-08-03T14:18:43.725641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.789164Z","title":"Semantic information,","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.789164Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:a38ac10325812d9ccca1276b4d12ad93704b00774e49d128a90a79854c04bfcc","observation_id":"a56bf092-45c6-46ba-8f9c-4d15575b3e2f","resolution":{"observed_at":"2026-08-03T14:18:43.789164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.10414","last_updated":"2025-09-12T22:19:01Z","snapshot_observed_at":"2026-08-16T16:00:19.709832Z","submitted_at":"2023-01-25T05:34:21Z","title":"Towards a Unification of Logic and Information Theory","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.10414","snapshot_observed_at":"2026-08-03T14:18:43.856963Z","title":"Towards a unification of logic and information theory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.856963Z"},"links":{"cited_paper":"/paper/2301.10414","citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:861c1343f6233da954f2cc72bf58e15e505e9cde2fcd1391745d94e29284b372","observation_id":"737cc83c-fc5b-43ca-8936-cadee860f446","resolution":{"observed_at":"2026-08-03T14:18:43.856963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:43.935485Z","title":"Eijck and A","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:43.935485Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:bea931fd7f7dfd5396b45dd6b096c8892a070c79f553820fe49a9a32b5208d46","observation_id":"e7e37635-ab90-46b0-9136-be6da91ed88c","resolution":{"observed_at":"2026-08-03T14:18:43.935485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.088500Z","title":"On the logic of information flow,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.088500Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:9f9119d50283597af60689aab47851d1c120199c2a42263adef4ff17f86ca79a","observation_id":"81f464c9-0bd0-47d1-a2e4-db19b6ac21a4","resolution":{"observed_at":"2026-08-03T14:18:44.088500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.152898Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.152898Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:daf1308bad0de25540a87aabea487f2170dbbd657212504f37bbf476adb841f6","observation_id":"53648d8a-1a9d-46b0-8bf2-8de5ce7562fe","resolution":{"observed_at":"2026-08-03T14:18:44.152898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.239190Z","title":"Symmetric heyting relation algebras with applications to hypergraphs,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.239190Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:e69771e63665b6076e83a7716de0942debe235b7f1cfa7c1b701631f01818a0c","observation_id":"0970bfd5-bc95-4de8-868f-fe27b4eabd6a","resolution":{"observed_at":"2026-08-03T14:18:44.239190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.309677Z","title":"Berger,Rate Distortion Theory: A Mathematical Basis for Data Compression","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.309677Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:dbbace4cca14446f33051cb090eba62c9e8db1d011bdf46d98cb7bd538f98fc2","observation_id":"2dcf629b-869f-4b15-b0f1-e07acf8d34be","resolution":{"observed_at":"2026-08-03T14:18:44.309677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.369928Z","title":"Relaxations of vertex packing,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.369928Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:c3119c5a8599ca6f778062e0f98efbad21bb8fde92887ed2dbcb93735c151dcc","observation_id":"bad8a599-98ce-4e6b-b5a1-d9442952819f","resolution":{"observed_at":"2026-08-03T14:18:44.369928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.456256Z","title":"Entropy splitting for antiblocking corners and perfect graphs,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.456256Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:931fe2554d86c27a880a70c6e5c0223f79ea0684bf754b960f452cfd643978ac","observation_id":"6bfe29f4-5c59-436c-897d-e2da3fff3c62","resolution":{"observed_at":"2026-08-03T14:18:44.456256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.518413Z","title":"On measures of entropy and information,","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.518413Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:a353ea9638a143bb10070e69927c0e6e26320ea32c748ac84b90fc6c272bbd56","observation_id":"2fb38c30-7f41-4771-ae5e-fc95fadc9b30","resolution":{"observed_at":"2026-08-03T14:18:44.518413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.582018Z","title":"Transmission of information,","venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.582018Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:e5daecd489423a6dcd65d6ee1e980f621a2fcfb2d188c16ebd29823297f4038e","observation_id":"862ec4fb-c3d6-494e-8bbc-78c4205c063c","resolution":{"observed_at":"2026-08-03T14:18:44.582018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.665942Z","title":"Esakia duals of regular Heyting algebras,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.665942Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:71a05d018ee7365e0e928b64abd3dfd50df52f6359ff5b734334e6e0a54b5a33","observation_id":"a0a9f18f-0ea0-49d6-ba60-34fba8b4d8c4","resolution":{"observed_at":"2026-08-03T14:18:44.665942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.763225Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.763225Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:028ab0c2b4c527cbaba804aa1279254cc6465e6e345e48348cb1bf83b5eba88c","observation_id":"b171ae2c-186c-4d9a-b6f3-5adc14c21b01","resolution":{"observed_at":"2026-08-03T14:18:44.763225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.829136Z","title":"A propositional calculus with denumerable matrix,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.829136Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:415ee2bb004701b5896347aae9950f769615df4ac1744bb51cd8f16df66fdfeb","observation_id":"e07a1765-2ffb-4bdd-9dab-d88d659a5f00","resolution":{"observed_at":"2026-08-03T14:18:44.829136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.913387Z","title":"Polynomial codes over certain finite fields,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.913387Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:6954989c098def6a3d15636be9ee4651aa10cb62af32bc5d7feb6f1b00d9ac38","observation_id":"deba55af-c32d-46ff-b8a4-ff9c1dad80cc","resolution":{"observed_at":"2026-08-03T14:18:44.913387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:44.973885Z","title":"Eine unableitbarkeitsbeweismethode für den intuitionistischen aussagenkalkül,","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:44.973885Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:e221981ba8350cd3ea505d452a23370a807b2681dff0040d26906fe1e5d9cb7f","observation_id":"4c17423a-9632-4ea7-9c48-c955382fb185","resolution":{"observed_at":"2026-08-03T14:18:44.973885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.016068Z","title":"Some results on intermediate constructive logics,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.016068Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:dfdffd2f9bd9c4c90640376df6fde2ce9e326ccf574e7deab5f92a0aaacbd49a","observation_id":"90205ce7-4db0-41e1-99ed-360d850efe79","resolution":{"observed_at":"2026-08-03T14:18:45.016068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17242","last_updated":"2025-03-17T19:18:29Z","snapshot_observed_at":"2026-08-16T12:55:42.167791Z","submitted_at":"2025-02-24T15:19:10Z","title":"An Intermediate Logic Contained in Medvedev's Logic with Disjunction Property","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17242","snapshot_observed_at":"2026-08-03T14:18:45.077838Z","title":"An intermediate logic contained in Medvedev’s logic with disjunction property,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.077838Z"},"links":{"cited_paper":"/paper/2502.17242","citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:9077dd4772b56060b5ca1e5d2dd3c15d7e9abad9e9c264a4136cfa5748016e59","observation_id":"a8960164-1b03-4c43-826d-194eef3957a1","resolution":{"observed_at":"2026-08-03T14:18:45.077838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.156750Z","title":"Aubin and H","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.156750Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:1d4700ca227c6c75ef095ec8ff05c9edf81878e793a9c008195b339d09dfb3ce","observation_id":"61dded3c-ba24-4598-b597-686a1f3f499a","resolution":{"observed_at":"2026-08-03T14:18:45.156750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.252616Z","title":"Relative capacity and dimension of graphs,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.252616Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:341376640280fa63b6290f48ac7b773dee5be90349fe460cf676b47d7391dc7e","observation_id":"e9bcfcf8-f7d2-4c9f-a323-aacba99529af","resolution":{"observed_at":"2026-08-03T14:18:45.252616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.316089Z","title":"Graph information ratio,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.316089Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:e2626bd92a292a62a356bbea3bd2cc252e316c2dd9a952b7c5d230d88fb43abc","observation_id":"71ebf5ac-cd0d-4e1b-a564-e5e88692266f","resolution":{"observed_at":"2026-08-03T14:18:45.316089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.397043Z","title":"Computation of channel capacity and rate-distortion functions,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.397043Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:b2c95c90baeb824777837c7d1b5006f8c002ff42d50958f13c96c898b2460c23","observation_id":"484a780b-5a78-4e67-9c3a-312da138cae3","resolution":{"observed_at":"2026-08-03T14:18:45.397043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.468997Z","title":"An algorithm for computing the capacity of arbitrary discrete memoryless channels,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.468997Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:77168ed2690dbeca0e366a44433a2a3a15903ce64d0420b0b4edbac64491395b","observation_id":"7f088c3b-88d8-4a15-b056-4c29936e1c4e","resolution":{"observed_at":"2026-08-03T14:18:45.468997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.533685Z","title":"The theory of representation for Boolean algebras,","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.533685Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:a98f7929f020edc006117e37d922022b86162418283f471633a3c114e7c89a6c","observation_id":"76aeddbf-536e-49ef-bf48-4a6f11bdb670","resolution":{"observed_at":"2026-08-03T14:18:45.533685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.619931Z","title":"On join-dense subsets of certain families of aggregation functions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.619931Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:209e13fab22ed8f5b8761f9afdc8fba8e319865c7d9ab0902c014581ee9b63ac","observation_id":"dd8ea0aa-88e9-449b-90a5-f42d22fa70fb","resolution":{"observed_at":"2026-08-03T14:18:45.619931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.715962Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.715962Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:78dc15b5001e57a80deaa520eefaf31c98d0db9978adc37f780e42a45c1accb8","observation_id":"1b3d01d1-9866-4811-b08a-5295e9c51d61","resolution":{"observed_at":"2026-08-03T14:18:45.715962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:45.877801Z","title":"Join-prime elements in semidistributive lattices,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:45.877801Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:9c303cfb732b3edb67dba34a2f5cc3585a802bdaadadf899ede0bafec4c627a0","observation_id":"0ccfa207-0b23-4b73-8e82-0f9bc99b13f9","resolution":{"observed_at":"2026-08-03T14:18:45.877801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:46.178674Z","title":"Channel simulation: Theory and applications to lossy compression and differential privacy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:46.178674Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:c6f6bd1d58e31623f4be17e83adcaf021dc4cf9dcfbb806620a14e60d50e756e","observation_id":"ec68a28d-cd9e-46a9-b786-f445e3d56cb7","resolution":{"observed_at":"2026-08-03T14:18:46.178674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:18:46.291346Z","title":"The proof theory and semantics of intuitionistic modal logic,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T14:18:46.291346Z"},"links":{"citing_paper":"/paper/2512.21112"},"observation_digest":"sha256:c888162326b421e02fd344efc0a7af5ae8b0184b014507c3724c63ac3d16eb13","observation_id":"bd50df36-d01f-4a08-9ac4-04e31564b8ac","resolution":{"observed_at":"2026-08-03T14:18:46.291346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.21112","last_updated":"2026-07-27T17:26:04Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T12:18:12.333160Z","submitted_at":"2025-12-24T11:20:29Z","title":"Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra"},"reference_resolution":{"displayed":75,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":75,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":75},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 75 of 75 outbound references and 2 inbound Pith citation observations for arXiv:2512.21112."}