{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EQNI3CYPY5HPNAZWZ6LR2MD5XQ","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":"be1d8f9ae98a89ffede9222d9acd448d584246dfb9dfd972044450232b713381","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-07-02T05:45:53Z","title_canon_sha256":"6243eb6b4d1c446ffc18b545b52c6d09f27e30c249184e01c0f8dade7798aecf"},"schema_version":"1.0","source":{"id":"1507.00432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00432","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00432v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00432","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"EQNI3CYPY5HP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQNI3CYPY5HPNAZW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQNI3CYP","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:0c897b3f25757fbee1b0b4f5f09769e6b4edad059dc573c817fad312da47bbc1","target":"graph","created_at":"2026-05-18T01:37:24Z","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":"Span programs are a model of computation that have been used to design quantum algorithms, mainly in the query model. For any decision problem, there exists a span program that leads to an algorithm with optimal quantum query complexity, but finding such an algorithm is generally challenging.\n  We consider new ways of designing quantum algorithms using span programs. We show how any span program that decides a problem $f$ can also be used to decide \"property testing\" versions of $f$, or more generally, approximate the span program witness size, a property of the input related to $f$. For examp","authors_text":"Stacey Jeffery, Tsuyoshi Ito","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-07-02T05:45:53Z","title":"Approximate Span Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00432","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:fd5bb9cb2eb9dea486056c44089cd05827a92946a8af1f1add1bc515cb12a32f","target":"record","created_at":"2026-05-18T01:37:24Z","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":"be1d8f9ae98a89ffede9222d9acd448d584246dfb9dfd972044450232b713381","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-07-02T05:45:53Z","title_canon_sha256":"6243eb6b4d1c446ffc18b545b52c6d09f27e30c249184e01c0f8dade7798aecf"},"schema_version":"1.0","source":{"id":"1507.00432","kind":"arxiv","version":1}},"canonical_sha256":"241a8d8b0fc74ef68336cf971d307dbc2e17e827170e835adb9a109835bb7d8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"241a8d8b0fc74ef68336cf971d307dbc2e17e827170e835adb9a109835bb7d8d","first_computed_at":"2026-05-18T01:37:24.743020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.743020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BkVwPveMszCPOK1Wt2UxaQVH1naBUg4zxMIlI5xakuulDDfKxjT1w56OaKZqgHWElJ1XjYfhpVqmX2I/Uo0cCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.743768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd5bb9cb2eb9dea486056c44089cd05827a92946a8af1f1add1bc515cb12a32f","sha256:0c897b3f25757fbee1b0b4f5f09769e6b4edad059dc573c817fad312da47bbc1"],"state_sha256":"aa1f88e5b221e321c1bfbb6c928041d137253e3631e9371c935b638a0eaaa9e1"}