{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JGXI4XBSHALRFW5UQQLLBIKU4U","short_pith_number":"pith:JGXI4XBS","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"},"canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","source":{"kind":"arxiv","id":"1903.07258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07258","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07258v1","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07258","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"JGXI4XBSHALR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGXI4XBSHALRFW5U","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGXI4XBS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JGXI4XBSHALRFW5UQQLLBIKU4U","target":"record","payload":{"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"},"canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","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"},"source_kind":"arxiv","source_id":"1903.07258","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-17T23:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHA4mdXrn1e7SSd39c6Qv+Xp9MGHveN76vop1F5VSIpnJEWFjCX70wnGOGlYT8GDghPfCG5SXUe+9fv+iba0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:10:35.577699Z"},"content_sha256":"d8c6d99a01621571398dcf3ac57852c44f3e20d949e3e09604dda719074b7217","schema_version":"1.0","event_id":"sha256:d8c6d99a01621571398dcf3ac57852c44f3e20d949e3e09604dda719074b7217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JGXI4XBSHALRFW5UQQLLBIKU4U","target":"graph","payload":{"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"},"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-17T23:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6hQTAUZxnr+Cu+Nv1wNkRDfUGDtHAaJMFKoVOQJVpauwRE6E2ceIcxz4KrlHhyhmgSLlajkrx0Drlr4J7G0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:10:35.578089Z"},"content_sha256":"c8c3927a8ad92e91d0bfc7d8bb1c5ebf176b515ed20a325a1ce4c6584ceba246","schema_version":"1.0","event_id":"sha256:c8c3927a8ad92e91d0bfc7d8bb1c5ebf176b515ed20a325a1ce4c6584ceba246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/bundle.json","state_url":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/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-26T17:10:35Z","links":{"resolver":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U","bundle":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/bundle.json","state":"https://pith.science/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGXI4XBSHALRFW5UQQLLBIKU4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JGXI4XBSHALRFW5UQQLLBIKU4U","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":"8976cca4d24a269986a67658a8198e9628b71840239cbdff1fa46bf17828960f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T05:16:37Z","title_canon_sha256":"7b8e779477588b1234b62fdeba74a8fda3b68e59b611d364d5a7d1321bd6be2e"},"schema_version":"1.0","source":{"id":"1903.07258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07258","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07258v1","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07258","created_at":"2026-05-17T23:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"JGXI4XBSHALR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGXI4XBSHALRFW5U","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGXI4XBS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:c8c3927a8ad92e91d0bfc7d8bb1c5ebf176b515ed20a325a1ce4c6584ceba246","target":"graph","created_at":"2026-05-17T23:51:03Z","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":"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","authors_text":"Brian Swenson, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T05:16:37Z","title":"Annealing for Distributed Global Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07258","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:d8c6d99a01621571398dcf3ac57852c44f3e20d949e3e09604dda719074b7217","target":"record","created_at":"2026-05-17T23:51:03Z","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":"8976cca4d24a269986a67658a8198e9628b71840239cbdff1fa46bf17828960f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T05:16:37Z","title_canon_sha256":"7b8e779477588b1234b62fdeba74a8fda3b68e59b611d364d5a7d1321bd6be2e"},"schema_version":"1.0","source":{"id":"1903.07258","kind":"arxiv","version":1}},"canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49ae8e5c32381712dbb48416b0a154e5398dac7a7289c0d46bca686cbde49c2b","first_computed_at":"2026-05-17T23:51:03.797767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:03.797767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBLOqc59/TgzMFXGuzQJ1fZxRw4BI9lBpg7oIpQU0GlTHpEWGRnNbgBFbnuw7SAziZbmjA2cQ6pInv+bi+rAAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:03.798396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8c6d99a01621571398dcf3ac57852c44f3e20d949e3e09604dda719074b7217","sha256:c8c3927a8ad92e91d0bfc7d8bb1c5ebf176b515ed20a325a1ce4c6584ceba246"],"state_sha256":"a69f3311f2e52e11f751d58452fc3d588cb99e5d6873fe98a2351feddde2ccdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTex1oY5ztbn3uOMqPCvChm/XXcU4kSWoTm9FxDqsP8vNYCL/5xjsz4ZLQcDUv34/CrDFkFMR39EDYJr0FdJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:10:35.581469Z","bundle_sha256":"e37fe1d4f741d44822ade02606aa293175273c3d830c3fc65e0d815f304cb69f"}}