{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZCXPIOJXUCZ2YBCCQMC6AMEACS","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":"524ad259028150913588e47f15c5950571301795f6651ca715380f75aaaa0729","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-09T15:55:07Z","title_canon_sha256":"2ccb01834af024729ae4b238dbb890c1dc231e08459666cdf67df4f3d59bebec"},"schema_version":"1.0","source":{"id":"2605.09017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09017","created_at":"2026-08-06T01:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09017v2","created_at":"2026-08-06T01:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09017","created_at":"2026-08-06T01:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZCXPIOJXUCZ2","created_at":"2026-08-06T01:39:39Z"},{"alias_kind":"pith_short_16","alias_value":"ZCXPIOJXUCZ2YBCC","created_at":"2026-08-06T01:39:39Z"},{"alias_kind":"pith_short_8","alias_value":"ZCXPIOJX","created_at":"2026-08-06T01:39:39Z"}],"graph_snapshots":[{"event_id":"sha256:010af78fdfd85055e57e6cd4ead93c5896ad15c4212fb407d814dac2ecf8915d","target":"graph","created_at":"2026-08-06T01:39:39Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove a novel quantum-walk-based algorithm that achieves query complexity Õ(n^{3/2-α_k}), where α_k ∈ Θ(c^{-k}) and c = √(3+√17)/2 ≈ 1.33, beating the previous best upper bound O(n^{3/2})."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The randomized reductions between problem variants preserve quantum query complexity up to constant factors; if this fails for any of the listed variants, the claimed equivalence classes and the transfer of the new upper bound would collapse."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound."}],"snapshot_sha256":"85ce52c271ee2fbb55b6204e8631182dbe14edb1c58a67ca60580d7cb7326f42"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T08:22:01.745028Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T20:39:13.843341Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T14:01:19.108676Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T10:37:35.596257Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09017/integrity.json","findings":[],"snapshot_sha256":"bd1c7eca4c9d13290b0f0a4605d601683b5d6cb2d69f3d6f853e05056b4198f1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths and cycles, a complete understanding of their query complexities remains elusive. In this work, we consider several variants of path- and cycle-containment problems in the adjacency matrix model, where we search for paths or cycles of constant length $k$. We compare the settings where the graphs are directed or undirected, where the goal is to detect or fin","authors_text":"Amin Shiraz Gilani, Arjan Cornelissen, Subhasree Patro","cross_cats":["cs.CC"],"headline":"A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-09T15:55:07Z","title":"Quantum algorithms for path and cycle containment problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09017","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T02:15:46.902250Z","id":"2dcd2cf8-f17a-48c1-89dc-7dbc7f1e6d27","model_set":{"reader":"grok-4.3"},"one_line_summary":"A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"We prove a novel quantum-walk-based algorithm that achieves query complexity Õ(n^{3/2-α_k}), where α_k ∈ Θ(c^{-k}) and c = √(3+√17)/2 ≈ 1.33, beating the previous best upper bound O(n^{3/2}).","weakest_assumption":"The randomized reductions between problem variants preserve quantum query complexity up to constant factors; if this fails for any of the listed variants, the claimed equivalence classes and the transfer of the new upper bound would collapse."}},"verdict_id":"2dcd2cf8-f17a-48c1-89dc-7dbc7f1e6d27"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:943581002c2259fed1b929c737fb6462b5b1481db91a14c24ff8426d7582fbf1","target":"record","created_at":"2026-08-06T01:39:39Z","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":"524ad259028150913588e47f15c5950571301795f6651ca715380f75aaaa0729","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-09T15:55:07Z","title_canon_sha256":"2ccb01834af024729ae4b238dbb890c1dc231e08459666cdf67df4f3d59bebec"},"schema_version":"1.0","source":{"id":"2605.09017","kind":"arxiv","version":2}},"canonical_sha256":"c8aef43937a0b3ac04428305e0308014b38d9a5890402efd6e33a95e52bad89f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8aef43937a0b3ac04428305e0308014b38d9a5890402efd6e33a95e52bad89f","first_computed_at":"2026-08-06T01:39:39.212058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:39:39.212058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uA6OwlixNYkvRhuEc/zIo6Ki28LNla0PgJP3cx1jVh9yDOzynK3oO8VCUDWkvbbR1rQNPygOqidE45WTNKvtCA==","signature_status":"signed_v1","signed_at":"2026-08-06T01:39:39.213470Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943581002c2259fed1b929c737fb6462b5b1481db91a14c24ff8426d7582fbf1","sha256:010af78fdfd85055e57e6cd4ead93c5896ad15c4212fb407d814dac2ecf8915d"],"state_sha256":"f7fb7e5862a1768a8064ad2144549bff7ebfdf8c638b948bfcf9fca0f1044663"}