{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KGZZQXUMCLHN2TYXDKQDHZOUBA","short_pith_number":"pith:KGZZQXUM","schema_version":"1.0","canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","source":{"kind":"arxiv","id":"1904.08037","version":2},"attestation_state":"computed","paper":{"title":"Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Thatchaphol Saranurak, Yi-Jun Chang","submitted_at":"2019-04-17T00:50:26Z","abstract_excerpt":"An $(\\epsilon,\\phi)$-expander decomposition of a graph $G=(V,E)$ is a clustering of the vertices $V=V_{1}\\cup\\cdots\\cup V_{x}$ such that (1) each cluster $V_{i}$ induces subgraph with conductance at least $\\phi$, and (2) the number of inter-cluster edges is at most $\\epsilon|E|$. In this paper, we give an improved distributed expander decomposition.\n  Specifically, we construct an $(\\epsilon,\\phi)$-expander decomposition with $\\phi=(\\epsilon/\\log n)^{2^{O(k)}}$ in $O(n^{2/k}\\cdot\\text{poly}(1/\\phi,\\log n))$ rounds for any $\\epsilon\\in(0,1)$ and positive integer $k$. For example, a $(0.01,1/\\te"},"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":"1904.08037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T00:50:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"de7bab1dd47c6aa79a2871ad32324dcf101a2ecd578e7fd684b25adcad7b2da9","abstract_canon_sha256":"21c6e1414cd907dde098c0f23507a5bbfc48fa0ecc88cc802e0fd5f658f39c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.849078Z","signature_b64":"Pk+jWhLeSrWnOFjVghZ2AxHMor4SL8RjWilJQFErHxDh3VmjRXszEAo/+yZ/Dek3TN9O59QcV6on7vV/p7IbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","last_reissued_at":"2026-05-17T23:45:03.848233Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.848233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Thatchaphol Saranurak, Yi-Jun Chang","submitted_at":"2019-04-17T00:50:26Z","abstract_excerpt":"An $(\\epsilon,\\phi)$-expander decomposition of a graph $G=(V,E)$ is a clustering of the vertices $V=V_{1}\\cup\\cdots\\cup V_{x}$ such that (1) each cluster $V_{i}$ induces subgraph with conductance at least $\\phi$, and (2) the number of inter-cluster edges is at most $\\epsilon|E|$. In this paper, we give an improved distributed expander decomposition.\n  Specifically, we construct an $(\\epsilon,\\phi)$-expander decomposition with $\\phi=(\\epsilon/\\log n)^{2^{O(k)}}$ in $O(n^{2/k}\\cdot\\text{poly}(1/\\phi,\\log n))$ rounds for any $\\epsilon\\in(0,1)$ and positive integer $k$. For example, a $(0.01,1/\\te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08037","kind":"arxiv","version":2},"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":"1904.08037","created_at":"2026-05-17T23:45:03.848355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08037v2","created_at":"2026-05-17T23:45:03.848355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08037","created_at":"2026-05-17T23:45:03.848355+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGZZQXUMCLHN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGZZQXUMCLHN2TYX","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGZZQXUM","created_at":"2026-05-18T12:33:21.387695+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/KGZZQXUMCLHN2TYXDKQDHZOUBA","json":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA.json","graph_json":"https://pith.science/api/pith-number/KGZZQXUMCLHN2TYXDKQDHZOUBA/graph.json","events_json":"https://pith.science/api/pith-number/KGZZQXUMCLHN2TYXDKQDHZOUBA/events.json","paper":"https://pith.science/paper/KGZZQXUM"},"agent_actions":{"view_html":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA","download_json":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA.json","view_paper":"https://pith.science/paper/KGZZQXUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08037&json=true","fetch_graph":"https://pith.science/api/pith-number/KGZZQXUMCLHN2TYXDKQDHZOUBA/graph.json","fetch_events":"https://pith.science/api/pith-number/KGZZQXUMCLHN2TYXDKQDHZOUBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/action/storage_attestation","attest_author":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/action/author_attestation","sign_citation":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/action/citation_signature","submit_replication":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/action/replication_record"}},"created_at":"2026-05-17T23:45:03.848355+00:00","updated_at":"2026-05-17T23:45:03.848355+00:00"}