{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GQAV56SVYFGBLQKQUD4YY2QGHC","short_pith_number":"pith:GQAV56SV","canonical_record":{"source":{"id":"1803.01370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T15:37:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ae95f3ed946493b285e8b9df8982d0cb8f0afd34405fbda0e3ccbe753c5ba110","abstract_canon_sha256":"e1463991d35bb9fe82ed20be09eae1e43b5fb83e24f27ebbd09c863ad067a85a"},"schema_version":"1.0"},"canonical_sha256":"34015efa55c14c15c150a0f98c6a0638ae291d8e8c3cc46b40041f19f1c4ea3a","source":{"kind":"arxiv","id":"1803.01370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01370","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01370v2","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01370","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"GQAV56SVYFGB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQAV56SVYFGBLQKQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQAV56SV","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GQAV56SVYFGBLQKQUD4YY2QGHC","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T15:37:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ae95f3ed946493b285e8b9df8982d0cb8f0afd34405fbda0e3ccbe753c5ba110","abstract_canon_sha256":"e1463991d35bb9fe82ed20be09eae1e43b5fb83e24f27ebbd09c863ad067a85a"},"schema_version":"1.0"},"canonical_sha256":"34015efa55c14c15c150a0f98c6a0638ae291d8e8c3cc46b40041f19f1c4ea3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:53.699135Z","signature_b64":"+W15kdUa7CJqwFpYFRwmdtwkq/V/1wwDZ9KVJB5mrBUNycsGyaQdpd2Uf86czgS15ItGHNk67Jv5MRsKOwu8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34015efa55c14c15c150a0f98c6a0638ae291d8e8c3cc46b40041f19f1c4ea3a","last_reissued_at":"2026-05-18T00:14:53.698287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:53.698287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01370","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:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yg2g6HBuglLoa0l/6JhHUyMWIgT+VCESWBify34A0MgXGMJUo1ekYlt4a/I3FeCC/xTrXL0zmjls+IQR7D/ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:30:18.736033Z"},"content_sha256":"69829233df209942dd9c2d61e775d1c167011aefd48f7269e9ec220448980bec","schema_version":"1.0","event_id":"sha256:69829233df209942dd9c2d61e775d1c167011aefd48f7269e9ec220448980bec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GQAV56SVYFGBLQKQUD4YY2QGHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ching-pei Lee, Cong Han Lim, Stephen J. Wright","submitted_at":"2018-03-04T15:37:46Z","abstract_excerpt":"We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving ERM problems with a nonsmooth regularization term. Current second-order and quasi-Newton methods for this problem either do not work well in the distributed setting or work only for specific regularizers. Our algorithm uses successive quadratic approximations, and we describe how to maintain an approximation of the Hessian and solve subproblems efficiently in a distributed manner. The proposed method enjoys global linear convergence for a broad range of non-strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01370","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:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59xECuwzKZjAjB1/WdDSszOHUPEjic1wi7UkNI1GyzYciQVLmhnroy/H6r0AC0fghVONZyRDALx6+w4f3uCdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:30:18.736488Z"},"content_sha256":"e44100ff9d7c6efed11a3e8fae193f41fbda4f822fb1098436476cc20e574ad3","schema_version":"1.0","event_id":"sha256:e44100ff9d7c6efed11a3e8fae193f41fbda4f822fb1098436476cc20e574ad3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/bundle.json","state_url":"https://pith.science/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/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-08-11T19:30:18Z","links":{"resolver":"https://pith.science/pith/GQAV56SVYFGBLQKQUD4YY2QGHC","bundle":"https://pith.science/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/bundle.json","state":"https://pith.science/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQAV56SVYFGBLQKQUD4YY2QGHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GQAV56SVYFGBLQKQUD4YY2QGHC","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":"e1463991d35bb9fe82ed20be09eae1e43b5fb83e24f27ebbd09c863ad067a85a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T15:37:46Z","title_canon_sha256":"ae95f3ed946493b285e8b9df8982d0cb8f0afd34405fbda0e3ccbe753c5ba110"},"schema_version":"1.0","source":{"id":"1803.01370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01370","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01370v2","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01370","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"GQAV56SVYFGB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQAV56SVYFGBLQKQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQAV56SV","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:e44100ff9d7c6efed11a3e8fae193f41fbda4f822fb1098436476cc20e574ad3","target":"graph","created_at":"2026-05-18T00:14:53Z","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 a communication- and computation-efficient distributed optimization algorithm using second-order information for solving ERM problems with a nonsmooth regularization term. Current second-order and quasi-Newton methods for this problem either do not work well in the distributed setting or work only for specific regularizers. Our algorithm uses successive quadratic approximations, and we describe how to maintain an approximation of the Hessian and solve subproblems efficiently in a distributed manner. The proposed method enjoys global linear convergence for a broad range of non-strong","authors_text":"Ching-pei Lee, Cong Han Lim, Stephen J. Wright","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T15:37:46Z","title":"A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01370","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:69829233df209942dd9c2d61e775d1c167011aefd48f7269e9ec220448980bec","target":"record","created_at":"2026-05-18T00:14:53Z","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":"e1463991d35bb9fe82ed20be09eae1e43b5fb83e24f27ebbd09c863ad067a85a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T15:37:46Z","title_canon_sha256":"ae95f3ed946493b285e8b9df8982d0cb8f0afd34405fbda0e3ccbe753c5ba110"},"schema_version":"1.0","source":{"id":"1803.01370","kind":"arxiv","version":2}},"canonical_sha256":"34015efa55c14c15c150a0f98c6a0638ae291d8e8c3cc46b40041f19f1c4ea3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34015efa55c14c15c150a0f98c6a0638ae291d8e8c3cc46b40041f19f1c4ea3a","first_computed_at":"2026-05-18T00:14:53.698287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:53.698287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+W15kdUa7CJqwFpYFRwmdtwkq/V/1wwDZ9KVJB5mrBUNycsGyaQdpd2Uf86czgS15ItGHNk67Jv5MRsKOwu8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:53.699135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69829233df209942dd9c2d61e775d1c167011aefd48f7269e9ec220448980bec","sha256:e44100ff9d7c6efed11a3e8fae193f41fbda4f822fb1098436476cc20e574ad3"],"state_sha256":"50a591b36c808c5a0d7bafa9065f89230474adf98cca9b675f4f3090fc819cc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PE2eruxbDn37iyh72Bk/tu2IOn5cjBnHocrP56o0V77fboXScyko7X93YgrzOvit1s0DKVjLnGAhBvyon7CICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:30:18.740651Z","bundle_sha256":"f3946452785d07a7e01d2f4ef9e4dab8dc2cb94dd7393040eefccc0c47139cf4"}}