{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JI4CRXVGYWVSIUOI3FXHARINEV","short_pith_number":"pith:JI4CRXVG","canonical_record":{"source":{"id":"1604.03763","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-13T13:33:32Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"950812f56501dabcc26d7c0b2aa5b58acdaa6957a30191aeef24e4b7efd78858","abstract_canon_sha256":"e1c29eb4da4ce8a5bc43fa784e1f1ffb8b426de9f6fb276d5e3c75e8be3ad5f4"},"schema_version":"1.0"},"canonical_sha256":"4a3828dea6c5ab2451c8d96e70450d2546ee671e3e682fa583caea49992836cf","source":{"kind":"arxiv","id":"1604.03763","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03763","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03763v3","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03763","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"JI4CRXVGYWVS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JI4CRXVGYWVSIUOI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JI4CRXVG","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JI4CRXVGYWVSIUOI3FXHARINEV","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03763","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-13T13:33:32Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"950812f56501dabcc26d7c0b2aa5b58acdaa6957a30191aeef24e4b7efd78858","abstract_canon_sha256":"e1c29eb4da4ce8a5bc43fa784e1f1ffb8b426de9f6fb276d5e3c75e8be3ad5f4"},"schema_version":"1.0"},"canonical_sha256":"4a3828dea6c5ab2451c8d96e70450d2546ee671e3e682fa583caea49992836cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.874272Z","signature_b64":"Zruni0/PG0Gq1aZeavFzaqo/+Q6ifRRqba87q6x4Mm77qJE1IA5EV6ZwESUGm8fIQgbhLobJI/c0fxdzCDMYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3828dea6c5ab2451c8d96e70450d2546ee671e3e682fa583caea49992836cf","last_reissued_at":"2026-05-18T00:36:43.873711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.873711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03763","source_version":3,"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:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBflumJz5myyHRplGfOC5aNydC3T8fSdX9JEMzva/NBzzBo1dOTKQ3t9SFz7rccTfYXA0LHW8puMY32HfRJ9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:02:27.667826Z"},"content_sha256":"e4eb7c51b13a52e16359b64f9ebfebb57dfb7bda5c4eb347850a59be88f760b3","schema_version":"1.0","event_id":"sha256:e4eb7c51b13a52e16359b64f9ebfebb57dfb7bda5c4eb347850a59be88f760b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JI4CRXVGYWVSIUOI3FXHARINEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fen Xia, Jialei Wang, Shun Zheng, Tong Zhang, Wei Xu","submitted_at":"2016-04-13T13:33:32Z","abstract_excerpt":"In modern large-scale machine learning applications, the training data are often partitioned and stored on multiple machines. It is customary to employ the \"data parallelism\" approach, where the aggregated training loss is minimized without moving data across machines. In this paper, we introduce a novel distributed dual formulation for regularized loss minimization problems that can directly handle data parallelism in the distributed setting. This formulation allows us to systematically derive dual coordinate optimization procedures, which we refer to as Distributed Alternating Dual Maximizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03763","kind":"arxiv","version":3},"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:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7saGBeCL/k4R3M7nnxHgqDZ0Hd51qXQPwIr5pdbrWelD+5cF1E86E1hqQFRyntAkSBvpOtgJ1HSBn4IngjHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:02:27.668557Z"},"content_sha256":"a6563d472c6d96d28e1a137dc19cf2e7e003d20ff48f4039ee007a88bd0299bd","schema_version":"1.0","event_id":"sha256:a6563d472c6d96d28e1a137dc19cf2e7e003d20ff48f4039ee007a88bd0299bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI4CRXVGYWVSIUOI3FXHARINEV/bundle.json","state_url":"https://pith.science/pith/JI4CRXVGYWVSIUOI3FXHARINEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI4CRXVGYWVSIUOI3FXHARINEV/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-11T08:02:27Z","links":{"resolver":"https://pith.science/pith/JI4CRXVGYWVSIUOI3FXHARINEV","bundle":"https://pith.science/pith/JI4CRXVGYWVSIUOI3FXHARINEV/bundle.json","state":"https://pith.science/pith/JI4CRXVGYWVSIUOI3FXHARINEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI4CRXVGYWVSIUOI3FXHARINEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JI4CRXVGYWVSIUOI3FXHARINEV","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":"e1c29eb4da4ce8a5bc43fa784e1f1ffb8b426de9f6fb276d5e3c75e8be3ad5f4","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-13T13:33:32Z","title_canon_sha256":"950812f56501dabcc26d7c0b2aa5b58acdaa6957a30191aeef24e4b7efd78858"},"schema_version":"1.0","source":{"id":"1604.03763","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03763","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03763v3","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03763","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"JI4CRXVGYWVS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JI4CRXVGYWVSIUOI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JI4CRXVG","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:a6563d472c6d96d28e1a137dc19cf2e7e003d20ff48f4039ee007a88bd0299bd","target":"graph","created_at":"2026-05-18T00:36:43Z","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":"In modern large-scale machine learning applications, the training data are often partitioned and stored on multiple machines. It is customary to employ the \"data parallelism\" approach, where the aggregated training loss is minimized without moving data across machines. In this paper, we introduce a novel distributed dual formulation for regularized loss minimization problems that can directly handle data parallelism in the distributed setting. This formulation allows us to systematically derive dual coordinate optimization procedures, which we refer to as Distributed Alternating Dual Maximizat","authors_text":"Fen Xia, Jialei Wang, Shun Zheng, Tong Zhang, Wei Xu","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-13T13:33:32Z","title":"A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03763","kind":"arxiv","version":3},"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:e4eb7c51b13a52e16359b64f9ebfebb57dfb7bda5c4eb347850a59be88f760b3","target":"record","created_at":"2026-05-18T00:36:43Z","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":"e1c29eb4da4ce8a5bc43fa784e1f1ffb8b426de9f6fb276d5e3c75e8be3ad5f4","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-13T13:33:32Z","title_canon_sha256":"950812f56501dabcc26d7c0b2aa5b58acdaa6957a30191aeef24e4b7efd78858"},"schema_version":"1.0","source":{"id":"1604.03763","kind":"arxiv","version":3}},"canonical_sha256":"4a3828dea6c5ab2451c8d96e70450d2546ee671e3e682fa583caea49992836cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3828dea6c5ab2451c8d96e70450d2546ee671e3e682fa583caea49992836cf","first_computed_at":"2026-05-18T00:36:43.873711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:43.873711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zruni0/PG0Gq1aZeavFzaqo/+Q6ifRRqba87q6x4Mm77qJE1IA5EV6ZwESUGm8fIQgbhLobJI/c0fxdzCDMYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:43.874272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03763","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4eb7c51b13a52e16359b64f9ebfebb57dfb7bda5c4eb347850a59be88f760b3","sha256:a6563d472c6d96d28e1a137dc19cf2e7e003d20ff48f4039ee007a88bd0299bd"],"state_sha256":"bb59c9b4c2055f83ee3619920060803c78459fb39e55b1b482f4f750c34ba43e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7tb7G8O9aQNUNpAKNb24gMS++R/1KRlbqRyaRkvCs81gN92jpwRQaEXniX6THeeWuW5mvLg8fWXIGaEnGlMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:02:27.672891Z","bundle_sha256":"b86d130e8bf4b93b0cc81ba8c30583176f5999d37890908ab46e997d6f41319e"}}