{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YJAMKYGNRYIKOCZX42RR3VD2UW","short_pith_number":"pith:YJAMKYGN","schema_version":"1.0","canonical_sha256":"c240c560cd8e10a70b37e6a31dd47aa5828c2e0a85fc72bd3c11c693d65fac84","source":{"kind":"arxiv","id":"1203.2603","version":1},"attestation_state":"computed","paper":{"title":"Span programs and quantum algorithms for st-connectivity and claw detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ben W. Reichardt","submitted_at":"2012-03-12T19:59:08Z","abstract_excerpt":"We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.2603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-12T19:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"e0dd6090d98e05208d5274221f267d7a6416b5384f7a217094b0ea92d9094a50","abstract_canon_sha256":"ad12dedbc204f09d6b6d7113a0f990697b7cdfc835af3f722587fc3a64af95ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:26.347956Z","signature_b64":"uRkHJmIYthfEclJCdsCHM39t1kUttvHNikf4zmsK3xpaDhPJuBS+9Dc1AZdWvCNO8NzCv2F0yD3tzUFn1z6HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c240c560cd8e10a70b37e6a31dd47aa5828c2e0a85fc72bd3c11c693d65fac84","last_reissued_at":"2026-05-18T03:40:26.347522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:26.347522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Span programs and quantum algorithms for st-connectivity and claw detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ben W. Reichardt","submitted_at":"2012-03-12T19:59:08Z","abstract_excerpt":"We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2603","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.2603","created_at":"2026-05-18T03:40:26.347579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2603v1","created_at":"2026-05-18T03:40:26.347579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2603","created_at":"2026-05-18T03:40:26.347579+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJAMKYGNRYIK","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJAMKYGNRYIKOCZX","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJAMKYGN","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW","json":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW.json","graph_json":"https://pith.science/api/pith-number/YJAMKYGNRYIKOCZX42RR3VD2UW/graph.json","events_json":"https://pith.science/api/pith-number/YJAMKYGNRYIKOCZX42RR3VD2UW/events.json","paper":"https://pith.science/paper/YJAMKYGN"},"agent_actions":{"view_html":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW","download_json":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW.json","view_paper":"https://pith.science/paper/YJAMKYGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2603&json=true","fetch_graph":"https://pith.science/api/pith-number/YJAMKYGNRYIKOCZX42RR3VD2UW/graph.json","fetch_events":"https://pith.science/api/pith-number/YJAMKYGNRYIKOCZX42RR3VD2UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW/action/storage_attestation","attest_author":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW/action/author_attestation","sign_citation":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW/action/citation_signature","submit_replication":"https://pith.science/pith/YJAMKYGNRYIKOCZX42RR3VD2UW/action/replication_record"}},"created_at":"2026-05-18T03:40:26.347579+00:00","updated_at":"2026-05-18T03:40:26.347579+00:00"}