{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DLWD6EO673BT3CIZLYJ2CHUTIA","short_pith_number":"pith:DLWD6EO6","canonical_record":{"source":{"id":"1005.5582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-31T04:20:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e2e47e1a8357fc655fe46d8a11e0264f7d334542e58c17793311c5cbadde6728","abstract_canon_sha256":"09f2bc1dc43e8a60eeaff03e5c4fa9ebb458c8b5aeeb5be025d884ccbd82b00a"},"schema_version":"1.0"},"canonical_sha256":"1aec3f11defec33d89195e13a11e93402f1fecffbadcb6a56e731991e65c8f66","source":{"kind":"arxiv","id":"1005.5582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5582","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5582v2","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5582","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"DLWD6EO673BT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DLWD6EO673BT3CIZ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DLWD6EO6","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DLWD6EO673BT3CIZLYJ2CHUTIA","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-31T04:20:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e2e47e1a8357fc655fe46d8a11e0264f7d334542e58c17793311c5cbadde6728","abstract_canon_sha256":"09f2bc1dc43e8a60eeaff03e5c4fa9ebb458c8b5aeeb5be025d884ccbd82b00a"},"schema_version":"1.0"},"canonical_sha256":"1aec3f11defec33d89195e13a11e93402f1fecffbadcb6a56e731991e65c8f66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:45.150298Z","signature_b64":"tjDj73agtsUmXN4cQzjBxv0K/gV4MBHwFJCFyRVVxdnPnmnU9Y4a/0l8/rrrxTo41KK92HY/DuOfCS2THv33CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aec3f11defec33d89195e13a11e93402f1fecffbadcb6a56e731991e65c8f66","last_reissued_at":"2026-05-18T04:14:45.149900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:45.149900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5582","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-18T04:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaEGzBjo3XAb4Bq/Z1fImbF9tmc/WOJPyh+oNKbJxBSCDiE8W/uRnOMJYr9cZr7Uw6wlGssTbM5o8F6/TkVsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:26:30.780114Z"},"content_sha256":"b1e24cfc9afef68837f05b0de1226c03371b7c86ddacaad862f6ea9644cd3e8a","schema_version":"1.0","event_id":"sha256:b1e24cfc9afef68837f05b0de1226c03371b7c86ddacaad862f6ea9644cd3e8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DLWD6EO673BT3CIZLYJ2CHUTIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A First-order Augmented Lagrangian Method for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat","submitted_at":"2010-05-31T04:20:49Z","abstract_excerpt":"We propose a first-order augmented Lagrangian algorithm (FAL) for solving the basis pursuit problem. FAL computes a solution to this problem by inexactly solving a sequence of L1-regularized least squares sub-problems. These sub-problems are solved using an infinite memory proximal gradient algorithm wherein each update reduces to \"shrinkage\" or constrained \"shrinkage\". We show that FAL converges to an optimal solution of the basis pursuit problem whenever the solution is unique, which is the case with very high probability for compressed sensing problems. We construct a parameter sequence suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5582","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-18T04:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUfFEMY1Wh0sHUecETwmL2d+NJx3rERQsyRGLrD3pFV4FCzkrFgxCEv/aXWamD2eYSfKit7H9OU84ULDfqXpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:26:30.780504Z"},"content_sha256":"c2ab03c73e77d6aab4875d65dc4639f1fbbfa099778c4095d5825dd2a433767d","schema_version":"1.0","event_id":"sha256:c2ab03c73e77d6aab4875d65dc4639f1fbbfa099778c4095d5825dd2a433767d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/bundle.json","state_url":"https://pith.science/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/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-21T23:26:30Z","links":{"resolver":"https://pith.science/pith/DLWD6EO673BT3CIZLYJ2CHUTIA","bundle":"https://pith.science/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/bundle.json","state":"https://pith.science/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLWD6EO673BT3CIZLYJ2CHUTIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DLWD6EO673BT3CIZLYJ2CHUTIA","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":"09f2bc1dc43e8a60eeaff03e5c4fa9ebb458c8b5aeeb5be025d884ccbd82b00a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-31T04:20:49Z","title_canon_sha256":"e2e47e1a8357fc655fe46d8a11e0264f7d334542e58c17793311c5cbadde6728"},"schema_version":"1.0","source":{"id":"1005.5582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5582","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5582v2","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5582","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"DLWD6EO673BT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DLWD6EO673BT3CIZ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DLWD6EO6","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:c2ab03c73e77d6aab4875d65dc4639f1fbbfa099778c4095d5825dd2a433767d","target":"graph","created_at":"2026-05-18T04:14:45Z","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 propose a first-order augmented Lagrangian algorithm (FAL) for solving the basis pursuit problem. FAL computes a solution to this problem by inexactly solving a sequence of L1-regularized least squares sub-problems. These sub-problems are solved using an infinite memory proximal gradient algorithm wherein each update reduces to \"shrinkage\" or constrained \"shrinkage\". We show that FAL converges to an optimal solution of the basis pursuit problem whenever the solution is unique, which is the case with very high probability for compressed sensing problems. We construct a parameter sequence suc","authors_text":"Garud Iyengar, Necdet Serhat Aybat","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-31T04:20:49Z","title":"A First-order Augmented Lagrangian Method for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5582","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:b1e24cfc9afef68837f05b0de1226c03371b7c86ddacaad862f6ea9644cd3e8a","target":"record","created_at":"2026-05-18T04:14:45Z","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":"09f2bc1dc43e8a60eeaff03e5c4fa9ebb458c8b5aeeb5be025d884ccbd82b00a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-31T04:20:49Z","title_canon_sha256":"e2e47e1a8357fc655fe46d8a11e0264f7d334542e58c17793311c5cbadde6728"},"schema_version":"1.0","source":{"id":"1005.5582","kind":"arxiv","version":2}},"canonical_sha256":"1aec3f11defec33d89195e13a11e93402f1fecffbadcb6a56e731991e65c8f66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aec3f11defec33d89195e13a11e93402f1fecffbadcb6a56e731991e65c8f66","first_computed_at":"2026-05-18T04:14:45.149900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:45.149900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tjDj73agtsUmXN4cQzjBxv0K/gV4MBHwFJCFyRVVxdnPnmnU9Y4a/0l8/rrrxTo41KK92HY/DuOfCS2THv33CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:45.150298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1e24cfc9afef68837f05b0de1226c03371b7c86ddacaad862f6ea9644cd3e8a","sha256:c2ab03c73e77d6aab4875d65dc4639f1fbbfa099778c4095d5825dd2a433767d"],"state_sha256":"53576ec5752beab75c20f5da050d5fb34ddd06e8694d761212c9472b43105f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXVjZZtthAcStXMsdrgJ15wIRKiTVWJwJAoymbv+JHCvKmA1v6yb6VS3FNg3bfjdF7fyefFw+6d+aGpFhvbIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:26:30.783027Z","bundle_sha256":"87f186d2230df73677f320738a261bc119dca19bdeed9f87fe0df0772867be61"}}