{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I5AM3X2MUCFZ7JUFBKURNY7DUI","short_pith_number":"pith:I5AM3X2M","schema_version":"1.0","canonical_sha256":"4740cddf4ca08b9fa6850aa916e3e3a2127bcb14294528236c970345c8ae265a","source":{"kind":"arxiv","id":"1908.01020","version":1},"attestation_state":"computed","paper":{"title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eric Blais, Joshua Brody","submitted_at":"2019-08-02T19:16:22Z","abstract_excerpt":"We establish two results regarding the query complexity of bounded-error randomized algorithms.\n  * Bounded-error separation theorem. There exists a total function $f : \\{0,1\\}^n \\to \\{0,1\\}$ whose $\\epsilon$-error randomized query complexity satisfies $\\overline{\\mathrm{R}}_\\epsilon(f) = \\Omega( \\mathrm{R}(f) \\cdot \\log\\frac1\\epsilon)$.\n  * Strong direct sum theorem. For every function $f$ and every $k \\ge 2$, the randomized query complexity of computing $k$ instances of $f$ simultaneously satisfies $\\overline{\\mathrm{R}}_\\epsilon(f^k) = \\Theta(k \\cdot \\overline{\\mathrm{R}}_{\\frac\\epsilon k}("},"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":"1908.01020","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-02T19:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"d3ade1c05c7084c611d46f6d7417a3f9827347f53c3b3045f86bd61c55d7389a","abstract_canon_sha256":"2263dde8b833e83863716b678f34519a709e397b5eff397a8254e1b734652731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:25.671918Z","signature_b64":"R3vabU2z2QcO+9SLXsRJoBQgH4xxQknDxnWZgCur7ITXf2kgFP0DZsrr1VCl05zEc/oegWW/yJMVp4Hg5SPFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4740cddf4ca08b9fa6850aa916e3e3a2127bcb14294528236c970345c8ae265a","last_reissued_at":"2026-07-04T23:51:25.671375Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:25.671375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eric Blais, Joshua Brody","submitted_at":"2019-08-02T19:16:22Z","abstract_excerpt":"We establish two results regarding the query complexity of bounded-error randomized algorithms.\n  * Bounded-error separation theorem. There exists a total function $f : \\{0,1\\}^n \\to \\{0,1\\}$ whose $\\epsilon$-error randomized query complexity satisfies $\\overline{\\mathrm{R}}_\\epsilon(f) = \\Omega( \\mathrm{R}(f) \\cdot \\log\\frac1\\epsilon)$.\n  * Strong direct sum theorem. For every function $f$ and every $k \\ge 2$, the randomized query complexity of computing $k$ instances of $f$ simultaneously satisfies $\\overline{\\mathrm{R}}_\\epsilon(f^k) = \\Theta(k \\cdot \\overline{\\mathrm{R}}_{\\frac\\epsilon k}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01020","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01020/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01020","created_at":"2026-07-04T23:51:25.671443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01020v1","created_at":"2026-07-04T23:51:25.671443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01020","created_at":"2026-07-04T23:51:25.671443+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5AM3X2MUCFZ","created_at":"2026-07-04T23:51:25.671443+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5AM3X2MUCFZ7JUF","created_at":"2026-07-04T23:51:25.671443+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5AM3X2M","created_at":"2026-07-04T23:51:25.671443+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/I5AM3X2MUCFZ7JUFBKURNY7DUI","json":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI.json","graph_json":"https://pith.science/api/pith-number/I5AM3X2MUCFZ7JUFBKURNY7DUI/graph.json","events_json":"https://pith.science/api/pith-number/I5AM3X2MUCFZ7JUFBKURNY7DUI/events.json","paper":"https://pith.science/paper/I5AM3X2M"},"agent_actions":{"view_html":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI","download_json":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI.json","view_paper":"https://pith.science/paper/I5AM3X2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01020&json=true","fetch_graph":"https://pith.science/api/pith-number/I5AM3X2MUCFZ7JUFBKURNY7DUI/graph.json","fetch_events":"https://pith.science/api/pith-number/I5AM3X2MUCFZ7JUFBKURNY7DUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI/action/storage_attestation","attest_author":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI/action/author_attestation","sign_citation":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI/action/citation_signature","submit_replication":"https://pith.science/pith/I5AM3X2MUCFZ7JUFBKURNY7DUI/action/replication_record"}},"created_at":"2026-07-04T23:51:25.671443+00:00","updated_at":"2026-07-04T23:51:25.671443+00:00"}