{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N4IT4WIKEXVYEVLAXNEK2DE3YM","short_pith_number":"pith:N4IT4WIK","canonical_record":{"source":{"id":"1809.08709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-24T00:41:05Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"7652bf27f722e7c366a728eba0bc0c7191fa6330838572aee469fb38bf3da645","abstract_canon_sha256":"0551cc56ab90b14e1b9f153586d08c948d28f12d3cc1757875ca9b8251324975"},"schema_version":"1.0"},"canonical_sha256":"6f113e590a25eb825560bb48ad0c9bc31477ba5440a8f9688d8c28eac5d5ce70","source":{"kind":"arxiv","id":"1809.08709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08709","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08709v2","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08709","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"N4IT4WIKEXVY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4IT4WIKEXVYEVLA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4IT4WIK","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N4IT4WIKEXVYEVLAXNEK2DE3YM","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-24T00:41:05Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"7652bf27f722e7c366a728eba0bc0c7191fa6330838572aee469fb38bf3da645","abstract_canon_sha256":"0551cc56ab90b14e1b9f153586d08c948d28f12d3cc1757875ca9b8251324975"},"schema_version":"1.0"},"canonical_sha256":"6f113e590a25eb825560bb48ad0c9bc31477ba5440a8f9688d8c28eac5d5ce70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.547777Z","signature_b64":"ziyFt3kqyKBpCDzPiEBsJn96fH1utmxMcNLDLvg6uQsZ4ggdmVJzKVjdFzDJeEwCLbZg67fpfZjjacxqeFcbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f113e590a25eb825560bb48ad0c9bc31477ba5440a8f9688d8c28eac5d5ce70","last_reissued_at":"2026-05-17T23:40:41.547243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.547243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08709","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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXCG/7hOyEKYAuOgfnhKv+qS0QSEEC4bTPSeKBbqiIohoP/UAEjmZD5/jI0weP7/rZ4CDvhgBReyqYzNggXoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:18.189871Z"},"content_sha256":"2c1d9e579a42857ec5c069a5183fc678cc805e1fce73f97273378280da9d17ae","schema_version":"1.0","event_id":"sha256:2c1d9e579a42857ec5c069a5183fc678cc805e1fce73f97273378280da9d17ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N4IT4WIKEXVYEVLAXNEK2DE3YM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Canonical Form for First-Order Distributed Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Akhil Sundararajan, Bryan Van Scoy, Laurent Lessard","submitted_at":"2018-09-24T00:41:05Z","abstract_excerpt":"We consider the distributed optimization problem in which a network of agents aims to minimize the average of local functions. To solve this problem, several algorithms have recently been proposed where agents perform various combinations of communication with neighbors, local gradient computations, and updates to local state variables. In this paper, we present a canonical form that characterizes any first-order distributed algorithm that can be implemented using a single round of communication and gradient computation per iteration, and where each agent stores up to two state variables. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08709","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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nA7cDwQ7FiqKkC6jPL4UeVPKfGlkZaVN5UkseBPTMmY9X1ilUQ0jSlXzaaYzTyEJLdEJd+c9+TXNG/ATxZA5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:18.190465Z"},"content_sha256":"6c78aaefde146e4f93a5f4c208351de2732074c9a96c372776d7f7e79537ff19","schema_version":"1.0","event_id":"sha256:6c78aaefde146e4f93a5f4c208351de2732074c9a96c372776d7f7e79537ff19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/bundle.json","state_url":"https://pith.science/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/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-27T01:00:18Z","links":{"resolver":"https://pith.science/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM","bundle":"https://pith.science/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/bundle.json","state":"https://pith.science/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4IT4WIKEXVYEVLAXNEK2DE3YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N4IT4WIKEXVYEVLAXNEK2DE3YM","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":"0551cc56ab90b14e1b9f153586d08c948d28f12d3cc1757875ca9b8251324975","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-24T00:41:05Z","title_canon_sha256":"7652bf27f722e7c366a728eba0bc0c7191fa6330838572aee469fb38bf3da645"},"schema_version":"1.0","source":{"id":"1809.08709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08709","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08709v2","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08709","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"N4IT4WIKEXVY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4IT4WIKEXVYEVLA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4IT4WIK","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:6c78aaefde146e4f93a5f4c208351de2732074c9a96c372776d7f7e79537ff19","target":"graph","created_at":"2026-05-17T23:40:41Z","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 the distributed optimization problem in which a network of agents aims to minimize the average of local functions. To solve this problem, several algorithms have recently been proposed where agents perform various combinations of communication with neighbors, local gradient computations, and updates to local state variables. In this paper, we present a canonical form that characterizes any first-order distributed algorithm that can be implemented using a single round of communication and gradient computation per iteration, and where each agent stores up to two state variables. The ","authors_text":"Akhil Sundararajan, Bryan Van Scoy, Laurent Lessard","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-24T00:41:05Z","title":"A Canonical Form for First-Order Distributed Optimization Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08709","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:2c1d9e579a42857ec5c069a5183fc678cc805e1fce73f97273378280da9d17ae","target":"record","created_at":"2026-05-17T23:40:41Z","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":"0551cc56ab90b14e1b9f153586d08c948d28f12d3cc1757875ca9b8251324975","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-24T00:41:05Z","title_canon_sha256":"7652bf27f722e7c366a728eba0bc0c7191fa6330838572aee469fb38bf3da645"},"schema_version":"1.0","source":{"id":"1809.08709","kind":"arxiv","version":2}},"canonical_sha256":"6f113e590a25eb825560bb48ad0c9bc31477ba5440a8f9688d8c28eac5d5ce70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f113e590a25eb825560bb48ad0c9bc31477ba5440a8f9688d8c28eac5d5ce70","first_computed_at":"2026-05-17T23:40:41.547243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:41.547243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ziyFt3kqyKBpCDzPiEBsJn96fH1utmxMcNLDLvg6uQsZ4ggdmVJzKVjdFzDJeEwCLbZg67fpfZjjacxqeFcbCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:41.547777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c1d9e579a42857ec5c069a5183fc678cc805e1fce73f97273378280da9d17ae","sha256:6c78aaefde146e4f93a5f4c208351de2732074c9a96c372776d7f7e79537ff19"],"state_sha256":"5e21b834b675911ea2b3dd96c23bacab4c950e35de67c4cbb9c660b33bf1b536"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMn9lrjeyPYOo130gTCFcmCt9uyM6hkW6XcGgNlsVyOoexx2v/X6j+zuNK5lMWwv3vOwjKDfgtuKD5G5iCNjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:00:18.192940Z","bundle_sha256":"2863846d0fa95221a8e3d28644c7099b31b2df7df100971cddc0dbff4df11629"}}