{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:S5GKD2J55K3YSNY5JBMFDWLS6B","short_pith_number":"pith:S5GKD2J5","canonical_record":{"source":{"id":"2007.15220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-30T04:18:51Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"9874546c08e21b3aa998250bbf977e0ee9de75773eab5392d303786117c70b65","abstract_canon_sha256":"56f7d9e70acdebc4d6e228116a2a9b3b4ed266d78e85b90934e173660a29d54a"},"schema_version":"1.0"},"canonical_sha256":"974ca1e93deab789371d485851d972f07d09250cb8cdb936cbdb3b2e2f424dcf","source":{"kind":"arxiv","id":"2007.15220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15220","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15220v1","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15220","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"S5GKD2J55K3Y","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"S5GKD2J55K3YSNY5","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"S5GKD2J5","created_at":"2026-07-05T01:23:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:S5GKD2J55K3YSNY5JBMFDWLS6B","target":"record","payload":{"canonical_record":{"source":{"id":"2007.15220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-30T04:18:51Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"9874546c08e21b3aa998250bbf977e0ee9de75773eab5392d303786117c70b65","abstract_canon_sha256":"56f7d9e70acdebc4d6e228116a2a9b3b4ed266d78e85b90934e173660a29d54a"},"schema_version":"1.0"},"canonical_sha256":"974ca1e93deab789371d485851d972f07d09250cb8cdb936cbdb3b2e2f424dcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:28.506603Z","signature_b64":"tVqvfrhW0Kkq53N94kvBSxYZaJy61wsF5l5LO3Hb+qc4SIfOGBIZWTfd6CbLJNuxXOTufF508P0pgaGo1nDzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974ca1e93deab789371d485851d972f07d09250cb8cdb936cbdb3b2e2f424dcf","last_reissued_at":"2026-07-05T01:23:28.506167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:28.506167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.15220","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-07-05T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NazbAiWRCbHG4/8HCHe4dO0bGlZqk0T+pfR9nRUTYYREpqZaEMqEXUHWcZTdv0WOZX/ohqmY4zySlRmThtreCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:08:13.966814Z"},"content_sha256":"7110d236b7cce537ffcee42b388734ae789b01d08ebfe2a84e11a0c42af4f7ed","schema_version":"1.0","event_id":"sha256:7110d236b7cce537ffcee42b388734ae789b01d08ebfe2a84e11a0c42af4f7ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:S5GKD2J55K3YSNY5JBMFDWLS6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Pasin Manurangsi","submitted_at":"2020-07-30T04:18:51Z","abstract_excerpt":"We study the computational complexity of adversarially robust proper learning of halfspaces in the distribution-independent agnostic PAC model, with a focus on $L_p$ perturbations. We give a computationally efficient learning algorithm and a nearly matching computational hardness result for this problem. An interesting implication of our findings is that the $L_{\\infty}$ perturbations case is provably computationally harder than the case $2 \\leq p < \\infty$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15220","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/2007.15220/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"},"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-07-05T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uMsyl9r5BCagYl1J1A19cwiU26Q4Dcv53pBn6vIs2LVcOZhn8LzkV3BWxg69ECiPzMtQVpD0sO7bt1orCGwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:08:13.967189Z"},"content_sha256":"372a3ce414d8bf8dac13da8a6cfe71d54bd56bd1d608998b71ddae941eee4bd2","schema_version":"1.0","event_id":"sha256:372a3ce414d8bf8dac13da8a6cfe71d54bd56bd1d608998b71ddae941eee4bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/bundle.json","state_url":"https://pith.science/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/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-07-05T09:08:13Z","links":{"resolver":"https://pith.science/pith/S5GKD2J55K3YSNY5JBMFDWLS6B","bundle":"https://pith.science/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/bundle.json","state":"https://pith.science/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5GKD2J55K3YSNY5JBMFDWLS6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:S5GKD2J55K3YSNY5JBMFDWLS6B","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":"56f7d9e70acdebc4d6e228116a2a9b3b4ed266d78e85b90934e173660a29d54a","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-30T04:18:51Z","title_canon_sha256":"9874546c08e21b3aa998250bbf977e0ee9de75773eab5392d303786117c70b65"},"schema_version":"1.0","source":{"id":"2007.15220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15220","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15220v1","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15220","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"S5GKD2J55K3Y","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"S5GKD2J55K3YSNY5","created_at":"2026-07-05T01:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"S5GKD2J5","created_at":"2026-07-05T01:23:28Z"}],"graph_snapshots":[{"event_id":"sha256:372a3ce414d8bf8dac13da8a6cfe71d54bd56bd1d608998b71ddae941eee4bd2","target":"graph","created_at":"2026-07-05T01:23:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.15220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computational complexity of adversarially robust proper learning of halfspaces in the distribution-independent agnostic PAC model, with a focus on $L_p$ perturbations. We give a computationally efficient learning algorithm and a nearly matching computational hardness result for this problem. An interesting implication of our findings is that the $L_{\\infty}$ perturbations case is provably computationally harder than the case $2 \\leq p < \\infty$.","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Pasin Manurangsi","cross_cats":["cs.CC","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-30T04:18:51Z","title":"The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15220","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:7110d236b7cce537ffcee42b388734ae789b01d08ebfe2a84e11a0c42af4f7ed","target":"record","created_at":"2026-07-05T01:23:28Z","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":"56f7d9e70acdebc4d6e228116a2a9b3b4ed266d78e85b90934e173660a29d54a","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-30T04:18:51Z","title_canon_sha256":"9874546c08e21b3aa998250bbf977e0ee9de75773eab5392d303786117c70b65"},"schema_version":"1.0","source":{"id":"2007.15220","kind":"arxiv","version":1}},"canonical_sha256":"974ca1e93deab789371d485851d972f07d09250cb8cdb936cbdb3b2e2f424dcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"974ca1e93deab789371d485851d972f07d09250cb8cdb936cbdb3b2e2f424dcf","first_computed_at":"2026-07-05T01:23:28.506167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:28.506167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVqvfrhW0Kkq53N94kvBSxYZaJy61wsF5l5LO3Hb+qc4SIfOGBIZWTfd6CbLJNuxXOTufF508P0pgaGo1nDzAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:28.506603Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.15220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7110d236b7cce537ffcee42b388734ae789b01d08ebfe2a84e11a0c42af4f7ed","sha256:372a3ce414d8bf8dac13da8a6cfe71d54bd56bd1d608998b71ddae941eee4bd2"],"state_sha256":"f5d5b9c99f396a58cc9ca134db51a15afab0b5390131c298d3fc98b3e06576ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+CMQTCJO9yBp/cTCyDpgLSwmCLUNYEfhQKqXMbhexuCQ4Q/+rZiia0DZjqo99uXykwziXLw/PshAAowNjQdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:08:13.969152Z","bundle_sha256":"933092c29fa3e1a4a9db60c849db0f4a410800a758507c302cc258def0b0e43a"}}