{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LDOCC3K2ICXVZ7HUX63X5R7HUU","short_pith_number":"pith:LDOCC3K2","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"},"canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","source":{"kind":"arxiv","id":"0903.1443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1443","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1443v2","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1443","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"LDOCC3K2ICXV","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LDOCC3K2ICXVZ7HU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LDOCC3K2","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LDOCC3K2ICXVZ7HUX63X5R7HUU","target":"record","payload":{"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"},"canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","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"},"source_kind":"arxiv","source_id":"0903.1443","source_version":2,"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:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic6e1aqM2bamsT4hXenCwKbpnmFOMbVrnQV71vUCEDrIp9BEtqHjv9RDh6+fAqKYFJDwWXpr7CJzlWVG1F5/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:40.515430Z"},"content_sha256":"633da138d497371becedee10e55e19cb55208ee2e1120ed436e5722ee0d89ba4","schema_version":"1.0","event_id":"sha256:633da138d497371becedee10e55e19cb55208ee2e1120ed436e5722ee0d89ba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LDOCC3K2ICXVZ7HUX63X5R7HUU","target":"graph","payload":{"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"},"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:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAQF9BX6Np3YOEpQWYkI6W3AwlY1gT9QOoRU5tpbMZ7uB32cFMX+cye6wJGSUTe+QK3tq5PFfRTISG7j1LoOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:40.515869Z"},"content_sha256":"7612de72ba3262b1ef4fb99093b44d40e48201e772dbf4b273d9a4e6b52dd71f","schema_version":"1.0","event_id":"sha256:7612de72ba3262b1ef4fb99093b44d40e48201e772dbf4b273d9a4e6b52dd71f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/bundle.json","state_url":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/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-27T19:19:40Z","links":{"resolver":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU","bundle":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/bundle.json","state":"https://pith.science/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDOCC3K2ICXVZ7HUX63X5R7HUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LDOCC3K2ICXVZ7HUX63X5R7HUU","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":"dea71af5869c9f05d6dcd4c18e2bf0dbd815334884193e2940a6198b0f4885a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T19:27:28Z","title_canon_sha256":"122bc0a78efec4a8c99d130e155edbfb09eed60108b0f8f6b3559fdbb26746aa"},"schema_version":"1.0","source":{"id":"0903.1443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1443","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1443v2","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1443","created_at":"2026-05-18T02:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"LDOCC3K2ICXV","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LDOCC3K2ICXVZ7HU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LDOCC3K2","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:7612de72ba3262b1ef4fb99093b44d40e48201e772dbf4b273d9a4e6b52dd71f","target":"graph","created_at":"2026-05-18T02:14:36Z","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":"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 \"","authors_text":"Justin Romberg, Muhammad Salman Asif","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T19:27:28Z","title":"Dynamic Updating for L1 Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1443","kind":"arxiv","version":2},"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:633da138d497371becedee10e55e19cb55208ee2e1120ed436e5722ee0d89ba4","target":"record","created_at":"2026-05-18T02:14:36Z","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":"dea71af5869c9f05d6dcd4c18e2bf0dbd815334884193e2940a6198b0f4885a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T19:27:28Z","title_canon_sha256":"122bc0a78efec4a8c99d130e155edbfb09eed60108b0f8f6b3559fdbb26746aa"},"schema_version":"1.0","source":{"id":"0903.1443","kind":"arxiv","version":2}},"canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58dc216d5a40af5cfcf4bfb77ec7e7a53f30d49255a2e491001235e43d4bebdc","first_computed_at":"2026-05-18T02:14:36.616408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:36.616408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XMd2BkmnO1QdtkLa/ZEenk8QuuFjJEI15p2uNTSgJFZIz04rwZ0kx3A6zSvOsFl45kmkXFq/MGAOv1wTRIQmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:36.617075Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.1443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633da138d497371becedee10e55e19cb55208ee2e1120ed436e5722ee0d89ba4","sha256:7612de72ba3262b1ef4fb99093b44d40e48201e772dbf4b273d9a4e6b52dd71f"],"state_sha256":"fa192ab7078ded72f8aba2d907ceca83e4b9aca36f9072d653eb4f022585315e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ao4t+lA+IsB/j11+D2OoAq3E+cysTAJJzkPSd7uKfwTGUd7B8fLipzwEiFjozsOwazb0FxFKGFxvp2IjNMEQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:40.519432Z","bundle_sha256":"969c240308b336372911e1a10561fac11368b3084893517f121173fb893eacda"}}