{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CGEAGSUSU7N2JHFDIHIRZYTABK","short_pith_number":"pith:CGEAGSUS","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"},"canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","source":{"kind":"arxiv","id":"1009.1422","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1422","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1422v3","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1422","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"CGEAGSUSU7N2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CGEAGSUSU7N2JHFD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CGEAGSUS","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CGEAGSUSU7N2JHFDIHIRZYTABK","target":"record","payload":{"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"},"canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","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"},"source_kind":"arxiv","source_id":"1009.1422","source_version":3,"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-18T02:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6eAfWF7rfPQxodEfViJVvWZ7B58/MXGAcDQPsr2GAsaqKCBmlRBTviKoId2JjEHWPArhDNpoWUljenmm+QEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:24:49.133826Z"},"content_sha256":"034dc644d88387a9ef166d02546246cd272a33c8fc46221696856573553de248","schema_version":"1.0","event_id":"sha256:034dc644d88387a9ef166d02546246cd272a33c8fc46221696856573553de248"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CGEAGSUSU7N2JHFDIHIRZYTABK","target":"graph","payload":{"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"},"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-18T02:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3soEJASBjs9TXVRk/0FeJeMHW4jnRul7LsbYC69i/9kDDE+NfgPGfBQhtmfI0B3WkenhiKgehSwSWvL1xV+YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:24:49.134440Z"},"content_sha256":"174d787ddd6a5eba6e76510cb9e824f361b43ed6cc5c8afc08c458d42b3de2d0","schema_version":"1.0","event_id":"sha256:174d787ddd6a5eba6e76510cb9e824f361b43ed6cc5c8afc08c458d42b3de2d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/bundle.json","state_url":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/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-05-26T20:24:49Z","links":{"resolver":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK","bundle":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/bundle.json","state":"https://pith.science/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGEAGSUSU7N2JHFDIHIRZYTABK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CGEAGSUSU7N2JHFDIHIRZYTABK","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":"dc2bd8c46e18e4f7023193ce8b69590bbb2ba0d22212d3756d991d673a814613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-07T23:08:02Z","title_canon_sha256":"8b48ff62511e4cb23b8aa9f5959498bccf6a2de4ecca2c0ed3aa5bf3776ae505"},"schema_version":"1.0","source":{"id":"1009.1422","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1422","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1422v3","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1422","created_at":"2026-05-18T02:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"CGEAGSUSU7N2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CGEAGSUSU7N2JHFD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CGEAGSUS","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:174d787ddd6a5eba6e76510cb9e824f361b43ed6cc5c8afc08c458d42b3de2d0","target":"graph","created_at":"2026-05-18T02:42: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":"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","authors_text":"G. Abal, M. Forets, R. Donangelo, R. Portugal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-07T23:08:02Z","title":"Spatial quantum search in a triangular network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1422","kind":"arxiv","version":3},"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:034dc644d88387a9ef166d02546246cd272a33c8fc46221696856573553de248","target":"record","created_at":"2026-05-18T02:42: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":"dc2bd8c46e18e4f7023193ce8b69590bbb2ba0d22212d3756d991d673a814613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-07T23:08:02Z","title_canon_sha256":"8b48ff62511e4cb23b8aa9f5959498bccf6a2de4ecca2c0ed3aa5bf3776ae505"},"schema_version":"1.0","source":{"id":"1009.1422","kind":"arxiv","version":3}},"canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1188034a92a7dba49ca341d11ce2600a881316f71ff1ac16a6d27886123a4d8c","first_computed_at":"2026-05-18T02:42:06.420446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:06.420446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g28u4qgYrC6yUaHLeq+Po7z5jNsEihJ+lLWFolBPLqfjwLnituhJaXIK8Incq/RF+z6rPmZrMrjP2toCD+PiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:06.420894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1422","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:034dc644d88387a9ef166d02546246cd272a33c8fc46221696856573553de248","sha256:174d787ddd6a5eba6e76510cb9e824f361b43ed6cc5c8afc08c458d42b3de2d0"],"state_sha256":"40dbed91fa2a27c29ad0514a235598709fe001975f5c6b1b8bacca4a6f1dfd5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27HtUVfPohCgubVvlEDeSiV1HHKyQiH9igvUp0j3eLym0zhSwfc+GZCUJtHJkA1y2U6GONe/JY77W/8pbED5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:24:49.137261Z","bundle_sha256":"65ad890538dec7cb6f2ba54bb678b7d235cf1c3d6e9716b00048d44bd73111d0"}}