{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RW6MR65XSGRSYEUATOJQU7HWSY","short_pith_number":"pith:RW6MR65X","canonical_record":{"source":{"id":"1210.3335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-11T19:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"da9ae78863efa26648f7bf644121f6d7eb23cb47711666178ac51040487e8dac","abstract_canon_sha256":"a7d2c6e11a95068222dd3085c2feed7a52d00999b73c1dcea828cb9e6b9800e4"},"schema_version":"1.0"},"canonical_sha256":"8dbcc8fbb791a32c12809b930a7cf69636f1936029b1ddf9412328492be6627e","source":{"kind":"arxiv","id":"1210.3335","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3335","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3335v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3335","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"RW6MR65XSGRS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RW6MR65XSGRSYEUA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RW6MR65X","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RW6MR65XSGRSYEUATOJQU7HWSY","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-11T19:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"da9ae78863efa26648f7bf644121f6d7eb23cb47711666178ac51040487e8dac","abstract_canon_sha256":"a7d2c6e11a95068222dd3085c2feed7a52d00999b73c1dcea828cb9e6b9800e4"},"schema_version":"1.0"},"canonical_sha256":"8dbcc8fbb791a32c12809b930a7cf69636f1936029b1ddf9412328492be6627e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.831152Z","signature_b64":"sxnqoM0a5yhlf+r/uIOKJhHalP6oTIV7SnnOnayb5RUJ37fgzTkLjxX+8ykaWcvQ8klQ2534RGsYZKDAJP9VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dbcc8fbb791a32c12809b930a7cf69636f1936029b1ddf9412328492be6627e","last_reissued_at":"2026-05-18T00:58:42.830719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.830719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3335","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXd2cKRoV/Yt7ZJUfNfcddCHdrQl4V6zE0FE0KdAA/ebh1e3GJ2RJzA+BqARI8IF5ZfF3NO2JoLM/f4jOLYDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:41:59.275395Z"},"content_sha256":"86ca7be87bca1a21e2a78f3d1add6710d7143824aab309755ed87ec243e81a98","schema_version":"1.0","event_id":"sha256:86ca7be87bca1a21e2a78f3d1add6710d7143824aab309755ed87ec243e81a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RW6MR65XSGRSYEUATOJQU7HWSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Huan Xu, Sujay Sanghavi, Yudong Chen","submitted_at":"2012-10-11T19:27:28Z","abstract_excerpt":"Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this problem is the stochastic block model, also referred to as the planted partition model.\n  In this paper we present a new algorithm--a convexified version of Maximum Likelihood--for graph clustering. We show that, in the classic stochastic block model setting, it outperforms existing methods by polynomial factors when the cluster size is allowed to have general sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3335","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmiddIcpYGg3F/g/47VMguwufya7HqXgpVdyQ8TbgcO7U38ET3OeKKiLrE+sPV/yWcngF7UysoKSKuK+OvOKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:41:59.275755Z"},"content_sha256":"dfac7e386b38a4b9964cce3d60c07ca64f611113e9fee118214e28b20191a7ff","schema_version":"1.0","event_id":"sha256:dfac7e386b38a4b9964cce3d60c07ca64f611113e9fee118214e28b20191a7ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RW6MR65XSGRSYEUATOJQU7HWSY/bundle.json","state_url":"https://pith.science/pith/RW6MR65XSGRSYEUATOJQU7HWSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RW6MR65XSGRSYEUATOJQU7HWSY/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-02T16:41:59Z","links":{"resolver":"https://pith.science/pith/RW6MR65XSGRSYEUATOJQU7HWSY","bundle":"https://pith.science/pith/RW6MR65XSGRSYEUATOJQU7HWSY/bundle.json","state":"https://pith.science/pith/RW6MR65XSGRSYEUATOJQU7HWSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RW6MR65XSGRSYEUATOJQU7HWSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RW6MR65XSGRSYEUATOJQU7HWSY","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":"a7d2c6e11a95068222dd3085c2feed7a52d00999b73c1dcea828cb9e6b9800e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-11T19:27:28Z","title_canon_sha256":"da9ae78863efa26648f7bf644121f6d7eb23cb47711666178ac51040487e8dac"},"schema_version":"1.0","source":{"id":"1210.3335","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3335","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3335v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3335","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"RW6MR65XSGRS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RW6MR65XSGRSYEUA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RW6MR65X","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:dfac7e386b38a4b9964cce3d60c07ca64f611113e9fee118214e28b20191a7ff","target":"graph","created_at":"2026-05-18T00:58:42Z","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 involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this problem is the stochastic block model, also referred to as the planted partition model.\n  In this paper we present a new algorithm--a convexified version of Maximum Likelihood--for graph clustering. We show that, in the classic stochastic block model setting, it outperforms existing methods by polynomial factors when the cluster size is allowed to have general sca","authors_text":"Huan Xu, Sujay Sanghavi, Yudong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-11T19:27:28Z","title":"Improved Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3335","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:86ca7be87bca1a21e2a78f3d1add6710d7143824aab309755ed87ec243e81a98","target":"record","created_at":"2026-05-18T00:58:42Z","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":"a7d2c6e11a95068222dd3085c2feed7a52d00999b73c1dcea828cb9e6b9800e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-11T19:27:28Z","title_canon_sha256":"da9ae78863efa26648f7bf644121f6d7eb23cb47711666178ac51040487e8dac"},"schema_version":"1.0","source":{"id":"1210.3335","kind":"arxiv","version":3}},"canonical_sha256":"8dbcc8fbb791a32c12809b930a7cf69636f1936029b1ddf9412328492be6627e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dbcc8fbb791a32c12809b930a7cf69636f1936029b1ddf9412328492be6627e","first_computed_at":"2026-05-18T00:58:42.830719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.830719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sxnqoM0a5yhlf+r/uIOKJhHalP6oTIV7SnnOnayb5RUJ37fgzTkLjxX+8ykaWcvQ8klQ2534RGsYZKDAJP9VCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.831152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3335","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ca7be87bca1a21e2a78f3d1add6710d7143824aab309755ed87ec243e81a98","sha256:dfac7e386b38a4b9964cce3d60c07ca64f611113e9fee118214e28b20191a7ff"],"state_sha256":"2adab2e6c3ed8dc623db593535d09f9eba269428dff0379c4e36a3aa512f8d81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwLpM1vI0zrYpxT65i0Usb1Pc2JnKQPGv3tHOdrMeBWh8R/YPD84UgSmXAbmUb6iWeZI09/A7/PrE9WwUEZsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:41:59.277788Z","bundle_sha256":"c86589183d1af9bb4b13ace5ba98a425c79bcea29ed6bdd2b64d03be129d91a4"}}