{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6CCPHPRYVIDBBENSIJKA644DXE","short_pith_number":"pith:6CCPHPRY","canonical_record":{"source":{"id":"1709.01317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:58:47Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"b9a1b0ff6515e0f97b58e55dc5616e8f23f3e570e803e2c06026dbd85f44f85b","abstract_canon_sha256":"f375245e745b80220b6f73590112f993b50dbc3b395282080f9da0352dd19246"},"schema_version":"1.0"},"canonical_sha256":"f084f3be38aa061091b242540f7383b9007408583884346f974c3060959048b1","source":{"kind":"arxiv","id":"1709.01317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01317","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01317v2","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01317","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"6CCPHPRYVIDB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6CCPHPRYVIDBBENS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6CCPHPRY","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6CCPHPRYVIDBBENSIJKA644DXE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:58:47Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"b9a1b0ff6515e0f97b58e55dc5616e8f23f3e570e803e2c06026dbd85f44f85b","abstract_canon_sha256":"f375245e745b80220b6f73590112f993b50dbc3b395282080f9da0352dd19246"},"schema_version":"1.0"},"canonical_sha256":"f084f3be38aa061091b242540f7383b9007408583884346f974c3060959048b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:19.069087Z","signature_b64":"Zgxsj8s7uLP5dG3fRh52ed76SVbGME+9bgiz49NebW0Y4he0AZEJ55q316sl6kno4zvx/Aj3DFbng2UjZLH2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f084f3be38aa061091b242540f7383b9007408583884346f974c3060959048b1","last_reissued_at":"2026-05-18T00:27:19.068616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:19.068616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01317","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:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dfw6xZF2zwjcW3+wch0ZuSt/pT3yvBjasHw7mopUc641D8uwRqN1ibMXscreJwuYeOo87nYYcnMxaUlU16CsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:30:44.854047Z"},"content_sha256":"f9da6a195b94daf0071289bce3ebcc710b1961e73190fc966c23b438f31e80e8","schema_version":"1.0","event_id":"sha256:f9da6a195b94daf0071289bce3ebcc710b1961e73190fc966c23b438f31e80e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6CCPHPRYVIDBBENSIJKA644DXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unification and Generalization of Exact Distributed First Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic","submitted_at":"2017-09-05T09:58:47Z","abstract_excerpt":"Recently, there has been significant progress in the development of distributed first order methods. (At least) two different types of methods, designed from very different perspectives, have been proposed that achieve both exact and linear convergence when a constant step size is used -- a favorable feature that was not achievable by most prior methods. In this paper, we unify, generalize, and improve convergence speed of these exact distributed first order methods. We first carry out a novel unifying analysis that sheds light on how the different existing methods compare. The analysis reveal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01317","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:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVZxO3Lt/PDVMyDMWFqXlSTB2HMGHGgyxTozgUYyKDSif9l56M33QRtWviST8+XKGvKxfpjzQxMuKl5uxc2PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:30:44.854818Z"},"content_sha256":"ce81cd8a1924f21696c0314e7476e1710458e989c1860f5741e37985af80c7ec","schema_version":"1.0","event_id":"sha256:ce81cd8a1924f21696c0314e7476e1710458e989c1860f5741e37985af80c7ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CCPHPRYVIDBBENSIJKA644DXE/bundle.json","state_url":"https://pith.science/pith/6CCPHPRYVIDBBENSIJKA644DXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CCPHPRYVIDBBENSIJKA644DXE/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-20T05:30:44Z","links":{"resolver":"https://pith.science/pith/6CCPHPRYVIDBBENSIJKA644DXE","bundle":"https://pith.science/pith/6CCPHPRYVIDBBENSIJKA644DXE/bundle.json","state":"https://pith.science/pith/6CCPHPRYVIDBBENSIJKA644DXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CCPHPRYVIDBBENSIJKA644DXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6CCPHPRYVIDBBENSIJKA644DXE","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":"f375245e745b80220b6f73590112f993b50dbc3b395282080f9da0352dd19246","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:58:47Z","title_canon_sha256":"b9a1b0ff6515e0f97b58e55dc5616e8f23f3e570e803e2c06026dbd85f44f85b"},"schema_version":"1.0","source":{"id":"1709.01317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01317","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01317v2","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01317","created_at":"2026-05-18T00:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"6CCPHPRYVIDB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6CCPHPRYVIDBBENS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6CCPHPRY","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:ce81cd8a1924f21696c0314e7476e1710458e989c1860f5741e37985af80c7ec","target":"graph","created_at":"2026-05-18T00:27:19Z","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":"Recently, there has been significant progress in the development of distributed first order methods. (At least) two different types of methods, designed from very different perspectives, have been proposed that achieve both exact and linear convergence when a constant step size is used -- a favorable feature that was not achievable by most prior methods. In this paper, we unify, generalize, and improve convergence speed of these exact distributed first order methods. We first carry out a novel unifying analysis that sheds light on how the different existing methods compare. The analysis reveal","authors_text":"Dusan Jakovetic","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:58:47Z","title":"A Unification and Generalization of Exact Distributed First Order Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01317","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:f9da6a195b94daf0071289bce3ebcc710b1961e73190fc966c23b438f31e80e8","target":"record","created_at":"2026-05-18T00:27:19Z","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":"f375245e745b80220b6f73590112f993b50dbc3b395282080f9da0352dd19246","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:58:47Z","title_canon_sha256":"b9a1b0ff6515e0f97b58e55dc5616e8f23f3e570e803e2c06026dbd85f44f85b"},"schema_version":"1.0","source":{"id":"1709.01317","kind":"arxiv","version":2}},"canonical_sha256":"f084f3be38aa061091b242540f7383b9007408583884346f974c3060959048b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f084f3be38aa061091b242540f7383b9007408583884346f974c3060959048b1","first_computed_at":"2026-05-18T00:27:19.068616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:19.068616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zgxsj8s7uLP5dG3fRh52ed76SVbGME+9bgiz49NebW0Y4he0AZEJ55q316sl6kno4zvx/Aj3DFbng2UjZLH2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:19.069087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9da6a195b94daf0071289bce3ebcc710b1961e73190fc966c23b438f31e80e8","sha256:ce81cd8a1924f21696c0314e7476e1710458e989c1860f5741e37985af80c7ec"],"state_sha256":"cedfc410080c95bd1954f5dedca2229b70b45f10c198443b13cfebc529d59376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RFsfPxULD3A/JQN9u5ITcix860+RqGZIueCaND7Ivcv1PY27GWEwx1ZVFt4UePYPfigDSNq8DvWH14lUXIMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T05:30:44.859411Z","bundle_sha256":"00e080063a612f8c212f96a1d9716131d30a281d6c233f68ae6a86100c295ca7"}}