{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U5KNAXMN6RBE4FXGAQDQF6JKZL","short_pith_number":"pith:U5KNAXMN","schema_version":"1.0","canonical_sha256":"a754d05d8df4424e16e6040702f92acac4e33d32fca48a7a182d028729abf1b8","source":{"kind":"arxiv","id":"1712.08130","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Aleksander M\\k{a}dry, Ludwig Schmidt, Slobodan Mitrovi\\'c","submitted_at":"2017-12-21T18:06:34Z","abstract_excerpt":"Sparsity-based methods are widely used in machine learning, statistics, and signal processing. There is now a rich class of structured sparsity approaches that expand the modeling power of the sparsity paradigm and incorporate constraints such as group sparsity, graph sparsity, or hierarchical sparsity. While these sparsity models offer improved sample complexity and better interpretability, the improvements come at a computational cost: it is often challenging to optimize over the (non-convex) constraint sets that capture various sparsity structures. In this paper, we make progress in this di"},"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":"1712.08130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-21T18:06:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"05f733f326389359f97102d2e49d53a7abd87013457f6c71c7e707b204f6ce5c","abstract_canon_sha256":"be3f599fd38f62371388023f0edf39160365d6743c6d45f33ba2a5048e73b048"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:28.704090Z","signature_b64":"evKk2KCJdKiN9KXFyw78sRe405KGq3qrKk82S2P+sBOR2zo2keWnmS2BPYwnxOxN1OLXGUI5fHhVuRzQuuGoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a754d05d8df4424e16e6040702f92acac4e33d32fca48a7a182d028729abf1b8","last_reissued_at":"2026-05-18T00:27:28.703454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:28.703454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Aleksander M\\k{a}dry, Ludwig Schmidt, Slobodan Mitrovi\\'c","submitted_at":"2017-12-21T18:06:34Z","abstract_excerpt":"Sparsity-based methods are widely used in machine learning, statistics, and signal processing. There is now a rich class of structured sparsity approaches that expand the modeling power of the sparsity paradigm and incorporate constraints such as group sparsity, graph sparsity, or hierarchical sparsity. While these sparsity models offer improved sample complexity and better interpretability, the improvements come at a computational cost: it is often challenging to optimize over the (non-convex) constraint sets that capture various sparsity structures. In this paper, we make progress in this di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08130","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":""},"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":"1712.08130","created_at":"2026-05-18T00:27:28.703562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08130v1","created_at":"2026-05-18T00:27:28.703562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08130","created_at":"2026-05-18T00:27:28.703562+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5KNAXMN6RBE","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5KNAXMN6RBE4FXG","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5KNAXMN","created_at":"2026-05-18T12:31:46.661854+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/U5KNAXMN6RBE4FXGAQDQF6JKZL","json":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL.json","graph_json":"https://pith.science/api/pith-number/U5KNAXMN6RBE4FXGAQDQF6JKZL/graph.json","events_json":"https://pith.science/api/pith-number/U5KNAXMN6RBE4FXGAQDQF6JKZL/events.json","paper":"https://pith.science/paper/U5KNAXMN"},"agent_actions":{"view_html":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL","download_json":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL.json","view_paper":"https://pith.science/paper/U5KNAXMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08130&json=true","fetch_graph":"https://pith.science/api/pith-number/U5KNAXMN6RBE4FXGAQDQF6JKZL/graph.json","fetch_events":"https://pith.science/api/pith-number/U5KNAXMN6RBE4FXGAQDQF6JKZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL/action/storage_attestation","attest_author":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL/action/author_attestation","sign_citation":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL/action/citation_signature","submit_replication":"https://pith.science/pith/U5KNAXMN6RBE4FXGAQDQF6JKZL/action/replication_record"}},"created_at":"2026-05-18T00:27:28.703562+00:00","updated_at":"2026-05-18T00:27:28.703562+00:00"}