{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4BMUQCY7WIUEKS6U2KKRMXYRTA","short_pith_number":"pith:4BMUQCY7","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"},"canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","source":{"kind":"arxiv","id":"1901.10576","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10576","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10576v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10576","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"4BMUQCY7WIUE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4BMUQCY7WIUEKS6U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4BMUQCY7","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4BMUQCY7WIUEKS6U2KKRMXYRTA","target":"record","payload":{"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"},"canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","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"},"source_kind":"arxiv","source_id":"1901.10576","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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TogM/u55aNbWAX0rxt8SNBirKaNTfdKeNmRtCncll780HQeKNpERjUK0/+xAz2qpjsA8MeoJ70Jj3ms4m9KGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:09:28.882251Z"},"content_sha256":"416f1875d83cbcda3373881f478abac34b712749f996cd34916354e0f827ac3b","schema_version":"1.0","event_id":"sha256:416f1875d83cbcda3373881f478abac34b712749f996cd34916354e0f827ac3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4BMUQCY7WIUEKS6U2KKRMXYRTA","target":"graph","payload":{"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"},"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqmjXMF/5Lwb/X+QJPWVZy0ryeD4sAlCFePxKJ5h5S0yohYUajLfncEu+pmIblOBPoXZMK8wEYAbqhflyiPDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:09:28.882996Z"},"content_sha256":"f5f728368f5271ad0103519d4207d1e497cf122e244e6ed6281604a68fc4a07f","schema_version":"1.0","event_id":"sha256:f5f728368f5271ad0103519d4207d1e497cf122e244e6ed6281604a68fc4a07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/bundle.json","state_url":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/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-07T22:09:28Z","links":{"resolver":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA","bundle":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/bundle.json","state":"https://pith.science/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BMUQCY7WIUEKS6U2KKRMXYRTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4BMUQCY7WIUEKS6U2KKRMXYRTA","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":"0ce895944e765c7d6b3e3a2f3de5bd27911a2336e51103c43aa773ee3dd08dfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-29T21:59:15Z","title_canon_sha256":"903671c9a2047bb803a4c099a264e080de4806e0a22c9be32ce6a4cab6c1452c"},"schema_version":"1.0","source":{"id":"1901.10576","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10576","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10576v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10576","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"4BMUQCY7WIUE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4BMUQCY7WIUEKS6U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4BMUQCY7","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f5f728368f5271ad0103519d4207d1e497cf122e244e6ed6281604a68fc4a07f","target":"graph","created_at":"2026-05-17T23:41:17Z","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":"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","authors_text":"Mohsen Heidari, Ramji Venkataramanan, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-29T21:59:15Z","title":"Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10576","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:416f1875d83cbcda3373881f478abac34b712749f996cd34916354e0f827ac3b","target":"record","created_at":"2026-05-17T23:41:17Z","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":"0ce895944e765c7d6b3e3a2f3de5bd27911a2336e51103c43aa773ee3dd08dfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-29T21:59:15Z","title_canon_sha256":"903671c9a2047bb803a4c099a264e080de4806e0a22c9be32ce6a4cab6c1452c"},"schema_version":"1.0","source":{"id":"1901.10576","kind":"arxiv","version":2}},"canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e059480b1fb228454bd4d295165f11983db0b48310a3c27516eb497ab09b1897","first_computed_at":"2026-05-17T23:41:17.553537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:17.553537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xIWC1Tbj8NbrxAwa8nlDPzlECXQDO8UlM/EwWJmmoMzTUeTKZ0tkWFWKXpuDw1LLvWZjUc+T3IwLGGr+AVidCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:17.554009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10576","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:416f1875d83cbcda3373881f478abac34b712749f996cd34916354e0f827ac3b","sha256:f5f728368f5271ad0103519d4207d1e497cf122e244e6ed6281604a68fc4a07f"],"state_sha256":"acc7d41b1b023aacd35ef26fb7961f46d10cdb5788e99672dfa7945480ac94bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHyFXrhieRu18QRksS1cSykclbnYreMeCwj88pFGEq4X+7TLyy/Cetj2PN0pKTUm6sUMEA3AaFzom3mtpLNyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:09:28.886829Z","bundle_sha256":"b75a60f33b2c904d085d71f8b19497e13043b173b0aebe91a566b462157a3f8c"}}