{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KGZZQXUMCLHN2TYXDKQDHZOUBA","short_pith_number":"pith:KGZZQXUM","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"},"canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","source":{"kind":"arxiv","id":"1904.08037","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08037","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08037v2","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08037","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"KGZZQXUMCLHN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KGZZQXUMCLHN2TYX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KGZZQXUM","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KGZZQXUMCLHN2TYXDKQDHZOUBA","target":"record","payload":{"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"},"canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","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"},"source_kind":"arxiv","source_id":"1904.08037","source_version":2,"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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIViw+kXXkJ+koHdVaExbPjbpqJwH6Nrikihn6vNvD1pTURzP4IHly/ZZRNXQqlhd2DIx5/omjomT8zeiBBuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:56.545855Z"},"content_sha256":"26cee96cf2e549ed29fa4c399cd9def5853255db89fcf9639dad7cc07d8f31bb","schema_version":"1.0","event_id":"sha256:26cee96cf2e549ed29fa4c399cd9def5853255db89fcf9639dad7cc07d8f31bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KGZZQXUMCLHN2TYXDKQDHZOUBA","target":"graph","payload":{"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"},"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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVkmKnYcrqXdKgpyV9lqM8gv3D8vckUZ2JC1IFbME6dk5fBY/9YKmgZVhMFANGjD7Q2zIoAeAKx6tNMNlGeEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:56.546504Z"},"content_sha256":"e7c6f9bd43fb2eed81b232486caf70754d08a22f8e4ceada2071af4f76928bff","schema_version":"1.0","event_id":"sha256:e7c6f9bd43fb2eed81b232486caf70754d08a22f8e4ceada2071af4f76928bff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/bundle.json","state_url":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/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-26T16:30:56Z","links":{"resolver":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA","bundle":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/bundle.json","state":"https://pith.science/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGZZQXUMCLHN2TYXDKQDHZOUBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KGZZQXUMCLHN2TYXDKQDHZOUBA","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":"21c6e1414cd907dde098c0f23507a5bbfc48fa0ecc88cc802e0fd5f658f39c37","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T00:50:26Z","title_canon_sha256":"de7bab1dd47c6aa79a2871ad32324dcf101a2ecd578e7fd684b25adcad7b2da9"},"schema_version":"1.0","source":{"id":"1904.08037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08037","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08037v2","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08037","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"KGZZQXUMCLHN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KGZZQXUMCLHN2TYX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KGZZQXUM","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:e7c6f9bd43fb2eed81b232486caf70754d08a22f8e4ceada2071af4f76928bff","target":"graph","created_at":"2026-05-17T23:45:03Z","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":"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","authors_text":"Thatchaphol Saranurak, Yi-Jun Chang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T00:50:26Z","title":"Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08037","kind":"arxiv","version":2},"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:26cee96cf2e549ed29fa4c399cd9def5853255db89fcf9639dad7cc07d8f31bb","target":"record","created_at":"2026-05-17T23:45:03Z","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":"21c6e1414cd907dde098c0f23507a5bbfc48fa0ecc88cc802e0fd5f658f39c37","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T00:50:26Z","title_canon_sha256":"de7bab1dd47c6aa79a2871ad32324dcf101a2ecd578e7fd684b25adcad7b2da9"},"schema_version":"1.0","source":{"id":"1904.08037","kind":"arxiv","version":2}},"canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51b3985e8c12cedd4f171aa033e5d4080abaaa77f6b949b03fbbe833bad8e9a4","first_computed_at":"2026-05-17T23:45:03.848233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.848233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pk+jWhLeSrWnOFjVghZ2AxHMor4SL8RjWilJQFErHxDh3VmjRXszEAo/+yZ/Dek3TN9O59QcV6on7vV/p7IbDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.849078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26cee96cf2e549ed29fa4c399cd9def5853255db89fcf9639dad7cc07d8f31bb","sha256:e7c6f9bd43fb2eed81b232486caf70754d08a22f8e4ceada2071af4f76928bff"],"state_sha256":"6f1465c508aa91cc7dbaa57c15c20b54717d65734dfe1e368a35f1241a7259c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOjjaYMFbkkQeKaaqBs2givZGRHzT6Atfn/sYcFz6FdKRz6z/4xYFojj+jDbAfGzDBAU8kuRnFcIvhLd9kJaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:30:56.549596Z","bundle_sha256":"024aa2dc989856b3b28099519f00dd0073412b5dc9b9524cd023e2e173ac08a0"}}