{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YGDO3SKLFAFUKY6HBF6ERGPYYH","short_pith_number":"pith:YGDO3SKL","schema_version":"1.0","canonical_sha256":"c186edc94b280b4563c7097c4899f8c1f9a63fa4b4d7f4b527cbb0e6aae80d42","source":{"kind":"arxiv","id":"1901.03707","version":2},"attestation_state":"computed","paper":{"title":"Neumann Networks for Inverse Problems in Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Davis Gilton, Greg Ongie, Rebecca Willett","submitted_at":"2019-01-13T17:44:22Z","abstract_excerpt":"Many challenging image processing tasks can be described by an ill-posed linear inverse problem: deblurring, deconvolution, inpainting, compressed sensing, and superresolution all lie in this framework. Traditional inverse problem solvers minimize a cost function consisting of a data-fit term, which measures how well an image matches the observations, and a regularizer, which reflects prior knowledge and promotes images with desirable properties like smoothness. Recent advances in machine learning and image processing have illustrated that it is often possible to learn a regularizer from train"},"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":"1901.03707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-13T17:44:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3b100ca85ad013ca646345f75fe0b1ef6fc8db93e4176ac5e732fbb56d8b2ae1","abstract_canon_sha256":"dc456e217155133c01221bf2e407de16fe242f72cc8bc8d56e8ad8a6c0ca666c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.852414Z","signature_b64":"O2GbrcrXMqHypXeBkiHpaWfDv/bW3eB86SaJVZSb8ZlVL0i0RpcTsr5UzIcJHgEaQZrwyBFWMwAmz4OLvvrTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c186edc94b280b4563c7097c4899f8c1f9a63fa4b4d7f4b527cbb0e6aae80d42","last_reissued_at":"2026-05-17T23:44:21.851706Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.851706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neumann Networks for Inverse Problems in Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Davis Gilton, Greg Ongie, Rebecca Willett","submitted_at":"2019-01-13T17:44:22Z","abstract_excerpt":"Many challenging image processing tasks can be described by an ill-posed linear inverse problem: deblurring, deconvolution, inpainting, compressed sensing, and superresolution all lie in this framework. Traditional inverse problem solvers minimize a cost function consisting of a data-fit term, which measures how well an image matches the observations, and a regularizer, which reflects prior knowledge and promotes images with desirable properties like smoothness. Recent advances in machine learning and image processing have illustrated that it is often possible to learn a regularizer from train"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03707","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.03707","created_at":"2026-05-17T23:44:21.851822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03707v2","created_at":"2026-05-17T23:44:21.851822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03707","created_at":"2026-05-17T23:44:21.851822+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGDO3SKLFAFU","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGDO3SKLFAFUKY6H","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGDO3SKL","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04608","citing_title":"Comprehensive Examination of Unrolled Networks for Solving Linear Inverse Problems","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH","json":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH.json","graph_json":"https://pith.science/api/pith-number/YGDO3SKLFAFUKY6HBF6ERGPYYH/graph.json","events_json":"https://pith.science/api/pith-number/YGDO3SKLFAFUKY6HBF6ERGPYYH/events.json","paper":"https://pith.science/paper/YGDO3SKL"},"agent_actions":{"view_html":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH","download_json":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH.json","view_paper":"https://pith.science/paper/YGDO3SKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03707&json=true","fetch_graph":"https://pith.science/api/pith-number/YGDO3SKLFAFUKY6HBF6ERGPYYH/graph.json","fetch_events":"https://pith.science/api/pith-number/YGDO3SKLFAFUKY6HBF6ERGPYYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH/action/storage_attestation","attest_author":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH/action/author_attestation","sign_citation":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH/action/citation_signature","submit_replication":"https://pith.science/pith/YGDO3SKLFAFUKY6HBF6ERGPYYH/action/replication_record"}},"created_at":"2026-05-17T23:44:21.851822+00:00","updated_at":"2026-05-17T23:44:21.851822+00:00"}