{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZGWG52L6F2SC7LWETP2PVF6SVN","short_pith_number":"pith:ZGWG52L6","schema_version":"1.0","canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","source":{"kind":"arxiv","id":"1807.06624","version":1},"attestation_state":"computed","paper":{"title":"Distributed Triangle Detection via Expander Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Seth Pettie, Yi-Jun Chang","submitted_at":"2018-07-17T18:59:09Z","abstract_excerpt":"We present improved distributed algorithms for triangle detection and its variants in the CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be solved in $\\tilde{O}(n^{1/2})$ rounds. In contrast, the previous state-of-the-art bounds for Triangle Detection and Enumeration were $\\tilde{O}(n^{2/3})$ and $\\tilde{O}(n^{3/4})$, respectively, due to Izumi and LeGall (PODC 2017).\n  The main technical novelty in this work is a distributed graph partitioning algorithm. We show that in $\\tilde{O}(n^{1-\\delta})$ rounds we can partition the edge set of the network $G=(V,E)$ into "},"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":"1807.06624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T18:59:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f8efacef33c076b2506e191693d2bd28d3ba91851fa25731abbd5f9a40bc4d06","abstract_canon_sha256":"c438dc69e7ebc490f98e92f56cfff2ba26b07284154624c9e1bf957ae59490f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:27.384127Z","signature_b64":"Y7AH9EqD0epMd3bb4bZIGe8JBGt8LRLrreR4BKQ4+oB8fzJnhEOzHbuMxv/UKreNdbsT74/s2D0GTVzYLFaaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","last_reissued_at":"2026-05-18T00:10:27.383438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:27.383438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Triangle Detection via Expander Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Seth Pettie, Yi-Jun Chang","submitted_at":"2018-07-17T18:59:09Z","abstract_excerpt":"We present improved distributed algorithms for triangle detection and its variants in the CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be solved in $\\tilde{O}(n^{1/2})$ rounds. In contrast, the previous state-of-the-art bounds for Triangle Detection and Enumeration were $\\tilde{O}(n^{2/3})$ and $\\tilde{O}(n^{3/4})$, respectively, due to Izumi and LeGall (PODC 2017).\n  The main technical novelty in this work is a distributed graph partitioning algorithm. We show that in $\\tilde{O}(n^{1-\\delta})$ rounds we can partition the edge set of the network $G=(V,E)$ into "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06624","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":"1807.06624","created_at":"2026-05-18T00:10:27.383528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06624v1","created_at":"2026-05-18T00:10:27.383528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06624","created_at":"2026-05-18T00:10:27.383528+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGWG52L6F2SC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGWG52L6F2SC7LWE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGWG52L6","created_at":"2026-05-18T12:33:07.085635+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/ZGWG52L6F2SC7LWETP2PVF6SVN","json":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN.json","graph_json":"https://pith.science/api/pith-number/ZGWG52L6F2SC7LWETP2PVF6SVN/graph.json","events_json":"https://pith.science/api/pith-number/ZGWG52L6F2SC7LWETP2PVF6SVN/events.json","paper":"https://pith.science/paper/ZGWG52L6"},"agent_actions":{"view_html":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN","download_json":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN.json","view_paper":"https://pith.science/paper/ZGWG52L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06624&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGWG52L6F2SC7LWETP2PVF6SVN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGWG52L6F2SC7LWETP2PVF6SVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/action/storage_attestation","attest_author":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/action/author_attestation","sign_citation":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/action/citation_signature","submit_replication":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/action/replication_record"}},"created_at":"2026-05-18T00:10:27.383528+00:00","updated_at":"2026-05-18T00:10:27.383528+00:00"}