{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YPYVYONWFFMHTPC5QGQNPJVSAX","short_pith_number":"pith:YPYVYONW","canonical_record":{"source":{"id":"1607.04984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T09:30:49Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"e6b3760f55426c018f412eaee6e620101cf833d7b1323a66e6b3d8313c4dafe9","abstract_canon_sha256":"f58fd6c4b9416611a0689a58adec07458e3db6a48cc5a76efa2cf05467f37b46"},"schema_version":"1.0"},"canonical_sha256":"c3f15c39b6295879bc5d81a0d7a6b205d3c44c0ae72d867e5a872aab5f5eabc3","source":{"kind":"arxiv","id":"1607.04984","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04984","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04984v3","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04984","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"YPYVYONWFFMH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPYVYONWFFMHTPC5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPYVYONW","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YPYVYONWFFMHTPC5QGQNPJVSAX","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T09:30:49Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"e6b3760f55426c018f412eaee6e620101cf833d7b1323a66e6b3d8313c4dafe9","abstract_canon_sha256":"f58fd6c4b9416611a0689a58adec07458e3db6a48cc5a76efa2cf05467f37b46"},"schema_version":"1.0"},"canonical_sha256":"c3f15c39b6295879bc5d81a0d7a6b205d3c44c0ae72d867e5a872aab5f5eabc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.289547Z","signature_b64":"JT1jwpVJQJOG+ub1DExf9h0yQGq2Zp0m5L6sqJN+Xl3hTPAhdNbQFLL+nCBZV48/AuuNs+Uaki+zY08ryVj+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f15c39b6295879bc5d81a0d7a6b205d3c44c0ae72d867e5a872aab5f5eabc3","last_reissued_at":"2026-05-17T23:48:53.288961Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.288961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04984","source_version":3,"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:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRtnL/zz9wuLs6NuW1sLXDR0/96yrHYhcwsySXGHkuznYpM1Ea/nBI1+tLjSzHCZJC4sVxnduNukbyd0EI2gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:03:00.588888Z"},"content_sha256":"7fc7a5774d4cc7f8d58318baa0d296be36beacdc3deef7de2acc21b1aeaf456c","schema_version":"1.0","event_id":"sha256:7fc7a5774d4cc7f8d58318baa0d296be36beacdc3deef7de2acc21b1aeaf456c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YPYVYONWFFMHTPC5QGQNPJVSAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Graph Clustering by Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"He Sun, Luca Zanetti","submitted_at":"2016-07-18T09:30:49Z","abstract_excerpt":"Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. However, most of these methods are based on complicated spectral techniques or convex optimisation, and cannot be applied directly for clustering many networks that occur in practice, whose information is often collected on different sites. Designing a simple and distributed clustering algorithm is of great interest, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04984","kind":"arxiv","version":3},"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:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6uHmX78oTGWFXzx2sMoWV+Gx/NFFhHZcZbuUztbHk08pYiv8dQSpjPAVv9mmGFC9nyDs5hOWbvE647gkBaNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:03:00.589233Z"},"content_sha256":"a774f33ff6193a3fc748c6f39f7814121827fe49677823863cd20ad05626e2ff","schema_version":"1.0","event_id":"sha256:a774f33ff6193a3fc748c6f39f7814121827fe49677823863cd20ad05626e2ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/bundle.json","state_url":"https://pith.science/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/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-07-02T06:03:00Z","links":{"resolver":"https://pith.science/pith/YPYVYONWFFMHTPC5QGQNPJVSAX","bundle":"https://pith.science/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/bundle.json","state":"https://pith.science/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPYVYONWFFMHTPC5QGQNPJVSAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YPYVYONWFFMHTPC5QGQNPJVSAX","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":"f58fd6c4b9416611a0689a58adec07458e3db6a48cc5a76efa2cf05467f37b46","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T09:30:49Z","title_canon_sha256":"e6b3760f55426c018f412eaee6e620101cf833d7b1323a66e6b3d8313c4dafe9"},"schema_version":"1.0","source":{"id":"1607.04984","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04984","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04984v3","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04984","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"YPYVYONWFFMH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPYVYONWFFMHTPC5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPYVYONW","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:a774f33ff6193a3fc748c6f39f7814121827fe49677823863cd20ad05626e2ff","target":"graph","created_at":"2026-05-17T23:48:53Z","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":"Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. However, most of these methods are based on complicated spectral techniques or convex optimisation, and cannot be applied directly for clustering many networks that occur in practice, whose information is often collected on different sites. Designing a simple and distributed clustering algorithm is of great interest, ","authors_text":"He Sun, Luca Zanetti","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T09:30:49Z","title":"Distributed Graph Clustering by Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04984","kind":"arxiv","version":3},"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:7fc7a5774d4cc7f8d58318baa0d296be36beacdc3deef7de2acc21b1aeaf456c","target":"record","created_at":"2026-05-17T23:48:53Z","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":"f58fd6c4b9416611a0689a58adec07458e3db6a48cc5a76efa2cf05467f37b46","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T09:30:49Z","title_canon_sha256":"e6b3760f55426c018f412eaee6e620101cf833d7b1323a66e6b3d8313c4dafe9"},"schema_version":"1.0","source":{"id":"1607.04984","kind":"arxiv","version":3}},"canonical_sha256":"c3f15c39b6295879bc5d81a0d7a6b205d3c44c0ae72d867e5a872aab5f5eabc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3f15c39b6295879bc5d81a0d7a6b205d3c44c0ae72d867e5a872aab5f5eabc3","first_computed_at":"2026-05-17T23:48:53.288961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:53.288961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JT1jwpVJQJOG+ub1DExf9h0yQGq2Zp0m5L6sqJN+Xl3hTPAhdNbQFLL+nCBZV48/AuuNs+Uaki+zY08ryVj+Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:53.289547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04984","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc7a5774d4cc7f8d58318baa0d296be36beacdc3deef7de2acc21b1aeaf456c","sha256:a774f33ff6193a3fc748c6f39f7814121827fe49677823863cd20ad05626e2ff"],"state_sha256":"c3f40e67ba9acb8c7667207dc57d652b8a775c8bf044edce81402f8c5cc1beee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1Q7LDy+0Q6cal5biNudJxXHQTCrmEGs2BI+8uVy52Q773xAT9EMhtmBhAbo1Ude6zH5qJdJWgipyOUx4du6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:03:00.591171Z","bundle_sha256":"8057b842a2add574946a35a770fc28e47965f4c19caa2b414c034f7265cb730a"}}