{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P7JRUV2USJXBNKAB4IJRU2PGYI","short_pith_number":"pith:P7JRUV2U","schema_version":"1.0","canonical_sha256":"7fd31a5754926e16a801e2131a69e6c23e9660ff867785f33fcad61a734579b8","source":{"kind":"arxiv","id":"2402.18648","version":3},"attestation_state":"computed","paper":{"title":"Linear gate bounds against natural functions for position-verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex May, Eric Culf, Richard Cleve, Vahid Asadi","submitted_at":"2024-02-28T19:00:10Z","abstract_excerpt":"A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84. Both schemes require an honest prover to locally compute a classical function $f$ of inputs of length $n$, and manipulate $O(1)$ size quantum systems. We prove the number of quantum gates plus single qubit measurements needed to implement a function $f$ is lower bounded linearly by the communication com"},"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":"2402.18648","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-28T19:00:10Z","cross_cats_sorted":[],"title_canon_sha256":"6f7e62000fa2ba3e252d5893c8ad2dd1b975472bee91e163831b4cabac27b171","abstract_canon_sha256":"ec30982dfa5a6fa57e234591011435317a5a5063437e503f4bac12ea6b1db10a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:24.104174Z","signature_b64":"Tg0O20uhUhXjJXwew1h2Wg1CTuiR5RP3gDIF9mnvf6RdnjWAdCJ5dmEW2fgVZU4mLkQiOmhCRqN8S1J46SagDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd31a5754926e16a801e2131a69e6c23e9660ff867785f33fcad61a734579b8","last_reissued_at":"2026-07-05T10:03:24.103747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:24.103747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear gate bounds against natural functions for position-verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex May, Eric Culf, Richard Cleve, Vahid Asadi","submitted_at":"2024-02-28T19:00:10Z","abstract_excerpt":"A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84. Both schemes require an honest prover to locally compute a classical function $f$ of inputs of length $n$, and manipulate $O(1)$ size quantum systems. We prove the number of quantum gates plus single qubit measurements needed to implement a function $f$ is lower bounded linearly by the communication com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18648/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":"2402.18648","created_at":"2026-07-05T10:03:24.103807+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18648v3","created_at":"2026-07-05T10:03:24.103807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18648","created_at":"2026-07-05T10:03:24.103807+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7JRUV2USJXB","created_at":"2026-07-05T10:03:24.103807+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7JRUV2USJXBNKAB","created_at":"2026-07-05T10:03:24.103807+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7JRUV2U","created_at":"2026-07-05T10:03:24.103807+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05775","citing_title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI","json":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI.json","graph_json":"https://pith.science/api/pith-number/P7JRUV2USJXBNKAB4IJRU2PGYI/graph.json","events_json":"https://pith.science/api/pith-number/P7JRUV2USJXBNKAB4IJRU2PGYI/events.json","paper":"https://pith.science/paper/P7JRUV2U"},"agent_actions":{"view_html":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI","download_json":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI.json","view_paper":"https://pith.science/paper/P7JRUV2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18648&json=true","fetch_graph":"https://pith.science/api/pith-number/P7JRUV2USJXBNKAB4IJRU2PGYI/graph.json","fetch_events":"https://pith.science/api/pith-number/P7JRUV2USJXBNKAB4IJRU2PGYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI/action/storage_attestation","attest_author":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI/action/author_attestation","sign_citation":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI/action/citation_signature","submit_replication":"https://pith.science/pith/P7JRUV2USJXBNKAB4IJRU2PGYI/action/replication_record"}},"created_at":"2026-07-05T10:03:24.103807+00:00","updated_at":"2026-07-05T10:03:24.103807+00:00"}