{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DDO5QDYW2XIGAIAA23KOTQ5TMK","short_pith_number":"pith:DDO5QDYW","canonical_record":{"source":{"id":"2603.11437","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e43dd2d3b07845871271f1d729c33c1f50fceef9a9961b9be6627cf5db87a6fa","abstract_canon_sha256":"432255fab108437a48df7ce2cbe0f623dee76418f6260a96d3ae37f167af9e2c"},"schema_version":"1.0"},"canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","source":{"kind":"arxiv","id":"2603.11437","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.11437","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.11437v2","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11437","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"DDO5QDYW2XIG","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"DDO5QDYW2XIGAIAA","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"DDO5QDYW","created_at":"2026-06-19T16:09:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DDO5QDYW2XIGAIAA23KOTQ5TMK","target":"record","payload":{"canonical_record":{"source":{"id":"2603.11437","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e43dd2d3b07845871271f1d729c33c1f50fceef9a9961b9be6627cf5db87a6fa","abstract_canon_sha256":"432255fab108437a48df7ce2cbe0f623dee76418f6260a96d3ae37f167af9e2c"},"schema_version":"1.0"},"canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:56.014070Z","signature_b64":"Omure1FTwv7yKsrG+ltoYxXnm/mMs028xqANPKgT5ah9Jr4hAspyn3DRdHWQZh1GVHRS0hhQPVkuQUaLTjvyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","last_reissued_at":"2026-06-19T16:09:56.013653Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:56.013653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.11437","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUiZ0lrJyP55iex5xpjjOUJZnXQHkPi/BR8fp/tOqx729RIMSh4JrwfE3HtQKV7Q6031ff1JXW/JSAw7qE4sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:22:07.021759Z"},"content_sha256":"6020f7d7800f64fc06359460a495e112aff2fec4aa89266ee59ca04fd939c48e","schema_version":"1.0","event_id":"sha256:6020f7d7800f64fc06359460a495e112aff2fec4aa89266ee59ca04fd939c48e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DDO5QDYW2XIGAIAA23KOTQ5TMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unclonable Encryption in the Haar Random Oracle Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Eli Goldin, James Bartusek","submitted_at":"2026-03-12T02:03:51Z","abstract_excerpt":"We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in \"microcrypt\", a world where one-way functions may not exist.\n  As one of our central technical contributions, we build on the recently introduced path recording fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11437","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.11437/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyvOt5gw0f4sDJ9eqD9Z7+uNpzPVT8W2rZbqSKtQtA1E50pxSDS0LHOrjxPC0MbhO/g/G3JI+xQBURwOPDhVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:22:07.022135Z"},"content_sha256":"9d67d2426f4355e6c3168ac92db87a56c7d61e7f230a1315b07419fde85deeec","schema_version":"1.0","event_id":"sha256:9d67d2426f4355e6c3168ac92db87a56c7d61e7f230a1315b07419fde85deeec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/bundle.json","state_url":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T18:22:07Z","links":{"resolver":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK","bundle":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/bundle.json","state":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DDO5QDYW2XIGAIAA23KOTQ5TMK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"432255fab108437a48df7ce2cbe0f623dee76418f6260a96d3ae37f167af9e2c","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","title_canon_sha256":"e43dd2d3b07845871271f1d729c33c1f50fceef9a9961b9be6627cf5db87a6fa"},"schema_version":"1.0","source":{"id":"2603.11437","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.11437","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.11437v2","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11437","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"DDO5QDYW2XIG","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"DDO5QDYW2XIGAIAA","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"DDO5QDYW","created_at":"2026-06-19T16:09:56Z"}],"graph_snapshots":[{"event_id":"sha256:9d67d2426f4355e6c3168ac92db87a56c7d61e7f230a1315b07419fde85deeec","target":"graph","created_at":"2026-06-19T16:09:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.11437/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in \"microcrypt\", a world where one-way functions may not exist.\n  As one of our central technical contributions, we build on the recently introduced path recording fra","authors_text":"Eli Goldin, James Bartusek","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","title":"Unclonable Encryption in the Haar Random Oracle Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11437","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6020f7d7800f64fc06359460a495e112aff2fec4aa89266ee59ca04fd939c48e","target":"record","created_at":"2026-06-19T16:09:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"432255fab108437a48df7ce2cbe0f623dee76418f6260a96d3ae37f167af9e2c","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","title_canon_sha256":"e43dd2d3b07845871271f1d729c33c1f50fceef9a9961b9be6627cf5db87a6fa"},"schema_version":"1.0","source":{"id":"2603.11437","kind":"arxiv","version":2}},"canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","first_computed_at":"2026-06-19T16:09:56.013653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:56.013653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Omure1FTwv7yKsrG+ltoYxXnm/mMs028xqANPKgT5ah9Jr4hAspyn3DRdHWQZh1GVHRS0hhQPVkuQUaLTjvyDw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:56.014070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.11437","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6020f7d7800f64fc06359460a495e112aff2fec4aa89266ee59ca04fd939c48e","sha256:9d67d2426f4355e6c3168ac92db87a56c7d61e7f230a1315b07419fde85deeec"],"state_sha256":"070dd54e0eaf7b145180764a82bceb4644e2f51dd28842db0f0da2c6e34f9744"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkDaqcchdJcbXfz5hmw1QBcGfzrHgPriZGhNKElggzdC0lSdgKmlpGiO5/wjHqyfP0oUGKUzKX0y3N4QWZ5mBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:22:07.024082Z","bundle_sha256":"01a37c1e7d05543656f3e69bb9eb573e55648ba18d3da51252b0e0f152d05d8c"}}