{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VOX2KQWNRVUENOYJJ7M3BEKOQK","short_pith_number":"pith:VOX2KQWN","canonical_record":{"source":{"id":"1501.00263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T09:21:57Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8de8066c8880cf2a2cb8dc056dd1aafe74474c67fd54a25c25a93c41b9e5bf63","abstract_canon_sha256":"c56ccb80b27bcd46e6b559c1e6dbadebcd7c73459bb8d68719fef6adfef93adb"},"schema_version":"1.0"},"canonical_sha256":"abafa542cd8d6846bb094fd9b0914e82923ab210222b8b650a6ac5d66abda945","source":{"kind":"arxiv","id":"1501.00263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00263","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00263v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00263","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"VOX2KQWNRVUE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VOX2KQWNRVUENOYJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VOX2KQWN","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VOX2KQWNRVUENOYJJ7M3BEKOQK","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T09:21:57Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8de8066c8880cf2a2cb8dc056dd1aafe74474c67fd54a25c25a93c41b9e5bf63","abstract_canon_sha256":"c56ccb80b27bcd46e6b559c1e6dbadebcd7c73459bb8d68719fef6adfef93adb"},"schema_version":"1.0"},"canonical_sha256":"abafa542cd8d6846bb094fd9b0914e82923ab210222b8b650a6ac5d66abda945","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.726626Z","signature_b64":"yWeSpCqcLDHOesPkUiK1ywxFoBUOuQIJZnMdGlk/ad9FTvejN7adVpwO3DMYwcHIpxOG1FOR6wtQ2bD/D/YXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abafa542cd8d6846bb094fd9b0914e82923ab210222b8b650a6ac5d66abda945","last_reissued_at":"2026-05-18T02:30:09.726163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.726163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00263","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:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxxJJk2NxjpZb17gLNq58EzppnhCjfPx5Mmbf5YSozhchR4+XpkcckrVeZ7+AlaAJJOJwtGAi0XCIZzfN0oTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:31:54.470596Z"},"content_sha256":"08d9195f30c9f8710f071e24e2af19916d51336ed55d0ae513e91bf71f645277","schema_version":"1.0","event_id":"sha256:08d9195f30c9f8710f071e24e2af19916d51336ed55d0ae513e91bf71f645277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VOX2KQWNRVUENOYJJ7M3BEKOQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lin Xiao, Yuchen Zhang","submitted_at":"2015-01-01T09:21:57Z","abstract_excerpt":"We consider distributed convex optimization problems originated from sample average approximation of stochastic optimization, or empirical risk minimization in machine learning. We assume that each machine in the distributed computing system has access to a local empirical loss function, constructed with i.i.d. data sampled from a common distribution. We propose a communication-efficient distributed algorithm to minimize the overall empirical loss, which is the average of the local empirical losses. The algorithm is based on an inexact damped Newton method, where the inexact Newton steps are c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00263","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:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3P6cXbwefNQbYxA+MtCRpCqZJQN/PRPmUrRdU0Jq03GiuAVq4WW0T2l90CHATexpq7/1JPNpa9feES0vRTbYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:31:54.471041Z"},"content_sha256":"8b7e0cf552d290f897820b352ac3b534d87279b17b5b9ab129cfe2b93e6fe4aa","schema_version":"1.0","event_id":"sha256:8b7e0cf552d290f897820b352ac3b534d87279b17b5b9ab129cfe2b93e6fe4aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/bundle.json","state_url":"https://pith.science/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/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-06T05:31:54Z","links":{"resolver":"https://pith.science/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK","bundle":"https://pith.science/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/bundle.json","state":"https://pith.science/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOX2KQWNRVUENOYJJ7M3BEKOQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VOX2KQWNRVUENOYJJ7M3BEKOQK","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":"c56ccb80b27bcd46e6b559c1e6dbadebcd7c73459bb8d68719fef6adfef93adb","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T09:21:57Z","title_canon_sha256":"8de8066c8880cf2a2cb8dc056dd1aafe74474c67fd54a25c25a93c41b9e5bf63"},"schema_version":"1.0","source":{"id":"1501.00263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00263","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00263v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00263","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"VOX2KQWNRVUE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VOX2KQWNRVUENOYJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VOX2KQWN","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:8b7e0cf552d290f897820b352ac3b534d87279b17b5b9ab129cfe2b93e6fe4aa","target":"graph","created_at":"2026-05-18T02:30:09Z","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 consider distributed convex optimization problems originated from sample average approximation of stochastic optimization, or empirical risk minimization in machine learning. We assume that each machine in the distributed computing system has access to a local empirical loss function, constructed with i.i.d. data sampled from a common distribution. We propose a communication-efficient distributed algorithm to minimize the overall empirical loss, which is the average of the local empirical losses. The algorithm is based on an inexact damped Newton method, where the inexact Newton steps are c","authors_text":"Lin Xiao, Yuchen Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T09:21:57Z","title":"Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00263","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:08d9195f30c9f8710f071e24e2af19916d51336ed55d0ae513e91bf71f645277","target":"record","created_at":"2026-05-18T02:30:09Z","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":"c56ccb80b27bcd46e6b559c1e6dbadebcd7c73459bb8d68719fef6adfef93adb","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T09:21:57Z","title_canon_sha256":"8de8066c8880cf2a2cb8dc056dd1aafe74474c67fd54a25c25a93c41b9e5bf63"},"schema_version":"1.0","source":{"id":"1501.00263","kind":"arxiv","version":1}},"canonical_sha256":"abafa542cd8d6846bb094fd9b0914e82923ab210222b8b650a6ac5d66abda945","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abafa542cd8d6846bb094fd9b0914e82923ab210222b8b650a6ac5d66abda945","first_computed_at":"2026-05-18T02:30:09.726163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:09.726163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yWeSpCqcLDHOesPkUiK1ywxFoBUOuQIJZnMdGlk/ad9FTvejN7adVpwO3DMYwcHIpxOG1FOR6wtQ2bD/D/YXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:09.726626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08d9195f30c9f8710f071e24e2af19916d51336ed55d0ae513e91bf71f645277","sha256:8b7e0cf552d290f897820b352ac3b534d87279b17b5b9ab129cfe2b93e6fe4aa"],"state_sha256":"00f652b7c6dbe3700feea345f2b9bd792f259c5d99ee441606dfe12e33ba9ad6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Eup0ZgS10bNj60SJAFXdqPkO1Qo6HOEN/UN9EMwtVKhRa6zE4Hb/+NXhqUdWrqS4fW6CEphKQj7WxH+4Z1dBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:31:54.473997Z","bundle_sha256":"a04f0c7ac6ab0d6aba666dd752ae751f7bfb193844a1c5b866f00b5f25b7649d"}}