{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VXQ5UTWK77V7WVXJHF3ALSY56P","short_pith_number":"pith:VXQ5UTWK","schema_version":"1.0","canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","source":{"kind":"arxiv","id":"1312.0036","version":1},"attestation_state":"computed","paper":{"title":"Weak Parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Kaspars Balodis, Mohammad Bavarian, Scott Aaronson","submitted_at":"2013-11-29T22:49:00Z","abstract_excerpt":"We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1"},"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":"1312.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-29T22:49:00Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"35b168d857f8bcd5b43fca742aa12d0b70f055ae292d75150f98c52d4bc65976","abstract_canon_sha256":"c1fa25a40612aaafd05124c395fe0dd1b40e0e94715b9f45ef292e179d321c59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:47.030816Z","signature_b64":"XZF7w97/BM5QieBzkaQoA0YXf7xUwSC+oW5L0D12EXydKVm9Sir1ylWhMCRWtoWc7od6k9jVCIMt3puHWgyHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","last_reissued_at":"2026-05-18T03:05:47.030171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:47.030171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Kaspars Balodis, Mohammad Bavarian, Scott Aaronson","submitted_at":"2013-11-29T22:49:00Z","abstract_excerpt":"We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0036","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0036","created_at":"2026-05-18T03:05:47.030279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0036v1","created_at":"2026-05-18T03:05:47.030279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0036","created_at":"2026-05-18T03:05:47.030279+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXQ5UTWK77V7","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXQ5UTWK77V7WVXJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXQ5UTWK","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P","json":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P.json","graph_json":"https://pith.science/api/pith-number/VXQ5UTWK77V7WVXJHF3ALSY56P/graph.json","events_json":"https://pith.science/api/pith-number/VXQ5UTWK77V7WVXJHF3ALSY56P/events.json","paper":"https://pith.science/paper/VXQ5UTWK"},"agent_actions":{"view_html":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P","download_json":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P.json","view_paper":"https://pith.science/paper/VXQ5UTWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0036&json=true","fetch_graph":"https://pith.science/api/pith-number/VXQ5UTWK77V7WVXJHF3ALSY56P/graph.json","fetch_events":"https://pith.science/api/pith-number/VXQ5UTWK77V7WVXJHF3ALSY56P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/action/storage_attestation","attest_author":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/action/author_attestation","sign_citation":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/action/citation_signature","submit_replication":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/action/replication_record"}},"created_at":"2026-05-18T03:05:47.030279+00:00","updated_at":"2026-05-18T03:05:47.030279+00:00"}