{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ARHXR6I6LQHMLLC22Q3L6YYNFV","short_pith_number":"pith:ARHXR6I6","canonical_record":{"source":{"id":"2605.27647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-26T20:09:21Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"63f1cf5e76c580e0beaefb9dbfcf0d773457be085b016d69c86e859153d0d81d","abstract_canon_sha256":"601f2f05c69c359ac1452800d1fa56f1a767023776b1ae13d31c451ddb038f81"},"schema_version":"1.0"},"canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","source":{"kind":"arxiv","id":"2605.27647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27647","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27647v1","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27647","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"ARHXR6I6LQHM","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"ARHXR6I6LQHMLLC2","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"ARHXR6I6","created_at":"2026-05-28T01:04:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ARHXR6I6LQHMLLC22Q3L6YYNFV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.27647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-26T20:09:21Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"63f1cf5e76c580e0beaefb9dbfcf0d773457be085b016d69c86e859153d0d81d","abstract_canon_sha256":"601f2f05c69c359ac1452800d1fa56f1a767023776b1ae13d31c451ddb038f81"},"schema_version":"1.0"},"canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:45.266269Z","signature_b64":"i2iIFnaJjS9qsBnQ5RZB0PQ8O57x67wMLn+x3EETOqMQAO9FTAfm0nj12d6X8SXC6DpludAsDlLC34qAB3IEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","last_reissued_at":"2026-05-28T01:04:45.265784Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:45.265784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.27647","source_version":1,"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-05-28T01:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIwc7k0Ce5GBMcOVQjIhf3Q263QVnU9hm5X0gMfzSbllPwI2YqA8MKU/ouFahu/p4wmL5E2dmlFRwztrfNDICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:59:05.153155Z"},"content_sha256":"aebd4719f1090749fe64a1ee37b21b7dcd3b273939baa62eedda2468d2568250","schema_version":"1.0","event_id":"sha256:aebd4719f1090749fe64a1ee37b21b7dcd3b273939baa62eedda2468d2568250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ARHXR6I6LQHMLLC22Q3L6YYNFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Boosting Uncloneable Encryption in Microcrypt","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-05-26T20:09:21Z","abstract_excerpt":"In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the assumptions under which (many-time secure) uncloneable encryption is known to exist, assuming the existence of an information-theoretic \"uncloneable bit\", i.e. a one-time secure uncloneable encryption scheme for one-bit messages. We observe that if a t -> t' uncloneable bit exists, then the following implications hold.\n  1. If many-time secure symmetric key enc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27647","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.27647/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-05-28T01:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUQpeP0twIGv+TeBoAON5x+F4NT9dAgxse0p0+S+FNS3Y2j/LYhcHtnw0iPCHJz4h6bBnEJNhRqEualm/YlHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:59:05.154038Z"},"content_sha256":"7abc208070dfda6874e91eefbdad77f7e78606022a32055b66862c7437b2ca09","schema_version":"1.0","event_id":"sha256:7abc208070dfda6874e91eefbdad77f7e78606022a32055b66862c7437b2ca09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/bundle.json","state_url":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/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-07T12:59:05Z","links":{"resolver":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV","bundle":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/bundle.json","state":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ARHXR6I6LQHMLLC22Q3L6YYNFV","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":"601f2f05c69c359ac1452800d1fa56f1a767023776b1ae13d31c451ddb038f81","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-26T20:09:21Z","title_canon_sha256":"63f1cf5e76c580e0beaefb9dbfcf0d773457be085b016d69c86e859153d0d81d"},"schema_version":"1.0","source":{"id":"2605.27647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27647","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27647v1","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27647","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"ARHXR6I6LQHM","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"ARHXR6I6LQHMLLC2","created_at":"2026-05-28T01:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"ARHXR6I6","created_at":"2026-05-28T01:04:45Z"}],"graph_snapshots":[{"event_id":"sha256:7abc208070dfda6874e91eefbdad77f7e78606022a32055b66862c7437b2ca09","target":"graph","created_at":"2026-05-28T01:04:45Z","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/2605.27647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the assumptions under which (many-time secure) uncloneable encryption is known to exist, assuming the existence of an information-theoretic \"uncloneable bit\", i.e. a one-time secure uncloneable encryption scheme for one-bit messages. We observe that if a t -> t' uncloneable bit exists, then the following implications hold.\n  1. If many-time secure symmetric key enc","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-05-26T20:09:21Z","title":"A Note on Boosting Uncloneable Encryption in Microcrypt"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27647","kind":"arxiv","version":1},"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:aebd4719f1090749fe64a1ee37b21b7dcd3b273939baa62eedda2468d2568250","target":"record","created_at":"2026-05-28T01:04:45Z","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":"601f2f05c69c359ac1452800d1fa56f1a767023776b1ae13d31c451ddb038f81","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-26T20:09:21Z","title_canon_sha256":"63f1cf5e76c580e0beaefb9dbfcf0d773457be085b016d69c86e859153d0d81d"},"schema_version":"1.0","source":{"id":"2605.27647","kind":"arxiv","version":1}},"canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","first_computed_at":"2026-05-28T01:04:45.265784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:45.265784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i2iIFnaJjS9qsBnQ5RZB0PQ8O57x67wMLn+x3EETOqMQAO9FTAfm0nj12d6X8SXC6DpludAsDlLC34qAB3IEDA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:45.266269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aebd4719f1090749fe64a1ee37b21b7dcd3b273939baa62eedda2468d2568250","sha256:7abc208070dfda6874e91eefbdad77f7e78606022a32055b66862c7437b2ca09"],"state_sha256":"480b8eb1cece05e79338abfb4f7c6412229747c82743aebf6d6d950888840fe7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpPJ7DD2P44Dgjo6p9rDVer+wlRLKOGszySqbJ3CZXGvrkWTW41wS9+Wm12+8+9UXVZMMjLgBPbrdclKIaVPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:59:05.157708Z","bundle_sha256":"4fd765d0c0aeaa66304f93872716050b49b8cc7ec4da13651fae0a73e20ee8ee"}}