{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F3T5UUQ352CVMGCE5P627LMSR7","short_pith_number":"pith:F3T5UUQ3","schema_version":"1.0","canonical_sha256":"2ee7da521bee85561844ebfdafad928fc20e7debcb0dcc16a88f7bbf5add345d","source":{"kind":"arxiv","id":"1605.09071","version":2},"attestation_state":"computed","paper":{"title":"Randomized query complexity of sabotaged and composed functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Robin Kothari, Shalev Ben-David","submitted_at":"2016-05-29T22:46:12Z","abstract_excerpt":"We study the composition question for bounded-error randomized query complexity: Is R(f o g) = Omega(R(f) R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Theta(log R(g)), in between f and g allows us to prove R(f o h o g) = Omega(R(f) R(h) R(g)).\n  We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f o g) >= RS(f) RS(g), and a composition th"},"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":"1605.09071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-29T22:46:12Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"eefcc311588049a446f349889b8ab749b7c03b431abfcee118acf3145655a4dd","abstract_canon_sha256":"dd8d8f13ad7f0fbd82626a8cf0d2f938aee73a242090426683e2dd201b1dc10e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:57.949201Z","signature_b64":"pbKWtucmOjWCE3GvvaTXedAECyRuy6B+ivb9k8HPzC3auEt+R4ckAgdqwYmHOh0uS+zttZfc9Gsjc4DGXBtTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee7da521bee85561844ebfdafad928fc20e7debcb0dcc16a88f7bbf5add345d","last_reissued_at":"2026-05-18T00:55:57.948628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:57.948628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized query complexity of sabotaged and composed functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Robin Kothari, Shalev Ben-David","submitted_at":"2016-05-29T22:46:12Z","abstract_excerpt":"We study the composition question for bounded-error randomized query complexity: Is R(f o g) = Omega(R(f) R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Theta(log R(g)), in between f and g allows us to prove R(f o h o g) = Omega(R(f) R(h) R(g)).\n  We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f o g) >= RS(f) RS(g), and a composition th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09071","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":"1605.09071","created_at":"2026-05-18T00:55:57.948708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09071v2","created_at":"2026-05-18T00:55:57.948708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09071","created_at":"2026-05-18T00:55:57.948708+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3T5UUQ352CV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3T5UUQ352CVMGCE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3T5UUQ3","created_at":"2026-05-18T12:30:15.759754+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/F3T5UUQ352CVMGCE5P627LMSR7","json":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7.json","graph_json":"https://pith.science/api/pith-number/F3T5UUQ352CVMGCE5P627LMSR7/graph.json","events_json":"https://pith.science/api/pith-number/F3T5UUQ352CVMGCE5P627LMSR7/events.json","paper":"https://pith.science/paper/F3T5UUQ3"},"agent_actions":{"view_html":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7","download_json":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7.json","view_paper":"https://pith.science/paper/F3T5UUQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09071&json=true","fetch_graph":"https://pith.science/api/pith-number/F3T5UUQ352CVMGCE5P627LMSR7/graph.json","fetch_events":"https://pith.science/api/pith-number/F3T5UUQ352CVMGCE5P627LMSR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7/action/storage_attestation","attest_author":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7/action/author_attestation","sign_citation":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7/action/citation_signature","submit_replication":"https://pith.science/pith/F3T5UUQ352CVMGCE5P627LMSR7/action/replication_record"}},"created_at":"2026-05-18T00:55:57.948708+00:00","updated_at":"2026-05-18T00:55:57.948708+00:00"}