{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:U5PHGFP25IM5MHW77W4AAEULXU","short_pith_number":"pith:U5PHGFP2","canonical_record":{"source":{"id":"2305.06199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-05-10T14:31:03Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"50105ea8063d130356d83b28f348bb7020fbef8fdbdf9b1f3bb7d3347b7af4e8","abstract_canon_sha256":"3003130d3e5c50ca62abdef1aaff1105817286a2d1fe7139fc46f51132d2ae5a"},"schema_version":"1.0"},"canonical_sha256":"a75e7315faea19d61edffdb800128bbd2ac00ec3e578c1b1cfc3fb87631b970f","source":{"kind":"arxiv","id":"2305.06199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.06199","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2305.06199v1","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06199","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"U5PHGFP25IM5","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_16","alias_value":"U5PHGFP25IM5MHW7","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_8","alias_value":"U5PHGFP2","created_at":"2026-07-05T06:09:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:U5PHGFP25IM5MHW77W4AAEULXU","target":"record","payload":{"canonical_record":{"source":{"id":"2305.06199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-05-10T14:31:03Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"50105ea8063d130356d83b28f348bb7020fbef8fdbdf9b1f3bb7d3347b7af4e8","abstract_canon_sha256":"3003130d3e5c50ca62abdef1aaff1105817286a2d1fe7139fc46f51132d2ae5a"},"schema_version":"1.0"},"canonical_sha256":"a75e7315faea19d61edffdb800128bbd2ac00ec3e578c1b1cfc3fb87631b970f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:00.614596Z","signature_b64":"28B4q5gGYB+e+Ka1tV3TVJ1cihFZ7onqPP1dryVsdc/QYI+bMfkjgEXrcCuNLHJ/NDuT+Gv+DTDbiRtFOjITCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75e7315faea19d61edffdb800128bbd2ac00ec3e578c1b1cfc3fb87631b970f","last_reissued_at":"2026-07-05T06:09:00.614003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:00.614003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.06199","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-05T06:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9O/e4n9DC8TN9mVbN2DgzQdI0DVgamZfhAcmJyvCck6SgGSnKRFf4MaPddjfFh9ZQ9GYi0CpT1RyB09rOY9aAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:12:19.421282Z"},"content_sha256":"afab0fb90700f2174ea5b67fe638f5cb358e68301379ee21f41b5511ccd2009b","schema_version":"1.0","event_id":"sha256:afab0fb90700f2174ea5b67fe638f5cb358e68301379ee21f41b5511ccd2009b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:U5PHGFP25IM5MHW77W4AAEULXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dong Xia, Jian-Feng Cai, Jingyang Li, Yinan Shen","submitted_at":"2023-05-10T14:31:03Z","abstract_excerpt":"High-dimensional linear regression under heavy-tailed noise or outlier corruption is challenging, both computationally and statistically. Convex approaches have been proven statistically optimal but suffer from high computational costs, especially since the robust loss functions are usually non-smooth. More recently, computationally fast non-convex approaches via sub-gradient descent are proposed, which, unfortunately, fail to deliver a statistically consistent estimator even under sub-Gaussian noise. In this paper, we introduce a projected sub-gradient descent algorithm for both the sparse li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06199","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/2305.06199/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-05T06:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjIrgNG8SkfkO9tYJ7Fwys4Sk409xCb2n+hCd0zD4eBrie4y0ES3suSjUx/3MOVXpwD7xLVXzkq2HOEHycKQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:12:19.421803Z"},"content_sha256":"2771aed7085c874fe7d205e3f8fdf7971ef0ac389b96f2577c47d8ef2f9c0290","schema_version":"1.0","event_id":"sha256:2771aed7085c874fe7d205e3f8fdf7971ef0ac389b96f2577c47d8ef2f9c0290"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5PHGFP25IM5MHW77W4AAEULXU/bundle.json","state_url":"https://pith.science/pith/U5PHGFP25IM5MHW77W4AAEULXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5PHGFP25IM5MHW77W4AAEULXU/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-08-05T06:12:19Z","links":{"resolver":"https://pith.science/pith/U5PHGFP25IM5MHW77W4AAEULXU","bundle":"https://pith.science/pith/U5PHGFP25IM5MHW77W4AAEULXU/bundle.json","state":"https://pith.science/pith/U5PHGFP25IM5MHW77W4AAEULXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5PHGFP25IM5MHW77W4AAEULXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:U5PHGFP25IM5MHW77W4AAEULXU","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":"3003130d3e5c50ca62abdef1aaff1105817286a2d1fe7139fc46f51132d2ae5a","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-05-10T14:31:03Z","title_canon_sha256":"50105ea8063d130356d83b28f348bb7020fbef8fdbdf9b1f3bb7d3347b7af4e8"},"schema_version":"1.0","source":{"id":"2305.06199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.06199","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2305.06199v1","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06199","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"U5PHGFP25IM5","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_16","alias_value":"U5PHGFP25IM5MHW7","created_at":"2026-07-05T06:09:00Z"},{"alias_kind":"pith_short_8","alias_value":"U5PHGFP2","created_at":"2026-07-05T06:09:00Z"}],"graph_snapshots":[{"event_id":"sha256:2771aed7085c874fe7d205e3f8fdf7971ef0ac389b96f2577c47d8ef2f9c0290","target":"graph","created_at":"2026-07-05T06:09:00Z","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/2305.06199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-dimensional linear regression under heavy-tailed noise or outlier corruption is challenging, both computationally and statistically. Convex approaches have been proven statistically optimal but suffer from high computational costs, especially since the robust loss functions are usually non-smooth. More recently, computationally fast non-convex approaches via sub-gradient descent are proposed, which, unfortunately, fail to deliver a statistically consistent estimator even under sub-Gaussian noise. In this paper, we introduce a projected sub-gradient descent algorithm for both the sparse li","authors_text":"Dong Xia, Jian-Feng Cai, Jingyang Li, Yinan Shen","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-05-10T14:31:03Z","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06199","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:afab0fb90700f2174ea5b67fe638f5cb358e68301379ee21f41b5511ccd2009b","target":"record","created_at":"2026-07-05T06:09:00Z","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":"3003130d3e5c50ca62abdef1aaff1105817286a2d1fe7139fc46f51132d2ae5a","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-05-10T14:31:03Z","title_canon_sha256":"50105ea8063d130356d83b28f348bb7020fbef8fdbdf9b1f3bb7d3347b7af4e8"},"schema_version":"1.0","source":{"id":"2305.06199","kind":"arxiv","version":1}},"canonical_sha256":"a75e7315faea19d61edffdb800128bbd2ac00ec3e578c1b1cfc3fb87631b970f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a75e7315faea19d61edffdb800128bbd2ac00ec3e578c1b1cfc3fb87631b970f","first_computed_at":"2026-07-05T06:09:00.614003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:00.614003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"28B4q5gGYB+e+Ka1tV3TVJ1cihFZ7onqPP1dryVsdc/QYI+bMfkjgEXrcCuNLHJ/NDuT+Gv+DTDbiRtFOjITCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:00.614596Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.06199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afab0fb90700f2174ea5b67fe638f5cb358e68301379ee21f41b5511ccd2009b","sha256:2771aed7085c874fe7d205e3f8fdf7971ef0ac389b96f2577c47d8ef2f9c0290"],"state_sha256":"86763d8451d805bc64762b8087f646eb0430f2d3b5a615399cabd579b0e000ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nl86XT4tMTpJuYyLgP09kyvJ1zQd85BFa6xI7GeXmGHe9iydo2lLlYVoZXbjfNotYUzScbdPn1RSoTpmQmjOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:12:19.431898Z","bundle_sha256":"1857fb65a8c044f55e027c331e1609e44698add2228f81710f71b76d9210aeae"}}