{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VXQ5UTWK77V7WVXJHF3ALSY56P","short_pith_number":"pith:VXQ5UTWK","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"},"canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","source":{"kind":"arxiv","id":"1312.0036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0036","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0036v1","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0036","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"VXQ5UTWK77V7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXQ5UTWK77V7WVXJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXQ5UTWK","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VXQ5UTWK77V7WVXJHF3ALSY56P","target":"record","payload":{"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"},"canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","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"},"source_kind":"arxiv","source_id":"1312.0036","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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic81QA0jdt0Vn8Kq27K83iDZlsa42UsJ5IHmTWuXyhLNYfxNEP4qiCahBzk0I6WwX3Ll6OviYTvboTl5jj2rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:15:21.952707Z"},"content_sha256":"c8847687e8b6f073a0b03558fe20a5e18e3558d57d683528605525d14effe064","schema_version":"1.0","event_id":"sha256:c8847687e8b6f073a0b03558fe20a5e18e3558d57d683528605525d14effe064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VXQ5UTWK77V7WVXJHF3ALSY56P","target":"graph","payload":{"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"},"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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZyD6AS6X5VGYv76+xBl/NC/6fvOnRij+5ATrHkv3YBQQrrGGsSh0rxqKhlqedMBDRU9fujd7RRycjvS39XVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:15:21.953381Z"},"content_sha256":"9cea7f456c285875d68f05d5a44e51580c5aa0bcce55d7e52d0591de0b2a1a5c","schema_version":"1.0","event_id":"sha256:9cea7f456c285875d68f05d5a44e51580c5aa0bcce55d7e52d0591de0b2a1a5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/bundle.json","state_url":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/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-25T20:15:21Z","links":{"resolver":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P","bundle":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/bundle.json","state":"https://pith.science/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXQ5UTWK77V7WVXJHF3ALSY56P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VXQ5UTWK77V7WVXJHF3ALSY56P","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":"c1fa25a40612aaafd05124c395fe0dd1b40e0e94715b9f45ef292e179d321c59","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-29T22:49:00Z","title_canon_sha256":"35b168d857f8bcd5b43fca742aa12d0b70f055ae292d75150f98c52d4bc65976"},"schema_version":"1.0","source":{"id":"1312.0036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0036","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0036v1","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0036","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"VXQ5UTWK77V7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXQ5UTWK77V7WVXJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXQ5UTWK","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:9cea7f456c285875d68f05d5a44e51580c5aa0bcce55d7e52d0591de0b2a1a5c","target":"graph","created_at":"2026-05-18T03:05:47Z","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 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","authors_text":"Andris Ambainis, Kaspars Balodis, Mohammad Bavarian, Scott Aaronson","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-29T22:49:00Z","title":"Weak Parity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0036","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:c8847687e8b6f073a0b03558fe20a5e18e3558d57d683528605525d14effe064","target":"record","created_at":"2026-05-18T03:05:47Z","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":"c1fa25a40612aaafd05124c395fe0dd1b40e0e94715b9f45ef292e179d321c59","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-29T22:49:00Z","title_canon_sha256":"35b168d857f8bcd5b43fca742aa12d0b70f055ae292d75150f98c52d4bc65976"},"schema_version":"1.0","source":{"id":"1312.0036","kind":"arxiv","version":1}},"canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ade1da4ecaffebfb56e9397605cb1df3da45982870fced2cdfb892e0a3026053","first_computed_at":"2026-05-18T03:05:47.030171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:47.030171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XZF7w97/BM5QieBzkaQoA0YXf7xUwSC+oW5L0D12EXydKVm9Sir1ylWhMCRWtoWc7od6k9jVCIMt3puHWgyHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:47.030816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8847687e8b6f073a0b03558fe20a5e18e3558d57d683528605525d14effe064","sha256:9cea7f456c285875d68f05d5a44e51580c5aa0bcce55d7e52d0591de0b2a1a5c"],"state_sha256":"13e5b5d1e9d62fd735f4ed21e5db163dc46082ed2c2446a541b89b20cbb99dc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoOS9cOZhqmlzyQGaNQnDgcqHs9xWdAyZk1TQ6V7UMs26bhTQTcvmDn/7SS8h0XZZAWpIF9KHXdadxX5oz5eBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:15:21.956890Z","bundle_sha256":"530f8cfc967af39948d363991e9e92bde7acd45a54ce3224729c694ac09d62ad"}}