{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MEJ4XNFCER5CGOGGHS77BBQJMH","short_pith_number":"pith:MEJ4XNFC","canonical_record":{"source":{"id":"1802.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-25T01:59:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8362feaef563bc0ffcaefa6e53cfda495e1ceec6be8f72bbe2f54bae203b303e","abstract_canon_sha256":"a377aae2b922c089994e212c7bec8d44ad3ca2d862a46e46f0b2b84366a454e6"},"schema_version":"1.0"},"canonical_sha256":"6113cbb4a2247a2338c63cbff0860961d5c3af1d40ae17d5aaf4c8693ca65d5a","source":{"kind":"arxiv","id":"1802.08941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08941","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08941v1","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08941","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"MEJ4XNFCER5C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MEJ4XNFCER5CGOGG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MEJ4XNFC","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MEJ4XNFCER5CGOGGHS77BBQJMH","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-25T01:59:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8362feaef563bc0ffcaefa6e53cfda495e1ceec6be8f72bbe2f54bae203b303e","abstract_canon_sha256":"a377aae2b922c089994e212c7bec8d44ad3ca2d862a46e46f0b2b84366a454e6"},"schema_version":"1.0"},"canonical_sha256":"6113cbb4a2247a2338c63cbff0860961d5c3af1d40ae17d5aaf4c8693ca65d5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:35.986031Z","signature_b64":"mkBfiDcDof3LPdx71m8zU7+ZmvhXtzba+OIGwM1YmPiA24Y+I+Ge0sga2A26ndfJM5oJlg/88jc/SEWuecUCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6113cbb4a2247a2338c63cbff0860961d5c3af1d40ae17d5aaf4c8693ca65d5a","last_reissued_at":"2026-05-18T00:22:35.985371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:35.985371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08941","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-18T00:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kfe/+j9BtCJ+YCMBZAmgMdPZMbe+enVv/t3P25ZlQyByl5UFJfgqAPU7+zBKkojCSH7sGAbpGNvJPLKVmwjNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:10:27.483033Z"},"content_sha256":"49aeb3a5a979b550aedbdfb7888ec1fc988a26d20a52504e6b9de45a3ce0bfd7","schema_version":"1.0","event_id":"sha256:49aeb3a5a979b550aedbdfb7888ec1fc988a26d20a52504e6b9de45a3ce0bfd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MEJ4XNFCER5CGOGGHS77BBQJMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solutions for Nonconvex Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Jason D. Lee, Meisam Razaviyayn, Mingyi Hong","submitted_at":"2018-02-25T01:59:05Z","abstract_excerpt":"In this work, we study two first-order primal-dual based algorithms, the Gradient Primal-Dual Algorithm (GPDA) and the Gradient Alternating Direction Method of Multipliers (GADMM), for solving a class of linearly constrained non-convex optimization problems. We show that with random initialization of the primal and dual variables, both algorithms are able to compute second-order stationary solutions (ss2) with probability one. This is the first result showing that primal-dual algorithm is capable of finding ss2 when only using first-order information, it also extends the existing results for f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08941","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-18T00:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2kQlOd/tNJSnxmqELw4qvg3Jb1JqF4NXKl/MkZvikL/faIvwXmmIjv8qorf9qkZe+6maYvgW3G406AdV+JAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:10:27.483414Z"},"content_sha256":"250a08032872c3c1667270a7ce0645bad12f19e0444f80db53545e0ba1e48702","schema_version":"1.0","event_id":"sha256:250a08032872c3c1667270a7ce0645bad12f19e0444f80db53545e0ba1e48702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/bundle.json","state_url":"https://pith.science/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/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-30T13:10:27Z","links":{"resolver":"https://pith.science/pith/MEJ4XNFCER5CGOGGHS77BBQJMH","bundle":"https://pith.science/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/bundle.json","state":"https://pith.science/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEJ4XNFCER5CGOGGHS77BBQJMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MEJ4XNFCER5CGOGGHS77BBQJMH","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":"a377aae2b922c089994e212c7bec8d44ad3ca2d862a46e46f0b2b84366a454e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-25T01:59:05Z","title_canon_sha256":"8362feaef563bc0ffcaefa6e53cfda495e1ceec6be8f72bbe2f54bae203b303e"},"schema_version":"1.0","source":{"id":"1802.08941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08941","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08941v1","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08941","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"MEJ4XNFCER5C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MEJ4XNFCER5CGOGG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MEJ4XNFC","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:250a08032872c3c1667270a7ce0645bad12f19e0444f80db53545e0ba1e48702","target":"graph","created_at":"2026-05-18T00:22:35Z","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 work, we study two first-order primal-dual based algorithms, the Gradient Primal-Dual Algorithm (GPDA) and the Gradient Alternating Direction Method of Multipliers (GADMM), for solving a class of linearly constrained non-convex optimization problems. We show that with random initialization of the primal and dual variables, both algorithms are able to compute second-order stationary solutions (ss2) with probability one. This is the first result showing that primal-dual algorithm is capable of finding ss2 when only using first-order information, it also extends the existing results for f","authors_text":"Jason D. Lee, Meisam Razaviyayn, Mingyi Hong","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-25T01:59:05Z","title":"Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solutions for Nonconvex Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08941","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:49aeb3a5a979b550aedbdfb7888ec1fc988a26d20a52504e6b9de45a3ce0bfd7","target":"record","created_at":"2026-05-18T00:22:35Z","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":"a377aae2b922c089994e212c7bec8d44ad3ca2d862a46e46f0b2b84366a454e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-25T01:59:05Z","title_canon_sha256":"8362feaef563bc0ffcaefa6e53cfda495e1ceec6be8f72bbe2f54bae203b303e"},"schema_version":"1.0","source":{"id":"1802.08941","kind":"arxiv","version":1}},"canonical_sha256":"6113cbb4a2247a2338c63cbff0860961d5c3af1d40ae17d5aaf4c8693ca65d5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6113cbb4a2247a2338c63cbff0860961d5c3af1d40ae17d5aaf4c8693ca65d5a","first_computed_at":"2026-05-18T00:22:35.985371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:35.985371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mkBfiDcDof3LPdx71m8zU7+ZmvhXtzba+OIGwM1YmPiA24Y+I+Ge0sga2A26ndfJM5oJlg/88jc/SEWuecUCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:35.986031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49aeb3a5a979b550aedbdfb7888ec1fc988a26d20a52504e6b9de45a3ce0bfd7","sha256:250a08032872c3c1667270a7ce0645bad12f19e0444f80db53545e0ba1e48702"],"state_sha256":"f4e0672dfb32ac13c0aff3c78857aae06d032307c778a38cf9850d47086749fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fxehJ+tX2qyIiwsVRLknShLP6n8/CGCKKY409kfPygTahUVd2FxXDm2Leo7S69xHSQmVHp+GQyOWqD7cSW+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:10:27.486625Z","bundle_sha256":"0ec79f34dd77c61a11dcd7c8ae50ce3d05c348ec2f7ec50be01fd37949ac19f8"}}