{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5JHVLDYZZ6CSO5ECKRO3QTPYXF","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":"2acb8aba44661515caf06305acc018ae8c772236f4ce8f90612cf39d45b223dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-07T09:43:10Z","title_canon_sha256":"bd9922cf64630a0c4869d8dd507da7a5b50e3015916b6cffb012b50c2184c550"},"schema_version":"1.0","source":{"id":"1908.02503","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02503","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02503v4","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02503","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_12","alias_value":"5JHVLDYZZ6CS","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_16","alias_value":"5JHVLDYZZ6CSO5EC","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_8","alias_value":"5JHVLDYZ","created_at":"2026-07-05T02:06:47Z"}],"graph_snapshots":[{"event_id":"sha256:e41454d5c4367249b6467b0acda6127a1df74aef1b396ab29e8bfad73c66f6f4","target":"graph","created_at":"2026-07-05T02:06:47Z","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/1908.02503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we consider numerical efficiency and convergence rates for solvers of non-convex multi-penalty formulations when reconstructing sparse signals from noisy linear measurements. We extend an existing approach, based on reduction to an augmented single-penalty formulation, to the non-convex setting and discuss its computational intractability in large-scale applications. To circumvent this limitation, we propose an alternative single-penalty reduction based on infimal convolution that shares the benefits of the augmented approach but is computationally less dependent on the problem si","authors_text":"Johannes Maly, Valeriya Naumova, Zeljko Kereta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-07T09:43:10Z","title":"Computational approaches to non-convex, sparsity-inducing multi-penalty regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02503","kind":"arxiv","version":4},"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:076dd60877d4abc1a37854952035034d3f4b39531b41a437a433414547fa3885","target":"record","created_at":"2026-07-05T02:06:47Z","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":"2acb8aba44661515caf06305acc018ae8c772236f4ce8f90612cf39d45b223dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-07T09:43:10Z","title_canon_sha256":"bd9922cf64630a0c4869d8dd507da7a5b50e3015916b6cffb012b50c2184c550"},"schema_version":"1.0","source":{"id":"1908.02503","kind":"arxiv","version":4}},"canonical_sha256":"ea4f558f19cf85277482545db84df8b955ee32dd289aced94d6900c9de36a055","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea4f558f19cf85277482545db84df8b955ee32dd289aced94d6900c9de36a055","first_computed_at":"2026-07-05T02:06:47.699051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:47.699051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPSvhJAlBK+r84ceMSiRHqZV32i9zCMixl7qkifXXf1KzpFYufpk3t75lhN8CIqCLOYqVD968+xhQgH0A42wDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:47.699473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02503","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:076dd60877d4abc1a37854952035034d3f4b39531b41a437a433414547fa3885","sha256:e41454d5c4367249b6467b0acda6127a1df74aef1b396ab29e8bfad73c66f6f4"],"state_sha256":"6b2faefe1debf893f0169d12c29d586acd2e2e0fed289d31fe8a169dc4fda762"}