{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EV2IRGM4NU3UFFTOSGHBLRZX25","short_pith_number":"pith:EV2IRGM4","canonical_record":{"source":{"id":"1509.02957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-09T21:26:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cab6e70331df5020bf380c63f9d80ee7f57eff431a787c6b7e8ccb482c9cc270","abstract_canon_sha256":"b1b4192b7ae37f902271fc29063bfda7c2b82925d7951537684d91c38da1d0ba"},"schema_version":"1.0"},"canonical_sha256":"257488999c6d3742966e918e15c737d75981062321d4253d0cc533be3853dedd","source":{"kind":"arxiv","id":"1509.02957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02957","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02957v2","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02957","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"EV2IRGM4NU3U","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EV2IRGM4NU3UFFTO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EV2IRGM4","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EV2IRGM4NU3UFFTOSGHBLRZX25","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-09T21:26:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cab6e70331df5020bf380c63f9d80ee7f57eff431a787c6b7e8ccb482c9cc270","abstract_canon_sha256":"b1b4192b7ae37f902271fc29063bfda7c2b82925d7951537684d91c38da1d0ba"},"schema_version":"1.0"},"canonical_sha256":"257488999c6d3742966e918e15c737d75981062321d4253d0cc533be3853dedd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:17.841586Z","signature_b64":"VutktfjhMKaS6sIulFvIvJi2Xdl82g6wd+PUb8GXG3Ep3gMiiQM7B6pYYd4KjPwT3CXDm3/BbQwARrqVeaV6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"257488999c6d3742966e918e15c737d75981062321d4253d0cc533be3853dedd","last_reissued_at":"2026-05-18T01:14:17.840940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:17.840940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02957","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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foGdwNJnKoiwNRBqb4uyY6XTdfYmHoXFvf40dyyvPrD4HsAGNSxe/v8OgkxqZv1WGbjT+ydcrflZXnzycP5cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:59.888525Z"},"content_sha256":"cae22951d3b7a315da82d2ee59070ca59ebb7573442fb985f8345f82a8180ad1","schema_version":"1.0","event_id":"sha256:cae22951d3b7a315da82d2ee59070ca59ebb7573442fb985f8345f82a8180ad1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EV2IRGM4NU3UFFTOSGHBLRZX25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Congrui Yi, Jian Huang","submitted_at":"2015-09-09T21:26:39Z","abstract_excerpt":"We propose an algorithm, semismooth Newton coordinate descent (SNCD), for the elastic-net penalized Huber loss regression and quantile regression in high dimensional settings. Unlike existing coordinate descent type algorithms, the SNCD updates each regression coefficient and its corresponding subgradient simultaneously in each iteration. It combines the strengths of the coordinate descent and the semismooth Newton algorithm, and effectively solves the computational challenges posed by dimensionality and nonsmoothness. We establish the convergence properties of the algorithm. In addition, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02957","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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkzcCL/rx63uuK3d82OIX4s4c3ZdbbPBASPLL3jqtzrW5dT9pOUG28Wr4dXRqKLGbnJJqFoEQpRt+PuxGOtbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:59.888870Z"},"content_sha256":"4940a358370cec2fd455923e119200b4d6c0f6297227a7d4a2815b7169863a9c","schema_version":"1.0","event_id":"sha256:4940a358370cec2fd455923e119200b4d6c0f6297227a7d4a2815b7169863a9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/bundle.json","state_url":"https://pith.science/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/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-31T03:55:59Z","links":{"resolver":"https://pith.science/pith/EV2IRGM4NU3UFFTOSGHBLRZX25","bundle":"https://pith.science/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/bundle.json","state":"https://pith.science/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EV2IRGM4NU3UFFTOSGHBLRZX25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EV2IRGM4NU3UFFTOSGHBLRZX25","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":"b1b4192b7ae37f902271fc29063bfda7c2b82925d7951537684d91c38da1d0ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-09T21:26:39Z","title_canon_sha256":"cab6e70331df5020bf380c63f9d80ee7f57eff431a787c6b7e8ccb482c9cc270"},"schema_version":"1.0","source":{"id":"1509.02957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02957","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02957v2","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02957","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"EV2IRGM4NU3U","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EV2IRGM4NU3UFFTO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EV2IRGM4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:4940a358370cec2fd455923e119200b4d6c0f6297227a7d4a2815b7169863a9c","target":"graph","created_at":"2026-05-18T01:14:17Z","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":"We propose an algorithm, semismooth Newton coordinate descent (SNCD), for the elastic-net penalized Huber loss regression and quantile regression in high dimensional settings. Unlike existing coordinate descent type algorithms, the SNCD updates each regression coefficient and its corresponding subgradient simultaneously in each iteration. It combines the strengths of the coordinate descent and the semismooth Newton algorithm, and effectively solves the computational challenges posed by dimensionality and nonsmoothness. We establish the convergence properties of the algorithm. In addition, we p","authors_text":"Congrui Yi, Jian Huang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-09T21:26:39Z","title":"Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02957","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:cae22951d3b7a315da82d2ee59070ca59ebb7573442fb985f8345f82a8180ad1","target":"record","created_at":"2026-05-18T01:14:17Z","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":"b1b4192b7ae37f902271fc29063bfda7c2b82925d7951537684d91c38da1d0ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-09T21:26:39Z","title_canon_sha256":"cab6e70331df5020bf380c63f9d80ee7f57eff431a787c6b7e8ccb482c9cc270"},"schema_version":"1.0","source":{"id":"1509.02957","kind":"arxiv","version":2}},"canonical_sha256":"257488999c6d3742966e918e15c737d75981062321d4253d0cc533be3853dedd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"257488999c6d3742966e918e15c737d75981062321d4253d0cc533be3853dedd","first_computed_at":"2026-05-18T01:14:17.840940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:17.840940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VutktfjhMKaS6sIulFvIvJi2Xdl82g6wd+PUb8GXG3Ep3gMiiQM7B6pYYd4KjPwT3CXDm3/BbQwARrqVeaV6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:17.841586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cae22951d3b7a315da82d2ee59070ca59ebb7573442fb985f8345f82a8180ad1","sha256:4940a358370cec2fd455923e119200b4d6c0f6297227a7d4a2815b7169863a9c"],"state_sha256":"c4bee89e14582a6ace7988b4c8c97a36e91e5600505025437c4581115a4ceb4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ft+f1ap+gNR5ZORMoZUXtb3TVZYQihNox2grH6uZzDMtwaHDEdUYDBwclWDYbMIFKVlh1/otRF7FTEU86gpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:55:59.890891Z","bundle_sha256":"3ae520133b057fc350dea022c66545503109939cc10addde6b1aee31d53756e1"}}