{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4BMUQCY7WIUEKS6U2KKRMXYRTA","short_pith_number":"pith:4BMUQCY7","schema_version":"1.0","canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","source":{"kind":"arxiv","id":"1901.10576","version":2},"attestation_state":"computed","paper":{"title":"Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Heidari, Ramji Venkataramanan, S. Sandeep Pradhan","submitted_at":"2019-01-29T21:59:15Z","abstract_excerpt":"This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input bits of the function are assumed to be independently drawn from a distribution that may be biased. The quality of approximation is measured by the mismatch probability between $f$ and the approximating function $g$. For each class, the optimal approximation and the associated mismatch probability is characterized in terms of the biased Fourier expansion of $f"},"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":"1901.10576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-29T21:59:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"903671c9a2047bb803a4c099a264e080de4806e0a22c9be32ce6a4cab6c1452c","abstract_canon_sha256":"0ce895944e765c7d6b3e3a2f3de5bd27911a2336e51103c43aa773ee3dd08dfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.554009Z","signature_b64":"xIWC1Tbj8NbrxAwa8nlDPzlECXQDO8UlM/EwWJmmoMzTUeTKZ0tkWFWKXpuDw1LLvWZjUc+T3IwLGGr+AVidCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","last_reissued_at":"2026-05-17T23:41:17.553537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.553537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Heidari, Ramji Venkataramanan, S. Sandeep Pradhan","submitted_at":"2019-01-29T21:59:15Z","abstract_excerpt":"This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input bits of the function are assumed to be independently drawn from a distribution that may be biased. The quality of approximation is measured by the mismatch probability between $f$ and the approximating function $g$. For each class, the optimal approximation and the associated mismatch probability is characterized in terms of the biased Fourier expansion of $f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10576","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":"1901.10576","created_at":"2026-05-17T23:41:17.553612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10576v2","created_at":"2026-05-17T23:41:17.553612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10576","created_at":"2026-05-17T23:41:17.553612+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BMUQCY7WIUE","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BMUQCY7WIUEKS6U","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BMUQCY7","created_at":"2026-05-18T12:33:10.108867+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/4BMUQCY7WIUEKS6U2KKRMXYRTA","json":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA.json","graph_json":"https://pith.science/api/pith-number/4BMUQCY7WIUEKS6U2KKRMXYRTA/graph.json","events_json":"https://pith.science/api/pith-number/4BMUQCY7WIUEKS6U2KKRMXYRTA/events.json","paper":"https://pith.science/paper/4BMUQCY7"},"agent_actions":{"view_html":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA","download_json":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA.json","view_paper":"https://pith.science/paper/4BMUQCY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10576&json=true","fetch_graph":"https://pith.science/api/pith-number/4BMUQCY7WIUEKS6U2KKRMXYRTA/graph.json","fetch_events":"https://pith.science/api/pith-number/4BMUQCY7WIUEKS6U2KKRMXYRTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/action/storage_attestation","attest_author":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/action/author_attestation","sign_citation":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/action/citation_signature","submit_replication":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/action/replication_record"}},"created_at":"2026-05-17T23:41:17.553612+00:00","updated_at":"2026-05-17T23:41:17.553612+00:00"}