{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZEGX5L6Y7QQQIEUFG3BPUOOANB","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":"974aca3de4767efbc903c6dd1a6f594a32290ac8ccfb64d3a291c2ea8743a0ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-06T18:13:19Z","title_canon_sha256":"d9a5f55e83019ed5bfa1d328277c247e5f541a65d3af68e98d6297aac135f0f7"},"schema_version":"1.0","source":{"id":"1204.1527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1527","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1527v1","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1527","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZEGX5L6Y7QQQ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZEGX5L6Y7QQQIEUF","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZEGX5L6Y","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:bb7cf3d304bd471e67458f0227e92bc6ca6defa39f26e0b982f181a61fb8a018","target":"graph","created_at":"2026-05-18T03:58:25Z","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 construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is O(sqrt(n)+sqrt(alpha*(G))), where n is the number of vertices and alpha*(G) is the maximum total degree of the vertices in an independent set of G. Notably, if G is a random graph where every edge is present with a fixed probability independently of other edges, then our algorithm requires O(sqrt(n log n)) queries on most graphs, which is optimal up to the sqrt(","authors_text":"Dmitry Gavinsky, Tsuyoshi Ito","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-06T18:13:19Z","title":"A quantum query algorithm for the graph collision problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1527","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:9c5c2d2f38e7d1fe864e516e150d597363c2c6724e064adb5a62830b35ddfc2b","target":"record","created_at":"2026-05-18T03:58:25Z","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":"974aca3de4767efbc903c6dd1a6f594a32290ac8ccfb64d3a291c2ea8743a0ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-06T18:13:19Z","title_canon_sha256":"d9a5f55e83019ed5bfa1d328277c247e5f541a65d3af68e98d6297aac135f0f7"},"schema_version":"1.0","source":{"id":"1204.1527","kind":"arxiv","version":1}},"canonical_sha256":"c90d7eafd8fc2104128536c2fa39c068619cd4a7c9bcdb186b1fcec559c7c564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c90d7eafd8fc2104128536c2fa39c068619cd4a7c9bcdb186b1fcec559c7c564","first_computed_at":"2026-05-18T03:58:25.308177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:25.308177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RukPePcqxaZgTcT3qshD5qYIjIz2A8HeuwsEnBwY60j6+jqNgygker1MuW/hOwg0aq3lLvy7S3xvRJRhGh69Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:25.308714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c5c2d2f38e7d1fe864e516e150d597363c2c6724e064adb5a62830b35ddfc2b","sha256:bb7cf3d304bd471e67458f0227e92bc6ca6defa39f26e0b982f181a61fb8a018"],"state_sha256":"0ab44eb7c666cb6b554772a1090b344ca82de3d34bc421c9308e6c05d1a80277"}