{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H5HJ5NV7WO22HVNAPDBWRFIXPZ","short_pith_number":"pith:H5HJ5NV7","canonical_record":{"source":{"id":"1711.03783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"72d3df14c529d22e027bdcc1875a72318688d24e600c9a053a9163c63116ffdf","abstract_canon_sha256":"1b1f6f7071995d977d377aea69e6feb3e837ad7f5f2a43deba8cdb422dd514ca"},"schema_version":"1.0"},"canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","source":{"kind":"arxiv","id":"1711.03783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03783","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03783v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03783","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"H5HJ5NV7WO22","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5HJ5NV7WO22HVNA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5HJ5NV7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H5HJ5NV7WO22HVNAPDBWRFIXPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"72d3df14c529d22e027bdcc1875a72318688d24e600c9a053a9163c63116ffdf","abstract_canon_sha256":"1b1f6f7071995d977d377aea69e6feb3e837ad7f5f2a43deba8cdb422dd514ca"},"schema_version":"1.0"},"canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.474960Z","signature_b64":"9zoa2+FRYiGuPIEgdJYwc1jDPGPokwc7Ydb1JJbzf+p2hGhYqzR530J8UmJ9vOUK+rhYm4IZjH7sj/kzoQcNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","last_reissued_at":"2026-05-18T00:30:51.474380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.474380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03783","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-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ginbg6mFW/ar8e5MRkl+Gp2JZVjvrAmTkhCybDVHUTEpXbdOftjys8wMw9PADMeym+ACb6zJMcE6nh2Ukl4JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:18:21.627774Z"},"content_sha256":"0f2579964c2f28c7ce7f1d013e570c164935a60ef34dfad15a1ac3331737c42b","schema_version":"1.0","event_id":"sha256:0f2579964c2f28c7ce7f1d013e570c164935a60ef34dfad15a1ac3331737c42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H5HJ5NV7WO22HVNAPDBWRFIXPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Duan Li, Yun-Bin Zhao","submitted_at":"2017-11-10T11:53:27Z","abstract_excerpt":"Dantzig selector (DS) and LASSO problems have attracted plenty of attention in statistical learning, sparse data recovery and mathematical optimization. In this paper, we provide a theoretical analysis of the sparse recovery stability of these optimization problems in more general settings and from a new perspective. We establish recovery error bounds for these optimization problems under a mild assumption called weak range space property of a transposed design matrix. This assumption is less restrictive than the well known sparse recovery conditions such as restricted isometry property (RIP),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03783","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-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GGzUbFpkzmUuzuG4V38/0WNDcEGeerDa2tbjTSvWlD03e2UWaztht8uvuHfyEoo2YSjgtTjNU1L9UxYJlHyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:18:21.628176Z"},"content_sha256":"673db34b0b38cdd7175488eb6048788f45b543e0e7173c2be80e8066e75799e9","schema_version":"1.0","event_id":"sha256:673db34b0b38cdd7175488eb6048788f45b543e0e7173c2be80e8066e75799e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/bundle.json","state_url":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/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-24T23:18:21Z","links":{"resolver":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ","bundle":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/bundle.json","state":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H5HJ5NV7WO22HVNAPDBWRFIXPZ","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":"1b1f6f7071995d977d377aea69e6feb3e837ad7f5f2a43deba8cdb422dd514ca","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","title_canon_sha256":"72d3df14c529d22e027bdcc1875a72318688d24e600c9a053a9163c63116ffdf"},"schema_version":"1.0","source":{"id":"1711.03783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03783","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03783v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03783","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"H5HJ5NV7WO22","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5HJ5NV7WO22HVNA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5HJ5NV7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:673db34b0b38cdd7175488eb6048788f45b543e0e7173c2be80e8066e75799e9","target":"graph","created_at":"2026-05-18T00:30:51Z","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":"Dantzig selector (DS) and LASSO problems have attracted plenty of attention in statistical learning, sparse data recovery and mathematical optimization. In this paper, we provide a theoretical analysis of the sparse recovery stability of these optimization problems in more general settings and from a new perspective. We establish recovery error bounds for these optimization problems under a mild assumption called weak range space property of a transposed design matrix. This assumption is less restrictive than the well known sparse recovery conditions such as restricted isometry property (RIP),","authors_text":"Duan Li, Yun-Bin Zhao","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","title":"A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03783","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:0f2579964c2f28c7ce7f1d013e570c164935a60ef34dfad15a1ac3331737c42b","target":"record","created_at":"2026-05-18T00:30:51Z","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":"1b1f6f7071995d977d377aea69e6feb3e837ad7f5f2a43deba8cdb422dd514ca","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","title_canon_sha256":"72d3df14c529d22e027bdcc1875a72318688d24e600c9a053a9163c63116ffdf"},"schema_version":"1.0","source":{"id":"1711.03783","kind":"arxiv","version":1}},"canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","first_computed_at":"2026-05-18T00:30:51.474380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:51.474380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9zoa2+FRYiGuPIEgdJYwc1jDPGPokwc7Ydb1JJbzf+p2hGhYqzR530J8UmJ9vOUK+rhYm4IZjH7sj/kzoQcNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:51.474960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2579964c2f28c7ce7f1d013e570c164935a60ef34dfad15a1ac3331737c42b","sha256:673db34b0b38cdd7175488eb6048788f45b543e0e7173c2be80e8066e75799e9"],"state_sha256":"e697ade1466090a179a3d1d3dd63053609d33e800f32f4b87cb97fdc7e441a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPHr60XUnurz7HM2JNyplnraD5uEDGrQBD5RXKjXyLQpjbABNWBEAJa9JlkHcdF9XjFN2ziqOVpcLaK+ybdzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:18:21.631622Z","bundle_sha256":"0ff90796bffc7dbc9816f89aa5c6c61c1815d97710a860a53ff5b5d304357ad7"}}