{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BRVBETEXSQENZKXMH2YZIQR3M3","short_pith_number":"pith:BRVBETEX","canonical_record":{"source":{"id":"1210.4353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7ec4563656f067ab65734981378f6286abf0f83e1c87754ef3b38c16b154abbc","abstract_canon_sha256":"d670e5239aa6e3b1ef170350b8e8f89de5fdbdf9232c8819a5167f24ef1e36be"},"schema_version":"1.0"},"canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","source":{"kind":"arxiv","id":"1210.4353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4353","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4353v1","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4353","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"pith_short_12","alias_value":"BRVBETEXSQEN","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BRVBETEXSQENZKXM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BRVBETEX","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BRVBETEXSQENZKXMH2YZIQR3M3","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7ec4563656f067ab65734981378f6286abf0f83e1c87754ef3b38c16b154abbc","abstract_canon_sha256":"d670e5239aa6e3b1ef170350b8e8f89de5fdbdf9232c8819a5167f24ef1e36be"},"schema_version":"1.0"},"canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:06.250698Z","signature_b64":"CjwwArQImEdYrv9uTOpSj1z5aIXk7YLN+TG7PTE5hgqYHWPdCfZvKMU7TOF+5rfODwTYDHCff36YCMEDDVHuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","last_reissued_at":"2026-05-18T03:43:06.250080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:06.250080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4353","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-18T03:43:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlTM0WUg14iEKhoVvfvz3vt/1oUlCpe/DIW5pm2l9T/Y7MlaCy84f6OdI58ThRKAM/etrPzDGSM4tQK/XAD7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:27:40.146843Z"},"content_sha256":"2282d2b40040b702e55480af9220706bb5cf72e8c3bfa382d2729cc6fbc98622","schema_version":"1.0","event_id":"sha256:2282d2b40040b702e55480af9220706bb5cf72e8c3bfa382d2729cc6fbc98622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BRVBETEXSQENZKXMH2YZIQR3M3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Position-Based Quantum Cryptography and the Garden-Hose Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Florian Speelman","submitted_at":"2012-10-16T11:00:04Z","abstract_excerpt":"We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens up a way to link the security of position-based quantum cryptography to traditional complexity theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4353","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":""},"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-18T03:43:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbFOiLeHkuHwliWAjvQ01GYeL8bD3YSLcdhZDYe9FjS/3RM7EKIMgIl/dpLpYUgb+InxlbZnVauO7WkFdjDZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:27:40.147526Z"},"content_sha256":"4642a670f3adf1dfee188731e4c8e1986e5049810803254260d6568bc5c910b3","schema_version":"1.0","event_id":"sha256:4642a670f3adf1dfee188731e4c8e1986e5049810803254260d6568bc5c910b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/bundle.json","state_url":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRVBETEXSQENZKXMH2YZIQR3M3/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-10T11:27:40Z","links":{"resolver":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3","bundle":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/bundle.json","state":"https://pith.science/pith/BRVBETEXSQENZKXMH2YZIQR3M3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRVBETEXSQENZKXMH2YZIQR3M3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BRVBETEXSQENZKXMH2YZIQR3M3","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":"d670e5239aa6e3b1ef170350b8e8f89de5fdbdf9232c8819a5167f24ef1e36be","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","title_canon_sha256":"7ec4563656f067ab65734981378f6286abf0f83e1c87754ef3b38c16b154abbc"},"schema_version":"1.0","source":{"id":"1210.4353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4353","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4353v1","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4353","created_at":"2026-05-18T03:43:06Z"},{"alias_kind":"pith_short_12","alias_value":"BRVBETEXSQEN","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BRVBETEXSQENZKXM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BRVBETEX","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:4642a670f3adf1dfee188731e4c8e1986e5049810803254260d6568bc5c910b3","target":"graph","created_at":"2026-05-18T03:43:06Z","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":"We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens up a way to link the security of position-based quantum cryptography to traditional complexity theory.","authors_text":"Florian Speelman","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","title":"Position-Based Quantum Cryptography and the Garden-Hose Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4353","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:2282d2b40040b702e55480af9220706bb5cf72e8c3bfa382d2729cc6fbc98622","target":"record","created_at":"2026-05-18T03:43:06Z","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":"d670e5239aa6e3b1ef170350b8e8f89de5fdbdf9232c8819a5167f24ef1e36be","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T11:00:04Z","title_canon_sha256":"7ec4563656f067ab65734981378f6286abf0f83e1c87754ef3b38c16b154abbc"},"schema_version":"1.0","source":{"id":"1210.4353","kind":"arxiv","version":1}},"canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c6a124c979408dcaaec3eb194423b66e760fc0a10025d0e51b82ac6437b20ce","first_computed_at":"2026-05-18T03:43:06.250080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:06.250080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CjwwArQImEdYrv9uTOpSj1z5aIXk7YLN+TG7PTE5hgqYHWPdCfZvKMU7TOF+5rfODwTYDHCff36YCMEDDVHuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:06.250698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2282d2b40040b702e55480af9220706bb5cf72e8c3bfa382d2729cc6fbc98622","sha256:4642a670f3adf1dfee188731e4c8e1986e5049810803254260d6568bc5c910b3"],"state_sha256":"dd09a26d23a511f3bd6996d27d37dd16201be6316c15d72248c6ebaae41d1630"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Op8PuezBEZvjGaRzQxeC7AUtBlotF5kefTfH8zHtM7V1/UrErwYlu+JYlSjHINZSY/ArhcxdmB0VqtKHXsuaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:27:40.151846Z","bundle_sha256":"9cd13d9c54152fab3904c71f759ba29d2e3a4bc9f86d37e59a2df6fc32120f1d"}}