{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OG7SM6GT7BFQXFLXNZOBOGJHPK","short_pith_number":"pith:OG7SM6GT","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"},"canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","source":{"kind":"arxiv","id":"2212.09088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09088","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09088v1","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09088","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"OG7SM6GT7BFQ","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"OG7SM6GT7BFQXFLX","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"OG7SM6GT","created_at":"2026-07-05T05:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OG7SM6GT7BFQXFLXNZOBOGJHPK","target":"record","payload":{"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"},"canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","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"},"source_kind":"arxiv","source_id":"2212.09088","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvLAZmn5Bp2//da9S9pCvdhadw6fwGbzbcZlbGZ7DluwVsEGyrvpxZVV72I+jpEOZ1SXgFSxCuK+cOLzTewnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:56:55.589855Z"},"content_sha256":"d22698d579218a9c29c6e451c08c34cf32b56502a75a69ef2d34c8e8add68a86","schema_version":"1.0","event_id":"sha256:d22698d579218a9c29c6e451c08c34cf32b56502a75a69ef2d34c8e8add68a86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OG7SM6GT7BFQXFLXNZOBOGJHPK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zromiR4eGJHGHt6e5wz9YEGb+sOC331KP10TH9jZ9B/tYToDkG+ZZh825zvFEng7SZlZvsGlrHNLJlaR/sKhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:56:55.590221Z"},"content_sha256":"dd9da26e864ba34abf8108ee9085c5c4b4ffff3d5be6a2cd0a1cc9597cf60a05","schema_version":"1.0","event_id":"sha256:dd9da26e864ba34abf8108ee9085c5c4b4ffff3d5be6a2cd0a1cc9597cf60a05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/bundle.json","state_url":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T11:56:55Z","links":{"resolver":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK","bundle":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/bundle.json","state":"https://pith.science/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG7SM6GT7BFQXFLXNZOBOGJHPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OG7SM6GT7BFQXFLXNZOBOGJHPK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6ce70c3bcf4ef26c63b6ea571b2e03d99e7e96e08d36962ab11cf7fff7ce6ed3","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-18T13:54:11Z","title_canon_sha256":"fef35dadd0f2f0c2801598017ce3d6ff136b3d51d9b2d683799c42bf30f09a7a"},"schema_version":"1.0","source":{"id":"2212.09088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09088","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09088v1","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09088","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"OG7SM6GT7BFQ","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"OG7SM6GT7BFQXFLX","created_at":"2026-07-05T05:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"OG7SM6GT","created_at":"2026-07-05T05:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:dd9da26e864ba34abf8108ee9085c5c4b4ffff3d5be6a2cd0a1cc9597cf60a05","target":"graph","created_at":"2026-07-05T05:26:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.09088/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christian Igel, Fabian Gieseke, Lei Li, Stefan Oehmcke, Tianfang Zhang, Zhenming Peng","cross_cats":["eess.IV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-18T13:54:11Z","title":"LR-CSNet: Low-Rank Deep Unfolding Network for Image Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09088","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d22698d579218a9c29c6e451c08c34cf32b56502a75a69ef2d34c8e8add68a86","target":"record","created_at":"2026-07-05T05:26:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6ce70c3bcf4ef26c63b6ea571b2e03d99e7e96e08d36962ab11cf7fff7ce6ed3","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-18T13:54:11Z","title_canon_sha256":"fef35dadd0f2f0c2801598017ce3d6ff136b3d51d9b2d683799c42bf30f09a7a"},"schema_version":"1.0","source":{"id":"2212.09088","kind":"arxiv","version":1}},"canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71bf2678d3f84b0b95776e5c1719277aa2f9437521608105d3be349ca2bd7bde","first_computed_at":"2026-07-05T05:26:18.035397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:26:18.035397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ROUCMqYrReDGol7H0IL8O2mkqcV1YgZ+SkS62JCewBJ6Rsst9WFCvh9CTfXXUMi1GN0OO4sUu9lkLep5TgDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:26:18.035803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.09088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d22698d579218a9c29c6e451c08c34cf32b56502a75a69ef2d34c8e8add68a86","sha256:dd9da26e864ba34abf8108ee9085c5c4b4ffff3d5be6a2cd0a1cc9597cf60a05"],"state_sha256":"69a233cad3e3e95f6b88fae049c5fc2356f1873cdb3eb1fbab84628cab7adc5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KN54agqNRcdCKH+FX/IzYRTVA0yIqzXkrELfiQf8+N+zk6550zuZruDm0XDEjgcRMG5ePT2QrXUOeLOTOjREAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:56:55.592143Z","bundle_sha256":"6e6d291307d4f80b658c99748170efbd3dbbbef83d296894a4a089251eaad97c"}}