{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BDSTKOSD2L5UIBPVOAGGSQQR6F","short_pith_number":"pith:BDSTKOSD","schema_version":"1.0","canonical_sha256":"08e5353a43d2fb4405f5700c694211f1635342ef9cce584f5ca86651afbf9a56","source":{"kind":"arxiv","id":"1210.3279","version":2},"attestation_state":"computed","paper":{"title":"On the Power of Non-Adaptive Learning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ansis Rosmanis","submitted_at":"2012-10-11T15:54:33Z","abstract_excerpt":"We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein.\n  Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure and such that a learning graph gives an "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.3279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-11T15:54:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4fdc952b66762a5f80860498962aa93daa1b850c92906ffd9179b20981e734c9","abstract_canon_sha256":"bf50de76512efe7c99e8cb5c78b383011065d6236c7cb017dff4eeb8f4d74ef8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:23.042535Z","signature_b64":"9ljih/QbYIYdpJz+86Rx4pY2U/dGK1KaziQsP/vi+fGVPZum/+hJ9z6xQHHfNQ6SZNzfBzrwYLvcuR76LNnXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e5353a43d2fb4405f5700c694211f1635342ef9cce584f5ca86651afbf9a56","last_reissued_at":"2026-05-18T03:38:23.041840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:23.041840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Power of Non-Adaptive Learning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ansis Rosmanis","submitted_at":"2012-10-11T15:54:33Z","abstract_excerpt":"We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein.\n  Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure and such that a learning graph gives an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3279","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.3279","created_at":"2026-05-18T03:38:23.041942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3279v2","created_at":"2026-05-18T03:38:23.041942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3279","created_at":"2026-05-18T03:38:23.041942+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDSTKOSD2L5U","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDSTKOSD2L5UIBPV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDSTKOSD","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F","json":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F.json","graph_json":"https://pith.science/api/pith-number/BDSTKOSD2L5UIBPVOAGGSQQR6F/graph.json","events_json":"https://pith.science/api/pith-number/BDSTKOSD2L5UIBPVOAGGSQQR6F/events.json","paper":"https://pith.science/paper/BDSTKOSD"},"agent_actions":{"view_html":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F","download_json":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F.json","view_paper":"https://pith.science/paper/BDSTKOSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3279&json=true","fetch_graph":"https://pith.science/api/pith-number/BDSTKOSD2L5UIBPVOAGGSQQR6F/graph.json","fetch_events":"https://pith.science/api/pith-number/BDSTKOSD2L5UIBPVOAGGSQQR6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F/action/storage_attestation","attest_author":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F/action/author_attestation","sign_citation":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F/action/citation_signature","submit_replication":"https://pith.science/pith/BDSTKOSD2L5UIBPVOAGGSQQR6F/action/replication_record"}},"created_at":"2026-05-18T03:38:23.041942+00:00","updated_at":"2026-05-18T03:38:23.041942+00:00"}