{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KPY7DVQEPYHUL4DFXGJXZN45AX","short_pith_number":"pith:KPY7DVQE","schema_version":"1.0","canonical_sha256":"53f1f1d6047e0f45f065b9937cb79d05daf3fb398613960646cbbc66992f3788","source":{"kind":"arxiv","id":"1102.4699","version":1},"attestation_state":"computed","paper":{"title":"The influence lower bound via query elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rahul Jain, Shengyu Zhang","submitted_at":"2011-02-23T09:38:14Z","abstract_excerpt":"We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any variable of f. Our lower bound also applies to the two-sided error distributional query complexity of f, and it allows an immediate extension which can be used to prove stronger lower bounds for some functions."},"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":"1102.4699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-23T09:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"629095aa7dd7ed1f1078d982c2ccdf63aa48d1981d92781b81c03f22d6163494","abstract_canon_sha256":"987a42ae7056cbba8408d4a0d08dc78c4290e3259bcf87a3ccf25e24017a16c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.570354Z","signature_b64":"JX5IQMlKIcFSS51FlPyVOSaa7HxX0vjFxNed6Xcc+ZGttOyuQKaM1hF72GnsD1fUztBPikRiGNc7m+Rj9O8ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53f1f1d6047e0f45f065b9937cb79d05daf3fb398613960646cbbc66992f3788","last_reissued_at":"2026-05-18T04:28:07.569725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.569725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The influence lower bound via query elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rahul Jain, Shengyu Zhang","submitted_at":"2011-02-23T09:38:14Z","abstract_excerpt":"We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any variable of f. Our lower bound also applies to the two-sided error distributional query complexity of f, and it allows an immediate extension which can be used to prove stronger lower bounds for some functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4699","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":"1102.4699","created_at":"2026-05-18T04:28:07.569826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4699v1","created_at":"2026-05-18T04:28:07.569826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4699","created_at":"2026-05-18T04:28:07.569826+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPY7DVQEPYHU","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPY7DVQEPYHUL4DF","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPY7DVQE","created_at":"2026-05-18T12:26:34.985390+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/KPY7DVQEPYHUL4DFXGJXZN45AX","json":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX.json","graph_json":"https://pith.science/api/pith-number/KPY7DVQEPYHUL4DFXGJXZN45AX/graph.json","events_json":"https://pith.science/api/pith-number/KPY7DVQEPYHUL4DFXGJXZN45AX/events.json","paper":"https://pith.science/paper/KPY7DVQE"},"agent_actions":{"view_html":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX","download_json":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX.json","view_paper":"https://pith.science/paper/KPY7DVQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4699&json=true","fetch_graph":"https://pith.science/api/pith-number/KPY7DVQEPYHUL4DFXGJXZN45AX/graph.json","fetch_events":"https://pith.science/api/pith-number/KPY7DVQEPYHUL4DFXGJXZN45AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX/action/storage_attestation","attest_author":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX/action/author_attestation","sign_citation":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX/action/citation_signature","submit_replication":"https://pith.science/pith/KPY7DVQEPYHUL4DFXGJXZN45AX/action/replication_record"}},"created_at":"2026-05-18T04:28:07.569826+00:00","updated_at":"2026-05-18T04:28:07.569826+00:00"}