{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZA4TJ7FB5PMSSS7QNRCRTVU4KY","short_pith_number":"pith:ZA4TJ7FB","canonical_record":{"source":{"id":"1008.3651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","cross_cats_sorted":["cs.SY","math.OC","stat.TH"],"title_canon_sha256":"e98bb1eaeee226ccbbaca13a893847e8fa5218fbfca0029fa52f92308640e703","abstract_canon_sha256":"414174f0d0bb58160fcd98a371936750bf5617c2caf59df0d94a20879e59d0e1"},"schema_version":"1.0"},"canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","source":{"kind":"arxiv","id":"1008.3651","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3651","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3651v3","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3651","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4TJ7FB5PMS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4TJ7FB5PMSSS7Q","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4TJ7FB","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZA4TJ7FB5PMSSS7QNRCRTVU4KY","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","cross_cats_sorted":["cs.SY","math.OC","stat.TH"],"title_canon_sha256":"e98bb1eaeee226ccbbaca13a893847e8fa5218fbfca0029fa52f92308640e703","abstract_canon_sha256":"414174f0d0bb58160fcd98a371936750bf5617c2caf59df0d94a20879e59d0e1"},"schema_version":"1.0"},"canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:31.054148Z","signature_b64":"JfJHGE03nXOcCSF4a2d/xbSK4vf3TP3z3WehYop33odXMBRrRFPkqk2K+o6j8BG6K59osKYduNhY0kcFB7jZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","last_reissued_at":"2026-05-18T02:54:31.053534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:31.053534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3651","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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwqTHIOTZ5HKTCOTZNWSycqKqsyD+mLneU4cTXJ/agn2/UFCTrMaCdut+mQmMYYtvztCR1FXz58GZ9wObX3FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:31:51.237474Z"},"content_sha256":"5fd9532257b4ed49b744cc212b52762ffac77961330119929e25a8141a8fa297","schema_version":"1.0","event_id":"sha256:5fd9532257b4ed49b744cc212b52762ffac77961330119929e25a8141a8fa297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZA4TJ7FB5PMSSS7QNRCRTVU4KY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accuracy guarantees for L1-recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Anatoli Iouditski (LJK), Arkadii S. Nemirovski (ISyE)","submitted_at":"2010-08-21T18:32:03Z","abstract_excerpt":"We discuss two new methods of recovery of sparse signals from noisy observation based on $\\ell_1$- minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess better statistical properties than the commonly used ones. We also show how these techniques allow to provide efficiently computable accuracy bounds for Lasso and Dantzig Selector. We link our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3651","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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmXmQ0El2lfvXAzKxiLZfULAsOKVcqNeDJTCj6hCVMoxZ1yxgNvloGkfUxSrJsrefzt6SlkQkGjmgKqI+2mRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:31:51.238145Z"},"content_sha256":"076df3cceb866c06e1a16aa95a2fc59b2d1a40eebb8c51feb05cc5ed2a6b6b65","schema_version":"1.0","event_id":"sha256:076df3cceb866c06e1a16aa95a2fc59b2d1a40eebb8c51feb05cc5ed2a6b6b65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/bundle.json","state_url":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/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-28T18:31:51Z","links":{"resolver":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY","bundle":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/bundle.json","state":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZA4TJ7FB5PMSSS7QNRCRTVU4KY","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":"414174f0d0bb58160fcd98a371936750bf5617c2caf59df0d94a20879e59d0e1","cross_cats_sorted":["cs.SY","math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","title_canon_sha256":"e98bb1eaeee226ccbbaca13a893847e8fa5218fbfca0029fa52f92308640e703"},"schema_version":"1.0","source":{"id":"1008.3651","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3651","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3651v3","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3651","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4TJ7FB5PMS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4TJ7FB5PMSSS7Q","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4TJ7FB","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:076df3cceb866c06e1a16aa95a2fc59b2d1a40eebb8c51feb05cc5ed2a6b6b65","target":"graph","created_at":"2026-05-18T02:54:31Z","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 discuss two new methods of recovery of sparse signals from noisy observation based on $\\ell_1$- minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess better statistical properties than the commonly used ones. We also show how these techniques allow to provide efficiently computable accuracy bounds for Lasso and Dantzig Selector. We link our","authors_text":"Anatoli Iouditski (LJK), Arkadii S. Nemirovski (ISyE)","cross_cats":["cs.SY","math.OC","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","title":"Accuracy guarantees for L1-recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3651","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:5fd9532257b4ed49b744cc212b52762ffac77961330119929e25a8141a8fa297","target":"record","created_at":"2026-05-18T02:54:31Z","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":"414174f0d0bb58160fcd98a371936750bf5617c2caf59df0d94a20879e59d0e1","cross_cats_sorted":["cs.SY","math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","title_canon_sha256":"e98bb1eaeee226ccbbaca13a893847e8fa5218fbfca0029fa52f92308640e703"},"schema_version":"1.0","source":{"id":"1008.3651","kind":"arxiv","version":3}},"canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","first_computed_at":"2026-05-18T02:54:31.053534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:31.053534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JfJHGE03nXOcCSF4a2d/xbSK4vf3TP3z3WehYop33odXMBRrRFPkqk2K+o6j8BG6K59osKYduNhY0kcFB7jZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:31.054148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3651","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fd9532257b4ed49b744cc212b52762ffac77961330119929e25a8141a8fa297","sha256:076df3cceb866c06e1a16aa95a2fc59b2d1a40eebb8c51feb05cc5ed2a6b6b65"],"state_sha256":"8802dfb3f45dfb58e21fa87c4ec6d19f7f6129abf4b8bff0a8a4d34fda4cfb5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0KvENwqJpzcnoIq7v8uhAM2zK2yAx5+LGDqVsZeUy7R4jlDJq07+rBsuPOI1qR1LD9P/tN7fq+ErUg7zYGKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:31:51.241785Z","bundle_sha256":"d95152f9e96ef3b521b11a3a3f892521b8ee73dac6fdc06999ea1f7bf73e31d2"}}