{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CXL3XBTDJEG735FOXHYFL4YFGP","short_pith_number":"pith:CXL3XBTD","schema_version":"1.0","canonical_sha256":"15d7bb8663490dfdf4aeb9f055f30533db1c7a9729b98cd15655c4ff44ddf366","source":{"kind":"arxiv","id":"1804.06568","version":4},"attestation_state":"computed","paper":{"title":"Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Kun Yuan, Wotao Yin, Xianghui Mao, Yuantao Gu, Yubin Hu","submitted_at":"2018-04-18T06:26:38Z","abstract_excerpt":"This paper addresses consensus optimization problems in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. We develop a new decentralized algorithm in which each agent communicates only with its neighbors.\n  State-of-the-art decentralized algorithms use communications between either all pairs of adjacent agents or a random subset of them at each iteration. Another class of algorithms uses a random walk incremental strategy, which sequentially activates a succession of nodes; these incremental algorithms require diminishing step size"},"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":"1804.06568","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-18T06:26:38Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY"],"title_canon_sha256":"147d686abf20ebb2cf2f13858847417ad49bb29b4a7a4d38eb9b1162426615ba","abstract_canon_sha256":"eb3618c8493e7c2494343698e0d3b4f892e0602e9e702fcff63727e2dced2734"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:46.687630Z","signature_b64":"UBNYdcb/WskRSJbnLxy97BhezU2p9Z4IFHFY05p+F9qFD2yYEjofbRREM5sR8uwbrZTQyhEfIr2doI8wL6KkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d7bb8663490dfdf4aeb9f055f30533db1c7a9729b98cd15655c4ff44ddf366","last_reissued_at":"2026-05-17T23:41:46.686809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:46.686809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Kun Yuan, Wotao Yin, Xianghui Mao, Yuantao Gu, Yubin Hu","submitted_at":"2018-04-18T06:26:38Z","abstract_excerpt":"This paper addresses consensus optimization problems in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. We develop a new decentralized algorithm in which each agent communicates only with its neighbors.\n  State-of-the-art decentralized algorithms use communications between either all pairs of adjacent agents or a random subset of them at each iteration. Another class of algorithms uses a random walk incremental strategy, which sequentially activates a succession of nodes; these incremental algorithms require diminishing step size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06568","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":""},"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":"1804.06568","created_at":"2026-05-17T23:41:46.686942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06568v4","created_at":"2026-05-17T23:41:46.686942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06568","created_at":"2026-05-17T23:41:46.686942+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXL3XBTDJEG7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXL3XBTDJEG735FO","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXL3XBTD","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP","json":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP.json","graph_json":"https://pith.science/api/pith-number/CXL3XBTDJEG735FOXHYFL4YFGP/graph.json","events_json":"https://pith.science/api/pith-number/CXL3XBTDJEG735FOXHYFL4YFGP/events.json","paper":"https://pith.science/paper/CXL3XBTD"},"agent_actions":{"view_html":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP","download_json":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP.json","view_paper":"https://pith.science/paper/CXL3XBTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06568&json=true","fetch_graph":"https://pith.science/api/pith-number/CXL3XBTDJEG735FOXHYFL4YFGP/graph.json","fetch_events":"https://pith.science/api/pith-number/CXL3XBTDJEG735FOXHYFL4YFGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP/action/storage_attestation","attest_author":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP/action/author_attestation","sign_citation":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP/action/citation_signature","submit_replication":"https://pith.science/pith/CXL3XBTDJEG735FOXHYFL4YFGP/action/replication_record"}},"created_at":"2026-05-17T23:41:46.686942+00:00","updated_at":"2026-05-17T23:41:46.686942+00:00"}