{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:4KT5ARRG5TVVTJIMOEZUR66XFC","short_pith_number":"pith:4KT5ARRG","schema_version":"1.0","canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","source":{"kind":"arxiv","id":"0909.3947","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for the Constrained Formulation of Compressive Image Reconstruction and Other Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jose M. Bioucas-Dias, Manya V. Afonso, Mario A. T. Figueiredo","submitted_at":"2009-09-22T10:03:01Z","abstract_excerpt":"Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is minimized under the constraint that the solution explains the observations sufficiently well. The regularizer and constraint are usually convex; however, several particular features of these problems (huge dimensionality, non-smoothness) preclude the use of off-the-shelf optimization tools and have stimulated much research. In this paper, we propose a new e"},"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":"0909.3947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"fbe184a108bcd24633dac10b2145e97fe2ec0c5654e9462036971d1204937451","abstract_canon_sha256":"7cceef4ffdf3a48f1b7c469e8e074468c0919c564b91829f14f68f98a5e00e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.239186Z","signature_b64":"Mul33eCpQNBNd4rfQbsM7A5EWlzMCPXvxW7AkJw3FbGAsKW1OwF7l38Gog5vhjAgXRD539dEK99pVKyQKAhNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","last_reissued_at":"2026-05-18T00:59:11.238458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.238458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for the Constrained Formulation of Compressive Image Reconstruction and Other Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jose M. Bioucas-Dias, Manya V. Afonso, Mario A. T. Figueiredo","submitted_at":"2009-09-22T10:03:01Z","abstract_excerpt":"Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is minimized under the constraint that the solution explains the observations sufficiently well. The regularizer and constraint are usually convex; however, several particular features of these problems (huge dimensionality, non-smoothness) preclude the use of off-the-shelf optimization tools and have stimulated much research. In this paper, we propose a new e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.3947","kind":"arxiv","version":1},"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":"0909.3947","created_at":"2026-05-18T00:59:11.238610+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.3947v1","created_at":"2026-05-18T00:59:11.238610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.3947","created_at":"2026-05-18T00:59:11.238610+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KT5ARRG5TVV","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KT5ARRG5TVVTJIM","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KT5ARRG","created_at":"2026-05-18T12:25:58.837520+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/4KT5ARRG5TVVTJIMOEZUR66XFC","json":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC.json","graph_json":"https://pith.science/api/pith-number/4KT5ARRG5TVVTJIMOEZUR66XFC/graph.json","events_json":"https://pith.science/api/pith-number/4KT5ARRG5TVVTJIMOEZUR66XFC/events.json","paper":"https://pith.science/paper/4KT5ARRG"},"agent_actions":{"view_html":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC","download_json":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC.json","view_paper":"https://pith.science/paper/4KT5ARRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.3947&json=true","fetch_graph":"https://pith.science/api/pith-number/4KT5ARRG5TVVTJIMOEZUR66XFC/graph.json","fetch_events":"https://pith.science/api/pith-number/4KT5ARRG5TVVTJIMOEZUR66XFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/action/storage_attestation","attest_author":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/action/author_attestation","sign_citation":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/action/citation_signature","submit_replication":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/action/replication_record"}},"created_at":"2026-05-18T00:59:11.238610+00:00","updated_at":"2026-05-18T00:59:11.238610+00:00"}