{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OG7SM6GT7BFQXFLXNZOBOGJHPK","short_pith_number":"pith:OG7SM6GT","schema_version":"1.0","canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","source":{"kind":"arxiv","id":"2212.09088","version":1},"attestation_state":"computed","paper":{"title":"LR-CSNet: Low-Rank Deep Unfolding Network for Image Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Christian Igel, Fabian Gieseke, Lei Li, Stefan Oehmcke, Tianfang Zhang, Zhenming Peng","submitted_at":"2022-12-18T13:54:11Z","abstract_excerpt":"Deep unfolding networks (DUNs) have proven to be a viable approach to compressive sensing (CS). In this work, we propose a DUN called low-rank CS network (LR-CSNet) for natural image CS. Real-world image patches are often well-represented by low-rank approximations. LR-CSNet exploits this property by adding a low-rank prior to the CS optimization task. We derive a corresponding iterative optimization procedure using variable splitting, which is then translated to a new DUN architecture. The architecture uses low-rank generation modules (LRGMs), which learn low-rank matrix factorizations, as we"},"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":"2212.09088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-18T13:54:11Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"fef35dadd0f2f0c2801598017ce3d6ff136b3d51d9b2d683799c42bf30f09a7a","abstract_canon_sha256":"6ce70c3bcf4ef26c63b6ea571b2e03d99e7e96e08d36962ab11cf7fff7ce6ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:18.035803Z","signature_b64":"4ROUCMqYrReDGol7H0IL8O2mkqcV1YgZ+SkS62JCewBJ6Rsst9WFCvh9CTfXXUMi1GN0OO4sUu9lkLep5TgDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","last_reissued_at":"2026-07-05T05:26:18.035397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:18.035397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LR-CSNet: Low-Rank Deep Unfolding Network for Image Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Christian Igel, Fabian Gieseke, Lei Li, Stefan Oehmcke, Tianfang Zhang, Zhenming Peng","submitted_at":"2022-12-18T13:54:11Z","abstract_excerpt":"Deep unfolding networks (DUNs) have proven to be a viable approach to compressive sensing (CS). In this work, we propose a DUN called low-rank CS network (LR-CSNet) for natural image CS. Real-world image patches are often well-represented by low-rank approximations. LR-CSNet exploits this property by adding a low-rank prior to the CS optimization task. We derive a corresponding iterative optimization procedure using variable splitting, which is then translated to a new DUN architecture. The architecture uses low-rank generation modules (LRGMs), which learn low-rank matrix factorizations, as we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09088","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/2212.09088/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":"2212.09088","created_at":"2026-07-05T05:26:18.035458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09088v1","created_at":"2026-07-05T05:26:18.035458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09088","created_at":"2026-07-05T05:26:18.035458+00:00"},{"alias_kind":"pith_short_12","alias_value":"OG7SM6GT7BFQ","created_at":"2026-07-05T05:26:18.035458+00:00"},{"alias_kind":"pith_short_16","alias_value":"OG7SM6GT7BFQXFLX","created_at":"2026-07-05T05:26:18.035458+00:00"},{"alias_kind":"pith_short_8","alias_value":"OG7SM6GT","created_at":"2026-07-05T05:26:18.035458+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/OG7SM6GT7BFQXFLXNZOBOGJHPK","json":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK.json","graph_json":"https://pith.science/api/pith-number/OG7SM6GT7BFQXFLXNZOBOGJHPK/graph.json","events_json":"https://pith.science/api/pith-number/OG7SM6GT7BFQXFLXNZOBOGJHPK/events.json","paper":"https://pith.science/paper/OG7SM6GT"},"agent_actions":{"view_html":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK","download_json":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK.json","view_paper":"https://pith.science/paper/OG7SM6GT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09088&json=true","fetch_graph":"https://pith.science/api/pith-number/OG7SM6GT7BFQXFLXNZOBOGJHPK/graph.json","fetch_events":"https://pith.science/api/pith-number/OG7SM6GT7BFQXFLXNZOBOGJHPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/action/storage_attestation","attest_author":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/action/author_attestation","sign_citation":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/action/citation_signature","submit_replication":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/action/replication_record"}},"created_at":"2026-07-05T05:26:18.035458+00:00","updated_at":"2026-07-05T05:26:18.035458+00:00"}