{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XOG6Y4BADE34SHVFQAUO46JF2D","short_pith_number":"pith:XOG6Y4BA","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"},"canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","source":{"kind":"arxiv","id":"1712.03577","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XOG6Y4BADE34SHVFQAUO46JF2D","target":"record","payload":{"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"},"canonical_sha256":"bb8dec70201937c91ea58028ee7925d0fe543c037e4fc5c8d9d81c5b0f546fc2","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"},"source_kind":"arxiv","source_id":"1712.03577","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbpFndrRaoESpjeGXKFbgcQcrUt67eUGIes5B1wKhXmsFkUqXvqolQEeLv5b8xwTf0dcQccG9VVlt9qUoqIsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:41:08.861799Z"},"content_sha256":"8e89f48cc76cab6a3f989d8deb67f42449673f4f08a4c076c7ccb0193fabee12","schema_version":"1.0","event_id":"sha256:8e89f48cc76cab6a3f989d8deb67f42449673f4f08a4c076c7ccb0193fabee12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XOG6Y4BADE34SHVFQAUO46JF2D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7A91MnKt1q5mJZ8IPht2AtgLTW/1rKj0D+ndS0KHZOWtrib7FKkenimFZKvwuCs0LNgcRJJYGd5Aw7uAP7OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:41:08.862144Z"},"content_sha256":"70c3114a160b607533146a1873e70eaa9ffd833415c20ce9cb9ef5a613b32276","schema_version":"1.0","event_id":"sha256:70c3114a160b607533146a1873e70eaa9ffd833415c20ce9cb9ef5a613b32276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/bundle.json","state_url":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOG6Y4BADE34SHVFQAUO46JF2D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T20:41:08Z","links":{"resolver":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D","bundle":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/bundle.json","state":"https://pith.science/pith/XOG6Y4BADE34SHVFQAUO46JF2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOG6Y4BADE34SHVFQAUO46JF2D/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9O8LMGNpA7itpRm+UwwM0zUYNbKKfcP0hdATI44wXFD9DDj5XVg99QzkVYbeU8iXAADBOW5L+yRRU3k7QHfVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T20:41:08.864196Z","bundle_sha256":"4e70ebd59abe2fb695f622f7d44793f660973af8fdc4445a1034dbf6c69917a6"}}