{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XOG6Y4BADE34SHVFQAUO46JF2D","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":"5e4c303e0c01dfee1aa76369a8e156a4cc840d8047def3c0acd346048c7bffc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-10T19:39:53Z","title_canon_sha256":"c40c9f58ad3b95e831214f5123820a224467936c0535a46952cd5a711d92c47c"},"schema_version":"1.0","source":{"id":"1712.03577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03577","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03577v2","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03577","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"XOG6Y4BADE34","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XOG6Y4BADE34SHVF","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XOG6Y4BA","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:70c3114a160b607533146a1873e70eaa9ffd833415c20ce9cb9ef5a613b32276","target":"graph","created_at":"2026-05-18T00:03:24Z","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"},"paper":{"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","authors_text":"Julie Nutini, Mark Schmidt, Warren Hare","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-10T19:39:53Z","title":"\"Active-set complexity\" of proximal gradient: How long does it take to find the sparsity pattern?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03577","kind":"arxiv","version":2},"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:8e89f48cc76cab6a3f989d8deb67f42449673f4f08a4c076c7ccb0193fabee12","target":"record","created_at":"2026-05-18T00:03:24Z","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":"5e4c303e0c01dfee1aa76369a8e156a4cc840d8047def3c0acd346048c7bffc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-10T19:39:53Z","title_canon_sha256":"c40c9f58ad3b95e831214f5123820a224467936c0535a46952cd5a711d92c47c"},"schema_version":"1.0","source":{"id":"1712.03577","kind":"arxiv","version":2}},"canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","first_computed_at":"2026-05-18T00:03:24.829523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.829523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qj+Mt/BGvp1O/baQJBoW+kG5PLKaxOYGBDArhAdb9cGmJe0ZhOrju6NzT/MwxhPwJf81MY+CbKDkmdB461CwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.829948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e89f48cc76cab6a3f989d8deb67f42449673f4f08a4c076c7ccb0193fabee12","sha256:70c3114a160b607533146a1873e70eaa9ffd833415c20ce9cb9ef5a613b32276"],"state_sha256":"d937eebb15d708cf7a316410f665b5b932c4b3c3e26c38b919f2086f58bee360"}