{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4WLIO2F5BV7TCH7LNBCEH7BMCM","short_pith_number":"pith:4WLIO2F5","canonical_record":{"source":{"id":"1412.2457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-08T05:58:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5366a11f6c58b4a561780577dc18c366beccd7478cbb89e065dcbe65a1a005a5","abstract_canon_sha256":"7956f49b6fe7e283bf4c689af761fe79cf60b2b292523cf2a684575e554bf7c8"},"schema_version":"1.0"},"canonical_sha256":"e5968768bd0d7f311feb684443fc2c1339b50a49a4bc248e919e356a38f6994f","source":{"kind":"arxiv","id":"1412.2457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2457","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2457v1","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2457","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"pith_short_12","alias_value":"4WLIO2F5BV7T","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4WLIO2F5BV7TCH7L","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4WLIO2F5","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4WLIO2F5BV7TCH7LNBCEH7BMCM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-08T05:58:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5366a11f6c58b4a561780577dc18c366beccd7478cbb89e065dcbe65a1a005a5","abstract_canon_sha256":"7956f49b6fe7e283bf4c689af761fe79cf60b2b292523cf2a684575e554bf7c8"},"schema_version":"1.0"},"canonical_sha256":"e5968768bd0d7f311feb684443fc2c1339b50a49a4bc248e919e356a38f6994f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:57.931307Z","signature_b64":"nCGRMlVsscMhZOkXy4nx9jEOl2w8hdJlLcJ6n7XJO6QhVIYXxbqM/rusc8nJaT2b9eN82bndUP5mUPMg0EVUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5968768bd0d7f311feb684443fc2c1339b50a49a4bc248e919e356a38f6994f","last_reissued_at":"2026-05-18T02:31:57.930648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:57.930648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2457","source_version":1,"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-18T02:31:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47TXBwwM7VM6vKFeCZYWb3cY3wVDAgV3lC3/XjFCj9TmoJfzgAOoWvKbXwQFRux28OaIKE0KzOKupL+p8YtjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:43:07.122363Z"},"content_sha256":"079b7aabae7920c1275928cb72f5143f146bbd482bb51879e36128056d6d3543","schema_version":"1.0","event_id":"sha256:079b7aabae7920c1275928cb72f5143f146bbd482bb51879e36128056d6d3543"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4WLIO2F5BV7TCH7LNBCEH7BMCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Mark Bun, Thomas Steinke","submitted_at":"2014-12-08T05:58:56Z","abstract_excerpt":"Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as pseudorandom generators for halfspaces. In this work, we investigate the limits of these techniques by proving inapproximability results for the sign function.\n  Firstly, the polynomial regression algorithm of Kalai et al. (SIAM J. Comput. 2008) shows that halfspaces can be learned with respect to log-concave distributions on $\\mathbb{R}^n$ in the challenging agnost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2457","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":""},"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-18T02:31:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbNXR793iDANwA5jNOsYeEut3yUu7IFDM1EkdpZc8CqAHrKyh7gA/3tjgVxFo+8VP6gtzFuphKlp1xCNLLY5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:43:07.122719Z"},"content_sha256":"8a6d63aed8697700c78015920ab57769c2df8e154897c87af8fd627f021de139","schema_version":"1.0","event_id":"sha256:8a6d63aed8697700c78015920ab57769c2df8e154897c87af8fd627f021de139"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/bundle.json","state_url":"https://pith.science/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/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-04T22:43:07Z","links":{"resolver":"https://pith.science/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM","bundle":"https://pith.science/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/bundle.json","state":"https://pith.science/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WLIO2F5BV7TCH7LNBCEH7BMCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4WLIO2F5BV7TCH7LNBCEH7BMCM","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":"7956f49b6fe7e283bf4c689af761fe79cf60b2b292523cf2a684575e554bf7c8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-08T05:58:56Z","title_canon_sha256":"5366a11f6c58b4a561780577dc18c366beccd7478cbb89e065dcbe65a1a005a5"},"schema_version":"1.0","source":{"id":"1412.2457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2457","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2457v1","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2457","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"pith_short_12","alias_value":"4WLIO2F5BV7T","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4WLIO2F5BV7TCH7L","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4WLIO2F5","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:8a6d63aed8697700c78015920ab57769c2df8e154897c87af8fd627f021de139","target":"graph","created_at":"2026-05-18T02:31:57Z","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":"Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as pseudorandom generators for halfspaces. In this work, we investigate the limits of these techniques by proving inapproximability results for the sign function.\n  Firstly, the polynomial regression algorithm of Kalai et al. (SIAM J. Comput. 2008) shows that halfspaces can be learned with respect to log-concave distributions on $\\mathbb{R}^n$ in the challenging agnost","authors_text":"Mark Bun, Thomas Steinke","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-08T05:58:56Z","title":"Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2457","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:079b7aabae7920c1275928cb72f5143f146bbd482bb51879e36128056d6d3543","target":"record","created_at":"2026-05-18T02:31:57Z","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":"7956f49b6fe7e283bf4c689af761fe79cf60b2b292523cf2a684575e554bf7c8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-08T05:58:56Z","title_canon_sha256":"5366a11f6c58b4a561780577dc18c366beccd7478cbb89e065dcbe65a1a005a5"},"schema_version":"1.0","source":{"id":"1412.2457","kind":"arxiv","version":1}},"canonical_sha256":"e5968768bd0d7f311feb684443fc2c1339b50a49a4bc248e919e356a38f6994f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5968768bd0d7f311feb684443fc2c1339b50a49a4bc248e919e356a38f6994f","first_computed_at":"2026-05-18T02:31:57.930648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:57.930648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nCGRMlVsscMhZOkXy4nx9jEOl2w8hdJlLcJ6n7XJO6QhVIYXxbqM/rusc8nJaT2b9eN82bndUP5mUPMg0EVUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:57.931307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:079b7aabae7920c1275928cb72f5143f146bbd482bb51879e36128056d6d3543","sha256:8a6d63aed8697700c78015920ab57769c2df8e154897c87af8fd627f021de139"],"state_sha256":"1b19a894a73a03ce8e523135c8abf430211948346af1746c1eb4c19e2ecf4ad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAL5D3V6k9Etn8H0j8pGknfeuJDxVXRER8W8jw3p0LF6sj7KMIFCCx3S+P6IDzm10B5asUAh2y4oWc9YXIUnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:43:07.124778Z","bundle_sha256":"e3ebd4afc8b2aab9acc665d255b618b78562a3fd095cff83a09127d70dbd2bf2"}}