{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ASCAFEFQHDERUYWOUY2CWDLO4Z","short_pith_number":"pith:ASCAFEFQ","schema_version":"1.0","canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","source":{"kind":"arxiv","id":"1810.08668","version":2},"attestation_state":"computed","paper":{"title":"Parity Decision Tree Complexity is Greater Than Granularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anastasiya Chistopolskaya, Vladimir V. Podolskii","submitted_at":"2018-10-19T19:58:59Z","abstract_excerpt":"We prove a new lower bound on the parity decision tree complexity $\\mathsf{D}_{\\oplus}(f)$ of a Boolean function $f$. Namely, granularity of the Boolean function $f$ is the smallest $k$ such that all Fourier coefficients of $f$ are integer multiples of $1/2^k$. We show that $\\mathsf{D}_{\\oplus}(f)\\geq k+1$.\n  This lower bound is an improvement of lower bounds through the sparsity of $f$ and through the degree of $f$ over $\\mathbb{F}_2$. Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority and recursive majority. "},"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":"1810.08668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-19T19:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"dc318d98e3fa8e13d73915ad2bd2d7a94e9463d8efa7dc337d8b081f157162a8","abstract_canon_sha256":"1155e9d74829a3adba050e7a5f6c5bba5476768dad31e12690d8223fc506b95e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.530418Z","signature_b64":"soOsWLwqZ58lzEJYk1moM5ZB+0AQ6iP0r/t6OUofvLN2H7zCl9ju7WlDaUhSI5HQHRwxfVN4Gy96ipuM/YYgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","last_reissued_at":"2026-05-18T00:02:15.529715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.529715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parity Decision Tree Complexity is Greater Than Granularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anastasiya Chistopolskaya, Vladimir V. Podolskii","submitted_at":"2018-10-19T19:58:59Z","abstract_excerpt":"We prove a new lower bound on the parity decision tree complexity $\\mathsf{D}_{\\oplus}(f)$ of a Boolean function $f$. Namely, granularity of the Boolean function $f$ is the smallest $k$ such that all Fourier coefficients of $f$ are integer multiples of $1/2^k$. We show that $\\mathsf{D}_{\\oplus}(f)\\geq k+1$.\n  This lower bound is an improvement of lower bounds through the sparsity of $f$ and through the degree of $f$ over $\\mathbb{F}_2$. Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority and recursive majority. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08668","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":"1810.08668","created_at":"2026-05-18T00:02:15.529815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08668v2","created_at":"2026-05-18T00:02:15.529815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08668","created_at":"2026-05-18T00:02:15.529815+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASCAFEFQHDER","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASCAFEFQHDERUYWO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASCAFEFQ","created_at":"2026-05-18T12:32:13.499390+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/ASCAFEFQHDERUYWOUY2CWDLO4Z","json":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z.json","graph_json":"https://pith.science/api/pith-number/ASCAFEFQHDERUYWOUY2CWDLO4Z/graph.json","events_json":"https://pith.science/api/pith-number/ASCAFEFQHDERUYWOUY2CWDLO4Z/events.json","paper":"https://pith.science/paper/ASCAFEFQ"},"agent_actions":{"view_html":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z","download_json":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z.json","view_paper":"https://pith.science/paper/ASCAFEFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08668&json=true","fetch_graph":"https://pith.science/api/pith-number/ASCAFEFQHDERUYWOUY2CWDLO4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/ASCAFEFQHDERUYWOUY2CWDLO4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/action/storage_attestation","attest_author":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/action/author_attestation","sign_citation":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/action/citation_signature","submit_replication":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/action/replication_record"}},"created_at":"2026-05-18T00:02:15.529815+00:00","updated_at":"2026-05-18T00:02:15.529815+00:00"}