{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZGWG52L6F2SC7LWETP2PVF6SVN","short_pith_number":"pith:ZGWG52L6","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"},"canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","source":{"kind":"arxiv","id":"1807.06624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06624","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06624v1","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06624","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZGWG52L6F2SC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZGWG52L6F2SC7LWE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZGWG52L6","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZGWG52L6F2SC7LWETP2PVF6SVN","target":"record","payload":{"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"},"canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","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"},"source_kind":"arxiv","source_id":"1807.06624","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:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgkJMIl9C3OSNbTQOS84ccvJ4OZnFodkKqS7u4d2NykyQeXxGoazA/GnZTwcA3/X8Ao9kL40hwx6/7uxk6zIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:56:44.428007Z"},"content_sha256":"36c975890ad4296ae8a0fac6eef69548ece8a74a03a20ac9b336c2f46567cf16","schema_version":"1.0","event_id":"sha256:36c975890ad4296ae8a0fac6eef69548ece8a74a03a20ac9b336c2f46567cf16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZGWG52L6F2SC7LWETP2PVF6SVN","target":"graph","payload":{"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"},"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:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUsYUkby0SSd6BmgaA/cd/0TUaJNWvpOHrLNlIcu+jF+R9xaB392EtKsKwdHhOzK5aBH0TzhHXvfegaHokBwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:56:44.428682Z"},"content_sha256":"4bb6713232e5897ffa781a52c62b512a855103241a385ce238386355a1910375","schema_version":"1.0","event_id":"sha256:4bb6713232e5897ffa781a52c62b512a855103241a385ce238386355a1910375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/bundle.json","state_url":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/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-05-26T18:56:44Z","links":{"resolver":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN","bundle":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/bundle.json","state":"https://pith.science/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGWG52L6F2SC7LWETP2PVF6SVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZGWG52L6F2SC7LWETP2PVF6SVN","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":"c438dc69e7ebc490f98e92f56cfff2ba26b07284154624c9e1bf957ae59490f1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T18:59:09Z","title_canon_sha256":"f8efacef33c076b2506e191693d2bd28d3ba91851fa25731abbd5f9a40bc4d06"},"schema_version":"1.0","source":{"id":"1807.06624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06624","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06624v1","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06624","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZGWG52L6F2SC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZGWG52L6F2SC7LWE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZGWG52L6","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:4bb6713232e5897ffa781a52c62b512a855103241a385ce238386355a1910375","target":"graph","created_at":"2026-05-18T00:10:27Z","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 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 ","authors_text":"Hengjie Zhang, Seth Pettie, Yi-Jun Chang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T18:59:09Z","title":"Distributed Triangle Detection via Expander Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06624","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:36c975890ad4296ae8a0fac6eef69548ece8a74a03a20ac9b336c2f46567cf16","target":"record","created_at":"2026-05-18T00:10:27Z","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":"c438dc69e7ebc490f98e92f56cfff2ba26b07284154624c9e1bf957ae59490f1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T18:59:09Z","title_canon_sha256":"f8efacef33c076b2506e191693d2bd28d3ba91851fa25731abbd5f9a40bc4d06"},"schema_version":"1.0","source":{"id":"1807.06624","kind":"arxiv","version":1}},"canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9ac6ee97e2ea42faec49bf4fa97d2ab53576b26262bab5db874d90c6e1ce35c","first_computed_at":"2026-05-18T00:10:27.383438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:27.383438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y7AH9EqD0epMd3bb4bZIGe8JBGt8LRLrreR4BKQ4+oB8fzJnhEOzHbuMxv/UKreNdbsT74/s2D0GTVzYLFaaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:27.384127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36c975890ad4296ae8a0fac6eef69548ece8a74a03a20ac9b336c2f46567cf16","sha256:4bb6713232e5897ffa781a52c62b512a855103241a385ce238386355a1910375"],"state_sha256":"50a925a970a1a0f9a2dead842c71b3c5781daa9d548cf06a6a0c3f4cd9576606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYRnA0P80FyeqPXOk0qqZcEh3TE8vmJs4oi+MdOV8mNqwFQT5wHj2sf5xnt+UZrRPIl0hINlwb+Nd7kFNCPqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:56:44.432309Z","bundle_sha256":"fecbaacda07df6868cc7044c899640a0bee3cc50cdf7f8479ac89006415e3ba3"}}