{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PZ2DJDGF3CGXINNGQKUJPAVTT2","short_pith_number":"pith:PZ2DJDGF","schema_version":"1.0","canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","source":{"kind":"arxiv","id":"1805.04764","version":1},"attestation_state":"computed","paper":{"title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jason Li, Mohsen Ghaffari","submitted_at":"2018-05-12T18:58:10Z","abstract_excerpt":"We show that many classical optimization problems --- such as $(1\\pm\\epsilon)$-approximate maximum flow, shortest path, and transshipment --- can be computed in $\\newcommand{\\tmix}{{\\tau_{\\text{mix}}}}\\tmix(G)\\cdot n^{o(1)}$ rounds of distributed message passing, where $\\tmix(G)$ is the mixing time of the network graph $G$. This extends the result of Ghaffari et al.\\ [PODC'17], whose main result is a distributed MST algorithm in $\\tmix(G)\\cdot 2^{O(\\sqrt{\\log n \\log\\log n})}$ rounds in the CONGEST model, to a much wider class of optimization problems. For many practical networks of interest, e"},"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":"1805.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-12T18:58:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6aa6c098308a5c48561c3cababf3782050458a1b55170576aab578b495c955fe","abstract_canon_sha256":"e3541af6b4256eb76e686f0fc00d383590e7c39602eaab2e323c71bf35d9672b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:53.326489Z","signature_b64":"+b7PogEHwpeaiGI9pO4aGPR0r0HjVs3HUQ4Eq5UQGDbmPPjX6toSgE45/gmMkAGPaMzGOxFE7rU/AjMWyieJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","last_reissued_at":"2026-05-18T00:14:53.325643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:53.325643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jason Li, Mohsen Ghaffari","submitted_at":"2018-05-12T18:58:10Z","abstract_excerpt":"We show that many classical optimization problems --- such as $(1\\pm\\epsilon)$-approximate maximum flow, shortest path, and transshipment --- can be computed in $\\newcommand{\\tmix}{{\\tau_{\\text{mix}}}}\\tmix(G)\\cdot n^{o(1)}$ rounds of distributed message passing, where $\\tmix(G)$ is the mixing time of the network graph $G$. This extends the result of Ghaffari et al.\\ [PODC'17], whose main result is a distributed MST algorithm in $\\tmix(G)\\cdot 2^{O(\\sqrt{\\log n \\log\\log n})}$ rounds in the CONGEST model, to a much wider class of optimization problems. For many practical networks of interest, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04764","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":"1805.04764","created_at":"2026-05-18T00:14:53.325759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04764v1","created_at":"2026-05-18T00:14:53.325759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04764","created_at":"2026-05-18T00:14:53.325759+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZ2DJDGF3CGX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZ2DJDGF3CGXINNG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZ2DJDGF","created_at":"2026-05-18T12:32:46.962924+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/PZ2DJDGF3CGXINNGQKUJPAVTT2","json":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2.json","graph_json":"https://pith.science/api/pith-number/PZ2DJDGF3CGXINNGQKUJPAVTT2/graph.json","events_json":"https://pith.science/api/pith-number/PZ2DJDGF3CGXINNGQKUJPAVTT2/events.json","paper":"https://pith.science/paper/PZ2DJDGF"},"agent_actions":{"view_html":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2","download_json":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2.json","view_paper":"https://pith.science/paper/PZ2DJDGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04764&json=true","fetch_graph":"https://pith.science/api/pith-number/PZ2DJDGF3CGXINNGQKUJPAVTT2/graph.json","fetch_events":"https://pith.science/api/pith-number/PZ2DJDGF3CGXINNGQKUJPAVTT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/action/storage_attestation","attest_author":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/action/author_attestation","sign_citation":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/action/citation_signature","submit_replication":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/action/replication_record"}},"created_at":"2026-05-18T00:14:53.325759+00:00","updated_at":"2026-05-18T00:14:53.325759+00:00"}