{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4NNSUNIH5NNH7SFP4UUZ6YAPQR","short_pith_number":"pith:4NNSUNIH","schema_version":"1.0","canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","source":{"kind":"arxiv","id":"1604.07432","version":1},"attestation_state":"computed","paper":{"title":"Degree and Sensitivity: tails of two distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Avi Wigderson, Parikshit Gopalan, Rocco Servedio","submitted_at":"2016-04-25T20:20:02Z","abstract_excerpt":"The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree poly(s). The best known upper bounds on degree, however, are exponential rather than polynomial in s.\n  Our main result is an approximate version of the conjecture: every Boolean function with sensitivity s can be epsilon-approximated (in L_2) by a polynomial whose degree is O(s log(1/epsilon)). 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":"1604.07432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"bf14779505967b2a397138bbc8eeca50dcdf7e8fc519df0fd4b1cf7a3e55b9fc","abstract_canon_sha256":"4580103c392c8f62900f752dc579d0b2c77b51b1363289865d8a6dc4f6124e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:19.794880Z","signature_b64":"tgC/atLr0EhneuqNQ5fIqkuoBxVZuBcVvHhNk1n19SGyaGuOI1V4NpmVem5XjBwOn8ID7h5fO5RaqoKdTl3iAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","last_reissued_at":"2026-05-18T01:16:19.794289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:19.794289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree and Sensitivity: tails of two distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Avi Wigderson, Parikshit Gopalan, Rocco Servedio","submitted_at":"2016-04-25T20:20:02Z","abstract_excerpt":"The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree poly(s). The best known upper bounds on degree, however, are exponential rather than polynomial in s.\n  Our main result is an approximate version of the conjecture: every Boolean function with sensitivity s can be epsilon-approximated (in L_2) by a polynomial whose degree is O(s log(1/epsilon)). Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07432","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":"1604.07432","created_at":"2026-05-18T01:16:19.794401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07432v1","created_at":"2026-05-18T01:16:19.794401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07432","created_at":"2026-05-18T01:16:19.794401+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NNSUNIH5NNH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NNSUNIH5NNH7SFP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NNSUNIH","created_at":"2026-05-18T12:29:58.707656+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/4NNSUNIH5NNH7SFP4UUZ6YAPQR","json":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR.json","graph_json":"https://pith.science/api/pith-number/4NNSUNIH5NNH7SFP4UUZ6YAPQR/graph.json","events_json":"https://pith.science/api/pith-number/4NNSUNIH5NNH7SFP4UUZ6YAPQR/events.json","paper":"https://pith.science/paper/4NNSUNIH"},"agent_actions":{"view_html":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR","download_json":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR.json","view_paper":"https://pith.science/paper/4NNSUNIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07432&json=true","fetch_graph":"https://pith.science/api/pith-number/4NNSUNIH5NNH7SFP4UUZ6YAPQR/graph.json","fetch_events":"https://pith.science/api/pith-number/4NNSUNIH5NNH7SFP4UUZ6YAPQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/action/storage_attestation","attest_author":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/action/author_attestation","sign_citation":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/action/citation_signature","submit_replication":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/action/replication_record"}},"created_at":"2026-05-18T01:16:19.794401+00:00","updated_at":"2026-05-18T01:16:19.794401+00:00"}