{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XKS4KJXP6JXXJAZ3D2XLN5JFHS","short_pith_number":"pith:XKS4KJXP","schema_version":"1.0","canonical_sha256":"baa5c526eff26f74833b1eaeb6f5253c86077650eb51516f1eb7ba15f70a30e8","source":{"kind":"arxiv","id":"1801.01903","version":1},"attestation_state":"computed","paper":{"title":"Local Mixing Time: Distributed Computation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Gopal Pandurangan","submitted_at":"2018-01-05T19:24:34Z","abstract_excerpt":"The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion of mixing of a random walk on a (undirected) graph, called local mixing. Informally, the local mixing with respect to a given node $s$, is the mixing of a random walk probability distribution restricted to a large enough subset of nodes --- say, a subset of size at least $n/\\beta$ for a given parameter $\\beta$ --- containing $s$. The time to mix over such a s"},"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":"1801.01903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-05T19:24:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"995672d8273b60906bef739a6d6c14573dc8547b924ee487ffe7924d7e718369","abstract_canon_sha256":"692551c172f0e265faa5a1775ebbd2ae318ed880ed5af9c1f6eed97e6243607e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:35.522471Z","signature_b64":"c6SBKTJDVuYl5n2l3Zsl1ML0KFDSJK371/YHXSY9TZ+ouK/Eq6DtEt1GpxU6XLy1xn4kLmSo+WZoXjGzZqwxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baa5c526eff26f74833b1eaeb6f5253c86077650eb51516f1eb7ba15f70a30e8","last_reissued_at":"2026-05-18T00:26:35.521756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:35.521756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Mixing Time: Distributed Computation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Gopal Pandurangan","submitted_at":"2018-01-05T19:24:34Z","abstract_excerpt":"The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion of mixing of a random walk on a (undirected) graph, called local mixing. Informally, the local mixing with respect to a given node $s$, is the mixing of a random walk probability distribution restricted to a large enough subset of nodes --- say, a subset of size at least $n/\\beta$ for a given parameter $\\beta$ --- containing $s$. The time to mix over such a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01903","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":"1801.01903","created_at":"2026-05-18T00:26:35.521878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01903v1","created_at":"2026-05-18T00:26:35.521878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01903","created_at":"2026-05-18T00:26:35.521878+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKS4KJXP6JXX","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKS4KJXP6JXXJAZ3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKS4KJXP","created_at":"2026-05-18T12:33:01.666342+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/XKS4KJXP6JXXJAZ3D2XLN5JFHS","json":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS.json","graph_json":"https://pith.science/api/pith-number/XKS4KJXP6JXXJAZ3D2XLN5JFHS/graph.json","events_json":"https://pith.science/api/pith-number/XKS4KJXP6JXXJAZ3D2XLN5JFHS/events.json","paper":"https://pith.science/paper/XKS4KJXP"},"agent_actions":{"view_html":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS","download_json":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS.json","view_paper":"https://pith.science/paper/XKS4KJXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01903&json=true","fetch_graph":"https://pith.science/api/pith-number/XKS4KJXP6JXXJAZ3D2XLN5JFHS/graph.json","fetch_events":"https://pith.science/api/pith-number/XKS4KJXP6JXXJAZ3D2XLN5JFHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS/action/storage_attestation","attest_author":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS/action/author_attestation","sign_citation":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS/action/citation_signature","submit_replication":"https://pith.science/pith/XKS4KJXP6JXXJAZ3D2XLN5JFHS/action/replication_record"}},"created_at":"2026-05-18T00:26:35.521878+00:00","updated_at":"2026-05-18T00:26:35.521878+00:00"}