{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KJW5YUZYLGWXHAVATI54FCN3VO","short_pith_number":"pith:KJW5YUZY","canonical_record":{"source":{"id":"1101.4620","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-24T18:44:40Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"026fdfd02081e212e6b0a5fb3a4c68ae75c946fbee660d5bc19f96c1407f3a9c","abstract_canon_sha256":"dcb95b75b5e6279b33461cb41ca6c560b210a72bbfa157f51669a4a7583b4f63"},"schema_version":"1.0"},"canonical_sha256":"526ddc533859ad7382a09a3bc289bbab8f4e66013c09a036995b2120991561a5","source":{"kind":"arxiv","id":"1101.4620","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4620","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4620v4","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4620","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"KJW5YUZYLGWX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KJW5YUZYLGWXHAVA","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KJW5YUZY","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KJW5YUZYLGWXHAVATI54FCN3VO","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4620","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-24T18:44:40Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"026fdfd02081e212e6b0a5fb3a4c68ae75c946fbee660d5bc19f96c1407f3a9c","abstract_canon_sha256":"dcb95b75b5e6279b33461cb41ca6c560b210a72bbfa157f51669a4a7583b4f63"},"schema_version":"1.0"},"canonical_sha256":"526ddc533859ad7382a09a3bc289bbab8f4e66013c09a036995b2120991561a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:22.873968Z","signature_b64":"JWyda+K35mcJ0cF3wd6Bk0MDu8RdU9ymg36JxYY/rlrFI32yowcWUgsQroRDAdWiFKWbj6z3yVSTazX4LlxCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"526ddc533859ad7382a09a3bc289bbab8f4e66013c09a036995b2120991561a5","last_reissued_at":"2026-05-18T02:03:22.873468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:22.873468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4620","source_version":4,"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-18T02:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3Mm5nI9WLfFpnLuIr0BQ33BltD3b80gSklYePBD90N6UQPZS0D+OVIu0d+UAm2cexYdLYDlKTxorF5CyfofBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:31:38.262966Z"},"content_sha256":"9df2b01b030bf2428db004697d22a7302ffd92c1edbc933acd16d43347f0753b","schema_version":"1.0","event_id":"sha256:9df2b01b030bf2428db004697d22a7302ffd92c1edbc933acd16d43347f0753b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KJW5YUZYLGWXHAVATI54FCN3VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unconditionally Secure Bit Commitment with Flying Qudits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Adrian Kent (Centre for Quantum Information, DAMTP, Foundations, Perimeter Institute), University of Cambridge","submitted_at":"2011-01-24T18:44:40Z","abstract_excerpt":"In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but completely and provably secure schemes have remained elusive. Here we report a new development in physics-based cryptography which gives a completely new way of implementing bit commitment that is perfectly secure. The technique involves sending a quantum state (for instance one or more photons) at light speed in one of two or more directions, either along a sec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4620","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T02:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXMxADMuAQA8zm8q8PBKXOOEnyrEkqLi7NcgRYmO3lrXrRrgDIG1pc3mbTxNOUgeYVLBn2Bjcu9OSEpJC/jDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:31:38.263617Z"},"content_sha256":"88869caa6ddcf1e27ba072ae7dfcc9b7c384fbfddb50cee199e60f325f6dcf67","schema_version":"1.0","event_id":"sha256:88869caa6ddcf1e27ba072ae7dfcc9b7c384fbfddb50cee199e60f325f6dcf67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJW5YUZYLGWXHAVATI54FCN3VO/bundle.json","state_url":"https://pith.science/pith/KJW5YUZYLGWXHAVATI54FCN3VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJW5YUZYLGWXHAVATI54FCN3VO/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-05-29T16:31:38Z","links":{"resolver":"https://pith.science/pith/KJW5YUZYLGWXHAVATI54FCN3VO","bundle":"https://pith.science/pith/KJW5YUZYLGWXHAVATI54FCN3VO/bundle.json","state":"https://pith.science/pith/KJW5YUZYLGWXHAVATI54FCN3VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJW5YUZYLGWXHAVATI54FCN3VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KJW5YUZYLGWXHAVATI54FCN3VO","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":"dcb95b75b5e6279b33461cb41ca6c560b210a72bbfa157f51669a4a7583b4f63","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-24T18:44:40Z","title_canon_sha256":"026fdfd02081e212e6b0a5fb3a4c68ae75c946fbee660d5bc19f96c1407f3a9c"},"schema_version":"1.0","source":{"id":"1101.4620","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4620","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4620v4","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4620","created_at":"2026-05-18T02:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"KJW5YUZYLGWX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KJW5YUZYLGWXHAVA","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KJW5YUZY","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:88869caa6ddcf1e27ba072ae7dfcc9b7c384fbfddb50cee199e60f325f6dcf67","target":"graph","created_at":"2026-05-18T02:03:22Z","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"},"paper":{"abstract_excerpt":"In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but completely and provably secure schemes have remained elusive. Here we report a new development in physics-based cryptography which gives a completely new way of implementing bit commitment that is perfectly secure. The technique involves sending a quantum state (for instance one or more photons) at light speed in one of two or more directions, either along a sec","authors_text":"Adrian Kent (Centre for Quantum Information, DAMTP, Foundations, Perimeter Institute), University of Cambridge","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-24T18:44:40Z","title":"Unconditionally Secure Bit Commitment with Flying Qudits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4620","kind":"arxiv","version":4},"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:9df2b01b030bf2428db004697d22a7302ffd92c1edbc933acd16d43347f0753b","target":"record","created_at":"2026-05-18T02:03:22Z","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":"dcb95b75b5e6279b33461cb41ca6c560b210a72bbfa157f51669a4a7583b4f63","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-24T18:44:40Z","title_canon_sha256":"026fdfd02081e212e6b0a5fb3a4c68ae75c946fbee660d5bc19f96c1407f3a9c"},"schema_version":"1.0","source":{"id":"1101.4620","kind":"arxiv","version":4}},"canonical_sha256":"526ddc533859ad7382a09a3bc289bbab8f4e66013c09a036995b2120991561a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"526ddc533859ad7382a09a3bc289bbab8f4e66013c09a036995b2120991561a5","first_computed_at":"2026-05-18T02:03:22.873468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:22.873468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JWyda+K35mcJ0cF3wd6Bk0MDu8RdU9ymg36JxYY/rlrFI32yowcWUgsQroRDAdWiFKWbj6z3yVSTazX4LlxCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:22.873968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4620","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9df2b01b030bf2428db004697d22a7302ffd92c1edbc933acd16d43347f0753b","sha256:88869caa6ddcf1e27ba072ae7dfcc9b7c384fbfddb50cee199e60f325f6dcf67"],"state_sha256":"cd9b9f58c6fc8db1e4401e404afcc4859e56ad807691c3e1c2f4b8a5d261ed3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+HuZ7wd+AuzkAsKfQLpCbL6tJ5I4KscmRvg2Me8SuUPy5xzbz41QBwnjHBA1Cwt9xlhmGKTpHUljVmDYGvcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:31:38.266355Z","bundle_sha256":"f88a62779fe74fba9508128b1d967c7ee68499fde48380c4ca5be57416749e5c"}}