{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ASCAFEFQHDERUYWOUY2CWDLO4Z","short_pith_number":"pith:ASCAFEFQ","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"},"canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","source":{"kind":"arxiv","id":"1810.08668","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08668","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08668v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08668","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"ASCAFEFQHDER","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASCAFEFQHDERUYWO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASCAFEFQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ASCAFEFQHDERUYWOUY2CWDLO4Z","target":"record","payload":{"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"},"canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","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"},"source_kind":"arxiv","source_id":"1810.08668","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6RuFUXBFHykB3r7JfbpW6TCAjEVc5RV1rX+4dw+RjyOs+UjKGvrUcSffhGp3K2kLzT/5+WBEegcSF8pbrMYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:40:11.803829Z"},"content_sha256":"de5c69bb07a92548c9ee46484f987b74cd98b893d25b84e0e8c7f6246bdf5a0d","schema_version":"1.0","event_id":"sha256:de5c69bb07a92548c9ee46484f987b74cd98b893d25b84e0e8c7f6246bdf5a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ASCAFEFQHDERUYWOUY2CWDLO4Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oD/LoFr6HrpF31VjxM6wWa5iUYWlhnHjzyLV2lN6S/XOWg9mLsHhmmmjPobiGLC04a2ZT0eUNt5BnyMwDutDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:40:11.804167Z"},"content_sha256":"955517d4f59250a1619e3e7aec6fc97332c749e4f6253376fcb18bfe3b01b4c0","schema_version":"1.0","event_id":"sha256:955517d4f59250a1619e3e7aec6fc97332c749e4f6253376fcb18bfe3b01b4c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/bundle.json","state_url":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T22:40:11Z","links":{"resolver":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z","bundle":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/bundle.json","state":"https://pith.science/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASCAFEFQHDERUYWOUY2CWDLO4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ASCAFEFQHDERUYWOUY2CWDLO4Z","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":"1155e9d74829a3adba050e7a5f6c5bba5476768dad31e12690d8223fc506b95e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-19T19:58:59Z","title_canon_sha256":"dc318d98e3fa8e13d73915ad2bd2d7a94e9463d8efa7dc337d8b081f157162a8"},"schema_version":"1.0","source":{"id":"1810.08668","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08668","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08668v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08668","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"ASCAFEFQHDER","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASCAFEFQHDERUYWO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASCAFEFQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:955517d4f59250a1619e3e7aec6fc97332c749e4f6253376fcb18bfe3b01b4c0","target":"graph","created_at":"2026-05-18T00:02:15Z","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 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. ","authors_text":"Anastasiya Chistopolskaya, Vladimir V. Podolskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-19T19:58:59Z","title":"Parity Decision Tree Complexity is Greater Than Granularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08668","kind":"arxiv","version":2},"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:de5c69bb07a92548c9ee46484f987b74cd98b893d25b84e0e8c7f6246bdf5a0d","target":"record","created_at":"2026-05-18T00:02:15Z","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":"1155e9d74829a3adba050e7a5f6c5bba5476768dad31e12690d8223fc506b95e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-19T19:58:59Z","title_canon_sha256":"dc318d98e3fa8e13d73915ad2bd2d7a94e9463d8efa7dc337d8b081f157162a8"},"schema_version":"1.0","source":{"id":"1810.08668","kind":"arxiv","version":2}},"canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04840290b038c91a62cea6342b0d6ee65489661c98bcf8bcc0e63635e266b280","first_computed_at":"2026-05-18T00:02:15.529715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:15.529715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"soOsWLwqZ58lzEJYk1moM5ZB+0AQ6iP0r/t6OUofvLN2H7zCl9ju7WlDaUhSI5HQHRwxfVN4Gy96ipuM/YYgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:15.530418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08668","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de5c69bb07a92548c9ee46484f987b74cd98b893d25b84e0e8c7f6246bdf5a0d","sha256:955517d4f59250a1619e3e7aec6fc97332c749e4f6253376fcb18bfe3b01b4c0"],"state_sha256":"3edfc9ace7a2cb234db573045db77c04154822946899b88cda48424f53b9e5ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zexDjLUB1tMCb8eS6NBo6KFxG28KKOKA4P1vXK5gg7L8sKC9OR/JdhJerSrq5NUvILyHK6oLSzfikhZE8++iAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:40:11.806064Z","bundle_sha256":"c5aece4dfeb46154e47b000e2e4e9704330ef8ed5693530b22216404d6f81f5f"}}