{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WPOVITEEMHPKZCKN3YXUFBPNBY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"82c723c60798fcbac184c5a942fb205d0a1d630c8a68dea6d496b4a551fdc87f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T19:14:02Z","title_canon_sha256":"ca099910f1fc2099d47f6abd319ad70cc68c8268bd0a10127021c57c97820a16"},"schema_version":"1.0","source":{"id":"1801.08564","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08564","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08564v3","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08564","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"WPOVITEEMHPK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WPOVITEEMHPKZCKN","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WPOVITEE","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:6fb29e8b1ba3c3fe32345ffaacd776a7c6d423fb8c1a87e1b83191bffa5375bc","target":"graph","created_at":"2026-05-18T00:00:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We prove that there is a constant $C\\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\\mathbb{R}$) is a $C\\cdot 2^d$-junta, i.e. it depends on at most $C\\cdot 2^d$ variables. This improves the $d\\cdot 2^{d-1}$ upper bound of Nisan and Szegedy [Computational Complexity 4 (1994)]. Our proof uses a new weighting scheme where we assign weights to variables based on the highest degree monomial they appear on.\n  The bound of $C\\cdot 2^d$ is tight up to the constant $C$ as a lower bound of $2^d-1$ is achieved by a read-once decision tree of depth $d$. We slight","authors_text":"John Chiarelli, Michael Saks, Pooya Hatami","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T19:14:02Z","title":"An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08564","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:79cf3324b9272dd984cfc6d7a5bec9bc7d4c597f0feec306034f3b7b76f9fcbb","target":"record","created_at":"2026-05-18T00:00:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"82c723c60798fcbac184c5a942fb205d0a1d630c8a68dea6d496b4a551fdc87f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T19:14:02Z","title_canon_sha256":"ca099910f1fc2099d47f6abd319ad70cc68c8268bd0a10127021c57c97820a16"},"schema_version":"1.0","source":{"id":"1801.08564","kind":"arxiv","version":3}},"canonical_sha256":"b3dd544c8461deac894dde2f4285ed0e09f0a6ef83f9c5ae90baf1e50d8d029b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3dd544c8461deac894dde2f4285ed0e09f0a6ef83f9c5ae90baf1e50d8d029b","first_computed_at":"2026-05-18T00:00:30.701629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:30.701629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btAaLus00PRnnKIlnsM29RsOP3s6CN6XalnCsksNlyLbDw83457s8XyepSmXsecsh95CJse02zdShH7kXjbCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:30.702020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08564","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79cf3324b9272dd984cfc6d7a5bec9bc7d4c597f0feec306034f3b7b76f9fcbb","sha256:6fb29e8b1ba3c3fe32345ffaacd776a7c6d423fb8c1a87e1b83191bffa5375bc"],"state_sha256":"42724b7e1f30a85d2b7cbf76397f55c3dfcb2d3bb6ae80b79f5b3ec84ec5128b"}