{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q3USAXTOGT4OGSAIHME3OOOTA3","short_pith_number":"pith:Q3USAXTO","schema_version":"1.0","canonical_sha256":"86e9205e6e34f8e348083b09b739d306c3bb60aace1f5eebcca1635d4e31c76c","source":{"kind":"arxiv","id":"2605.19248","version":1},"attestation_state":"computed","paper":{"title":"Quantum Entanglement Halves the Oblivious Update Bandwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Sagar Dubey","submitted_at":"2026-05-19T01:42:48Z","abstract_excerpt":"We consider $(n,k)$ MDS-coded distributed storage over $\\mathbb{F}_q$ with per-node storage $\\alpha$ symbols. For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $\\alpha k \\log_2 q$ bits. We prove that when the $k$ contacted helpers share prior quantum entanglement, the update bandwidth is $\\lceil \\alpha/2 \\rceil \\cdot k \\log_2 q$ bits-equivalent, a factor approaching 2 reduction. For $\\alpha = 2$, a $[[k, k-2]]_q$ CSS code achieves bandwidth $k \\log_2 q$ with one qudit per helper. For general $"},"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":"2605.19248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-19T01:42:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"eb86899ad55c3b24b206deab7d5d47b04eaf8b4e0773c07847a6c972d3a1dad1","abstract_canon_sha256":"57b66290b46e0b67cdd0d281e963c1454c430b020216b09644eb5d6068258126"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:35.840100Z","signature_b64":"2DOUqrpHGjzzIi6gZT+9CzBByRKQxKUAfOYrBIt5U20TdQMCdE0G3vizda/sTgORIOACLlu3Shz3d4TwSrW0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e9205e6e34f8e348083b09b739d306c3bb60aace1f5eebcca1635d4e31c76c","last_reissued_at":"2026-05-20T01:05:35.839345Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:35.839345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Entanglement Halves the Oblivious Update Bandwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Sagar Dubey","submitted_at":"2026-05-19T01:42:48Z","abstract_excerpt":"We consider $(n,k)$ MDS-coded distributed storage over $\\mathbb{F}_q$ with per-node storage $\\alpha$ symbols. For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $\\alpha k \\log_2 q$ bits. We prove that when the $k$ contacted helpers share prior quantum entanglement, the update bandwidth is $\\lceil \\alpha/2 \\rceil \\cdot k \\log_2 q$ bits-equivalent, a factor approaching 2 reduction. For $\\alpha = 2$, a $[[k, k-2]]_q$ CSS code achieves bandwidth $k \\log_2 q$ with one qudit per helper. For general $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19248","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/2605.19248/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":"2605.19248","created_at":"2026-05-20T01:05:35.839472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19248v1","created_at":"2026-05-20T01:05:35.839472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19248","created_at":"2026-05-20T01:05:35.839472+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3USAXTOGT4O","created_at":"2026-05-20T01:05:35.839472+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3USAXTOGT4OGSAI","created_at":"2026-05-20T01:05:35.839472+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3USAXTO","created_at":"2026-05-20T01:05:35.839472+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/Q3USAXTOGT4OGSAIHME3OOOTA3","json":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3.json","graph_json":"https://pith.science/api/pith-number/Q3USAXTOGT4OGSAIHME3OOOTA3/graph.json","events_json":"https://pith.science/api/pith-number/Q3USAXTOGT4OGSAIHME3OOOTA3/events.json","paper":"https://pith.science/paper/Q3USAXTO"},"agent_actions":{"view_html":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3","download_json":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3.json","view_paper":"https://pith.science/paper/Q3USAXTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19248&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3USAXTOGT4OGSAIHME3OOOTA3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3USAXTOGT4OGSAIHME3OOOTA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3/action/storage_attestation","attest_author":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3/action/author_attestation","sign_citation":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3/action/citation_signature","submit_replication":"https://pith.science/pith/Q3USAXTOGT4OGSAIHME3OOOTA3/action/replication_record"}},"created_at":"2026-05-20T01:05:35.839472+00:00","updated_at":"2026-05-20T01:05:35.839472+00:00"}