{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JGXI4XBSHALRFW5UQQLLBIKU4U","short_pith_number":"pith:JGXI4XBS","schema_version":"1.0","canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","source":{"kind":"arxiv","id":"1903.07258","version":1},"attestation_state":"computed","paper":{"title":"Annealing for Distributed Global Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Brian Swenson, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","submitted_at":"2019-03-18T05:16:37Z","abstract_excerpt":"The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to communicate over a time-varying undirected graph. Each agent is assumed to possess a local objective function (assumed to be smooth, but possibly nonconvex). The paper considers algorithms for optimizing the sum function. A distributed algorithm of the consensus+innovations type is proposed which relies on first-order information at the agent level. Under appropriate conditions on network connectivity and the cost objectiv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.07258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T05:16:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7b8e779477588b1234b62fdeba74a8fda3b68e59b611d364d5a7d1321bd6be2e","abstract_canon_sha256":"8976cca4d24a269986a67658a8198e9628b71840239cbdff1fa46bf17828960f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:03.798396Z","signature_b64":"JBLOqc59/TgzMFXGuzQJ1fZxRw4BI9lBpg7oIpQU0GlTHpEWGRnNbgBFbnuw7SAziZbmjA2cQ6pInv+bi+rAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","last_reissued_at":"2026-05-17T23:51:03.797767Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:03.797767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Annealing for Distributed Global Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Brian Swenson, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","submitted_at":"2019-03-18T05:16:37Z","abstract_excerpt":"The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to communicate over a time-varying undirected graph. Each agent is assumed to possess a local objective function (assumed to be smooth, but possibly nonconvex). The paper considers algorithms for optimizing the sum function. A distributed algorithm of the consensus+innovations type is proposed which relies on first-order information at the agent level. Under appropriate conditions on network connectivity and the cost objectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07258","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.07258","created_at":"2026-05-17T23:51:03.797857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07258v1","created_at":"2026-05-17T23:51:03.797857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07258","created_at":"2026-05-17T23:51:03.797857+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGXI4XBSHALR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGXI4XBSHALRFW5U","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGXI4XBS","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.01848","citing_title":"Distributed Learning in Non-Convex Environments -- Part I: Agreement at a Linear Rate","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01849","citing_title":"Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Points","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08802","citing_title":"Distributed Global Optimization by Annealing","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U","json":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U.json","graph_json":"https://pith.science/api/pith-number/JGXI4XBSHALRFW5UQQLLBIKU4U/graph.json","events_json":"https://pith.science/api/pith-number/JGXI4XBSHALRFW5UQQLLBIKU4U/events.json","paper":"https://pith.science/paper/JGXI4XBS"},"agent_actions":{"view_html":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U","download_json":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U.json","view_paper":"https://pith.science/paper/JGXI4XBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07258&json=true","fetch_graph":"https://pith.science/api/pith-number/JGXI4XBSHALRFW5UQQLLBIKU4U/graph.json","fetch_events":"https://pith.science/api/pith-number/JGXI4XBSHALRFW5UQQLLBIKU4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/action/storage_attestation","attest_author":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/action/author_attestation","sign_citation":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/action/citation_signature","submit_replication":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/action/replication_record"}},"created_at":"2026-05-17T23:51:03.797857+00:00","updated_at":"2026-05-17T23:51:03.797857+00:00"}