{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KKYFTNEMWY7YTGXIS5S2Q63UVM","short_pith_number":"pith:KKYFTNEM","schema_version":"1.0","canonical_sha256":"52b059b48cb63f899ae89765a87b74ab15187f88cebfb675483fd6e17a2c4e9a","source":{"kind":"arxiv","id":"2305.11469","version":4},"attestation_state":"computed","paper":{"title":"The Barzilai-Borwein Method for Distributed Optimization over Unbalanced Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Huaqing Li, Jinhui Hu, Lifeng Zheng, Ling Zhang, Xin Chen","submitted_at":"2023-05-19T06:43:46Z","abstract_excerpt":"This paper studies optimization problems over multi-agent systems, in which all agents cooperatively minimize a global objective function expressed as a sum of local cost functions. Each agent in the systems uses only local computation and communication in the overall process without leaking their private information. Based on the Barzilai-Borwein (BB) method and multi-consensus inner loops, a distributed algorithm with the availability of larger stepsizes and accelerated convergence, namely ADBB, is proposed. Moreover, owing to employing only row-stochastic weight matrices, ADBB can resolve t"},"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":"2305.11469","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-19T06:43:46Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fb752f41508438ea1c959f2c896534af1a3a820918ee5399c57f0dca6092c91b","abstract_canon_sha256":"dfbf4c66b441feba97fbecbf4fe2624ab5ca24195299cced97eb60eeb1f31c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:55.373058Z","signature_b64":"Y/gP0iY88rUjFNCvj0JNgk6ITxJHnUvAiONOFbxqxEk2TrxUxvkDhbqwmrykySqxEo4gIoy+DUGL9CRFkDCJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b059b48cb63f899ae89765a87b74ab15187f88cebfb675483fd6e17a2c4e9a","last_reissued_at":"2026-07-05T11:07:55.372606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:55.372606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Barzilai-Borwein Method for Distributed Optimization over Unbalanced Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Huaqing Li, Jinhui Hu, Lifeng Zheng, Ling Zhang, Xin Chen","submitted_at":"2023-05-19T06:43:46Z","abstract_excerpt":"This paper studies optimization problems over multi-agent systems, in which all agents cooperatively minimize a global objective function expressed as a sum of local cost functions. Each agent in the systems uses only local computation and communication in the overall process without leaking their private information. Based on the Barzilai-Borwein (BB) method and multi-consensus inner loops, a distributed algorithm with the availability of larger stepsizes and accelerated convergence, namely ADBB, is proposed. Moreover, owing to employing only row-stochastic weight matrices, ADBB can resolve t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11469","kind":"arxiv","version":4},"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/2305.11469/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.11469","created_at":"2026-07-05T11:07:55.372665+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11469v4","created_at":"2026-07-05T11:07:55.372665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11469","created_at":"2026-07-05T11:07:55.372665+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKYFTNEMWY7Y","created_at":"2026-07-05T11:07:55.372665+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKYFTNEMWY7YTGXI","created_at":"2026-07-05T11:07:55.372665+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKYFTNEM","created_at":"2026-07-05T11:07:55.372665+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.23725","citing_title":"Adaptive Stepsize Selection in Decentralized Convex Optimization","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM","json":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM.json","graph_json":"https://pith.science/api/pith-number/KKYFTNEMWY7YTGXIS5S2Q63UVM/graph.json","events_json":"https://pith.science/api/pith-number/KKYFTNEMWY7YTGXIS5S2Q63UVM/events.json","paper":"https://pith.science/paper/KKYFTNEM"},"agent_actions":{"view_html":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM","download_json":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM.json","view_paper":"https://pith.science/paper/KKYFTNEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11469&json=true","fetch_graph":"https://pith.science/api/pith-number/KKYFTNEMWY7YTGXIS5S2Q63UVM/graph.json","fetch_events":"https://pith.science/api/pith-number/KKYFTNEMWY7YTGXIS5S2Q63UVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM/action/storage_attestation","attest_author":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM/action/author_attestation","sign_citation":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM/action/citation_signature","submit_replication":"https://pith.science/pith/KKYFTNEMWY7YTGXIS5S2Q63UVM/action/replication_record"}},"created_at":"2026-07-05T11:07:55.372665+00:00","updated_at":"2026-07-05T11:07:55.372665+00:00"}