{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G2HCBCSUCPJ7S2CLAVU4UDNKTE","short_pith_number":"pith:G2HCBCSU","canonical_record":{"source":{"id":"1711.01262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T17:52:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"741eb2af6a7e05dcdcc9db993ecbe1964394701dc40b93da933e535d76672175","abstract_canon_sha256":"7fa7b65f372ce43a81145cd1b0166c513c6a621061ff6f18bf73b65f4230caa8"},"schema_version":"1.0"},"canonical_sha256":"368e208a5413d3f9684b0569ca0daa9937f0eb5bbc2b74e134607e8cafea3a4c","source":{"kind":"arxiv","id":"1711.01262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01262","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01262v1","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01262","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"G2HCBCSUCPJ7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2HCBCSUCPJ7S2CL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2HCBCSU","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G2HCBCSUCPJ7S2CLAVU4UDNKTE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T17:52:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"741eb2af6a7e05dcdcc9db993ecbe1964394701dc40b93da933e535d76672175","abstract_canon_sha256":"7fa7b65f372ce43a81145cd1b0166c513c6a621061ff6f18bf73b65f4230caa8"},"schema_version":"1.0"},"canonical_sha256":"368e208a5413d3f9684b0569ca0daa9937f0eb5bbc2b74e134607e8cafea3a4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.036264Z","signature_b64":"FoQzEFzcfY3+EjzSolzo7zHhK0A26IOoUXsR9cdMEK58a2dQ7KL5OvQo5mTzvXYO8iCuxtLKJbD6I1oohUhuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368e208a5413d3f9684b0569ca0daa9937f0eb5bbc2b74e134607e8cafea3a4c","last_reissued_at":"2026-05-18T00:31:23.035781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.035781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01262","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:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yuq7Jzklo+d74S87d6cvoFVPx/An2MT2n3yDS3A+hqDzGBeG3FYN6yU985nQKzj0yjUWm5Z9JwM5MRvSpahUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:05:14.561382Z"},"content_sha256":"2fe557dc92978eeac17941b8157eacc61518af7ec45a5af298eb2bd25ed52a33","schema_version":"1.0","event_id":"sha256:2fe557dc92978eeac17941b8157eacc61518af7ec45a5af298eb2bd25ed52a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G2HCBCSUCPJ7S2CLAVU4UDNKTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Graph Clustering and Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"He Sun, Luca Zanetti","submitted_at":"2017-11-03T17:52:28Z","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. Most of these methods, however, are based on complicated spectral techniques or convex optimisation, and cannot be directly applied 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":"1711.01262","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:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIrVCys2Se/Qbl6hy6SrlLwGJsrZ0/ei+8Y2QxXV9qrfyJwlp8SbF8HX8jNzKmfqzWu904u7widPcNWnd1ylCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:05:14.561735Z"},"content_sha256":"8cc6203efb2a0702cf55bf2ade586c0597889606e4e7599772eb862448a30e52","schema_version":"1.0","event_id":"sha256:8cc6203efb2a0702cf55bf2ade586c0597889606e4e7599772eb862448a30e52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/bundle.json","state_url":"https://pith.science/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/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-02T04:05:14Z","links":{"resolver":"https://pith.science/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE","bundle":"https://pith.science/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/bundle.json","state":"https://pith.science/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2HCBCSUCPJ7S2CLAVU4UDNKTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G2HCBCSUCPJ7S2CLAVU4UDNKTE","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":"7fa7b65f372ce43a81145cd1b0166c513c6a621061ff6f18bf73b65f4230caa8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T17:52:28Z","title_canon_sha256":"741eb2af6a7e05dcdcc9db993ecbe1964394701dc40b93da933e535d76672175"},"schema_version":"1.0","source":{"id":"1711.01262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01262","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01262v1","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01262","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"G2HCBCSUCPJ7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2HCBCSUCPJ7S2CL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2HCBCSU","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8cc6203efb2a0702cf55bf2ade586c0597889606e4e7599772eb862448a30e52","target":"graph","created_at":"2026-05-18T00:31:23Z","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. Most of these methods, however, are based on complicated spectral techniques or convex optimisation, and cannot be directly applied 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"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T17:52:28Z","title":"Distributed Graph Clustering and Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01262","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:2fe557dc92978eeac17941b8157eacc61518af7ec45a5af298eb2bd25ed52a33","target":"record","created_at":"2026-05-18T00:31:23Z","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":"7fa7b65f372ce43a81145cd1b0166c513c6a621061ff6f18bf73b65f4230caa8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T17:52:28Z","title_canon_sha256":"741eb2af6a7e05dcdcc9db993ecbe1964394701dc40b93da933e535d76672175"},"schema_version":"1.0","source":{"id":"1711.01262","kind":"arxiv","version":1}},"canonical_sha256":"368e208a5413d3f9684b0569ca0daa9937f0eb5bbc2b74e134607e8cafea3a4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"368e208a5413d3f9684b0569ca0daa9937f0eb5bbc2b74e134607e8cafea3a4c","first_computed_at":"2026-05-18T00:31:23.035781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:23.035781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FoQzEFzcfY3+EjzSolzo7zHhK0A26IOoUXsR9cdMEK58a2dQ7KL5OvQo5mTzvXYO8iCuxtLKJbD6I1oohUhuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:23.036264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe557dc92978eeac17941b8157eacc61518af7ec45a5af298eb2bd25ed52a33","sha256:8cc6203efb2a0702cf55bf2ade586c0597889606e4e7599772eb862448a30e52"],"state_sha256":"8aa410d166fab7bc283635ef0413b37a30e1d4e9267e1c81666fe1f86aa673d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhGpjLQkCUzAuI+cnVhVZRUmdf+ywM1PIRGx94Jm9Bcw7hP0lBY3Gkt5V5VbrUsFNuNt7Pwao+5Tw2GVauymDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T04:05:14.563745Z","bundle_sha256":"355951c9926a75a70395d88f0dc370607541a8242992056efc7c5a0ef8b1668b"}}