{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OM7CJYVMVKEVACZFA6SYTHEOEK","short_pith_number":"pith:OM7CJYVM","canonical_record":{"source":{"id":"2503.11104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-14T05:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"4324e1f324cdb687d2f58efc2b001ec494dfd029010a42e5a74d0083e8e96e85","abstract_canon_sha256":"049affd5ba762790971f9648400f5eb33a1d0e23a99f74e388c289ea886cbfea"},"schema_version":"1.0"},"canonical_sha256":"733e24e2acaa89500b2507a5899c8e2288e055cdaf2c0d8baec12c950b6b4f67","source":{"kind":"arxiv","id":"2503.11104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11104","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11104v2","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11104","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_12","alias_value":"OM7CJYVMVKEV","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"OM7CJYVMVKEVACZF","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"OM7CJYVM","created_at":"2026-07-05T11:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OM7CJYVMVKEVACZFA6SYTHEOEK","target":"record","payload":{"canonical_record":{"source":{"id":"2503.11104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-14T05:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"4324e1f324cdb687d2f58efc2b001ec494dfd029010a42e5a74d0083e8e96e85","abstract_canon_sha256":"049affd5ba762790971f9648400f5eb33a1d0e23a99f74e388c289ea886cbfea"},"schema_version":"1.0"},"canonical_sha256":"733e24e2acaa89500b2507a5899c8e2288e055cdaf2c0d8baec12c950b6b4f67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:21.413975Z","signature_b64":"Y2ywM2pNzFCGiLZK9HDAJy0808NTgDTVwT+SgA5q311nmiKFtZ6dBwiLDbfmnXhClkSdjkNsdjWlR/dqMkasBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"733e24e2acaa89500b2507a5899c8e2288e055cdaf2c0d8baec12c950b6b4f67","last_reissued_at":"2026-07-05T11:33:21.413489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:21.413489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.11104","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-07-05T11:33:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGvTWz7MSpwpy1Xv6MJ2SpKkoSwPZYPZTQ+oS/eohCWfovVrJPRx0ddZLA4sYehhKDHqLMkfmDcNDZk8Ve05BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:50:00.744197Z"},"content_sha256":"283763b0ecc66fbf08897937528cb03e4589877e0816017ecc44343b4b2c9086","schema_version":"1.0","event_id":"sha256:283763b0ecc66fbf08897937528cb03e4589877e0816017ecc44343b4b2c9086"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OM7CJYVMVKEVACZFA6SYTHEOEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis of EXTRA in Non-convex Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lei Qin, Ye Pu","submitted_at":"2025-03-14T05:50:31Z","abstract_excerpt":"Optimization problems involving the minimization of a finite sum of smooth, possibly non-convex functions arise in numerous applications. To achieve a consensus solution over a network, distributed optimization algorithms, such as \\textbf{EXTRA} (decentralized exact first-order algorithm), have been proposed to address these challenges. In this paper, we analyze the convergence properties of \\textbf{EXTRA} in the context of smooth, non-convex optimization. By interpreting its updates as a nonlinear dynamical system, we show novel insights into its convergence properties. Specifically, i) \\text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11104","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.11104/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-05T11:33:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9ldQVe6oAVJO0kpnz3lnysq09ickOnPnVwcCzZ7byOtrqm6CTzqTxPsfr+Q1J7lDSh49jNPKUfHtJzapkkjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:50:00.745135Z"},"content_sha256":"99d6062eda96e528aaa7f01d71aa3fb65ea636e1b42565899aabd3cb9825b8f1","schema_version":"1.0","event_id":"sha256:99d6062eda96e528aaa7f01d71aa3fb65ea636e1b42565899aabd3cb9825b8f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/bundle.json","state_url":"https://pith.science/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/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-08-08T11:50:00Z","links":{"resolver":"https://pith.science/pith/OM7CJYVMVKEVACZFA6SYTHEOEK","bundle":"https://pith.science/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/bundle.json","state":"https://pith.science/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM7CJYVMVKEVACZFA6SYTHEOEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OM7CJYVMVKEVACZFA6SYTHEOEK","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":"049affd5ba762790971f9648400f5eb33a1d0e23a99f74e388c289ea886cbfea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-14T05:50:31Z","title_canon_sha256":"4324e1f324cdb687d2f58efc2b001ec494dfd029010a42e5a74d0083e8e96e85"},"schema_version":"1.0","source":{"id":"2503.11104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11104","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11104v2","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11104","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_12","alias_value":"OM7CJYVMVKEV","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"OM7CJYVMVKEVACZF","created_at":"2026-07-05T11:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"OM7CJYVM","created_at":"2026-07-05T11:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:99d6062eda96e528aaa7f01d71aa3fb65ea636e1b42565899aabd3cb9825b8f1","target":"graph","created_at":"2026-07-05T11:33:21Z","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/2503.11104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimization problems involving the minimization of a finite sum of smooth, possibly non-convex functions arise in numerous applications. To achieve a consensus solution over a network, distributed optimization algorithms, such as \\textbf{EXTRA} (decentralized exact first-order algorithm), have been proposed to address these challenges. In this paper, we analyze the convergence properties of \\textbf{EXTRA} in the context of smooth, non-convex optimization. By interpreting its updates as a nonlinear dynamical system, we show novel insights into its convergence properties. Specifically, i) \\text","authors_text":"Lei Qin, Ye Pu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-14T05:50:31Z","title":"Convergence Analysis of EXTRA in Non-convex Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11104","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:283763b0ecc66fbf08897937528cb03e4589877e0816017ecc44343b4b2c9086","target":"record","created_at":"2026-07-05T11:33:21Z","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":"049affd5ba762790971f9648400f5eb33a1d0e23a99f74e388c289ea886cbfea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-14T05:50:31Z","title_canon_sha256":"4324e1f324cdb687d2f58efc2b001ec494dfd029010a42e5a74d0083e8e96e85"},"schema_version":"1.0","source":{"id":"2503.11104","kind":"arxiv","version":2}},"canonical_sha256":"733e24e2acaa89500b2507a5899c8e2288e055cdaf2c0d8baec12c950b6b4f67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"733e24e2acaa89500b2507a5899c8e2288e055cdaf2c0d8baec12c950b6b4f67","first_computed_at":"2026-07-05T11:33:21.413489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:21.413489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2ywM2pNzFCGiLZK9HDAJy0808NTgDTVwT+SgA5q311nmiKFtZ6dBwiLDbfmnXhClkSdjkNsdjWlR/dqMkasBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:21.413975Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.11104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:283763b0ecc66fbf08897937528cb03e4589877e0816017ecc44343b4b2c9086","sha256:99d6062eda96e528aaa7f01d71aa3fb65ea636e1b42565899aabd3cb9825b8f1"],"state_sha256":"fc7b0925000efa7ed0cd4c3d32b20fb64902ec1c601e6759c66202e385b76eb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4P9NfPXQViNczxBHbXmVBNPaJNdswSguVGO2a7pwh5Zw2ng63ByTRZyS1S6cnh1N0EnLiAfmgexL7dm5mHpODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:50:00.751835Z","bundle_sha256":"a4d446f95c1489e420cc2bd85a5c08893f9d73fe7ae0d002c7980b67371e78e6"}}