{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CGEAGSUSU7N2JHFDIHIRZYTABK","short_pith_number":"pith:CGEAGSUS","schema_version":"1.0","canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","source":{"kind":"arxiv","id":"1009.1422","version":3},"attestation_state":"computed","paper":{"title":"Spatial quantum search in a triangular network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G. Abal, M. Forets, R. Donangelo, R. Portugal","submitted_at":"2010-09-07T23:08:02Z","abstract_excerpt":"The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algortithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh [AKR05] (AKR) and Tulsi [Tulsi08], applied to a triangular network. The AKR-Tulsi formalism was employed to show that the time c"},"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":"1009.1422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-07T23:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"8b48ff62511e4cb23b8aa9f5959498bccf6a2de4ecca2c0ed3aa5bf3776ae505","abstract_canon_sha256":"dc2bd8c46e18e4f7023193ce8b69590bbb2ba0d22212d3756d991d673a814613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:06.420894Z","signature_b64":"g28u4qgYrC6yUaHLeq+Po7z5jNsEihJ+lLWFolBPLqfjwLnituhJaXIK8Incq/RF+z6rPmZrMrjP2toCD+PiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","last_reissued_at":"2026-05-18T02:42:06.420446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:06.420446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial quantum search in a triangular network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G. Abal, M. Forets, R. Donangelo, R. Portugal","submitted_at":"2010-09-07T23:08:02Z","abstract_excerpt":"The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algortithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh [AKR05] (AKR) and Tulsi [Tulsi08], applied to a triangular network. The AKR-Tulsi formalism was employed to show that the time c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1422","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":"1009.1422","created_at":"2026-05-18T02:42:06.420504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1422v3","created_at":"2026-05-18T02:42:06.420504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1422","created_at":"2026-05-18T02:42:06.420504+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGEAGSUSU7N2","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGEAGSUSU7N2JHFD","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGEAGSUS","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK","json":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK.json","graph_json":"https://pith.science/api/pith-number/CGEAGSUSU7N2JHFDIHIRZYTABK/graph.json","events_json":"https://pith.science/api/pith-number/CGEAGSUSU7N2JHFDIHIRZYTABK/events.json","paper":"https://pith.science/paper/CGEAGSUS"},"agent_actions":{"view_html":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK","download_json":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK.json","view_paper":"https://pith.science/paper/CGEAGSUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1422&json=true","fetch_graph":"https://pith.science/api/pith-number/CGEAGSUSU7N2JHFDIHIRZYTABK/graph.json","fetch_events":"https://pith.science/api/pith-number/CGEAGSUSU7N2JHFDIHIRZYTABK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/action/storage_attestation","attest_author":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/action/author_attestation","sign_citation":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/action/citation_signature","submit_replication":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/action/replication_record"}},"created_at":"2026-05-18T02:42:06.420504+00:00","updated_at":"2026-05-18T02:42:06.420504+00:00"}