{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2FFYO32JIVP3MKOY6ILFSTT3KV","short_pith_number":"pith:2FFYO32J","canonical_record":{"source":{"id":"1410.6220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-23T01:09:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c47d58240ed95dbb44e649271fed054a3ea703266fc78e7ffabc4b3e54c52d5e","abstract_canon_sha256":"5604c16c9c308cca5001820e7a8c526b34d63a8e4e5d3a2d3d01fbfdb1360410"},"schema_version":"1.0"},"canonical_sha256":"d14b876f49455fb629d8f216594e7b556b1ac6630cdeb1f282cea922dc1bf4a6","source":{"kind":"arxiv","id":"1410.6220","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2FFYO32JIVP3MKOY6ILFSTT3KV","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-23T01:09:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c47d58240ed95dbb44e649271fed054a3ea703266fc78e7ffabc4b3e54c52d5e","abstract_canon_sha256":"5604c16c9c308cca5001820e7a8c526b34d63a8e4e5d3a2d3d01fbfdb1360410"},"schema_version":"1.0"},"canonical_sha256":"d14b876f49455fb629d8f216594e7b556b1ac6630cdeb1f282cea922dc1bf4a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.363102Z","signature_b64":"aFjhO3nMVuEd1osvxmRWD6UihNfGrHUD4rsE/AJLTIcUQv1iHVb52JRqKp+X3Ktqq51QEYmfvZJZMbdnLkXuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d14b876f49455fb629d8f216594e7b556b1ac6630cdeb1f282cea922dc1bf4a6","last_reissued_at":"2026-05-18T02:39:31.362529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.362529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6220","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-05-18T02:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yn4843aI9UklrHwD7yAezzp+FiGy0AwCdPO6j/OiOc3c4WPN56YiwRagGRD0zP6SfeecxBmQnTyyd5Aqc0QKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:45.792615Z"},"content_sha256":"f39b63e9f202aed6ba1026a5b4a0003eae78af966e1b18d47b14ef3c8c1ca127","schema_version":"1.0","event_id":"sha256:f39b63e9f202aed6ba1026a5b4a0003eae78af966e1b18d47b14ef3c8c1ca127"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2FFYO32JIVP3MKOY6ILFSTT3KV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for shortest paths problems in structured instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aran Nayebi, Virginia Vassilevska Williams","submitted_at":"2014-10-23T01:09:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6220","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":""},"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:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/SODsvJv64mAb2q+J8kefK4yhFaiFIy6V3+yKteHAOwxaD/CdnSKwj7q9YfYr4FgKLxJY76jT+HmYhs7Xm4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:45.793288Z"},"content_sha256":"3bf613f2cf17a9de3b17a86fe5f6c005241b433118a3be44e288e44826fe84f6","schema_version":"1.0","event_id":"sha256:3bf613f2cf17a9de3b17a86fe5f6c005241b433118a3be44e288e44826fe84f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/bundle.json","state_url":"https://pith.science/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/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-25T17:55:45Z","links":{"resolver":"https://pith.science/pith/2FFYO32JIVP3MKOY6ILFSTT3KV","bundle":"https://pith.science/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/bundle.json","state":"https://pith.science/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FFYO32JIVP3MKOY6ILFSTT3KV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"em7Gz5v6xGOiCVBaGy/CHVad1Zr4et+bERo2ZRrdLAfQlBEL6wehXgYg3DqLT/DUV3Zrjdfl8r16XbDTrz1vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:55:45.796950Z","bundle_sha256":"ad8216f3c6d4d3221d7189e7ae0f699d430a5db996123366f19e259080a1f05f"}}