{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MPBGZRU5HYXAXF3PUF5YULM2ZW","short_pith_number":"pith:MPBGZRU5","schema_version":"1.0","canonical_sha256":"63c26cc69d3e2e0b976fa17b8a2d9acdbd8e408ed59d1b7146d49ec2665f75c0","source":{"kind":"arxiv","id":"2503.09544","version":1},"attestation_state":"computed","paper":{"title":"Quantum position verification in one shot: parallel repetition of the $f$-BB84 and $f$-routing protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Speelman, Lloren\\c{c} Escol\\`a-Farr\\`as","submitted_at":"2025-03-12T17:00:32Z","abstract_excerpt":"Quantum position verification (QPV) aims to verify an untrusted prover's location by timing communication with them. To reduce uncertainty, it is desirable for this verification to occur in a single round. However, previous protocols achieving one-round secure QPV had critical drawbacks: attackers pre-sharing an EPR pair per qubit could perfectly break them, and their security depended on quantum information traveling at the speed of light in vacuum, a major experimental challenge in quantum networks. In this work, we prove that a single round of interaction suffices for secure position verifi"},"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":"2503.09544","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-12T17:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"6dbe8ad40d171e9bfcdfa860b5a132c3e00eed3be07de17aded1a3b45e2183a8","abstract_canon_sha256":"49373052eb427c84d2ffaa3c7515a8fd983fa7b87e53718371659e2819fe22ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:58.050287Z","signature_b64":"UfzU3O29WwP6h6qhf4m9Kywkbpp1fZATDzypnqzCE9/rXv4eeFvYxjdT6uKwl5bNUe9Gvj5GKTUkPttUbp8nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c26cc69d3e2e0b976fa17b8a2d9acdbd8e408ed59d1b7146d49ec2665f75c0","last_reissued_at":"2026-07-05T10:29:58.049792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:58.049792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum position verification in one shot: parallel repetition of the $f$-BB84 and $f$-routing protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Speelman, Lloren\\c{c} Escol\\`a-Farr\\`as","submitted_at":"2025-03-12T17:00:32Z","abstract_excerpt":"Quantum position verification (QPV) aims to verify an untrusted prover's location by timing communication with them. To reduce uncertainty, it is desirable for this verification to occur in a single round. However, previous protocols achieving one-round secure QPV had critical drawbacks: attackers pre-sharing an EPR pair per qubit could perfectly break them, and their security depended on quantum information traveling at the speed of light in vacuum, a major experimental challenge in quantum networks. In this work, we prove that a single round of interaction suffices for secure position verifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09544","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/2503.09544/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.09544","created_at":"2026-07-05T10:29:58.049852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.09544v1","created_at":"2026-07-05T10:29:58.049852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09544","created_at":"2026-07-05T10:29:58.049852+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPBGZRU5HYXA","created_at":"2026-07-05T10:29:58.049852+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPBGZRU5HYXAXF3P","created_at":"2026-07-05T10:29:58.049852+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPBGZRU5","created_at":"2026-07-05T10:29:58.049852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25037","citing_title":"Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26354","citing_title":"Equivalence of non-local computation tasks beyond Clifford operations","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2602.00255","citing_title":"Lower bounds on non-local computation from controllable correlation","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW","json":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW.json","graph_json":"https://pith.science/api/pith-number/MPBGZRU5HYXAXF3PUF5YULM2ZW/graph.json","events_json":"https://pith.science/api/pith-number/MPBGZRU5HYXAXF3PUF5YULM2ZW/events.json","paper":"https://pith.science/paper/MPBGZRU5"},"agent_actions":{"view_html":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW","download_json":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW.json","view_paper":"https://pith.science/paper/MPBGZRU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.09544&json=true","fetch_graph":"https://pith.science/api/pith-number/MPBGZRU5HYXAXF3PUF5YULM2ZW/graph.json","fetch_events":"https://pith.science/api/pith-number/MPBGZRU5HYXAXF3PUF5YULM2ZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW/action/storage_attestation","attest_author":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW/action/author_attestation","sign_citation":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW/action/citation_signature","submit_replication":"https://pith.science/pith/MPBGZRU5HYXAXF3PUF5YULM2ZW/action/replication_record"}},"created_at":"2026-07-05T10:29:58.049852+00:00","updated_at":"2026-07-05T10:29:58.049852+00:00"}