{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EPM7FH4ARN6I25H3PWTCPMKALW","short_pith_number":"pith:EPM7FH4A","canonical_record":{"source":{"id":"1907.07852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-18T03:05:12Z","cross_cats_sorted":[],"title_canon_sha256":"a6cc8655585ff0871c984eeaf1060ceca48d756421e94dd1d0c30fefddcd05d3","abstract_canon_sha256":"4474a088d80f9fff3ce00e49928e672dafd7d57d0b8ecdf06692d9f57da8bb14"},"schema_version":"1.0"},"canonical_sha256":"23d9f29f808b7c8d74fb7da627b1405db6562be0b425f3f2e13e70ee1ed56c5a","source":{"kind":"arxiv","id":"1907.07852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07852","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07852v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07852","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"EPM7FH4ARN6I","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EPM7FH4ARN6I25H3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EPM7FH4A","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EPM7FH4ARN6I25H3PWTCPMKALW","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-18T03:05:12Z","cross_cats_sorted":[],"title_canon_sha256":"a6cc8655585ff0871c984eeaf1060ceca48d756421e94dd1d0c30fefddcd05d3","abstract_canon_sha256":"4474a088d80f9fff3ce00e49928e672dafd7d57d0b8ecdf06692d9f57da8bb14"},"schema_version":"1.0"},"canonical_sha256":"23d9f29f808b7c8d74fb7da627b1405db6562be0b425f3f2e13e70ee1ed56c5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.983696Z","signature_b64":"cFfehCRL3OkGQlzNCO/XWgD13b3IQvnUpywgukxGeuhFcj+bdCd6O37MGQWccBQLmZ6CshkVjxKr+d4AavYYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d9f29f808b7c8d74fb7da627b1405db6562be0b425f3f2e13e70ee1ed56c5a","last_reissued_at":"2026-05-17T23:40:15.982926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.982926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07852","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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FASLNo1M/r4qz1xfSSHLAozwoOd7+rkyd8c2daCSdJSHZ01bNhEMFkbZ6UsMBfvGIoRHtUl/XZKRJ0XxuEIMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:42:21.022215Z"},"content_sha256":"31ad0482c7d4fcea158d76ad470133ef1c8e933c85fc38ffe24f96e7b7f61ae2","schema_version":"1.0","event_id":"sha256:31ad0482c7d4fcea158d76ad470133ef1c8e933c85fc38ffe24f96e7b7f61ae2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EPM7FH4ARN6I25H3PWTCPMKALW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Convergence for Distributed Optimization with Barzilai-Borwein Step Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Gao, Peng Yang, Xinwei Liu, Yakui Huang, Yu-Hong Dai","submitted_at":"2019-07-18T03:05:12Z","abstract_excerpt":"We consider a distributed multi-agent optimization problem over a time-invariant undirected graph, where each agent possesses a local objective function and all agents collaboratively minimize the average of all objective functions through local computations and communications among neighbors. Recently, a class of distributed gradient methods has been proposed that achieves both exact and geometric convergence when a constant step size is used. The geometric convergence of these methods is ensured for conservatively selected step sizes, but how to choose an appropriate step size while running "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07852","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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wef3dCfbMm+xToUK/Y1Tgsubdbk6cuO2DbIsCJbzEa+1N7WqbVeleLZgTXyCUIP+jNKbwUCilO3Uxef+VKOVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:42:21.022902Z"},"content_sha256":"4d0f24106ab48a9cb5f415b285aa3d3c9900f2c9ed2ab128fa0de7267cfe58b0","schema_version":"1.0","event_id":"sha256:4d0f24106ab48a9cb5f415b285aa3d3c9900f2c9ed2ab128fa0de7267cfe58b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPM7FH4ARN6I25H3PWTCPMKALW/bundle.json","state_url":"https://pith.science/pith/EPM7FH4ARN6I25H3PWTCPMKALW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPM7FH4ARN6I25H3PWTCPMKALW/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-25T16:42:21Z","links":{"resolver":"https://pith.science/pith/EPM7FH4ARN6I25H3PWTCPMKALW","bundle":"https://pith.science/pith/EPM7FH4ARN6I25H3PWTCPMKALW/bundle.json","state":"https://pith.science/pith/EPM7FH4ARN6I25H3PWTCPMKALW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPM7FH4ARN6I25H3PWTCPMKALW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EPM7FH4ARN6I25H3PWTCPMKALW","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":"4474a088d80f9fff3ce00e49928e672dafd7d57d0b8ecdf06692d9f57da8bb14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-18T03:05:12Z","title_canon_sha256":"a6cc8655585ff0871c984eeaf1060ceca48d756421e94dd1d0c30fefddcd05d3"},"schema_version":"1.0","source":{"id":"1907.07852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07852","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07852v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07852","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"EPM7FH4ARN6I","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EPM7FH4ARN6I25H3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EPM7FH4A","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4d0f24106ab48a9cb5f415b285aa3d3c9900f2c9ed2ab128fa0de7267cfe58b0","target":"graph","created_at":"2026-05-17T23:40:15Z","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":"We consider a distributed multi-agent optimization problem over a time-invariant undirected graph, where each agent possesses a local objective function and all agents collaboratively minimize the average of all objective functions through local computations and communications among neighbors. Recently, a class of distributed gradient methods has been proposed that achieves both exact and geometric convergence when a constant step size is used. The geometric convergence of these methods is ensured for conservatively selected step sizes, but how to choose an appropriate step size while running ","authors_text":"Juan Gao, Peng Yang, Xinwei Liu, Yakui Huang, Yu-Hong Dai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-18T03:05:12Z","title":"Geometric Convergence for Distributed Optimization with Barzilai-Borwein Step Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07852","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:31ad0482c7d4fcea158d76ad470133ef1c8e933c85fc38ffe24f96e7b7f61ae2","target":"record","created_at":"2026-05-17T23:40:15Z","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":"4474a088d80f9fff3ce00e49928e672dafd7d57d0b8ecdf06692d9f57da8bb14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-18T03:05:12Z","title_canon_sha256":"a6cc8655585ff0871c984eeaf1060ceca48d756421e94dd1d0c30fefddcd05d3"},"schema_version":"1.0","source":{"id":"1907.07852","kind":"arxiv","version":1}},"canonical_sha256":"23d9f29f808b7c8d74fb7da627b1405db6562be0b425f3f2e13e70ee1ed56c5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23d9f29f808b7c8d74fb7da627b1405db6562be0b425f3f2e13e70ee1ed56c5a","first_computed_at":"2026-05-17T23:40:15.982926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.982926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cFfehCRL3OkGQlzNCO/XWgD13b3IQvnUpywgukxGeuhFcj+bdCd6O37MGQWccBQLmZ6CshkVjxKr+d4AavYYBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.983696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31ad0482c7d4fcea158d76ad470133ef1c8e933c85fc38ffe24f96e7b7f61ae2","sha256:4d0f24106ab48a9cb5f415b285aa3d3c9900f2c9ed2ab128fa0de7267cfe58b0"],"state_sha256":"4876652c22bfd1c10d8a4848ae09b6c3a9c55c674f2feb8a12520047665bed1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSK4DnKDSZ4EuJCwNyTWf42uorMTGSONaLCRAnk2oQxRGUaNOdfpUgWiDak+XBwGOssMjESJWjhK5+3THgBXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:42:21.026658Z","bundle_sha256":"710714f6ad3543075a7ac1893b23c1930400b7c4b0ad9e5f6d5ffd29c7183bd3"}}