{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MPEHTRVHN4H5KJ46HCSBQQ7ZV5","short_pith_number":"pith:MPEHTRVH","canonical_record":{"source":{"id":"1303.7291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","cross_cats_sorted":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"title_canon_sha256":"5599b1cb86bdb2d742c88d05cdc8273daa3da8a3e4f9973a4f067e82eb90d58f","abstract_canon_sha256":"74bab4cb3629bc9b2938616789c6960bd1529c105e607c31e34f535dfdf4e02f"},"schema_version":"1.0"},"canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","source":{"kind":"arxiv","id":"1303.7291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7291","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7291v1","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7291","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"MPEHTRVHN4H5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPEHTRVHN4H5KJ46","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPEHTRVH","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MPEHTRVHN4H5KJ46HCSBQQ7ZV5","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","cross_cats_sorted":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"title_canon_sha256":"5599b1cb86bdb2d742c88d05cdc8273daa3da8a3e4f9973a4f067e82eb90d58f","abstract_canon_sha256":"74bab4cb3629bc9b2938616789c6960bd1529c105e607c31e34f535dfdf4e02f"},"schema_version":"1.0"},"canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:28.981363Z","signature_b64":"WDSjsv+T78Um5+GM5Vj+9mM//6s0OUV+V/qXpj4jih2EjcRfflTYKtDeS98+2txmVOfOcAIhMQocZiA3GzouAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","last_reissued_at":"2026-05-18T03:29:28.980713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:28.980713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7291","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-18T03:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0H/9ZW5yKq8VadZQ/OEHBNhN2u9tJVzjeHVeNQFC1R3S9e2PNpQ/w337so2Cg82jXMMO3qLaagHls9eJu/9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:10:34.368908Z"},"content_sha256":"cf5d2d7b475ec7ad6b8ad69df3065329058939675a5efe131490ab7189ae6b63","schema_version":"1.0","event_id":"sha256:cf5d2d7b475ec7ad6b8ad69df3065329058939675a5efe131490ab7189ae6b63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MPEHTRVHN4H5KJ46HCSBQQ7ZV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A framework to characterize performance of LASSO algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T03:55:09Z","abstract_excerpt":"In this paper we consider solving \\emph{noisy} under-determined systems of linear equations with sparse solutions. A noiseless equivalent attracted enormous attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol} where it was shown in a statistical and large dimensional context that a sparse unknown vector (of sparsity proportional to the length of the vector) can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} further established that even when the equations are \\emph{noisy}, one can, throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7291","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-18T03:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGYqxW9zaCVluqmDH6qjX6AZhQ7OYVbfv0GuLC+JqPGy6cF3iNOGyRKc8JvdiDi77AlDGhqP5IVXzoKeKpk3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:10:34.369576Z"},"content_sha256":"0ffef924ba98253e533b0710cb97503c7f6a93da09cc504fdfa19bbd5185860f","schema_version":"1.0","event_id":"sha256:0ffef924ba98253e533b0710cb97503c7f6a93da09cc504fdfa19bbd5185860f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/bundle.json","state_url":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/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-24T06:10:34Z","links":{"resolver":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5","bundle":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/bundle.json","state":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MPEHTRVHN4H5KJ46HCSBQQ7ZV5","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":"74bab4cb3629bc9b2938616789c6960bd1529c105e607c31e34f535dfdf4e02f","cross_cats_sorted":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","title_canon_sha256":"5599b1cb86bdb2d742c88d05cdc8273daa3da8a3e4f9973a4f067e82eb90d58f"},"schema_version":"1.0","source":{"id":"1303.7291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7291","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7291v1","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7291","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"MPEHTRVHN4H5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPEHTRVHN4H5KJ46","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPEHTRVH","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0ffef924ba98253e533b0710cb97503c7f6a93da09cc504fdfa19bbd5185860f","target":"graph","created_at":"2026-05-18T03:29: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"},"paper":{"abstract_excerpt":"In this paper we consider solving \\emph{noisy} under-determined systems of linear equations with sparse solutions. A noiseless equivalent attracted enormous attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol} where it was shown in a statistical and large dimensional context that a sparse unknown vector (of sparsity proportional to the length of the vector) can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} further established that even when the equations are \\emph{noisy}, one can, throug","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","title":"A framework to characterize performance of LASSO algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7291","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:cf5d2d7b475ec7ad6b8ad69df3065329058939675a5efe131490ab7189ae6b63","target":"record","created_at":"2026-05-18T03:29: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":"74bab4cb3629bc9b2938616789c6960bd1529c105e607c31e34f535dfdf4e02f","cross_cats_sorted":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","title_canon_sha256":"5599b1cb86bdb2d742c88d05cdc8273daa3da8a3e4f9973a4f067e82eb90d58f"},"schema_version":"1.0","source":{"id":"1303.7291","kind":"arxiv","version":1}},"canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","first_computed_at":"2026-05-18T03:29:28.980713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:28.980713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDSjsv+T78Um5+GM5Vj+9mM//6s0OUV+V/qXpj4jih2EjcRfflTYKtDeS98+2txmVOfOcAIhMQocZiA3GzouAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:28.981363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf5d2d7b475ec7ad6b8ad69df3065329058939675a5efe131490ab7189ae6b63","sha256:0ffef924ba98253e533b0710cb97503c7f6a93da09cc504fdfa19bbd5185860f"],"state_sha256":"6f9239f8fec6c4ac6731eefdd4b59d448a76bc50f87e5d26a21e2783989ac8ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RoSknE0MbJ4rDSK+YH5+HHb7S96CaZS2hkgba7DdiXxlY1BopqS1d/X0/HBI0lMVbudPK/PGenBe6P5Iaq1nAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:10:34.372997Z","bundle_sha256":"1529b8450be4faab7213681455ce2b647f7a353a7400d371f5206ce81f605dfa"}}