{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V4FDYWCH4OH3TDJUNFVQVWQTZA","short_pith_number":"pith:V4FDYWCH","canonical_record":{"source":{"id":"1508.01327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-06T08:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"cae1d10e24f1f4d6a43d1bdc37b72a7857a6fb3ef72138e52a9f747cc49d79f0","abstract_canon_sha256":"0a844f3cfbd210a416854a8bbb64f07310ca1584802f8d58545ba571cad84759"},"schema_version":"1.0"},"canonical_sha256":"af0a3c5847e38fb98d34696b0ada13c8347e443d9a5cc60b41e5b8841356ab26","source":{"kind":"arxiv","id":"1508.01327","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01327","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01327v3","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01327","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"V4FDYWCH4OH3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4FDYWCH4OH3TDJU","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4FDYWCH","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V4FDYWCH4OH3TDJUNFVQVWQTZA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-06T08:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"cae1d10e24f1f4d6a43d1bdc37b72a7857a6fb3ef72138e52a9f747cc49d79f0","abstract_canon_sha256":"0a844f3cfbd210a416854a8bbb64f07310ca1584802f8d58545ba571cad84759"},"schema_version":"1.0"},"canonical_sha256":"af0a3c5847e38fb98d34696b0ada13c8347e443d9a5cc60b41e5b8841356ab26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:33.451788Z","signature_b64":"alLHKu0pau/49QScxPCifrEX+1vIB2gI7YK/LrBFy9qjh2w99DMhBpVWAv6WgGqPrr6doTot42lc0ECt3AsGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0a3c5847e38fb98d34696b0ada13c8347e443d9a5cc60b41e5b8841356ab26","last_reissued_at":"2026-05-18T01:18:33.451413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:33.451413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01327","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-18T01:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/E3rnY2nX2h0S/buXMbDq0K3IaXixElFHBDuQWPVSrWuSM60Odb063l6BoOylJIeSImJPhvq4AECvfoTigCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:15:39.938855Z"},"content_sha256":"2ff4eeb2e5a1c5ba17780072095d61ca621c25e080da93cb798728d455dc04b8","schema_version":"1.0","event_id":"sha256:2ff4eeb2e5a1c5ba17780072095d61ca621c25e080da93cb798728d455dc04b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V4FDYWCH4OH3TDJUNFVQVWQTZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial search by quantum walk is optimal for almost all graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Leonardo Novo, Shantanav Chakraborty, Yasser Omar","submitted_at":"2015-08-06T08:58:59Z","abstract_excerpt":"The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erd\\\"os-Renyi random graphs, i.e.\\ graphs of $n$ vertices where each edge exists with probability $p$, search by CTQW is \\textit{almost surely} optimal as long as $p\\geq \\log^{3/2}(n)/n$. Consequently, we show that quantum spatial search is in fact optimal for \\emph{almost all} graphs, meaning that the fraction of graphs of $n$ vertices fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01327","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-18T01:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnKHUf5iL3HQ/5VqVxgjqko63dTLRg1jeUmdck016oRSst9MXA+zG1ixyA/EdZc6N2XuzLQUyFslwdQYTIVEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:15:39.939204Z"},"content_sha256":"f9d4f0710fa1ecdaf6bb330a3d4144a8e9d1b2c8890635845a55b82af0a5d2eb","schema_version":"1.0","event_id":"sha256:f9d4f0710fa1ecdaf6bb330a3d4144a8e9d1b2c8890635845a55b82af0a5d2eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/bundle.json","state_url":"https://pith.science/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/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-06-03T09:15:39Z","links":{"resolver":"https://pith.science/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA","bundle":"https://pith.science/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/bundle.json","state":"https://pith.science/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4FDYWCH4OH3TDJUNFVQVWQTZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V4FDYWCH4OH3TDJUNFVQVWQTZA","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":"0a844f3cfbd210a416854a8bbb64f07310ca1584802f8d58545ba571cad84759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-06T08:58:59Z","title_canon_sha256":"cae1d10e24f1f4d6a43d1bdc37b72a7857a6fb3ef72138e52a9f747cc49d79f0"},"schema_version":"1.0","source":{"id":"1508.01327","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01327","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01327v3","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01327","created_at":"2026-05-18T01:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"V4FDYWCH4OH3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4FDYWCH4OH3TDJU","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4FDYWCH","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f9d4f0710fa1ecdaf6bb330a3d4144a8e9d1b2c8890635845a55b82af0a5d2eb","target":"graph","created_at":"2026-05-18T01:18:33Z","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 problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erd\\\"os-Renyi random graphs, i.e.\\ graphs of $n$ vertices where each edge exists with probability $p$, search by CTQW is \\textit{almost surely} optimal as long as $p\\geq \\log^{3/2}(n)/n$. Consequently, we show that quantum spatial search is in fact optimal for \\emph{almost all} graphs, meaning that the fraction of graphs of $n$ vertices fo","authors_text":"Andris Ambainis, Leonardo Novo, Shantanav Chakraborty, Yasser Omar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-06T08:58:59Z","title":"Spatial search by quantum walk is optimal for almost all graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01327","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:2ff4eeb2e5a1c5ba17780072095d61ca621c25e080da93cb798728d455dc04b8","target":"record","created_at":"2026-05-18T01:18:33Z","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":"0a844f3cfbd210a416854a8bbb64f07310ca1584802f8d58545ba571cad84759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-06T08:58:59Z","title_canon_sha256":"cae1d10e24f1f4d6a43d1bdc37b72a7857a6fb3ef72138e52a9f747cc49d79f0"},"schema_version":"1.0","source":{"id":"1508.01327","kind":"arxiv","version":3}},"canonical_sha256":"af0a3c5847e38fb98d34696b0ada13c8347e443d9a5cc60b41e5b8841356ab26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af0a3c5847e38fb98d34696b0ada13c8347e443d9a5cc60b41e5b8841356ab26","first_computed_at":"2026-05-18T01:18:33.451413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:33.451413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"alLHKu0pau/49QScxPCifrEX+1vIB2gI7YK/LrBFy9qjh2w99DMhBpVWAv6WgGqPrr6doTot42lc0ECt3AsGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:33.451788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01327","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ff4eeb2e5a1c5ba17780072095d61ca621c25e080da93cb798728d455dc04b8","sha256:f9d4f0710fa1ecdaf6bb330a3d4144a8e9d1b2c8890635845a55b82af0a5d2eb"],"state_sha256":"4362cd00786b5fadc835c5501e50f73ecc07f0711e5b7339f5a820c5e736348d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yavhUOljzlMx0hyYyQhgiSH6rmbScDGEVXYZRvMwFweUReCIoMBQn1TPHwmEo9raFB4ELPLCWX4qhpR3PLhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:15:39.941188Z","bundle_sha256":"9e2c67cc031992e088f8caacbe47f62d1dc727bf75e9083e1c61358e8b0dcb74"}}