{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6QSXNJ32CUF2YASH74KF5IWVBU","short_pith_number":"pith:6QSXNJ32","canonical_record":{"source":{"id":"1301.1272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-07T17:27:50Z","cross_cats_sorted":["math.CA","math.OC"],"title_canon_sha256":"fd8a529ae1d818eb145cfc75a06583baf28972a6f53348d9fdcd282a86f5b817","abstract_canon_sha256":"4d492b072a5fe42cdfde196e7699af9f98c995528f8f5af31213ebd7f7ab2b35"},"schema_version":"1.0"},"canonical_sha256":"f42576a77a150bac0247ff145ea2d50d1862d3f9fb1867d49bf5fa2e24ae0779","source":{"kind":"arxiv","id":"1301.1272","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1272","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1272v2","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1272","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"6QSXNJ32CUF2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6QSXNJ32CUF2YASH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6QSXNJ32","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6QSXNJ32CUF2YASH74KF5IWVBU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-07T17:27:50Z","cross_cats_sorted":["math.CA","math.OC"],"title_canon_sha256":"fd8a529ae1d818eb145cfc75a06583baf28972a6f53348d9fdcd282a86f5b817","abstract_canon_sha256":"4d492b072a5fe42cdfde196e7699af9f98c995528f8f5af31213ebd7f7ab2b35"},"schema_version":"1.0"},"canonical_sha256":"f42576a77a150bac0247ff145ea2d50d1862d3f9fb1867d49bf5fa2e24ae0779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:52.580494Z","signature_b64":"kP6I0AxviVxvLOwilyT840ZqHIBJ5y2YseLVK/IK7u+YgTVeV+l9Gc6SsIhLTgLwnTdVlMHsGNp1N8thgk6QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f42576a77a150bac0247ff145ea2d50d1862d3f9fb1867d49bf5fa2e24ae0779","last_reissued_at":"2026-05-18T00:45:52.579859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:52.579859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1272","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-18T00:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBG5FKNIueDOVxTFJBUJLF3h52u40zX7rDiPWytp6vH/2aS8dtkZ8O4FM7laGjOL7KBy/7MdsSRkKOe8TRg4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:18.664733Z"},"content_sha256":"3bb18d979f5681688852bc9ac5a21663b7a7f925a0ff2be735dc1f7462717bee","schema_version":"1.0","event_id":"sha256:3bb18d979f5681688852bc9ac5a21663b7a7f925a0ff2be735dc1f7462717bee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6QSXNJ32CUF2YASH74KF5IWVBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Speed of a Dynamical System for Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.OC"],"primary_cat":"math.DS","authors_text":"Aur\\`ele Balavoine, Christopher J. Rozell, Justin Romberg","submitted_at":"2013-01-07T17:27:50Z","abstract_excerpt":"This paper studies the convergence rate of a continuous-time dynamical system for L1-minimization, known as the Locally Competitive Algorithm (LCA). Solving L1-minimization} problems efficiently and rapidly is of great interest to the signal processing community, as these programs have been shown to recover sparse solutions to underdetermined systems of linear equations and come with strong performance guarantees. The LCA under study differs from the typical L1 solver in that it operates in continuous time: instead of being specified by discrete iterations, it evolves according to a system of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1272","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-18T00:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUcl0AB6YGB6O7E+4XM1OQW8TphU/Kl1DXuunRMJLrEFdX8DXLwLeqpELbGSEPR5eCCX/p+IzZu+UBRrmYwjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:18.665087Z"},"content_sha256":"a5dd1d412d002a6cba14d5b84a19773b0944e48a1760a66592a41d88325f37ab","schema_version":"1.0","event_id":"sha256:a5dd1d412d002a6cba14d5b84a19773b0944e48a1760a66592a41d88325f37ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QSXNJ32CUF2YASH74KF5IWVBU/bundle.json","state_url":"https://pith.science/pith/6QSXNJ32CUF2YASH74KF5IWVBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QSXNJ32CUF2YASH74KF5IWVBU/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-27T09:27:18Z","links":{"resolver":"https://pith.science/pith/6QSXNJ32CUF2YASH74KF5IWVBU","bundle":"https://pith.science/pith/6QSXNJ32CUF2YASH74KF5IWVBU/bundle.json","state":"https://pith.science/pith/6QSXNJ32CUF2YASH74KF5IWVBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QSXNJ32CUF2YASH74KF5IWVBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6QSXNJ32CUF2YASH74KF5IWVBU","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":"4d492b072a5fe42cdfde196e7699af9f98c995528f8f5af31213ebd7f7ab2b35","cross_cats_sorted":["math.CA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-07T17:27:50Z","title_canon_sha256":"fd8a529ae1d818eb145cfc75a06583baf28972a6f53348d9fdcd282a86f5b817"},"schema_version":"1.0","source":{"id":"1301.1272","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1272","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1272v2","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1272","created_at":"2026-05-18T00:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"6QSXNJ32CUF2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6QSXNJ32CUF2YASH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6QSXNJ32","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:a5dd1d412d002a6cba14d5b84a19773b0944e48a1760a66592a41d88325f37ab","target":"graph","created_at":"2026-05-18T00:45:52Z","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":"This paper studies the convergence rate of a continuous-time dynamical system for L1-minimization, known as the Locally Competitive Algorithm (LCA). Solving L1-minimization} problems efficiently and rapidly is of great interest to the signal processing community, as these programs have been shown to recover sparse solutions to underdetermined systems of linear equations and come with strong performance guarantees. The LCA under study differs from the typical L1 solver in that it operates in continuous time: instead of being specified by discrete iterations, it evolves according to a system of ","authors_text":"Aur\\`ele Balavoine, Christopher J. Rozell, Justin Romberg","cross_cats":["math.CA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-07T17:27:50Z","title":"Convergence Speed of a Dynamical System for Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1272","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:3bb18d979f5681688852bc9ac5a21663b7a7f925a0ff2be735dc1f7462717bee","target":"record","created_at":"2026-05-18T00:45:52Z","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":"4d492b072a5fe42cdfde196e7699af9f98c995528f8f5af31213ebd7f7ab2b35","cross_cats_sorted":["math.CA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-07T17:27:50Z","title_canon_sha256":"fd8a529ae1d818eb145cfc75a06583baf28972a6f53348d9fdcd282a86f5b817"},"schema_version":"1.0","source":{"id":"1301.1272","kind":"arxiv","version":2}},"canonical_sha256":"f42576a77a150bac0247ff145ea2d50d1862d3f9fb1867d49bf5fa2e24ae0779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f42576a77a150bac0247ff145ea2d50d1862d3f9fb1867d49bf5fa2e24ae0779","first_computed_at":"2026-05-18T00:45:52.579859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:52.579859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kP6I0AxviVxvLOwilyT840ZqHIBJ5y2YseLVK/IK7u+YgTVeV+l9Gc6SsIhLTgLwnTdVlMHsGNp1N8thgk6QBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:52.580494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1272","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb18d979f5681688852bc9ac5a21663b7a7f925a0ff2be735dc1f7462717bee","sha256:a5dd1d412d002a6cba14d5b84a19773b0944e48a1760a66592a41d88325f37ab"],"state_sha256":"c18a0d3502a66c64e5a5a501402b983d7627385527fcf3a60adba2bb1f3b6936"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9llJA2EcRue8FAMMLe9mGIKxapGsTB/G3fCMwgSK6RiZAgysqVK8cVWs8QkJS1SAgApy/SpXJlC8CDyhukoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:27:18.667512Z","bundle_sha256":"fba933b1dac2bd28b28bf2ea1093c9016e504280b9b0e2addd1cc8bf2061aabd"}}