{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z7GRKYQZFMVN3C7NUEU7GZDAK5","short_pith_number":"pith:Z7GRKYQZ","schema_version":"1.0","canonical_sha256":"cfcd1562192b2add8beda129f36460577cad63055ab1880785727cc03a223fcd","source":{"kind":"arxiv","id":"2607.08133","version":1},"attestation_state":"computed","paper":{"title":"Communication Advantages from Quantum Dense Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Brian Doolittle, Ian George","submitted_at":"2026-07-09T06:08:43Z","abstract_excerpt":"A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.08133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-09T06:08:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3826d5560ae0c9e0fc6743364cd352394c4cac2ab0651e5978f6b29e4ff3fd32","abstract_canon_sha256":"30032221c99343ed99ca18b919e685b9741e4130fe68b1d86456f310854129b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:27.533422Z","signature_b64":"iK7rKSkOA9E0MI1GGcQaILVdQ454lp2w/o4PYrO4ua3eKNsXFgJcaJH2oM3wdIBclT9bxCNFA/49dfUqG5BhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcd1562192b2add8beda129f36460577cad63055ab1880785727cc03a223fcd","last_reissued_at":"2026-07-10T01:19:27.532948Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:27.532948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Advantages from Quantum Dense Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Brian Doolittle, Ian George","submitted_at":"2026-07-09T06:08:43Z","abstract_excerpt":"A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08133","kind":"arxiv","version":1},"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/2607.08133/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.08133","created_at":"2026-07-10T01:19:27.533006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08133v1","created_at":"2026-07-10T01:19:27.533006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08133","created_at":"2026-07-10T01:19:27.533006+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7GRKYQZFMVN","created_at":"2026-07-10T01:19:27.533006+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7GRKYQZFMVN3C7N","created_at":"2026-07-10T01:19:27.533006+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7GRKYQZ","created_at":"2026-07-10T01:19:27.533006+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5","json":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5.json","graph_json":"https://pith.science/api/pith-number/Z7GRKYQZFMVN3C7NUEU7GZDAK5/graph.json","events_json":"https://pith.science/api/pith-number/Z7GRKYQZFMVN3C7NUEU7GZDAK5/events.json","paper":"https://pith.science/paper/Z7GRKYQZ"},"agent_actions":{"view_html":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5","download_json":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5.json","view_paper":"https://pith.science/paper/Z7GRKYQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08133&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7GRKYQZFMVN3C7NUEU7GZDAK5/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7GRKYQZFMVN3C7NUEU7GZDAK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5/action/storage_attestation","attest_author":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5/action/author_attestation","sign_citation":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5/action/citation_signature","submit_replication":"https://pith.science/pith/Z7GRKYQZFMVN3C7NUEU7GZDAK5/action/replication_record"}},"created_at":"2026-07-10T01:19:27.533006+00:00","updated_at":"2026-07-10T01:19:27.533006+00:00"}