{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZEGX5L6Y7QQQIEUFG3BPUOOANB","short_pith_number":"pith:ZEGX5L6Y","canonical_record":{"source":{"id":"1204.1527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-06T18:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"d9a5f55e83019ed5bfa1d328277c247e5f541a65d3af68e98d6297aac135f0f7","abstract_canon_sha256":"974aca3de4767efbc903c6dd1a6f594a32290ac8ccfb64d3a291c2ea8743a0ac"},"schema_version":"1.0"},"canonical_sha256":"c90d7eafd8fc2104128536c2fa39c068619cd4a7c9bcdb186b1fcec559c7c564","source":{"kind":"arxiv","id":"1204.1527","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZEGX5L6Y7QQQIEUFG3BPUOOANB","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-06T18:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"d9a5f55e83019ed5bfa1d328277c247e5f541a65d3af68e98d6297aac135f0f7","abstract_canon_sha256":"974aca3de4767efbc903c6dd1a6f594a32290ac8ccfb64d3a291c2ea8743a0ac"},"schema_version":"1.0"},"canonical_sha256":"c90d7eafd8fc2104128536c2fa39c068619cd4a7c9bcdb186b1fcec559c7c564","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:25.308714Z","signature_b64":"RukPePcqxaZgTcT3qshD5qYIjIz2A8HeuwsEnBwY60j6+jqNgygker1MuW/hOwg0aq3lLvy7S3xvRJRhGh69Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90d7eafd8fc2104128536c2fa39c068619cd4a7c9bcdb186b1fcec559c7c564","last_reissued_at":"2026-05-18T03:58:25.308177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:25.308177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1527","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-18T03:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1o9aMipBFUQw6JLlIyfuTrm0bfz0AykHifzEBjDtI5sNJgyvEohPPm6sHeSiwQ8ZWgaItoU2w4Y3jJ6AQYEsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:32:37.454133Z"},"content_sha256":"9c5c2d2f38e7d1fe864e516e150d597363c2c6724e064adb5a62830b35ddfc2b","schema_version":"1.0","event_id":"sha256:9c5c2d2f38e7d1fe864e516e150d597363c2c6724e064adb5a62830b35ddfc2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZEGX5L6Y7QQQIEUFG3BPUOOANB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum query algorithm for the graph collision problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dmitry Gavinsky, Tsuyoshi Ito","submitted_at":"2012-04-06T18:13:19Z","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("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1527","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-18T03:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDEwY+K6h7kgAOxU2YUImYO3fbAGr0BLg6NU8lVv7MPp5kQuNMWykcH84uOk/Dqw648Jgs/+xeyZY7o0MZ3kBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:32:37.454808Z"},"content_sha256":"bb7cf3d304bd471e67458f0227e92bc6ca6defa39f26e0b982f181a61fb8a018","schema_version":"1.0","event_id":"sha256:bb7cf3d304bd471e67458f0227e92bc6ca6defa39f26e0b982f181a61fb8a018"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/bundle.json","state_url":"https://pith.science/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/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-30T15:32:37Z","links":{"resolver":"https://pith.science/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB","bundle":"https://pith.science/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/bundle.json","state":"https://pith.science/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEGX5L6Y7QQQIEUFG3BPUOOANB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7N5CKKRqkwnCI0cr13BKjshDChrusUHG3J05DQn9u0Ws0gdC4SZhA3lB4IxO2/YJsfUxpzM+fZTycqeVQszBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:32:37.458002Z","bundle_sha256":"c1b0c777793e9300a86a2486dc34b369089f23c960505b62549610be814f77bb"}}