{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OUPSVZIO5RQH7UHHCDP6DGMH3R","short_pith_number":"pith:OUPSVZIO","schema_version":"1.0","canonical_sha256":"751f2ae50eec607fd0e710dfe19987dc6635f63a56d419be014cf80286161ed2","source":{"kind":"arxiv","id":"2104.12939","version":1},"attestation_state":"computed","paper":{"title":"Provably Convergent Learned Inexact Descent Algorithm for Low-Dose CT Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Mehrdad Alvandipour, Qingchao Zhang, Wenjun Xia, Xiaojing Ye, Yi Zhang, Yunmei Chen","submitted_at":"2021-04-27T02:02:41Z","abstract_excerpt":"We propose a provably convergent method, called Efficient Learned Descent Algorithm (ELDA), for low-dose CT (LDCT) reconstruction. ELDA is a highly interpretable neural network architecture with learned parameters and meanwhile retains convergence guarantee as classical optimization algorithms. To improve reconstruction quality, the proposed ELDA also employs a new non-local feature mapping and an associated regularizer. We compare ELDA with several state-of-the-art deep image methods, such as RED-CNN and Learned Primal-Dual, on a set of LDCT reconstruction problems. Numerical experiments demo"},"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":"2104.12939","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.IV","submitted_at":"2021-04-27T02:02:41Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"e859b1f1b60911babb153b95101d02dd16e1448ec9d46091919f9515802d93a5","abstract_canon_sha256":"9f73fb8ea876a9da270f5d5115ab6aa0ea113d2c6319413bed2ab15b12e42bc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:04.511965Z","signature_b64":"2SR8ojv48OSVX2pb0GPWH1W5/VZFOhoSGmojXdTsTlBvWW28cjLJQRegdXyIpTNJI4EpAxESC6ibGwcyE37zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751f2ae50eec607fd0e710dfe19987dc6635f63a56d419be014cf80286161ed2","last_reissued_at":"2026-07-05T02:35:04.511565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:04.511565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Convergent Learned Inexact Descent Algorithm for Low-Dose CT Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Mehrdad Alvandipour, Qingchao Zhang, Wenjun Xia, Xiaojing Ye, Yi Zhang, Yunmei Chen","submitted_at":"2021-04-27T02:02:41Z","abstract_excerpt":"We propose a provably convergent method, called Efficient Learned Descent Algorithm (ELDA), for low-dose CT (LDCT) reconstruction. ELDA is a highly interpretable neural network architecture with learned parameters and meanwhile retains convergence guarantee as classical optimization algorithms. To improve reconstruction quality, the proposed ELDA also employs a new non-local feature mapping and an associated regularizer. We compare ELDA with several state-of-the-art deep image methods, such as RED-CNN and Learned Primal-Dual, on a set of LDCT reconstruction problems. Numerical experiments demo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12939","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.12939/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.12939","created_at":"2026-07-05T02:35:04.511627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12939v1","created_at":"2026-07-05T02:35:04.511627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12939","created_at":"2026-07-05T02:35:04.511627+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUPSVZIO5RQH","created_at":"2026-07-05T02:35:04.511627+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUPSVZIO5RQH7UHH","created_at":"2026-07-05T02:35:04.511627+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUPSVZIO","created_at":"2026-07-05T02:35:04.511627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02143","citing_title":"SafeAug: Safety-Critical Driving Data Augmentation from Naturalistic Datasets","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R","json":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R.json","graph_json":"https://pith.science/api/pith-number/OUPSVZIO5RQH7UHHCDP6DGMH3R/graph.json","events_json":"https://pith.science/api/pith-number/OUPSVZIO5RQH7UHHCDP6DGMH3R/events.json","paper":"https://pith.science/paper/OUPSVZIO"},"agent_actions":{"view_html":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R","download_json":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R.json","view_paper":"https://pith.science/paper/OUPSVZIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12939&json=true","fetch_graph":"https://pith.science/api/pith-number/OUPSVZIO5RQH7UHHCDP6DGMH3R/graph.json","fetch_events":"https://pith.science/api/pith-number/OUPSVZIO5RQH7UHHCDP6DGMH3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R/action/storage_attestation","attest_author":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R/action/author_attestation","sign_citation":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R/action/citation_signature","submit_replication":"https://pith.science/pith/OUPSVZIO5RQH7UHHCDP6DGMH3R/action/replication_record"}},"created_at":"2026-07-05T02:35:04.511627+00:00","updated_at":"2026-07-05T02:35:04.511627+00:00"}