{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EUBACMB5QT26ECQA6Y6GBAQEX3","short_pith_number":"pith:EUBACMB5","canonical_record":{"source":{"id":"2004.12686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"29176de7feb3aa704a3548f35fb9d2da948b328cb134e2717e19dd43c694a102","abstract_canon_sha256":"d94286e87c40e4f23abf55fe1a2cc39526d86159107b4493164701d8ebecc4b6"},"schema_version":"1.0"},"canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","source":{"kind":"arxiv","id":"2004.12686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12686","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12686v1","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12686","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"EUBACMB5QT26","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"EUBACMB5QT26ECQA","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"EUBACMB5","created_at":"2026-07-05T01:37:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EUBACMB5QT26ECQA6Y6GBAQEX3","target":"record","payload":{"canonical_record":{"source":{"id":"2004.12686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"29176de7feb3aa704a3548f35fb9d2da948b328cb134e2717e19dd43c694a102","abstract_canon_sha256":"d94286e87c40e4f23abf55fe1a2cc39526d86159107b4493164701d8ebecc4b6"},"schema_version":"1.0"},"canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:09.205328Z","signature_b64":"PzFb7lw2cD0EJU/C3IiuhWLCkatb7vGTbBKei0XWd37G+niUG9IvEy/FWDkxfzhifX+ZqA1nOMEaRFj1YFb0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","last_reissued_at":"2026-07-05T01:37:09.204922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:09.204922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.12686","source_version":1,"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-07-05T01:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6EBoL6rXJwGyZBJXzMMzyef+JkXu1gezmm6mpulB90NO19AOaJs0AC/4uM1Q/tsTqVVer17C0/PBjqILMup0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:24:42.553160Z"},"content_sha256":"8ebe970e5ea8c64a5cfbbce71d1cc84ae0abeb158c68127c78c3752026aaf6e1","schema_version":"1.0","event_id":"sha256:8ebe970e5ea8c64a5cfbbce71d1cc84ae0abeb158c68127c78c3752026aaf6e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EUBACMB5QT26ECQA6Y6GBAQEX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the optimality of spatial search by continuous-time quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","submitted_at":"2020-04-27T10:05:55Z","abstract_excerpt":"One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked node on a graph of $n$ nodes via a continuous-time quantum walk. This algorithm is said to be optimal if it can find any of the nodes in $O(\\sqrt{n})$ time. However, given a graph, no general conditions for the optimality of the algorithm are known and previous works demonstrating optimal quantum search for certain graphs required an instance-specific analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12686","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/2004.12686/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"},"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-07-05T01:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg1oK2icH+VCqxQuosyeEWmbl9xKeY1vsPJ1RQ+XGcgcfgLdnttkgdkfZolpgiHVTUWBhE+ooExhBdnaiE3UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:24:42.554058Z"},"content_sha256":"751794436a61e8395f01e114819049c612efbec547ada8eb0715720751ea9a69","schema_version":"1.0","event_id":"sha256:751794436a61e8395f01e114819049c612efbec547ada8eb0715720751ea9a69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/bundle.json","state_url":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/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-08-01T11:24:42Z","links":{"resolver":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3","bundle":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/bundle.json","state":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EUBACMB5QT26ECQA6Y6GBAQEX3","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":"d94286e87c40e4f23abf55fe1a2cc39526d86159107b4493164701d8ebecc4b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","title_canon_sha256":"29176de7feb3aa704a3548f35fb9d2da948b328cb134e2717e19dd43c694a102"},"schema_version":"1.0","source":{"id":"2004.12686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12686","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12686v1","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12686","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"EUBACMB5QT26","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"EUBACMB5QT26ECQA","created_at":"2026-07-05T01:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"EUBACMB5","created_at":"2026-07-05T01:37:09Z"}],"graph_snapshots":[{"event_id":"sha256:751794436a61e8395f01e114819049c612efbec547ada8eb0715720751ea9a69","target":"graph","created_at":"2026-07-05T01:37:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.12686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked node on a graph of $n$ nodes via a continuous-time quantum walk. This algorithm is said to be optimal if it can find any of the nodes in $O(\\sqrt{n})$ time. However, given a graph, no general conditions for the optimality of the algorithm are known and previous works demonstrating optimal quantum search for certain graphs required an instance-specific analysi","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","title":"On the optimality of spatial search by continuous-time quantum walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12686","kind":"arxiv","version":1},"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:8ebe970e5ea8c64a5cfbbce71d1cc84ae0abeb158c68127c78c3752026aaf6e1","target":"record","created_at":"2026-07-05T01:37:09Z","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":"d94286e87c40e4f23abf55fe1a2cc39526d86159107b4493164701d8ebecc4b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","title_canon_sha256":"29176de7feb3aa704a3548f35fb9d2da948b328cb134e2717e19dd43c694a102"},"schema_version":"1.0","source":{"id":"2004.12686","kind":"arxiv","version":1}},"canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","first_computed_at":"2026-07-05T01:37:09.204922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:09.204922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PzFb7lw2cD0EJU/C3IiuhWLCkatb7vGTbBKei0XWd37G+niUG9IvEy/FWDkxfzhifX+ZqA1nOMEaRFj1YFb0Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:09.205328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.12686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ebe970e5ea8c64a5cfbbce71d1cc84ae0abeb158c68127c78c3752026aaf6e1","sha256:751794436a61e8395f01e114819049c612efbec547ada8eb0715720751ea9a69"],"state_sha256":"0301bc247b30e24366c0d17d5fa39e040ddaee553ea384646e029ec9330b0bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+a4zn4+1Y3cFSzAdZq0Pk/SQCtL8so/iQsMhyNRmbJ5MixkWmKgkJ9dipk2xV7IVp8mYLAJxywpd7vNH8jHmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T11:24:42.560782Z","bundle_sha256":"4f671627e98d03577e0af5611e0a0e89ea62efff7ea77aaeb0d3c4bf82e7cb86"}}