{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZYDY5GPZJDIUO7TBHGASLFZKTY","short_pith_number":"pith:ZYDY5GPZ","schema_version":"1.0","canonical_sha256":"ce078e99f948d1477e61398125972a9e0cfc0cf4437b2879f760c6a1eab98e40","source":{"kind":"arxiv","id":"1504.07171","version":3},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound for the BB84-states Quantum-Position-Verification Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Grosshans, J\\'er\\'emy Ribeiro","submitted_at":"2015-04-27T17:29:02Z","abstract_excerpt":"We use the entanglement sampling techniques developed by Dupuis, Fawzi and Wehner to find a lower bound on the entanglement needed by a coalition of cheater attacking the quantum position verification protocol using the four BB84 states in the scenario where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled state $\\tilde{\\Phi}$. For a protocol using n qubits, a necessary condition for cheating is that the max- relative entropy of entanglement $E_{\\max}(\\tilde{\\Phi})\\ge n-O(\\log n)$. This improves previously known best lower bound by a factor $\\sim4$, and i"},"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":"1504.07171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-27T17:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"078ad2216ef6be6fe9b8b4d489418a841b2236933256e552e649f582f69f1848","abstract_canon_sha256":"cba4c8298670148ab103a24738680f15da852dc08de8b191666dd41a8bc150ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:41.551516Z","signature_b64":"7zLa2SynXply0jUNUXpm1fTy6IDYao3qpO54A6f2MM437MKzWoZp99iSzb8zqP5nLt5xY4qpaO6n/ws2mHeoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce078e99f948d1477e61398125972a9e0cfc0cf4437b2879f760c6a1eab98e40","last_reissued_at":"2026-05-18T01:55:41.550821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:41.550821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound for the BB84-states Quantum-Position-Verification Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Grosshans, J\\'er\\'emy Ribeiro","submitted_at":"2015-04-27T17:29:02Z","abstract_excerpt":"We use the entanglement sampling techniques developed by Dupuis, Fawzi and Wehner to find a lower bound on the entanglement needed by a coalition of cheater attacking the quantum position verification protocol using the four BB84 states in the scenario where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled state $\\tilde{\\Phi}$. For a protocol using n qubits, a necessary condition for cheating is that the max- relative entropy of entanglement $E_{\\max}(\\tilde{\\Phi})\\ge n-O(\\log n)$. This improves previously known best lower bound by a factor $\\sim4$, and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07171","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.07171","created_at":"2026-05-18T01:55:41.550917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07171v3","created_at":"2026-05-18T01:55:41.550917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07171","created_at":"2026-05-18T01:55:41.550917+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYDY5GPZJDIU","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYDY5GPZJDIUO7TB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYDY5GPZ","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.00255","citing_title":"Lower bounds on non-local computation from controllable correlation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY","json":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY.json","graph_json":"https://pith.science/api/pith-number/ZYDY5GPZJDIUO7TBHGASLFZKTY/graph.json","events_json":"https://pith.science/api/pith-number/ZYDY5GPZJDIUO7TBHGASLFZKTY/events.json","paper":"https://pith.science/paper/ZYDY5GPZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY","download_json":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY.json","view_paper":"https://pith.science/paper/ZYDY5GPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07171&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYDY5GPZJDIUO7TBHGASLFZKTY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYDY5GPZJDIUO7TBHGASLFZKTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY/action/storage_attestation","attest_author":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY/action/author_attestation","sign_citation":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY/action/citation_signature","submit_replication":"https://pith.science/pith/ZYDY5GPZJDIUO7TBHGASLFZKTY/action/replication_record"}},"created_at":"2026-05-18T01:55:41.550917+00:00","updated_at":"2026-05-18T01:55:41.550917+00:00"}