{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SZMPYNXEZRGKA4WSTJ6SHLMCLD","short_pith_number":"pith:SZMPYNXE","canonical_record":{"source":{"id":"1809.08694","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-23T23:06:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"dca32a012b81bc12ae10dbbf3583be4d3cd3bc350d245483d9491206319a62c3","abstract_canon_sha256":"a1a8dd09e79f44c23f4817088070acb3ba00597426c1a04c629fcff8555abf44"},"schema_version":"1.0"},"canonical_sha256":"9658fc36e4cc4ca072d29a7d23ad8258cbd683dfdb9a98537952c5f4fa401b10","source":{"kind":"arxiv","id":"1809.08694","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08694","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08694v5","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08694","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"SZMPYNXEZRGK","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_16","alias_value":"SZMPYNXEZRGKA4WS","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_8","alias_value":"SZMPYNXE","created_at":"2026-07-05T01:05:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SZMPYNXEZRGKA4WSTJ6SHLMCLD","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08694","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-23T23:06:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"dca32a012b81bc12ae10dbbf3583be4d3cd3bc350d245483d9491206319a62c3","abstract_canon_sha256":"a1a8dd09e79f44c23f4817088070acb3ba00597426c1a04c629fcff8555abf44"},"schema_version":"1.0"},"canonical_sha256":"9658fc36e4cc4ca072d29a7d23ad8258cbd683dfdb9a98537952c5f4fa401b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:22.788996Z","signature_b64":"TFJfzj7U2qS9VExRzRV27PaeNYksu7g/kg2AGGqTgZVW4YuDXBvowBs7u/VfY1VvaKfG5Iz9fpNoFH6QU/IsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9658fc36e4cc4ca072d29a7d23ad8258cbd683dfdb9a98537952c5f4fa401b10","last_reissued_at":"2026-07-05T01:05:22.788491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:22.788491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08694","source_version":5,"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-05T01:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnCLUiwy6lHZLTNN5uTc9yxsay85o3OsONQuVYtD9iaRG7ag7CzFza+RuVQqAoBaAzKLawz+macKRNIZ6/JNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:42:08.122021Z"},"content_sha256":"5068f1a14e25acd5c0299fee92d06ae879c66a2380c6cead037593c339a3856d","schema_version":"1.0","event_id":"sha256:5068f1a14e25acd5c0299fee92d06ae879c66a2380c6cead037593c339a3856d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SZMPYNXEZRGKA4WSTJ6SHLMCLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-order Guarantees of Distributed Gradient Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Amir Daneshmand, Gesualdo Scutari, Vyacheslav Kungurtsev","submitted_at":"2018-09-23T23:06:39Z","abstract_excerpt":"We consider distributed smooth nonconvex unconstrained optimization over networks, modeled as a connected graph. We examine the behavior of distributed gradient-based algorithms near strict saddle points. Specifically, we establish that (i) the renowned Distributed Gradient Descent (DGD) algorithm likely converges to a neighborhood of a Second-order Stationary (SoS) solution; and (ii) the more recent class of distributed algorithms based on gradient tracking--implementable also over digraphs--likely converges to exact SoS solutions, thus avoiding (strict) saddle-points. Furthermore, new conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08694","kind":"arxiv","version":5},"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/1809.08694/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-05T01:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPG3wHdrZ+wu8mRbIxUL0wASwhsc8VrA5/ldSw4kOxj5MqtRbzHbCJ0EZ5969M3Wd1qy/6FTwHnEcSMV+PyNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:42:08.122420Z"},"content_sha256":"0a0646423ec8a2e16f2968c6dde0afac50a78480016bd14406bd32a121b056f3","schema_version":"1.0","event_id":"sha256:0a0646423ec8a2e16f2968c6dde0afac50a78480016bd14406bd32a121b056f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/bundle.json","state_url":"https://pith.science/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/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-06T20:42:08Z","links":{"resolver":"https://pith.science/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD","bundle":"https://pith.science/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/bundle.json","state":"https://pith.science/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZMPYNXEZRGKA4WSTJ6SHLMCLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SZMPYNXEZRGKA4WSTJ6SHLMCLD","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":"a1a8dd09e79f44c23f4817088070acb3ba00597426c1a04c629fcff8555abf44","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-23T23:06:39Z","title_canon_sha256":"dca32a012b81bc12ae10dbbf3583be4d3cd3bc350d245483d9491206319a62c3"},"schema_version":"1.0","source":{"id":"1809.08694","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08694","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08694v5","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08694","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"SZMPYNXEZRGK","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_16","alias_value":"SZMPYNXEZRGKA4WS","created_at":"2026-07-05T01:05:22Z"},{"alias_kind":"pith_short_8","alias_value":"SZMPYNXE","created_at":"2026-07-05T01:05:22Z"}],"graph_snapshots":[{"event_id":"sha256:0a0646423ec8a2e16f2968c6dde0afac50a78480016bd14406bd32a121b056f3","target":"graph","created_at":"2026-07-05T01:05:22Z","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/1809.08694/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider distributed smooth nonconvex unconstrained optimization over networks, modeled as a connected graph. We examine the behavior of distributed gradient-based algorithms near strict saddle points. Specifically, we establish that (i) the renowned Distributed Gradient Descent (DGD) algorithm likely converges to a neighborhood of a Second-order Stationary (SoS) solution; and (ii) the more recent class of distributed algorithms based on gradient tracking--implementable also over digraphs--likely converges to exact SoS solutions, thus avoiding (strict) saddle-points. Furthermore, new conver","authors_text":"Amir Daneshmand, Gesualdo Scutari, Vyacheslav Kungurtsev","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-23T23:06:39Z","title":"Second-order Guarantees of Distributed Gradient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08694","kind":"arxiv","version":5},"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:5068f1a14e25acd5c0299fee92d06ae879c66a2380c6cead037593c339a3856d","target":"record","created_at":"2026-07-05T01:05:22Z","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":"a1a8dd09e79f44c23f4817088070acb3ba00597426c1a04c629fcff8555abf44","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-23T23:06:39Z","title_canon_sha256":"dca32a012b81bc12ae10dbbf3583be4d3cd3bc350d245483d9491206319a62c3"},"schema_version":"1.0","source":{"id":"1809.08694","kind":"arxiv","version":5}},"canonical_sha256":"9658fc36e4cc4ca072d29a7d23ad8258cbd683dfdb9a98537952c5f4fa401b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9658fc36e4cc4ca072d29a7d23ad8258cbd683dfdb9a98537952c5f4fa401b10","first_computed_at":"2026-07-05T01:05:22.788491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:05:22.788491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TFJfzj7U2qS9VExRzRV27PaeNYksu7g/kg2AGGqTgZVW4YuDXBvowBs7u/VfY1VvaKfG5Iz9fpNoFH6QU/IsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:05:22.788996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08694","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5068f1a14e25acd5c0299fee92d06ae879c66a2380c6cead037593c339a3856d","sha256:0a0646423ec8a2e16f2968c6dde0afac50a78480016bd14406bd32a121b056f3"],"state_sha256":"e3991694fd6598845f31d36aa74d3e64444d63328531510688903774321a47d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmLw1M3/6iKnMA967OChucipTT2tSM74zMkVvTBynxFgO8e+VWKVaHhvz/QWPVaCd1t+TditVjXfd0nWvJqYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:42:08.124458Z","bundle_sha256":"21b710d5e6c51240577946ba360f223f2227012d2a2367aa8311fc41cfb6a04b"}}