{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FWDI6FYD24WBRPR2UWXIPSYXQ2","short_pith_number":"pith:FWDI6FYD","schema_version":"1.0","canonical_sha256":"2d868f1703d72c18be3aa5ae87cb17869e9d3b2a332d1b9413b705724a95c594","source":{"kind":"arxiv","id":"2105.10386","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Boolean Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Ryan O'Donnell","submitted_at":"2021-05-21T15:00:35Z","abstract_excerpt":"The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \\{0,1\\}^n \\to \\{0,1\\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps the most basic object of study in theoretical computer science, and Fourier analysis has become an indispensable tool in the field. The topic has also played a key role in several other areas of mathematics, from combinatorics, random graph theory, and statistical physics, to Gaussian geometry, metric/Banach spaces, and social choice theory.\n  The intent of t"},"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":"2105.10386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2021-05-21T15:00:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4c3863af28d2b6d75513fff446429eab9c3e381e8d3655179b3bf68143b125c0","abstract_canon_sha256":"4a030e76b44e2efb0547779bd4c9e62253da6bffd9d5a6d45202108b1db2e285"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:10.825152Z","signature_b64":"C8+Blhnclt0cH58Xcf3c8ZDObZbwR8FuYxyJygv8IzTW1Nhj3RHyQ9Cz1FJZ+QVAStbW6rx9+T1xyKnS0bfEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d868f1703d72c18be3aa5ae87cb17869e9d3b2a332d1b9413b705724a95c594","last_reissued_at":"2026-07-05T02:42:10.824806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:10.824806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Boolean Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Ryan O'Donnell","submitted_at":"2021-05-21T15:00:35Z","abstract_excerpt":"The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \\{0,1\\}^n \\to \\{0,1\\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps the most basic object of study in theoretical computer science, and Fourier analysis has become an indispensable tool in the field. The topic has also played a key role in several other areas of mathematics, from combinatorics, random graph theory, and statistical physics, to Gaussian geometry, metric/Banach spaces, and social choice theory.\n  The intent of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10386","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.10386/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.10386","created_at":"2026-07-05T02:42:10.824861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.10386v1","created_at":"2026-07-05T02:42:10.824861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10386","created_at":"2026-07-05T02:42:10.824861+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWDI6FYD24WB","created_at":"2026-07-05T02:42:10.824861+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWDI6FYD24WBRPR2","created_at":"2026-07-05T02:42:10.824861+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWDI6FYD","created_at":"2026-07-05T02:42:10.824861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00246","citing_title":"Further evidence towards the Fourier Entropy-Influence conjecture","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30433","citing_title":"Testing k-submodularity","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01367","citing_title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05036","citing_title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19625","citing_title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2","json":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2.json","graph_json":"https://pith.science/api/pith-number/FWDI6FYD24WBRPR2UWXIPSYXQ2/graph.json","events_json":"https://pith.science/api/pith-number/FWDI6FYD24WBRPR2UWXIPSYXQ2/events.json","paper":"https://pith.science/paper/FWDI6FYD"},"agent_actions":{"view_html":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2","download_json":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2.json","view_paper":"https://pith.science/paper/FWDI6FYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.10386&json=true","fetch_graph":"https://pith.science/api/pith-number/FWDI6FYD24WBRPR2UWXIPSYXQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/FWDI6FYD24WBRPR2UWXIPSYXQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2/action/storage_attestation","attest_author":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2/action/author_attestation","sign_citation":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2/action/citation_signature","submit_replication":"https://pith.science/pith/FWDI6FYD24WBRPR2UWXIPSYXQ2/action/replication_record"}},"created_at":"2026-07-05T02:42:10.824861+00:00","updated_at":"2026-07-05T02:42:10.824861+00:00"}