{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FAHXR3RDYXJQFOUWPP2JEQI6GR","short_pith_number":"pith:FAHXR3RD","canonical_record":{"source":{"id":"1708.05573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-18T12:09:10Z","cross_cats_sorted":["math.ST","stat.CO","stat.ME","stat.TH"],"title_canon_sha256":"1961d602321d270032e0fd7a5eb348e4581273b7b8d6ecbfd0b39dc499cb8bf2","abstract_canon_sha256":"7d9bb99dad1453a9025f20f45882954cba82ecba1473420dfc40c19b21e79b56"},"schema_version":"1.0"},"canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","source":{"kind":"arxiv","id":"1708.05573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05573","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05573v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05573","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"FAHXR3RDYXJQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAHXR3RDYXJQFOUW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAHXR3RD","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FAHXR3RDYXJQFOUWPP2JEQI6GR","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-18T12:09:10Z","cross_cats_sorted":["math.ST","stat.CO","stat.ME","stat.TH"],"title_canon_sha256":"1961d602321d270032e0fd7a5eb348e4581273b7b8d6ecbfd0b39dc499cb8bf2","abstract_canon_sha256":"7d9bb99dad1453a9025f20f45882954cba82ecba1473420dfc40c19b21e79b56"},"schema_version":"1.0"},"canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:49.655963Z","signature_b64":"lm1vd5/YN5OzL19WfR00m4YCy1hYH+/dubtaRdN5qa0kWCq+iUE5EXzGU/jHAUq3SQK47/+vAiXHUS5NlPluCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","last_reissued_at":"2026-05-18T00:37:49.655449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:49.655449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05573","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:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+p8lnV99Zj8fRVSt7SMhx6cWqv0KZrdKnM5FmPjL4dARIsRSb4OiCwvl4mqFQL8/rlvGtIx3phGoJpb/Z3xmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:07:43.118126Z"},"content_sha256":"c777c1275092713e98026d2885e74dfa2e7fedf1f9a88dea305cc37259d57c66","schema_version":"1.0","event_id":"sha256:c777c1275092713e98026d2885e74dfa2e7fedf1f9a88dea305cc37259d57c66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FAHXR3RDYXJQFOUWPP2JEQI6GR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two provably consistent divide and conquer clustering algorithms for large networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Peter J. Bickel, Purnamrita Sarkar, Soumendu Sundar Mukherjee","submitted_at":"2017-08-18T12:09:10Z","abstract_excerpt":"In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks. We propose two algorithms which perform clustering on a number of small subgraphs and finally patches the results into a single clustering. The main advantage of these algorithms is that they bring down significantly the computational cost of traditional algorithms, including spectral clustering, semi-definite programs, modularity based methods, likelihood based methods etc., without losing on accuracy and even improving accuracy at times. These algorithms are also, by nature, par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05573","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:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8E0iaaYnpeKk0PzhQCihbJZTAZAYevwzGJT+YTRdHKbRXXYg8h1eLnJKN1C1xxZSaUJbi4FbhvvDb/UZn6oUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:07:43.118541Z"},"content_sha256":"2ae57e6516aeadd108f0cef9e480eb2ffeb36853775ecf9450d070cc8140f484","schema_version":"1.0","event_id":"sha256:2ae57e6516aeadd108f0cef9e480eb2ffeb36853775ecf9450d070cc8140f484"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/bundle.json","state_url":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/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-06-02T17:07:43Z","links":{"resolver":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR","bundle":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/bundle.json","state":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FAHXR3RDYXJQFOUWPP2JEQI6GR","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":"7d9bb99dad1453a9025f20f45882954cba82ecba1473420dfc40c19b21e79b56","cross_cats_sorted":["math.ST","stat.CO","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-18T12:09:10Z","title_canon_sha256":"1961d602321d270032e0fd7a5eb348e4581273b7b8d6ecbfd0b39dc499cb8bf2"},"schema_version":"1.0","source":{"id":"1708.05573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05573","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05573v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05573","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"FAHXR3RDYXJQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAHXR3RDYXJQFOUW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAHXR3RD","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:2ae57e6516aeadd108f0cef9e480eb2ffeb36853775ecf9450d070cc8140f484","target":"graph","created_at":"2026-05-18T00:37:49Z","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":"In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks. We propose two algorithms which perform clustering on a number of small subgraphs and finally patches the results into a single clustering. The main advantage of these algorithms is that they bring down significantly the computational cost of traditional algorithms, including spectral clustering, semi-definite programs, modularity based methods, likelihood based methods etc., without losing on accuracy and even improving accuracy at times. These algorithms are also, by nature, par","authors_text":"Peter J. Bickel, Purnamrita Sarkar, Soumendu Sundar Mukherjee","cross_cats":["math.ST","stat.CO","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-18T12:09:10Z","title":"Two provably consistent divide and conquer clustering algorithms for large networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05573","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:c777c1275092713e98026d2885e74dfa2e7fedf1f9a88dea305cc37259d57c66","target":"record","created_at":"2026-05-18T00:37:49Z","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":"7d9bb99dad1453a9025f20f45882954cba82ecba1473420dfc40c19b21e79b56","cross_cats_sorted":["math.ST","stat.CO","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-18T12:09:10Z","title_canon_sha256":"1961d602321d270032e0fd7a5eb348e4581273b7b8d6ecbfd0b39dc499cb8bf2"},"schema_version":"1.0","source":{"id":"1708.05573","kind":"arxiv","version":1}},"canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","first_computed_at":"2026-05-18T00:37:49.655449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:49.655449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lm1vd5/YN5OzL19WfR00m4YCy1hYH+/dubtaRdN5qa0kWCq+iUE5EXzGU/jHAUq3SQK47/+vAiXHUS5NlPluCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:49.655963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c777c1275092713e98026d2885e74dfa2e7fedf1f9a88dea305cc37259d57c66","sha256:2ae57e6516aeadd108f0cef9e480eb2ffeb36853775ecf9450d070cc8140f484"],"state_sha256":"d01ef9ef2df9326a2eb6274257d3670554c8fb69d366a66d7bd60b02b461ce3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMIpTTNmrW6BX/qe31ovx2V1tuU9Q4fMaFQjNgNWfW3MelC8IpyUhrIfz9GOXsAKkK5dxtZiPfqqkUJu4czfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:07:43.120439Z","bundle_sha256":"8ed1438a76427b46a92490cf52455263a80ad076914e41fec85707b1aeca79df"}}