{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OH7MQUL7ZDBKIBIGVBUQZE7UKX","short_pith_number":"pith:OH7MQUL7","canonical_record":{"source":{"id":"1504.06637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-24T20:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"7c00116019b9d50de7448c8912fa71c31c6a062678757fe21443c08c7196aad2","abstract_canon_sha256":"fbe4c0a9576c89eb7a4d58882b3052b5b60343e0682d2b7433b10ab7d66393f4"},"schema_version":"1.0"},"canonical_sha256":"71fec8517fc8c2a40506a8690c93f455f2ec944240a1d29b4ec2aaf1189c8678","source":{"kind":"arxiv","id":"1504.06637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06637","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06637v1","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06637","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"OH7MQUL7ZDBK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OH7MQUL7ZDBKIBIG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OH7MQUL7","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OH7MQUL7ZDBKIBIGVBUQZE7UKX","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-24T20:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"7c00116019b9d50de7448c8912fa71c31c6a062678757fe21443c08c7196aad2","abstract_canon_sha256":"fbe4c0a9576c89eb7a4d58882b3052b5b60343e0682d2b7433b10ab7d66393f4"},"schema_version":"1.0"},"canonical_sha256":"71fec8517fc8c2a40506a8690c93f455f2ec944240a1d29b4ec2aaf1189c8678","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:52.907159Z","signature_b64":"rWjyVmsViGtitR7epA8gY3DjVn8A7M+wfy1tJjfIgc3/JCABz/UGemhRRvbHlrZhyymWafPzuJwJi+lVGWU0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71fec8517fc8c2a40506a8690c93f455f2ec944240a1d29b4ec2aaf1189c8678","last_reissued_at":"2026-05-18T02:17:52.906641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:52.906641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06637","source_version":1,"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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WYWdon79Fm28cQJ+gX6b+BElWHkDORZryYpdbm06V6RVmKF3sK/zY+6bJtBd07A143KcjrVbeDwP9gf48e0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:00:55.396939Z"},"content_sha256":"909261a208c83e350e493b89c3c690c4f0854b30ded0a93a7bd4046434745698","schema_version":"1.0","event_id":"sha256:909261a208c83e350e493b89c3c690c4f0854b30ded0a93a7bd4046434745698"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OH7MQUL7ZDBKIBIGVBUQZE7UKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Eric Chi, Genevera I. Allen, Yue Hu","submitted_at":"2015-04-24T20:48:51Z","abstract_excerpt":"Optimization approaches based on operator splitting are becoming popular for solving sparsity regularized statistical machine learning models. While many have proposed fast algorithms to solve these problems for a single regularization parameter, conspicuously less attention has been given to computing regularization paths, or solving the optimization problems over the full range of regularization parameters to obtain a sequence of sparse models. In this chapter, we aim to quickly approximate the sequence of sparse models associated with regularization paths for the purposes of statistical mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06637","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"},"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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgIP7uJ82JCwUKcYOVsFkfFVnLWPGmQfo5RzQITM2KPQvMip6/rP7nsqeaUQIc+/JcHrttamHTcZwLmu+zF/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:00:55.397334Z"},"content_sha256":"7728d2973e025754cb881d5c1a934335e6997bf0cfc3fb3ec72719486b1f20c9","schema_version":"1.0","event_id":"sha256:7728d2973e025754cb881d5c1a934335e6997bf0cfc3fb3ec72719486b1f20c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/bundle.json","state_url":"https://pith.science/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/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-06-08T23:00:55Z","links":{"resolver":"https://pith.science/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX","bundle":"https://pith.science/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/bundle.json","state":"https://pith.science/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OH7MQUL7ZDBKIBIGVBUQZE7UKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OH7MQUL7ZDBKIBIGVBUQZE7UKX","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":"fbe4c0a9576c89eb7a4d58882b3052b5b60343e0682d2b7433b10ab7d66393f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-24T20:48:51Z","title_canon_sha256":"7c00116019b9d50de7448c8912fa71c31c6a062678757fe21443c08c7196aad2"},"schema_version":"1.0","source":{"id":"1504.06637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06637","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06637v1","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06637","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"OH7MQUL7ZDBK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OH7MQUL7ZDBKIBIG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OH7MQUL7","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:7728d2973e025754cb881d5c1a934335e6997bf0cfc3fb3ec72719486b1f20c9","target":"graph","created_at":"2026-05-18T02:17:52Z","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":"Optimization approaches based on operator splitting are becoming popular for solving sparsity regularized statistical machine learning models. While many have proposed fast algorithms to solve these problems for a single regularization parameter, conspicuously less attention has been given to computing regularization paths, or solving the optimization problems over the full range of regularization parameters to obtain a sequence of sparse models. In this chapter, we aim to quickly approximate the sequence of sparse models associated with regularization paths for the purposes of statistical mod","authors_text":"Eric Chi, Genevera I. Allen, Yue Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-24T20:48:51Z","title":"ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06637","kind":"arxiv","version":1},"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:909261a208c83e350e493b89c3c690c4f0854b30ded0a93a7bd4046434745698","target":"record","created_at":"2026-05-18T02:17:52Z","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":"fbe4c0a9576c89eb7a4d58882b3052b5b60343e0682d2b7433b10ab7d66393f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-24T20:48:51Z","title_canon_sha256":"7c00116019b9d50de7448c8912fa71c31c6a062678757fe21443c08c7196aad2"},"schema_version":"1.0","source":{"id":"1504.06637","kind":"arxiv","version":1}},"canonical_sha256":"71fec8517fc8c2a40506a8690c93f455f2ec944240a1d29b4ec2aaf1189c8678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71fec8517fc8c2a40506a8690c93f455f2ec944240a1d29b4ec2aaf1189c8678","first_computed_at":"2026-05-18T02:17:52.906641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:52.906641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rWjyVmsViGtitR7epA8gY3DjVn8A7M+wfy1tJjfIgc3/JCABz/UGemhRRvbHlrZhyymWafPzuJwJi+lVGWU0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:52.907159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:909261a208c83e350e493b89c3c690c4f0854b30ded0a93a7bd4046434745698","sha256:7728d2973e025754cb881d5c1a934335e6997bf0cfc3fb3ec72719486b1f20c9"],"state_sha256":"8eb1e30a8ec5c951d8f5fb55e15fbdbd641145a03c6cdd1777098d7a7214552a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBYl4SFdBtUWNBqc/qQ03skvWvghqo2pYNVO98WpuRLLNGSd8majPFhj+8xDTRrBMuTlvyhf82vCbxB/6hfoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:00:55.399434Z","bundle_sha256":"74a60e4193642c785503a03170390ace8369464338d85c8724a9de8cddf4c6fa"}}