{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ADN3NVMJBWBTVALHQO757WTIAC","short_pith_number":"pith:ADN3NVMJ","canonical_record":{"source":{"id":"1402.3858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-16T23:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"35feff00ba100d95c947c7d6b679a26d03dd6bcaa7c48f439c5447996a817a13","abstract_canon_sha256":"99898669d31b9b13ceac7b94e6787879929927fad4603988e504f53c6c2fedda"},"schema_version":"1.0"},"canonical_sha256":"00dbb6d5890d833a816783bfdfda68009c8fc698f4d3b5fd4929dd9bad4bfebc","source":{"kind":"arxiv","id":"1402.3858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3858","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3858v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3858","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"ADN3NVMJBWBT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADN3NVMJBWBTVALH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADN3NVMJ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ADN3NVMJBWBTVALHQO757WTIAC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-16T23:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"35feff00ba100d95c947c7d6b679a26d03dd6bcaa7c48f439c5447996a817a13","abstract_canon_sha256":"99898669d31b9b13ceac7b94e6787879929927fad4603988e504f53c6c2fedda"},"schema_version":"1.0"},"canonical_sha256":"00dbb6d5890d833a816783bfdfda68009c8fc698f4d3b5fd4929dd9bad4bfebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.382957Z","signature_b64":"8tqYtgq/9cUc8HDyY/OS18rf1RgYTZlaFz3JTyXxHsV8WjD7j6yNzmLlu23XF48SFXfGqRq0Grt50xJAbkX4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00dbb6d5890d833a816783bfdfda68009c8fc698f4d3b5fd4929dd9bad4bfebc","last_reissued_at":"2026-05-18T02:58:55.382121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.382121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3858","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdcWrPjj8ysnFtg8KToe7rSW/3jp7L/aqD9CG5RrGp/XkXNnGcg7Tyx7vS0MUPEe18jJ+mDA8wrRGaDMIb4oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:00:18.780449Z"},"content_sha256":"08774f3dfb9fccbae18dc1ebe79e2585e51fd6634d31126d69a5d8f7ad391491","schema_version":"1.0","event_id":"sha256:08774f3dfb9fccbae18dc1ebe79e2585e51fd6634d31126d69a5d8f7ad391491"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ADN3NVMJBWBTVALHQO757WTIAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Applications of the Adversary Method in Quantum Query Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2014-02-16T23:50:13Z","abstract_excerpt":"In the thesis, we use a recently developed tight characterisation of quantum query complexity, the adversary bound, to develop new quantum algorithms and lower bounds. Our results are as follows:\n  * We develop a new technique for the construction of quantum algorithms: learning graphs.\n  * We use learning graphs to improve quantum query complexity of the triangle detection and the $k$-distinctness problems.\n  * We prove tight lower bounds for the $k$-sum and the triangle sum problems.\n  * We construct quantum algorithms for some subgraph-finding problems that are optimal in terms of query, ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3858","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aV2mpTIqx+7ae3lr+Rl+aZlhvTOaC5NcoO7THM3BmtvmhBb8DQT8+gYNKYZQllY3qDsPevh1JwM6VLhSprZsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:00:18.780795Z"},"content_sha256":"336d99ec2f691ad3fca1a7ff35e8e8b99bfb458ebda9ff11087ee6a90054fa76","schema_version":"1.0","event_id":"sha256:336d99ec2f691ad3fca1a7ff35e8e8b99bfb458ebda9ff11087ee6a90054fa76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADN3NVMJBWBTVALHQO757WTIAC/bundle.json","state_url":"https://pith.science/pith/ADN3NVMJBWBTVALHQO757WTIAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADN3NVMJBWBTVALHQO757WTIAC/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-06-09T16:00:18Z","links":{"resolver":"https://pith.science/pith/ADN3NVMJBWBTVALHQO757WTIAC","bundle":"https://pith.science/pith/ADN3NVMJBWBTVALHQO757WTIAC/bundle.json","state":"https://pith.science/pith/ADN3NVMJBWBTVALHQO757WTIAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADN3NVMJBWBTVALHQO757WTIAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ADN3NVMJBWBTVALHQO757WTIAC","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":"99898669d31b9b13ceac7b94e6787879929927fad4603988e504f53c6c2fedda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-16T23:50:13Z","title_canon_sha256":"35feff00ba100d95c947c7d6b679a26d03dd6bcaa7c48f439c5447996a817a13"},"schema_version":"1.0","source":{"id":"1402.3858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3858","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3858v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3858","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"ADN3NVMJBWBT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADN3NVMJBWBTVALH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADN3NVMJ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:336d99ec2f691ad3fca1a7ff35e8e8b99bfb458ebda9ff11087ee6a90054fa76","target":"graph","created_at":"2026-05-18T02:58:55Z","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":"In the thesis, we use a recently developed tight characterisation of quantum query complexity, the adversary bound, to develop new quantum algorithms and lower bounds. Our results are as follows:\n  * We develop a new technique for the construction of quantum algorithms: learning graphs.\n  * We use learning graphs to improve quantum query complexity of the triangle detection and the $k$-distinctness problems.\n  * We prove tight lower bounds for the $k$-sum and the triangle sum problems.\n  * We construct quantum algorithms for some subgraph-finding problems that are optimal in terms of query, ti","authors_text":"Aleksandrs Belovs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-16T23:50:13Z","title":"Applications of the Adversary Method in Quantum Query Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3858","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:08774f3dfb9fccbae18dc1ebe79e2585e51fd6634d31126d69a5d8f7ad391491","target":"record","created_at":"2026-05-18T02:58:55Z","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":"99898669d31b9b13ceac7b94e6787879929927fad4603988e504f53c6c2fedda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-16T23:50:13Z","title_canon_sha256":"35feff00ba100d95c947c7d6b679a26d03dd6bcaa7c48f439c5447996a817a13"},"schema_version":"1.0","source":{"id":"1402.3858","kind":"arxiv","version":1}},"canonical_sha256":"00dbb6d5890d833a816783bfdfda68009c8fc698f4d3b5fd4929dd9bad4bfebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00dbb6d5890d833a816783bfdfda68009c8fc698f4d3b5fd4929dd9bad4bfebc","first_computed_at":"2026-05-18T02:58:55.382121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:55.382121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8tqYtgq/9cUc8HDyY/OS18rf1RgYTZlaFz3JTyXxHsV8WjD7j6yNzmLlu23XF48SFXfGqRq0Grt50xJAbkX4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:55.382957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08774f3dfb9fccbae18dc1ebe79e2585e51fd6634d31126d69a5d8f7ad391491","sha256:336d99ec2f691ad3fca1a7ff35e8e8b99bfb458ebda9ff11087ee6a90054fa76"],"state_sha256":"b53f2f1bc2adba3a16f6c227012facb75219f03c6e2d6f90e2bdcab1469532c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+gbFblX8G6cMDBtT8hAQcMp2w1ITgTPbdfETboB7ygxc+PHFH4yGvvDYBA4s7Wpu8qQtIEbSMUh4AsS/LT5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:00:18.782785Z","bundle_sha256":"20572141cc179bddec336259a4922bcb937aad2259c25e487234f24a192586c3"}}