{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PWKBJBPUWMYCLWC7COI656RTMX","short_pith_number":"pith:PWKBJBPU","canonical_record":{"source":{"id":"1305.1021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"2cd84bed5b386eff1d6631eb26c2a43f9c0cb6a506e0c0d80f883da90280e087","abstract_canon_sha256":"0956fbd39a8f9c408fd3c49ee00cbd1a7521d55e1bc5abf9bbe92a3bc3a02e14"},"schema_version":"1.0"},"canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","source":{"kind":"arxiv","id":"1305.1021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1021","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1021v1","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1021","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"PWKBJBPUWMYC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PWKBJBPUWMYCLWC7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PWKBJBPU","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PWKBJBPUWMYCLWC7COI656RTMX","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"2cd84bed5b386eff1d6631eb26c2a43f9c0cb6a506e0c0d80f883da90280e087","abstract_canon_sha256":"0956fbd39a8f9c408fd3c49ee00cbd1a7521d55e1bc5abf9bbe92a3bc3a02e14"},"schema_version":"1.0"},"canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:31.111676Z","signature_b64":"szF6bXyrj0GdIITt3CC2h2q8U3jDH7sfQs/ueHx39vqA+ovVoWG7ZhsXQDLUxPZqAaVNZrcI2XjP+6E/mYYuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","last_reissued_at":"2026-05-18T03:26:31.111210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:31.111210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1021","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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cH/mqNQJ4hGZ77KzGlhMNb818zGDJ4yMluBL11ohgb0QfGkRJb0yPLGHQKBhcByliBS4OElK+zUze50O4EZJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:38.918693Z"},"content_sha256":"c1f8135f11faf08f4801cef5e61d4522bac7eaf99e09e4bb9f16c2df2be7dbc7","schema_version":"1.0","event_id":"sha256:c1f8135f11faf08f4801cef5e61d4522bac7eaf99e09e4bb9f16c2df2be7dbc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PWKBJBPUWMYCLWC7COI656RTMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Quantum Query Complexity of Graph Collision","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs, Kaspars Balodis, Raitis Ozols","submitted_at":"2013-05-05T15:40:13Z","abstract_excerpt":"We present three new quantum algorithms in the quantum query model for \\textsc{graph-collision} problem: \\begin{itemize} \\item an algorithm based on tree decomposition that uses $O\\left(\\sqrt{n}t^{\\sfrac{1}{6}}\\right)$ queries where $t$ is the treewidth of the graph; \\item an algorithm constructed on a span program that improves a result by Gavinsky and Ito. The algorithm uses $O(\\sqrt{n}+\\sqrt{\\alpha^{**}})$ queries, where $\\alpha^{**}(G)$ is a graph parameter defined by \\[\\alpha^{**}(G):=\\min_{VC\\text{-- vertex cover of}G}{\\max_{\\substack{I\\subseteq VC\\\\I\\text{-- independent set}}}{\\sum_{v\\i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1021","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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFSdGhR9tKabOr7Eewwrvh2Kc6oyESbH2QiDqbQP71fLkczsAo2VShvU5JJgn6kHr26ecy/ARhaoq80mc4UgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:38.919342Z"},"content_sha256":"7aee0571f227ddc833bd7e9876aa0ae332fb2acce01f24f43ac1e0341c3a02cb","schema_version":"1.0","event_id":"sha256:7aee0571f227ddc833bd7e9876aa0ae332fb2acce01f24f43ac1e0341c3a02cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/bundle.json","state_url":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWKBJBPUWMYCLWC7COI656RTMX/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-25T09:22:38Z","links":{"resolver":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX","bundle":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/bundle.json","state":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWKBJBPUWMYCLWC7COI656RTMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PWKBJBPUWMYCLWC7COI656RTMX","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":"0956fbd39a8f9c408fd3c49ee00cbd1a7521d55e1bc5abf9bbe92a3bc3a02e14","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","title_canon_sha256":"2cd84bed5b386eff1d6631eb26c2a43f9c0cb6a506e0c0d80f883da90280e087"},"schema_version":"1.0","source":{"id":"1305.1021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1021","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1021v1","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1021","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"PWKBJBPUWMYC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PWKBJBPUWMYCLWC7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PWKBJBPU","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:7aee0571f227ddc833bd7e9876aa0ae332fb2acce01f24f43ac1e0341c3a02cb","target":"graph","created_at":"2026-05-18T03:26:31Z","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 present three new quantum algorithms in the quantum query model for \\textsc{graph-collision} problem: \\begin{itemize} \\item an algorithm based on tree decomposition that uses $O\\left(\\sqrt{n}t^{\\sfrac{1}{6}}\\right)$ queries where $t$ is the treewidth of the graph; \\item an algorithm constructed on a span program that improves a result by Gavinsky and Ito. The algorithm uses $O(\\sqrt{n}+\\sqrt{\\alpha^{**}})$ queries, where $\\alpha^{**}(G)$ is a graph parameter defined by \\[\\alpha^{**}(G):=\\min_{VC\\text{-- vertex cover of}G}{\\max_{\\substack{I\\subseteq VC\\\\I\\text{-- independent set}}}{\\sum_{v\\i","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs, Kaspars Balodis, Raitis Ozols","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","title":"Parameterized Quantum Query Complexity of Graph Collision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1021","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:c1f8135f11faf08f4801cef5e61d4522bac7eaf99e09e4bb9f16c2df2be7dbc7","target":"record","created_at":"2026-05-18T03:26:31Z","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":"0956fbd39a8f9c408fd3c49ee00cbd1a7521d55e1bc5abf9bbe92a3bc3a02e14","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","title_canon_sha256":"2cd84bed5b386eff1d6631eb26c2a43f9c0cb6a506e0c0d80f883da90280e087"},"schema_version":"1.0","source":{"id":"1305.1021","kind":"arxiv","version":1}},"canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","first_computed_at":"2026-05-18T03:26:31.111210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:31.111210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szF6bXyrj0GdIITt3CC2h2q8U3jDH7sfQs/ueHx39vqA+ovVoWG7ZhsXQDLUxPZqAaVNZrcI2XjP+6E/mYYuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:31.111676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f8135f11faf08f4801cef5e61d4522bac7eaf99e09e4bb9f16c2df2be7dbc7","sha256:7aee0571f227ddc833bd7e9876aa0ae332fb2acce01f24f43ac1e0341c3a02cb"],"state_sha256":"bb963050164196397132d3d9a35c64fa1d5426a5b5b94d835cabeba60c6ccaf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQ7AGaFnDXk0SxLkAJJnbdIjH2mjNyVKMO2j1HqOZWQt1UrfBDI1Z5eORJo8t14HnIWgKb+fifb+tcbLXN4/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:22:38.922794Z","bundle_sha256":"9fc331f673ee91c8fe5fdaa367d8f5e5cca1d22230d203305643fda25786ca53"}}