{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DHGFS2ARX7GLPWJGKZQ5FBYMET","short_pith_number":"pith:DHGFS2AR","schema_version":"1.0","canonical_sha256":"19cc596811bfccb7d9265661d2870c24e364039759c96c2666cfe0d881eff936","source":{"kind":"arxiv","id":"2603.08916","version":2},"attestation_state":"computed","paper":{"title":"The uncloneable bit exists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Archishna Bhattacharyya, Eric Culf","submitted_at":"2026-03-09T20:33:33Z","abstract_excerpt":"We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves security that approaches the ideal limit at a rate that is exponentially small in the security parameter, without employing any assumptions. Our proof invokes unitary invariance of the shared entangled state and simplifies the adversarial strategies by enforcing this symmetry. Crucially, it then rules out the sender being highly correlated with two non-communicatin"},"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":"2603.08916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-09T20:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"3a958f8f4c29c5f85690b9a84d01acde50f0be15c040a03b43aa995b753c4c34","abstract_canon_sha256":"bed042cad570146abdbcd1c67c56b634a1ef93806e94023af8f1d7b5cfccd64c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:36.274185Z","signature_b64":"hR9Os59w1I4radFWsk8ebtGWVzljVEArhvGvzn4hxDU/9/06ni1oYQ3DMHZmQq/72iAkWGs4t7zw2tbkCbs1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19cc596811bfccb7d9265661d2870c24e364039759c96c2666cfe0d881eff936","last_reissued_at":"2026-06-05T01:14:36.273434Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:36.273434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The uncloneable bit exists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Archishna Bhattacharyya, Eric Culf","submitted_at":"2026-03-09T20:33:33Z","abstract_excerpt":"We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves security that approaches the ideal limit at a rate that is exponentially small in the security parameter, without employing any assumptions. Our proof invokes unitary invariance of the shared entangled state and simplifies the adversarial strategies by enforcing this symmetry. Crucially, it then rules out the sender being highly correlated with two non-communicatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08916","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.08916/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":"2603.08916","created_at":"2026-06-05T01:14:36.273543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.08916v2","created_at":"2026-06-05T01:14:36.273543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08916","created_at":"2026-06-05T01:14:36.273543+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHGFS2ARX7GL","created_at":"2026-06-05T01:14:36.273543+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHGFS2ARX7GLPWJG","created_at":"2026-06-05T01:14:36.273543+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHGFS2AR","created_at":"2026-06-05T01:14:36.273543+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.28561","citing_title":"Statistically secure uncloneable encryption of arbitrary messages","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET","json":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET.json","graph_json":"https://pith.science/api/pith-number/DHGFS2ARX7GLPWJGKZQ5FBYMET/graph.json","events_json":"https://pith.science/api/pith-number/DHGFS2ARX7GLPWJGKZQ5FBYMET/events.json","paper":"https://pith.science/paper/DHGFS2AR"},"agent_actions":{"view_html":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET","download_json":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET.json","view_paper":"https://pith.science/paper/DHGFS2AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.08916&json=true","fetch_graph":"https://pith.science/api/pith-number/DHGFS2ARX7GLPWJGKZQ5FBYMET/graph.json","fetch_events":"https://pith.science/api/pith-number/DHGFS2ARX7GLPWJGKZQ5FBYMET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET/action/storage_attestation","attest_author":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET/action/author_attestation","sign_citation":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET/action/citation_signature","submit_replication":"https://pith.science/pith/DHGFS2ARX7GLPWJGKZQ5FBYMET/action/replication_record"}},"created_at":"2026-06-05T01:14:36.273543+00:00","updated_at":"2026-06-05T01:14:36.273543+00:00"}