{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FAHXR3RDYXJQFOUWPP2JEQI6GR","short_pith_number":"pith:FAHXR3RD","schema_version":"1.0","canonical_sha256":"280f78ee23c5d302ba967bf492411e346772e9c9a9e22f1d0c5e06341c7f6347","source":{"kind":"arxiv","id":"1708.05573","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.05573","created_at":"2026-05-18T00:37:49.655531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05573v1","created_at":"2026-05-18T00:37:49.655531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05573","created_at":"2026-05-18T00:37:49.655531+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAHXR3RDYXJQ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAHXR3RDYXJQFOUW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAHXR3RD","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR","json":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR.json","graph_json":"https://pith.science/api/pith-number/FAHXR3RDYXJQFOUWPP2JEQI6GR/graph.json","events_json":"https://pith.science/api/pith-number/FAHXR3RDYXJQFOUWPP2JEQI6GR/events.json","paper":"https://pith.science/paper/FAHXR3RD"},"agent_actions":{"view_html":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR","download_json":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR.json","view_paper":"https://pith.science/paper/FAHXR3RD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05573&json=true","fetch_graph":"https://pith.science/api/pith-number/FAHXR3RDYXJQFOUWPP2JEQI6GR/graph.json","fetch_events":"https://pith.science/api/pith-number/FAHXR3RDYXJQFOUWPP2JEQI6GR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/action/storage_attestation","attest_author":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/action/author_attestation","sign_citation":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/action/citation_signature","submit_replication":"https://pith.science/pith/FAHXR3RDYXJQFOUWPP2JEQI6GR/action/replication_record"}},"created_at":"2026-05-18T00:37:49.655531+00:00","updated_at":"2026-05-18T00:37:49.655531+00:00"}