{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OJHYZJFQXNGFSZITNS3TLZ5FTK","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":"39878015d047a86ec47496d4f5bf1a5419dc678e1aaf02ceb1c6e3d7af0cf8a2","cross_cats_sorted":["cs.IR","cs.IT","eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-09T21:13:32Z","title_canon_sha256":"588359375ac2548a3e7ef700156fca7b21dc5f8c57145ba670aa0b3d7cb7d89d"},"schema_version":"1.0","source":{"id":"2303.05582","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.05582","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"2303.05582v3","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05582","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"OJHYZJFQXNGF","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_16","alias_value":"OJHYZJFQXNGFSZIT","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_8","alias_value":"OJHYZJFQ","created_at":"2026-07-05T11:18:56Z"}],"graph_snapshots":[{"event_id":"sha256:36e449be723bb2f654ca291c6a35db0b25091ec8443ae1d41ce66e38b68c8826","target":"graph","created_at":"2026-07-05T11:18:56Z","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/2303.05582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Unfolding networks have shown promising results in the Compressed Sensing (CS) field. Yet, the investigation of their generalization ability is still in its infancy. In this paper, we perform a generalization analysis of a state-of-the-art ADMM-based unfolding network, which jointly learns a decoder for CS and a sparsifying redundant analysis operator. To this end, we first impose a structural constraint on the learnable sparsifier, which parametrizes the network's hypothesis class. For the latter, we estimate its Rademacher complexity. With this estimate in hand, we deliver generalization err","authors_text":"Vicky Kouni, Yannis Panagakis","cross_cats":["cs.IR","cs.IT","eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-09T21:13:32Z","title":"Generalization analysis of an unfolding network for analysis-based Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05582","kind":"arxiv","version":3},"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:1573110e0ba99509dbad1fdae07bf9e873dbf0d655f0a7a7562f363fc647a217","target":"record","created_at":"2026-07-05T11:18:56Z","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":"39878015d047a86ec47496d4f5bf1a5419dc678e1aaf02ceb1c6e3d7af0cf8a2","cross_cats_sorted":["cs.IR","cs.IT","eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-09T21:13:32Z","title_canon_sha256":"588359375ac2548a3e7ef700156fca7b21dc5f8c57145ba670aa0b3d7cb7d89d"},"schema_version":"1.0","source":{"id":"2303.05582","kind":"arxiv","version":3}},"canonical_sha256":"724f8ca4b0bb4c5965136cb735e7a59ab49c407b1439a8768fe8fee39727da74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"724f8ca4b0bb4c5965136cb735e7a59ab49c407b1439a8768fe8fee39727da74","first_computed_at":"2026-07-05T11:18:56.587474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:56.587474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jOFSbFYw1C4pQLmf/0AhRWG8Pap1mbgyLQ7E8wpwKJMAkr7oZbt7qDUBjvj/Utuaez0gBNUwyRl0JEsPR6i4Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:56.587933Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.05582","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1573110e0ba99509dbad1fdae07bf9e873dbf0d655f0a7a7562f363fc647a217","sha256:36e449be723bb2f654ca291c6a35db0b25091ec8443ae1d41ce66e38b68c8826"],"state_sha256":"87c159832d2753785ca295694b93ae42d1d09a559ce6063a7ccfb3e6667e283c"}