{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PFTKS4OWAHREC5PIJN3Z6SQSAX","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":"25f5304734bba136aefeb70d4945ecebf53f81ea35e321fbfee198e5998da7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-01T13:59:48Z","title_canon_sha256":"e8f35b06159b4c36f3084763542dec78840f523f78c1dcf6452a368b12496fd0"},"schema_version":"1.0","source":{"id":"2008.00266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.00266","created_at":"2026-07-05T01:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"2008.00266v1","created_at":"2026-07-05T01:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00266","created_at":"2026-07-05T01:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"PFTKS4OWAHRE","created_at":"2026-07-05T01:24:06Z"},{"alias_kind":"pith_short_16","alias_value":"PFTKS4OWAHREC5PI","created_at":"2026-07-05T01:24:06Z"},{"alias_kind":"pith_short_8","alias_value":"PFTKS4OW","created_at":"2026-07-05T01:24:06Z"}],"graph_snapshots":[{"event_id":"sha256:a93fb1511cc2ba1bb4d1baa8db9d7840a7f0d5ad1ed401eeb450a744b2ad5436","target":"graph","created_at":"2026-07-05T01:24:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.00266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with Fourier support S and Fourier sparsity k.\n  1) We prove via the probabilistic method that there exists a parity decision tree of depth O(sqrt k) that computes f. This matches the best known upper bound on the parity decision tree complexity of Boolean functions (Tsang, Wong, Xie, and Zhang, FOCS 2013). Moreover, while previous constructions (Tsang et al., FOCS 2","authors_text":"Nikhil S. Mande, Swagato Sanyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-01T13:59:48Z","title":"On parity decision trees for Fourier-sparse Boolean functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00266","kind":"arxiv","version":1},"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:7b6995d405759e422f997f010aecb2198d7972a23f346e5d4a2cdc8537831fb6","target":"record","created_at":"2026-07-05T01:24:06Z","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":"25f5304734bba136aefeb70d4945ecebf53f81ea35e321fbfee198e5998da7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-01T13:59:48Z","title_canon_sha256":"e8f35b06159b4c36f3084763542dec78840f523f78c1dcf6452a368b12496fd0"},"schema_version":"1.0","source":{"id":"2008.00266","kind":"arxiv","version":1}},"canonical_sha256":"7966a971d601e24175e84b779f4a1205f6e9d0c1094123531b094a5f75ca337b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7966a971d601e24175e84b779f4a1205f6e9d0c1094123531b094a5f75ca337b","first_computed_at":"2026-07-05T01:24:06.040031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:24:06.040031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SQOPKVFB0gz6+5iF1kwA8cg2RY9VX2bzDAZH64B/xcw8kdwFekjcqwzu4UwuePPf/BD4BiRaUG5W1kzoErm0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:24:06.040468Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.00266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6995d405759e422f997f010aecb2198d7972a23f346e5d4a2cdc8537831fb6","sha256:a93fb1511cc2ba1bb4d1baa8db9d7840a7f0d5ad1ed401eeb450a744b2ad5436"],"state_sha256":"03f3fb3347fe5e079111094d4e45a83cb884fd34e3ecf891fbef47f5d55150c1"}