{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:LDOCC3K2ICXVZ7HUX63X5R7HUU","short_pith_number":"pith:LDOCC3K2","schema_version":"1.0","canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","source":{"kind":"arxiv","id":"0903.1443","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Updating for L1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Justin Romberg, Muhammad Salman Asif","submitted_at":"2009-03-09T19:27:28Z","abstract_excerpt":"The theory of compressive sensing (CS) suggests that under certain conditions, a sparse signal can be recovered from a small number of linear incoherent measurements. An effective class of reconstruction algorithms involve solving a convex optimization program that balances the L1 norm of the solution against a data fidelity term. Tremendous progress has been made in recent years on algorithms for solving these L1 minimization programs. These algorithms, however, are for the most part static: they focus on finding the solution for a fixed set of measurements.\n  In this paper, we will discuss \""},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0903.1443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T19:27:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"122bc0a78efec4a8c99d130e155edbfb09eed60108b0f8f6b3559fdbb26746aa","abstract_canon_sha256":"dea71af5869c9f05d6dcd4c18e2bf0dbd815334884193e2940a6198b0f4885a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:36.617075Z","signature_b64":"XMd2BkmnO1QdtkLa/ZEenk8QuuFjJEI15p2uNTSgJFZIz04rwZ0kx3A6zSvOsFl45kmkXFq/MGAOv1wTRIQmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","last_reissued_at":"2026-05-18T02:14:36.616408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:36.616408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Updating for L1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Justin Romberg, Muhammad Salman Asif","submitted_at":"2009-03-09T19:27:28Z","abstract_excerpt":"The theory of compressive sensing (CS) suggests that under certain conditions, a sparse signal can be recovered from a small number of linear incoherent measurements. An effective class of reconstruction algorithms involve solving a convex optimization program that balances the L1 norm of the solution against a data fidelity term. Tremendous progress has been made in recent years on algorithms for solving these L1 minimization programs. These algorithms, however, are for the most part static: they focus on finding the solution for a fixed set of measurements.\n  In this paper, we will discuss \""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1443","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0903.1443","created_at":"2026-05-18T02:14:36.616523+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1443v2","created_at":"2026-05-18T02:14:36.616523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1443","created_at":"2026-05-18T02:14:36.616523+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDOCC3K2ICXV","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDOCC3K2ICXVZ7HU","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDOCC3K2","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU","json":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU.json","graph_json":"https://pith.science/api/pith-number/LDOCC3K2ICXVZ7HUX63X5R7HUU/graph.json","events_json":"https://pith.science/api/pith-number/LDOCC3K2ICXVZ7HUX63X5R7HUU/events.json","paper":"https://pith.science/paper/LDOCC3K2"},"agent_actions":{"view_html":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU","download_json":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU.json","view_paper":"https://pith.science/paper/LDOCC3K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1443&json=true","fetch_graph":"https://pith.science/api/pith-number/LDOCC3K2ICXVZ7HUX63X5R7HUU/graph.json","fetch_events":"https://pith.science/api/pith-number/LDOCC3K2ICXVZ7HUX63X5R7HUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/action/storage_attestation","attest_author":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/action/author_attestation","sign_citation":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/action/citation_signature","submit_replication":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/action/replication_record"}},"created_at":"2026-05-18T02:14:36.616523+00:00","updated_at":"2026-05-18T02:14:36.616523+00:00"}