{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FQDFZC5IDKSWIYLMP3MUHIKNXD","short_pith_number":"pith:FQDFZC5I","schema_version":"1.0","canonical_sha256":"2c065c8ba81aa564616c7ed943a14db8ccd1f3044ece685c1bea81ef92a2c6b3","source":{"kind":"arxiv","id":"1903.08214","version":2},"attestation_state":"computed","paper":{"title":"A tighter bound on the number of relevant variables in a bounded degree Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jake Wellens","submitted_at":"2019-03-19T19:00:44Z","abstract_excerpt":"A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C \\cdot 2^d$, where $C = 6.614$. Here we refine their argument to show that one may take $C = 4.416$."},"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":"1903.08214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-19T19:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"da95ff09b547d508366d90fe2e995468373bbb49aeef48bc27491538abc524f8","abstract_canon_sha256":"a20f37c97cc4035f5d5174bc4c2873e31926be4a299cf9e7db6b716a0b159d35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:44.335189Z","signature_b64":"7rLGZ1Q+BkuvY5tZfApbJhcCcX3FfQmEcsnfrJOQqDllUqgTcyjsud12bwvM41T8WpzvhDkZrxhBnnbQbupIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c065c8ba81aa564616c7ed943a14db8ccd1f3044ece685c1bea81ef92a2c6b3","last_reissued_at":"2026-05-17T23:50:44.334600Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:44.334600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tighter bound on the number of relevant variables in a bounded degree Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jake Wellens","submitted_at":"2019-03-19T19:00:44Z","abstract_excerpt":"A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C \\cdot 2^d$, where $C = 6.614$. Here we refine their argument to show that one may take $C = 4.416$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08214","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":"1903.08214","created_at":"2026-05-17T23:50:44.334683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08214v2","created_at":"2026-05-17T23:50:44.334683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08214","created_at":"2026-05-17T23:50:44.334683+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQDFZC5IDKSW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQDFZC5IDKSWIYLM","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQDFZC5I","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05615","citing_title":"Classes Testable with $O(1/\\epsilon)$ Queries for Small $\\epsilon$ Independent of the Number of Variables","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD","json":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD.json","graph_json":"https://pith.science/api/pith-number/FQDFZC5IDKSWIYLMP3MUHIKNXD/graph.json","events_json":"https://pith.science/api/pith-number/FQDFZC5IDKSWIYLMP3MUHIKNXD/events.json","paper":"https://pith.science/paper/FQDFZC5I"},"agent_actions":{"view_html":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD","download_json":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD.json","view_paper":"https://pith.science/paper/FQDFZC5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08214&json=true","fetch_graph":"https://pith.science/api/pith-number/FQDFZC5IDKSWIYLMP3MUHIKNXD/graph.json","fetch_events":"https://pith.science/api/pith-number/FQDFZC5IDKSWIYLMP3MUHIKNXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD/action/storage_attestation","attest_author":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD/action/author_attestation","sign_citation":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD/action/citation_signature","submit_replication":"https://pith.science/pith/FQDFZC5IDKSWIYLMP3MUHIKNXD/action/replication_record"}},"created_at":"2026-05-17T23:50:44.334683+00:00","updated_at":"2026-05-17T23:50:44.334683+00:00"}