{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PZ2DJDGF3CGXINNGQKUJPAVTT2","short_pith_number":"pith:PZ2DJDGF","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"},"canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","source":{"kind":"arxiv","id":"1805.04764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04764","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04764v1","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04764","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"PZ2DJDGF3CGX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZ2DJDGF3CGXINNG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZ2DJDGF","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PZ2DJDGF3CGXINNGQKUJPAVTT2","target":"record","payload":{"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"},"canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","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"},"source_kind":"arxiv","source_id":"1805.04764","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-18T00:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qx10GKpCVM/228sjozejHCsVbEMLntNtLIAGJTHLwIp3tate9iM5/Rf6t9e7sRLilTl5XEoQR67o0WXRWmEXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:13:10.985197Z"},"content_sha256":"287130c48b4ceb44f83a5eeb85d40c492932d71a4c3a7295020d04070e9822b0","schema_version":"1.0","event_id":"sha256:287130c48b4ceb44f83a5eeb85d40c492932d71a4c3a7295020d04070e9822b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PZ2DJDGF3CGXINNGQKUJPAVTT2","target":"graph","payload":{"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"},"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-18T00:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrsKAQ0u3Gl49limfc2Do3UtyLJ74dGI/t/1m3sq45mlsdUkggKWLsB/pG9hQHPa6zcIMM6gX6rZ9ezUO6uFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:13:10.985565Z"},"content_sha256":"ded7a4a37471710beac7b4b476e1f6957a93452683484f03f7b8d179dfdf5c2c","schema_version":"1.0","event_id":"sha256:ded7a4a37471710beac7b4b476e1f6957a93452683484f03f7b8d179dfdf5c2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/bundle.json","state_url":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/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-06-04T01:13:10Z","links":{"resolver":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2","bundle":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/bundle.json","state":"https://pith.science/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZ2DJDGF3CGXINNGQKUJPAVTT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PZ2DJDGF3CGXINNGQKUJPAVTT2","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":"e3541af6b4256eb76e686f0fc00d383590e7c39602eaab2e323c71bf35d9672b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-12T18:58:10Z","title_canon_sha256":"6aa6c098308a5c48561c3cababf3782050458a1b55170576aab578b495c955fe"},"schema_version":"1.0","source":{"id":"1805.04764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04764","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04764v1","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04764","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"PZ2DJDGF3CGX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZ2DJDGF3CGXINNG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZ2DJDGF","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:ded7a4a37471710beac7b4b476e1f6957a93452683484f03f7b8d179dfdf5c2c","target":"graph","created_at":"2026-05-18T00:14:53Z","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 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","authors_text":"Jason Li, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-12T18:58:10Z","title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04764","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:287130c48b4ceb44f83a5eeb85d40c492932d71a4c3a7295020d04070e9822b0","target":"record","created_at":"2026-05-18T00:14:53Z","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":"e3541af6b4256eb76e686f0fc00d383590e7c39602eaab2e323c71bf35d9672b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-12T18:58:10Z","title_canon_sha256":"6aa6c098308a5c48561c3cababf3782050458a1b55170576aab578b495c955fe"},"schema_version":"1.0","source":{"id":"1805.04764","kind":"arxiv","version":1}},"canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e74348cc5d88d7435a682a89782b39e93a93c0384c5b672059dddd9a365ca28","first_computed_at":"2026-05-18T00:14:53.325643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:53.325643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+b7PogEHwpeaiGI9pO4aGPR0r0HjVs3HUQ4Eq5UQGDbmPPjX6toSgE45/gmMkAGPaMzGOxFE7rU/AjMWyieJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:53.326489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:287130c48b4ceb44f83a5eeb85d40c492932d71a4c3a7295020d04070e9822b0","sha256:ded7a4a37471710beac7b4b476e1f6957a93452683484f03f7b8d179dfdf5c2c"],"state_sha256":"4ffe799c60a25ed1ec0f00bfda781f7bec1269587923592117d74b661fa65ed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiTdDZQpz0c+Y8MM6RmuitozKw3MvhMs7X12QPQV9IPOmkgDBpYaoyrTyGcQUXqGgfM8xIvgUQ143yremaMLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:13:10.987557Z","bundle_sha256":"a1e77e543f28156c55edb2a473ee8a0a7ce42158e0ae299ce44d2718e0a3d695"}}