{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IAEIGOS2BVABK7ONU7TKSZGSVN","short_pith_number":"pith:IAEIGOS2","canonical_record":{"source":{"id":"1608.06879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T16:04:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5b635aa9d2781e4d156475629b5e0ac1c99a634b8121d8adb7dd8c093d96d092","abstract_canon_sha256":"802283d5b4d349a2ba8070ec2ceba99b9ebbaf49fa9854124b04a55ed080d1ba"},"schema_version":"1.0"},"canonical_sha256":"4008833a5a0d40157dcda7e6a964d2ab5f7fdf53a5dae59f50c93e86d249259c","source":{"kind":"arxiv","id":"1608.06879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06879","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06879v1","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06879","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"IAEIGOS2BVAB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IAEIGOS2BVABK7ON","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IAEIGOS2","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IAEIGOS2BVABK7ONU7TKSZGSVN","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T16:04:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5b635aa9d2781e4d156475629b5e0ac1c99a634b8121d8adb7dd8c093d96d092","abstract_canon_sha256":"802283d5b4d349a2ba8070ec2ceba99b9ebbaf49fa9854124b04a55ed080d1ba"},"schema_version":"1.0"},"canonical_sha256":"4008833a5a0d40157dcda7e6a964d2ab5f7fdf53a5dae59f50c93e86d249259c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:57.332612Z","signature_b64":"X9Uft/hG6o0baeOUL6nb5Rk8UfopjCynHJ+3yTEupnwOdj3EPPXq+bjU9ANqQdTTj4sUwR0ygZ2ipGfWXLHuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4008833a5a0d40157dcda7e6a964d2ab5f7fdf53a5dae59f50c93e86d249259c","last_reissued_at":"2026-05-18T01:07:57.332142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:57.332142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06879","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-18T01:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rezkinRpXfBA17isoQEQvzOpNYJiPLzOGtS1v37y1AW4MDKXdkS1kZ/mTO9ROMdTqyO8rPVlH0Lw/imoTlWuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:30:57.448009Z"},"content_sha256":"d67eaf4d45ff4134a37a4627ba23b36d550bd2e7fc113f196b2b8cd5badc76ca","schema_version":"1.0","event_id":"sha256:d67eaf4d45ff4134a37a4627ba23b36d550bd2e7fc113f196b2b8cd5badc76ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IAEIGOS2BVABK7ONU7TKSZGSVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AIDE: Fast and Communication Efficient Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Smola, Barnab\\'as P\\'ocz\\'os, Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik, Sashank J. Reddi","submitted_at":"2016-08-24T16:04:12Z","abstract_excerpt":"In this paper, we present two new communication-efficient methods for distributed minimization of an average of functions. The first algorithm is an inexact variant of the DANE algorithm that allows any local algorithm to return an approximate solution to a local subproblem. We show that such a strategy does not affect the theoretical guarantees of DANE significantly. In fact, our approach can be viewed as a robustification strategy since the method is substantially better behaved than DANE on data partition arising in practice. It is well known that DANE algorithm does not match the communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06879","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-18T01:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmoS4TNGGKbfD6o0Yy2KEbLh8TmwrGZqUuIMu9ptmKu7EEPOsrPAIh44CHJ3K5chSyyNpsSYg8nBJjx1cxxoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:30:57.448632Z"},"content_sha256":"529f06ac69996e843e5a52b9ee6e7eea314a715bc9f07343c9fe293c72789627","schema_version":"1.0","event_id":"sha256:529f06ac69996e843e5a52b9ee6e7eea314a715bc9f07343c9fe293c72789627"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/bundle.json","state_url":"https://pith.science/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/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-23T23:30:57Z","links":{"resolver":"https://pith.science/pith/IAEIGOS2BVABK7ONU7TKSZGSVN","bundle":"https://pith.science/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/bundle.json","state":"https://pith.science/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAEIGOS2BVABK7ONU7TKSZGSVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IAEIGOS2BVABK7ONU7TKSZGSVN","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":"802283d5b4d349a2ba8070ec2ceba99b9ebbaf49fa9854124b04a55ed080d1ba","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T16:04:12Z","title_canon_sha256":"5b635aa9d2781e4d156475629b5e0ac1c99a634b8121d8adb7dd8c093d96d092"},"schema_version":"1.0","source":{"id":"1608.06879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06879","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06879v1","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06879","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"IAEIGOS2BVAB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IAEIGOS2BVABK7ON","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IAEIGOS2","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:529f06ac69996e843e5a52b9ee6e7eea314a715bc9f07343c9fe293c72789627","target":"graph","created_at":"2026-05-18T01:07:57Z","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 this paper, we present two new communication-efficient methods for distributed minimization of an average of functions. The first algorithm is an inexact variant of the DANE algorithm that allows any local algorithm to return an approximate solution to a local subproblem. We show that such a strategy does not affect the theoretical guarantees of DANE significantly. In fact, our approach can be viewed as a robustification strategy since the method is substantially better behaved than DANE on data partition arising in practice. It is well known that DANE algorithm does not match the communica","authors_text":"Alex Smola, Barnab\\'as P\\'ocz\\'os, Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik, Sashank J. Reddi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T16:04:12Z","title":"AIDE: Fast and Communication Efficient Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06879","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:d67eaf4d45ff4134a37a4627ba23b36d550bd2e7fc113f196b2b8cd5badc76ca","target":"record","created_at":"2026-05-18T01:07:57Z","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":"802283d5b4d349a2ba8070ec2ceba99b9ebbaf49fa9854124b04a55ed080d1ba","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-24T16:04:12Z","title_canon_sha256":"5b635aa9d2781e4d156475629b5e0ac1c99a634b8121d8adb7dd8c093d96d092"},"schema_version":"1.0","source":{"id":"1608.06879","kind":"arxiv","version":1}},"canonical_sha256":"4008833a5a0d40157dcda7e6a964d2ab5f7fdf53a5dae59f50c93e86d249259c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4008833a5a0d40157dcda7e6a964d2ab5f7fdf53a5dae59f50c93e86d249259c","first_computed_at":"2026-05-18T01:07:57.332142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:57.332142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X9Uft/hG6o0baeOUL6nb5Rk8UfopjCynHJ+3yTEupnwOdj3EPPXq+bjU9ANqQdTTj4sUwR0ygZ2ipGfWXLHuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:57.332612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d67eaf4d45ff4134a37a4627ba23b36d550bd2e7fc113f196b2b8cd5badc76ca","sha256:529f06ac69996e843e5a52b9ee6e7eea314a715bc9f07343c9fe293c72789627"],"state_sha256":"246a843518c10d7a4cc8ffa7dbd538f6651f0c46ff6961523635824f6794bb9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTN65WpwI3/9gxEU0kGfMnn512W3Xoe2/wpwooKbdZVXN55drhGxrIK4L2MmXRxl/r/SzaFfv71n4TzzaUKGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:30:57.451129Z","bundle_sha256":"d13b0125d7a675f62ba9c704a7f26316d0b089b2a44ce12dc1aa4ec679ee40f6"}}