{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ATLJULXVRE345M64TXE2OQYJMV","short_pith_number":"pith:ATLJULXV","schema_version":"1.0","canonical_sha256":"04d69a2ef58937ceb3dc9dc9a74309657099244852785729cd84d9dd9529f1bb","source":{"kind":"arxiv","id":"1101.0798","version":2},"attestation_state":"computed","paper":{"title":"Speed from Repetition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shelby Kimmel","submitted_at":"2011-01-04T19:13:12Z","abstract_excerpt":"We present an oracle problem, which we call the Repeated Randomness problem, that a quantum algorithm can solve in one query, while any classical algorithm requires $\\Omega(\\log n)$ queries, where the oracle function has $2^n$ inputs. This problem has connections to the parity problem introduced by Bernstein and Vazirani \\cite{Bernstein1993} and to a variation of the NAND tree described by Zhan et al \\cite{Zhan}."},"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":"1101.0798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-04T19:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"a66fb13d2769332c28b76d14c093d97f1386ea23e511820e9ee9aa081a74704d","abstract_canon_sha256":"8f19c387b1e26ec2c4236ad1d69bc699b4d587f30a3b098bf15974295917a516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:05.524736Z","signature_b64":"xsZl+WBp5VsiB2CX16IkqBDd40cCCzGK41aTdLit61HRiSZf9SCuVE1YdGF6KrmwGNvcSX1pIVk18t+0tzgSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04d69a2ef58937ceb3dc9dc9a74309657099244852785729cd84d9dd9529f1bb","last_reissued_at":"2026-05-18T02:23:05.524059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:05.524059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speed from Repetition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shelby Kimmel","submitted_at":"2011-01-04T19:13:12Z","abstract_excerpt":"We present an oracle problem, which we call the Repeated Randomness problem, that a quantum algorithm can solve in one query, while any classical algorithm requires $\\Omega(\\log n)$ queries, where the oracle function has $2^n$ inputs. This problem has connections to the parity problem introduced by Bernstein and Vazirani \\cite{Bernstein1993} and to a variation of the NAND tree described by Zhan et al \\cite{Zhan}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0798","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":"1101.0798","created_at":"2026-05-18T02:23:05.524153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0798v2","created_at":"2026-05-18T02:23:05.524153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0798","created_at":"2026-05-18T02:23:05.524153+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATLJULXVRE34","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATLJULXVRE345M64","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATLJULXV","created_at":"2026-05-18T12:26:24.575870+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/ATLJULXVRE345M64TXE2OQYJMV","json":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV.json","graph_json":"https://pith.science/api/pith-number/ATLJULXVRE345M64TXE2OQYJMV/graph.json","events_json":"https://pith.science/api/pith-number/ATLJULXVRE345M64TXE2OQYJMV/events.json","paper":"https://pith.science/paper/ATLJULXV"},"agent_actions":{"view_html":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV","download_json":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV.json","view_paper":"https://pith.science/paper/ATLJULXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0798&json=true","fetch_graph":"https://pith.science/api/pith-number/ATLJULXVRE345M64TXE2OQYJMV/graph.json","fetch_events":"https://pith.science/api/pith-number/ATLJULXVRE345M64TXE2OQYJMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV/action/storage_attestation","attest_author":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV/action/author_attestation","sign_citation":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV/action/citation_signature","submit_replication":"https://pith.science/pith/ATLJULXVRE345M64TXE2OQYJMV/action/replication_record"}},"created_at":"2026-05-18T02:23:05.524153+00:00","updated_at":"2026-05-18T02:23:05.524153+00:00"}