{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XOG6Y4BADE34SHVFQAUO46JF2D","short_pith_number":"pith:XOG6Y4BA","schema_version":"1.0","canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","source":{"kind":"arxiv","id":"1712.03577","version":2},"attestation_state":"computed","paper":{"title":"\"Active-set complexity\" of proximal gradient: How long does it take to find the sparsity pattern?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Julie Nutini, Mark Schmidt, Warren Hare","submitted_at":"2017-12-10T19:39:53Z","abstract_excerpt":"Proximal gradient methods have been found to be highly effective for solving minimization problems with non-negative constraints or L1-regularization. Under suitable nondegeneracy conditions, it is known that these algorithms identify the optimal sparsity pattern for these types of problems in a finite number of iterations. However, it is not known how many iterations this may take. We introduce the notion of the \"active-set complexity\", which in these cases is the number of iterations before an algorithm is guaranteed to have identified the final sparsity pattern. We further give a bound on t"},"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.03577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-10T19:39:53Z","cross_cats_sorted":[],"title_canon_sha256":"c40c9f58ad3b95e831214f5123820a224467936c0535a46952cd5a711d92c47c","abstract_canon_sha256":"5e4c303e0c01dfee1aa76369a8e156a4cc840d8047def3c0acd346048c7bffc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.829948Z","signature_b64":"qj+Mt/BGvp1O/baQJBoW+kG5PLKaxOYGBDArhAdb9cGmJe0ZhOrju6NzT/MwxhPwJf81MY+CbKDkmdB461CwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","last_reissued_at":"2026-05-18T00:03:24.829523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.829523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Active-set complexity\" of proximal gradient: How long does it take to find the sparsity pattern?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Julie Nutini, Mark Schmidt, Warren Hare","submitted_at":"2017-12-10T19:39:53Z","abstract_excerpt":"Proximal gradient methods have been found to be highly effective for solving minimization problems with non-negative constraints or L1-regularization. Under suitable nondegeneracy conditions, it is known that these algorithms identify the optimal sparsity pattern for these types of problems in a finite number of iterations. However, it is not known how many iterations this may take. We introduce the notion of the \"active-set complexity\", which in these cases is the number of iterations before an algorithm is guaranteed to have identified the final sparsity pattern. We further give a bound on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03577","kind":"arxiv","version":2},"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.03577","created_at":"2026-05-18T00:03:24.829583+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03577v2","created_at":"2026-05-18T00:03:24.829583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03577","created_at":"2026-05-18T00:03:24.829583+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOG6Y4BADE34","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOG6Y4BADE34SHVF","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOG6Y4BA","created_at":"2026-05-18T12:31:56.362134+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/XOG6Y4BADE34SHVFQAUO46JF2D","json":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D.json","graph_json":"https://pith.science/api/pith-number/XOG6Y4BADE34SHVFQAUO46JF2D/graph.json","events_json":"https://pith.science/api/pith-number/XOG6Y4BADE34SHVFQAUO46JF2D/events.json","paper":"https://pith.science/paper/XOG6Y4BA"},"agent_actions":{"view_html":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D","download_json":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D.json","view_paper":"https://pith.science/paper/XOG6Y4BA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03577&json=true","fetch_graph":"https://pith.science/api/pith-number/XOG6Y4BADE34SHVFQAUO46JF2D/graph.json","fetch_events":"https://pith.science/api/pith-number/XOG6Y4BADE34SHVFQAUO46JF2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/action/storage_attestation","attest_author":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/action/author_attestation","sign_citation":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/action/citation_signature","submit_replication":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/action/replication_record"}},"created_at":"2026-05-18T00:03:24.829583+00:00","updated_at":"2026-05-18T00:03:24.829583+00:00"}