{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J6HJ7OD46EX7QBVZRYMM7MTQ53","short_pith_number":"pith:J6HJ7OD4","canonical_record":{"source":{"id":"1405.5268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-21T00:06:02Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"0a425c1eb0aeefaa3f525855c0db5da84cbede8c41aafa4917078a966975ee90","abstract_canon_sha256":"a397812f53cc6890c72ec8a92edea787c1ae2f8c16aac523820c11d36b078adb"},"schema_version":"1.0"},"canonical_sha256":"4f8e9fb87cf12ff806b98e18cfb270eeec182b9a1d554d521fe7f82ea5887566","source":{"kind":"arxiv","id":"1405.5268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5268","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5268v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5268","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"J6HJ7OD46EX7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6HJ7OD46EX7QBVZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6HJ7OD4","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J6HJ7OD46EX7QBVZRYMM7MTQ53","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-21T00:06:02Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"0a425c1eb0aeefaa3f525855c0db5da84cbede8c41aafa4917078a966975ee90","abstract_canon_sha256":"a397812f53cc6890c72ec8a92edea787c1ae2f8c16aac523820c11d36b078adb"},"schema_version":"1.0"},"canonical_sha256":"4f8e9fb87cf12ff806b98e18cfb270eeec182b9a1d554d521fe7f82ea5887566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.001311Z","signature_b64":"AaL/EBTe0hBhTtfa92PyoW6FNvpgilF0ffslXqQWgeEg68K0hCKIdQzosG/Pd+Rv9z/jRcwA0ScT+Y1isnH1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8e9fb87cf12ff806b98e18cfb270eeec182b9a1d554d521fe7f82ea5887566","last_reissued_at":"2026-05-18T02:48:02.000864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.000864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5268","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Es2p7ctNVo+xZ4EeYve29ve9mfixUxJ0p4qeKWtty+ODUnHWVHhqGlT4aGJaQi8M0B72fGcd5bbkVGlzuJYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:33:43.082067Z"},"content_sha256":"cbde5844ee280508386cc609eb90a8f1e6464bcf483c72db7eb0f9b5c232cd4e","schema_version":"1.0","event_id":"sha256:cbde5844ee280508386cc609eb90a8f1e6464bcf483c72db7eb0f9b5c232cd4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J6HJ7OD46EX7QBVZRYMM7MTQ53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate resilience, monotonicity, and the complexity of agnostic learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.LG","authors_text":"Andrew Wan, Dana Dachman-Soled, Karl Wimmer, Li-Yang Tan, Vitaly Feldman","submitted_at":"2014-05-21T00:06:02Z","abstract_excerpt":"A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\\mathit{approximate}$ $\\mathit{resilience}$ of Boolean functions, where we say that $f$ is $\\alpha$-approximately $d$-resilient if $f$ is $\\alpha$-close to a $[-1,1]$-valued $d$-resilient function in $\\ell_1$ distance. We show that approximate resilience essentially characterizes the complexity of agnostic learning of a concept class $C$ over the uniform distribution. Roughly speaking, if all functions in a class $C$ are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5268","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHZkW0WNbxzU4YLq9+zS0tvvtAW/XAFFH7jBF9oyQYbmpBln53oMIXHASD2Q13ukH6Nm2dXtJI19vAK9QwNxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:33:43.082535Z"},"content_sha256":"9c71856b9f38911ba175290d7461a82d16278efbcab8081188f267369d9b6878","schema_version":"1.0","event_id":"sha256:9c71856b9f38911ba175290d7461a82d16278efbcab8081188f267369d9b6878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/bundle.json","state_url":"https://pith.science/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/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-05-27T07:33:43Z","links":{"resolver":"https://pith.science/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53","bundle":"https://pith.science/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/bundle.json","state":"https://pith.science/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6HJ7OD46EX7QBVZRYMM7MTQ53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J6HJ7OD46EX7QBVZRYMM7MTQ53","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":"a397812f53cc6890c72ec8a92edea787c1ae2f8c16aac523820c11d36b078adb","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-21T00:06:02Z","title_canon_sha256":"0a425c1eb0aeefaa3f525855c0db5da84cbede8c41aafa4917078a966975ee90"},"schema_version":"1.0","source":{"id":"1405.5268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5268","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5268v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5268","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"J6HJ7OD46EX7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6HJ7OD46EX7QBVZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6HJ7OD4","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9c71856b9f38911ba175290d7461a82d16278efbcab8081188f267369d9b6878","target":"graph","created_at":"2026-05-18T02:48:02Z","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":"A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\\mathit{approximate}$ $\\mathit{resilience}$ of Boolean functions, where we say that $f$ is $\\alpha$-approximately $d$-resilient if $f$ is $\\alpha$-close to a $[-1,1]$-valued $d$-resilient function in $\\ell_1$ distance. We show that approximate resilience essentially characterizes the complexity of agnostic learning of a concept class $C$ over the uniform distribution. Roughly speaking, if all functions in a class $C$ are","authors_text":"Andrew Wan, Dana Dachman-Soled, Karl Wimmer, Li-Yang Tan, Vitaly Feldman","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-21T00:06:02Z","title":"Approximate resilience, monotonicity, and the complexity of agnostic learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5268","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:cbde5844ee280508386cc609eb90a8f1e6464bcf483c72db7eb0f9b5c232cd4e","target":"record","created_at":"2026-05-18T02:48:02Z","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":"a397812f53cc6890c72ec8a92edea787c1ae2f8c16aac523820c11d36b078adb","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-21T00:06:02Z","title_canon_sha256":"0a425c1eb0aeefaa3f525855c0db5da84cbede8c41aafa4917078a966975ee90"},"schema_version":"1.0","source":{"id":"1405.5268","kind":"arxiv","version":2}},"canonical_sha256":"4f8e9fb87cf12ff806b98e18cfb270eeec182b9a1d554d521fe7f82ea5887566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f8e9fb87cf12ff806b98e18cfb270eeec182b9a1d554d521fe7f82ea5887566","first_computed_at":"2026-05-18T02:48:02.000864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.000864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaL/EBTe0hBhTtfa92PyoW6FNvpgilF0ffslXqQWgeEg68K0hCKIdQzosG/Pd+Rv9z/jRcwA0ScT+Y1isnH1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.001311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbde5844ee280508386cc609eb90a8f1e6464bcf483c72db7eb0f9b5c232cd4e","sha256:9c71856b9f38911ba175290d7461a82d16278efbcab8081188f267369d9b6878"],"state_sha256":"252562691a6406a691b601f3570fec6152d72a1ed45dbb81578dfa073faf98d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbjUcb/Mlwx6gqrvDKfP/mU/ZTc1SBK2bZ6g5ffHpt1tMew54SlCvAvJpu8HZiRXknk2AWtV+03t0+fLEs6gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:33:43.086029Z","bundle_sha256":"b5e3f881c5cfdbdf27fab50c48f7303ba85f5fee163b39961e5d09ff0465c273"}}