{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S5W5DXFCNJF5ALVUAI3WJDXWYG","short_pith_number":"pith:S5W5DXFC","schema_version":"1.0","canonical_sha256":"976dd1dca26a4bd02eb40237648ef6c1a18efc06887b2656da9cab35da3e06dc","source":{"kind":"arxiv","id":"2607.27957","version":1},"attestation_state":"computed","paper":{"title":"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ananya Chakraborty, Manik Banik, Ronald de Wolf","submitted_at":"2026-07-30T10:04:53Z","abstract_excerpt":"We establish an exponential communication advantage enabled by multipartite quantum entanglement. Building on the bipartite Hidden Matching problem, we introduce a communication task involving multiple spatially separated senders and a single receiver. We show that a shared Greenberger-Horne-Zeilinger state enables completion of this task using only logarithmically many bits of classical communication from each sender. In contrast, without preshared entanglement, any protocol achieving high success probability requires polynomial communication from at least one sender, even when \\emph{quantum}"},"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.27957","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T10:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"55b09ce46795bc625e3a12b4863dc2a9a2a1f28dec2f7f2d7a715255652a1175","abstract_canon_sha256":"0c9fd10481d55bdfff6d153ad328156644fbf82478e156fc29f0babb1f85fa3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"976dd1dca26a4bd02eb40237648ef6c1a18efc06887b2656da9cab35da3e06dc","last_reissued_at":"2026-07-31T01:35:03.581619Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:03.581619Z"},"graph_snapshot":{"paper":{"title":"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ananya Chakraborty, Manik Banik, Ronald de Wolf","submitted_at":"2026-07-30T10:04:53Z","abstract_excerpt":"We establish an exponential communication advantage enabled by multipartite quantum entanglement. Building on the bipartite Hidden Matching problem, we introduce a communication task involving multiple spatially separated senders and a single receiver. We show that a shared Greenberger-Horne-Zeilinger state enables completion of this task using only logarithmically many bits of classical communication from each sender. In contrast, without preshared entanglement, any protocol achieving high success probability requires polynomial communication from at least one sender, even when \\emph{quantum}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27957","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.27957/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.27957","created_at":"2026-07-31T01:35:03.585041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27957v1","created_at":"2026-07-31T01:35:03.585041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27957","created_at":"2026-07-31T01:35:03.585041+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5W5DXFCNJF5","created_at":"2026-07-31T01:35:03.585041+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5W5DXFCNJF5ALVU","created_at":"2026-07-31T01:35:03.585041+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5W5DXFC","created_at":"2026-07-31T01:35:03.585041+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03986","citing_title":"A lower bound on the classical simulation cost of star-network correlations","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG","json":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG.json","graph_json":"https://pith.science/api/pith-number/S5W5DXFCNJF5ALVUAI3WJDXWYG/graph.json","events_json":"https://pith.science/api/pith-number/S5W5DXFCNJF5ALVUAI3WJDXWYG/events.json","paper":"https://pith.science/paper/S5W5DXFC"},"agent_actions":{"view_html":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG","download_json":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG.json","view_paper":"https://pith.science/paper/S5W5DXFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27957&json=true","fetch_graph":"https://pith.science/api/pith-number/S5W5DXFCNJF5ALVUAI3WJDXWYG/graph.json","fetch_events":"https://pith.science/api/pith-number/S5W5DXFCNJF5ALVUAI3WJDXWYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG/action/storage_attestation","attest_author":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG/action/author_attestation","sign_citation":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG/action/citation_signature","submit_replication":"https://pith.science/pith/S5W5DXFCNJF5ALVUAI3WJDXWYG/action/replication_record"}},"created_at":"2026-07-31T01:35:03.585041+00:00","updated_at":"2026-07-31T01:35:03.585041+00:00"}