{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:72FIQ27W2GYLG3MAIX5EO4CQOD","short_pith_number":"pith:72FIQ27W","canonical_record":{"source":{"id":"1805.11643","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T18:33:23Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"6b9c9b6aea7647e2321b5627ad504fa98f447445fbce411f7a3a6a849f61bbc7","abstract_canon_sha256":"224441446354ed936187114d688297c90398bc987835b8bd72429f3d2be63277"},"schema_version":"1.0"},"canonical_sha256":"fe8a886bf6d1b0b36d8045fa47705070ebd326e420f7d783161f2c0756004299","source":{"kind":"arxiv","id":"1805.11643","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11643","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11643v3","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11643","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"72FIQ27W2GYL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72FIQ27W2GYLG3MA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72FIQ27W","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:72FIQ27W2GYLG3MAIX5EO4CQOD","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11643","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T18:33:23Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"6b9c9b6aea7647e2321b5627ad504fa98f447445fbce411f7a3a6a849f61bbc7","abstract_canon_sha256":"224441446354ed936187114d688297c90398bc987835b8bd72429f3d2be63277"},"schema_version":"1.0"},"canonical_sha256":"fe8a886bf6d1b0b36d8045fa47705070ebd326e420f7d783161f2c0756004299","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.250816Z","signature_b64":"7IsLjQF4DiN2Ibzp6MDbg6jwT9DPWZHkGodpBS/k+IXB9nJFRxCd8EunAvB3hlSuaos/b3Lcop0PbwWWoWhRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8a886bf6d1b0b36d8045fa47705070ebd326e420f7d783161f2c0756004299","last_reissued_at":"2026-05-17T23:44:43.250274Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.250274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11643","source_version":3,"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:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cic0eLHv6uCv5RXSl9B/BmfYrpAZQNkI7/69MX3IzZJnb+L1QImEIFF7y7O8PuHWXH1uBpqvG20Bh0NlqxtnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:02:19.213197Z"},"content_sha256":"4e7927256a87983dc4feb8cad7df66355b1268a34b3481c2e041fb4efe7667c5","schema_version":"1.0","event_id":"sha256:4e7927256a87983dc4feb8cad7df66355b1268a34b3481c2e041fb4efe7667c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:72FIQ27W2GYLG3MAIX5EO4CQOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Dimensional Robust Sparse Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Constantine Caramanis, Liu Liu, Tianyang Li, Yanyao Shen","submitted_at":"2018-05-29T18:33:23Z","abstract_excerpt":"We provide a novel -- and to the best of our knowledge, the first -- algorithm for high dimensional sparse regression with constant fraction of corruptions in explanatory and/or response variables. Our algorithm recovers the true sparse parameters with sub-linear sample complexity, in the presence of a constant fraction of arbitrary corruptions. Our main contribution is a robust variant of Iterative Hard Thresholding. Using this, we provide accurate estimators: when the covariance matrix in sparse regression is identity, our error guarantee is near information-theoretically optimal. We then de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11643","kind":"arxiv","version":3},"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:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGnGJAxMzysTIf638M3NEDEYtqVWIX3c859cahcTGbqX6ST084eBhxIZNlDNxrEypB0EHk8NncUqXMz+Gn9CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:02:19.213835Z"},"content_sha256":"17ee8ae5b732aaeb092bf2e31174de246256b8166be177ff3bdcc088fa368574","schema_version":"1.0","event_id":"sha256:17ee8ae5b732aaeb092bf2e31174de246256b8166be177ff3bdcc088fa368574"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/bundle.json","state_url":"https://pith.science/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/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-25T17:02:19Z","links":{"resolver":"https://pith.science/pith/72FIQ27W2GYLG3MAIX5EO4CQOD","bundle":"https://pith.science/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/bundle.json","state":"https://pith.science/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72FIQ27W2GYLG3MAIX5EO4CQOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:72FIQ27W2GYLG3MAIX5EO4CQOD","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":"224441446354ed936187114d688297c90398bc987835b8bd72429f3d2be63277","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T18:33:23Z","title_canon_sha256":"6b9c9b6aea7647e2321b5627ad504fa98f447445fbce411f7a3a6a849f61bbc7"},"schema_version":"1.0","source":{"id":"1805.11643","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11643","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11643v3","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11643","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"72FIQ27W2GYL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72FIQ27W2GYLG3MA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72FIQ27W","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:17ee8ae5b732aaeb092bf2e31174de246256b8166be177ff3bdcc088fa368574","target":"graph","created_at":"2026-05-17T23:44:43Z","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":"We provide a novel -- and to the best of our knowledge, the first -- algorithm for high dimensional sparse regression with constant fraction of corruptions in explanatory and/or response variables. Our algorithm recovers the true sparse parameters with sub-linear sample complexity, in the presence of a constant fraction of arbitrary corruptions. Our main contribution is a robust variant of Iterative Hard Thresholding. Using this, we provide accurate estimators: when the covariance matrix in sparse regression is identity, our error guarantee is near information-theoretically optimal. We then de","authors_text":"Constantine Caramanis, Liu Liu, Tianyang Li, Yanyao Shen","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T18:33:23Z","title":"High Dimensional Robust Sparse Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11643","kind":"arxiv","version":3},"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:4e7927256a87983dc4feb8cad7df66355b1268a34b3481c2e041fb4efe7667c5","target":"record","created_at":"2026-05-17T23:44:43Z","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":"224441446354ed936187114d688297c90398bc987835b8bd72429f3d2be63277","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T18:33:23Z","title_canon_sha256":"6b9c9b6aea7647e2321b5627ad504fa98f447445fbce411f7a3a6a849f61bbc7"},"schema_version":"1.0","source":{"id":"1805.11643","kind":"arxiv","version":3}},"canonical_sha256":"fe8a886bf6d1b0b36d8045fa47705070ebd326e420f7d783161f2c0756004299","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe8a886bf6d1b0b36d8045fa47705070ebd326e420f7d783161f2c0756004299","first_computed_at":"2026-05-17T23:44:43.250274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:43.250274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7IsLjQF4DiN2Ibzp6MDbg6jwT9DPWZHkGodpBS/k+IXB9nJFRxCd8EunAvB3hlSuaos/b3Lcop0PbwWWoWhRBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:43.250816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11643","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e7927256a87983dc4feb8cad7df66355b1268a34b3481c2e041fb4efe7667c5","sha256:17ee8ae5b732aaeb092bf2e31174de246256b8166be177ff3bdcc088fa368574"],"state_sha256":"75abbb8302d69b3308061c8f2f1f0651338e48975842729d767764b45debc80a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRM606+HHNzBsqI+nmbE1bDx2BrlfhEoFFEUaXGjPqBTocehUhhr7r/SrVja5eq422fiOfYSOR9SWHgc79gyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:02:19.217632Z","bundle_sha256":"d0fa014642f8e689248a7856aa923ac8569619378fbb1075db00a2385da5c074"}}