{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:I3ZJDKPJCEMV43WFYP2TOBYA2X","short_pith_number":"pith:I3ZJDKPJ","canonical_record":{"source":{"id":"1901.06995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-21T16:43:31Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"8b6f66984e1541773bf1348c6cceef16f4cfd349aa129debfb3c4381d1c88f00","abstract_canon_sha256":"debb63a22c13ce00b482e3ded96fd58e278070ce84004202d6c678bd5153a37f"},"schema_version":"1.0"},"canonical_sha256":"46f291a9e911195e6ec5c3f5370700d5f2ba3f1b2c61c7b5c8143e5985002804","source":{"kind":"arxiv","id":"1901.06995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06995","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06995v1","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06995","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"I3ZJDKPJCEMV","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"I3ZJDKPJCEMV43WF","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"I3ZJDKPJ","created_at":"2026-07-05T00:01:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:I3ZJDKPJCEMV43WFYP2TOBYA2X","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-21T16:43:31Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"8b6f66984e1541773bf1348c6cceef16f4cfd349aa129debfb3c4381d1c88f00","abstract_canon_sha256":"debb63a22c13ce00b482e3ded96fd58e278070ce84004202d6c678bd5153a37f"},"schema_version":"1.0"},"canonical_sha256":"46f291a9e911195e6ec5c3f5370700d5f2ba3f1b2c61c7b5c8143e5985002804","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:39.262864Z","signature_b64":"CyrwupFCmGGe0UvOLilIB95MQdx/y4RFURa2HyAQ/GBFEZbq7auf6zzrcYha/+96tW2R06yaAHq6I3y6hJDAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f291a9e911195e6ec5c3f5370700d5f2ba3f1b2c61c7b5c8143e5985002804","last_reissued_at":"2026-07-05T00:01:39.262296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:39.262296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06995","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-07-05T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+2gvPg0FX3MMDdAKTcBYIkhRcBmLst0R/zDHICIbyBl7UERNjTspEMuRY5cyXYJA8NM4Dkx06lqyOepjnk/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T16:21:25.114788Z"},"content_sha256":"d46de6cc2baee6ea2caa05ece960088babbcd1b767e0b89fc6ed6f108686a4a3","schema_version":"1.0","event_id":"sha256:d46de6cc2baee6ea2caa05ece960088babbcd1b767e0b89fc6ed6f108686a4a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:I3ZJDKPJCEMV43WFYP2TOBYA2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Nesterov gradient methods over arbitrary graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dusan Jakovetic, Ran Xin, Usman A. Khan","submitted_at":"2019-01-21T16:43:31Z","abstract_excerpt":"In this letter, we introduce a distributed Nesterov method, termed as $\\mathcal{ABN}$, that does not require doubly-stochastic weight matrices. Instead, the implementation is based on a simultaneous application of both row- and column-stochastic weights that makes this method applicable to arbitrary (strongly-connected) graphs. Since constructing column-stochastic weights needs additional information (the number of outgoing neighbors at each agent), not available in certain communication protocols, we derive a variation, termed as FROZEN, that only requires row-stochastic weights but at the ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06995","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.06995/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4l4WqjZtAut3ha5pxdnJIvJJUC44GgIYbasQc4mkKXpgJewPfpkDRPZJAcqaYe8ZkW73oBqF6WH0hbUt+ImWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T16:21:25.115173Z"},"content_sha256":"fe501a8cdb6a7f16ee2903d57ed692f3ab6af00a0064d8faa1f51e80fa0d83ef","schema_version":"1.0","event_id":"sha256:fe501a8cdb6a7f16ee2903d57ed692f3ab6af00a0064d8faa1f51e80fa0d83ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/bundle.json","state_url":"https://pith.science/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/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-07-22T16:21:25Z","links":{"resolver":"https://pith.science/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X","bundle":"https://pith.science/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/bundle.json","state":"https://pith.science/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3ZJDKPJCEMV43WFYP2TOBYA2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:I3ZJDKPJCEMV43WFYP2TOBYA2X","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":"debb63a22c13ce00b482e3ded96fd58e278070ce84004202d6c678bd5153a37f","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-21T16:43:31Z","title_canon_sha256":"8b6f66984e1541773bf1348c6cceef16f4cfd349aa129debfb3c4381d1c88f00"},"schema_version":"1.0","source":{"id":"1901.06995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06995","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06995v1","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06995","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"I3ZJDKPJCEMV","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"I3ZJDKPJCEMV43WF","created_at":"2026-07-05T00:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"I3ZJDKPJ","created_at":"2026-07-05T00:01:39Z"}],"graph_snapshots":[{"event_id":"sha256:fe501a8cdb6a7f16ee2903d57ed692f3ab6af00a0064d8faa1f51e80fa0d83ef","target":"graph","created_at":"2026-07-05T00:01:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.06995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this letter, we introduce a distributed Nesterov method, termed as $\\mathcal{ABN}$, that does not require doubly-stochastic weight matrices. Instead, the implementation is based on a simultaneous application of both row- and column-stochastic weights that makes this method applicable to arbitrary (strongly-connected) graphs. Since constructing column-stochastic weights needs additional information (the number of outgoing neighbors at each agent), not available in certain communication protocols, we derive a variation, termed as FROZEN, that only requires row-stochastic weights but at the ex","authors_text":"Dusan Jakovetic, Ran Xin, Usman A. Khan","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-21T16:43:31Z","title":"Distributed Nesterov gradient methods over arbitrary graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06995","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:d46de6cc2baee6ea2caa05ece960088babbcd1b767e0b89fc6ed6f108686a4a3","target":"record","created_at":"2026-07-05T00:01:39Z","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":"debb63a22c13ce00b482e3ded96fd58e278070ce84004202d6c678bd5153a37f","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-21T16:43:31Z","title_canon_sha256":"8b6f66984e1541773bf1348c6cceef16f4cfd349aa129debfb3c4381d1c88f00"},"schema_version":"1.0","source":{"id":"1901.06995","kind":"arxiv","version":1}},"canonical_sha256":"46f291a9e911195e6ec5c3f5370700d5f2ba3f1b2c61c7b5c8143e5985002804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46f291a9e911195e6ec5c3f5370700d5f2ba3f1b2c61c7b5c8143e5985002804","first_computed_at":"2026-07-05T00:01:39.262296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:39.262296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CyrwupFCmGGe0UvOLilIB95MQdx/y4RFURa2HyAQ/GBFEZbq7auf6zzrcYha/+96tW2R06yaAHq6I3y6hJDAAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:39.262864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d46de6cc2baee6ea2caa05ece960088babbcd1b767e0b89fc6ed6f108686a4a3","sha256:fe501a8cdb6a7f16ee2903d57ed692f3ab6af00a0064d8faa1f51e80fa0d83ef"],"state_sha256":"c6e1b24c3bf5fdd82ea21090caf046dbe8a2b03a267e6784891cd083b991669c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zck2QOn1DLWtvGGJV9hZFtVPULqTXqqDayzikd+lgHGBDv4H51HnOKYs02TdxPeHCXudnIpwDsqszO+JZK96Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T16:21:25.117412Z","bundle_sha256":"7aca533073ea99542ea7fc59b347a453d9133786f80297c3daf3742bb7e4ec45"}}