{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L43S7AE7PLZWSG55ELCRVHBSWJ","short_pith_number":"pith:L43S7AE7","schema_version":"1.0","canonical_sha256":"5f372f809f7af3691bbd22c51a9c32b27f1a5c70015297ea3d7b6c4c795e2a23","source":{"kind":"arxiv","id":"1904.00423","version":1},"attestation_state":"computed","paper":{"title":"A Memory-efficient Algorithm for Large-scale Sparsity Regularized Image Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Greg Ongie, Jeffrey A. Fessler, Laura Balzano, Naveen Murthy","submitted_at":"2019-03-31T14:37:21Z","abstract_excerpt":"We derive a memory-efficient first-order variable splitting algorithm for convex image reconstruction problems with non-smooth regularization terms. The algorithm is based on a primal-dual approach, where one of the dual variables is updated using a step of the Frank-Wolfe algorithm, rather than the typical proximal point step used in other primal-dual algorithms. We show in certain cases this results in an algorithm with far less memory demand than other first-order methods based on proximal mappings. We demonstrate the algorithm on the problem of sparse-view X-ray computed tomography (CT) re"},"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":"1904.00423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-31T14:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"7ec8225da78adaf748da7cc3633d3c0065cc47cd971e0356f109e06c84479724","abstract_canon_sha256":"cc6601802cd94e11378278e73b461945075c82fa0a14f7e41c36d98196ce4fe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:48.439471Z","signature_b64":"TzueP5dknb5cB4ZNNRowwjol/pUTpBtzuBp4lxhjZglkdlAF91p/dQo+3dJzH+sNdnppfplDaxR5HjISjWeECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f372f809f7af3691bbd22c51a9c32b27f1a5c70015297ea3d7b6c4c795e2a23","last_reissued_at":"2026-05-17T23:49:48.438884Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:48.438884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Memory-efficient Algorithm for Large-scale Sparsity Regularized Image Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Greg Ongie, Jeffrey A. Fessler, Laura Balzano, Naveen Murthy","submitted_at":"2019-03-31T14:37:21Z","abstract_excerpt":"We derive a memory-efficient first-order variable splitting algorithm for convex image reconstruction problems with non-smooth regularization terms. The algorithm is based on a primal-dual approach, where one of the dual variables is updated using a step of the Frank-Wolfe algorithm, rather than the typical proximal point step used in other primal-dual algorithms. We show in certain cases this results in an algorithm with far less memory demand than other first-order methods based on proximal mappings. We demonstrate the algorithm on the problem of sparse-view X-ray computed tomography (CT) re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00423","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":"1904.00423","created_at":"2026-05-17T23:49:48.438978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00423v1","created_at":"2026-05-17T23:49:48.438978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00423","created_at":"2026-05-17T23:49:48.438978+00:00"},{"alias_kind":"pith_short_12","alias_value":"L43S7AE7PLZW","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L43S7AE7PLZWSG55","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L43S7AE7","created_at":"2026-05-18T12:33:21.387695+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/L43S7AE7PLZWSG55ELCRVHBSWJ","json":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ.json","graph_json":"https://pith.science/api/pith-number/L43S7AE7PLZWSG55ELCRVHBSWJ/graph.json","events_json":"https://pith.science/api/pith-number/L43S7AE7PLZWSG55ELCRVHBSWJ/events.json","paper":"https://pith.science/paper/L43S7AE7"},"agent_actions":{"view_html":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ","download_json":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ.json","view_paper":"https://pith.science/paper/L43S7AE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00423&json=true","fetch_graph":"https://pith.science/api/pith-number/L43S7AE7PLZWSG55ELCRVHBSWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/L43S7AE7PLZWSG55ELCRVHBSWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ/action/storage_attestation","attest_author":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ/action/author_attestation","sign_citation":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ/action/citation_signature","submit_replication":"https://pith.science/pith/L43S7AE7PLZWSG55ELCRVHBSWJ/action/replication_record"}},"created_at":"2026-05-17T23:49:48.438978+00:00","updated_at":"2026-05-17T23:49:48.438978+00:00"}