{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2FFYO32JIVP3MKOY6ILFSTT3KV","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":"5604c16c9c308cca5001820e7a8c526b34d63a8e4e5d3a2d3d01fbfdb1360410","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-23T01:09:06Z","title_canon_sha256":"c47d58240ed95dbb44e649271fed054a3ea703266fc78e7ffabc4b3e54c52d5e"},"schema_version":"1.0","source":{"id":"1410.6220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6220","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6220v1","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6220","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"2FFYO32JIVP3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FFYO32JIVP3MKOY","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FFYO32J","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:3bf613f2cf17a9de3b17a86fe5f6c005241b433118a3be44e288e44826fe84f6","target":"graph","created_at":"2026-05-18T02:39:31Z","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":"We consider the quantum time complexity of the all pairs shortest paths (APSP) problem and some of its variants. The trivial classical algorithm for APSP and most all pairs path problems runs in $O(n^3)$ time, while the trivial algorithm in the quantum setting runs in $\\tilde{O}(n^{2.5})$ time, using Grover search. A major open problem in classical algorithms is to obtain a truly subcubic time algorithm for APSP, i.e. an algorithm running in $O(n^{3-\\varepsilon})$ time for constant $\\varepsilon>0$. To approach this problem, many truly subcubic time classical algorithms have been devised for AP","authors_text":"Aran Nayebi, Virginia Vassilevska Williams","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-23T01:09:06Z","title":"Quantum algorithms for shortest paths problems in structured instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6220","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:f39b63e9f202aed6ba1026a5b4a0003eae78af966e1b18d47b14ef3c8c1ca127","target":"record","created_at":"2026-05-18T02:39:31Z","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":"5604c16c9c308cca5001820e7a8c526b34d63a8e4e5d3a2d3d01fbfdb1360410","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-23T01:09:06Z","title_canon_sha256":"c47d58240ed95dbb44e649271fed054a3ea703266fc78e7ffabc4b3e54c52d5e"},"schema_version":"1.0","source":{"id":"1410.6220","kind":"arxiv","version":1}},"canonical_sha256":"d14b876f49455fb629d8f216594e7b556b1ac6630cdeb1f282cea922dc1bf4a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d14b876f49455fb629d8f216594e7b556b1ac6630cdeb1f282cea922dc1bf4a6","first_computed_at":"2026-05-18T02:39:31.362529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:31.362529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aFjhO3nMVuEd1osvxmRWD6UihNfGrHUD4rsE/AJLTIcUQv1iHVb52JRqKp+X3Ktqq51QEYmfvZJZMbdnLkXuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:31.363102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f39b63e9f202aed6ba1026a5b4a0003eae78af966e1b18d47b14ef3c8c1ca127","sha256:3bf613f2cf17a9de3b17a86fe5f6c005241b433118a3be44e288e44826fe84f6"],"state_sha256":"a164e66bd217b09f029fc2b1864913c637d3c8f2e20271552e41783f45fededc"}