{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CGZTFAW4GAQIYQB2GDTLFIRNFA","short_pith_number":"pith:CGZTFAW4","schema_version":"1.0","canonical_sha256":"11b33282dc30208c403a30e6b2a22d282581867d850c8b2067424854bf599fe8","source":{"kind":"arxiv","id":"1207.3994","version":2},"attestation_state":"computed","paper":{"title":"Model Selection for Degree-corrected Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.ST","physics.soc-ph","stat.ML","stat.TH"],"primary_cat":"cs.SI","authors_text":"Cosma Rohilla Shalizi, Cristopher Moore, Florent Krzakala, Jacob E. Jensen, Lenka Zdeborova, Pan Zhang, Xiaoran Yan, Yaojia Zhu","submitted_at":"2012-07-17T13:58:56Z","abstract_excerpt":"The proliferation of models for networks raises challenging problems of model selection: the data are sparse and globally dependent, and models are typically high-dimensional and have large numbers of latent variables. Together, these issues mean that the usual model-selection criteria do not work properly for networks. We illustrate these challenges, and show one way to resolve them, by considering the key network-analysis problem of dividing a graph into communities or blocks of nodes with homogeneous patterns of links to the rest of the network. The standard tool for doing this is the stoch"},"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":"1207.3994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-07-17T13:58:56Z","cross_cats_sorted":["cond-mat.stat-mech","math.ST","physics.soc-ph","stat.ML","stat.TH"],"title_canon_sha256":"25a4464b2c9eedf52270bb25c0428cd8734eb11ed997b2a6898ebad853d48c20","abstract_canon_sha256":"ad83020b31faa03f9c4a1c045677c0eeba751579628f81f4df14b01b5334860f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:10.171933Z","signature_b64":"CuGOEyZ03DRy4JuRvPjeKIRaYkokwiGfG8WLkOpi6Dw/ADpALxzvQuWtLVqZnx42so7nTjucgUBG5iuieRdYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b33282dc30208c403a30e6b2a22d282581867d850c8b2067424854bf599fe8","last_reissued_at":"2026-05-18T02:49:10.171440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:10.171440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Selection for Degree-corrected Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.ST","physics.soc-ph","stat.ML","stat.TH"],"primary_cat":"cs.SI","authors_text":"Cosma Rohilla Shalizi, Cristopher Moore, Florent Krzakala, Jacob E. Jensen, Lenka Zdeborova, Pan Zhang, Xiaoran Yan, Yaojia Zhu","submitted_at":"2012-07-17T13:58:56Z","abstract_excerpt":"The proliferation of models for networks raises challenging problems of model selection: the data are sparse and globally dependent, and models are typically high-dimensional and have large numbers of latent variables. Together, these issues mean that the usual model-selection criteria do not work properly for networks. We illustrate these challenges, and show one way to resolve them, by considering the key network-analysis problem of dividing a graph into communities or blocks of nodes with homogeneous patterns of links to the rest of the network. The standard tool for doing this is the stoch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3994","kind":"arxiv","version":2},"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":"1207.3994","created_at":"2026-05-18T02:49:10.171524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3994v2","created_at":"2026-05-18T02:49:10.171524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3994","created_at":"2026-05-18T02:49:10.171524+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGZTFAW4GAQI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGZTFAW4GAQIYQB2","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGZTFAW4","created_at":"2026-05-18T12:27:01.376967+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/CGZTFAW4GAQIYQB2GDTLFIRNFA","json":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA.json","graph_json":"https://pith.science/api/pith-number/CGZTFAW4GAQIYQB2GDTLFIRNFA/graph.json","events_json":"https://pith.science/api/pith-number/CGZTFAW4GAQIYQB2GDTLFIRNFA/events.json","paper":"https://pith.science/paper/CGZTFAW4"},"agent_actions":{"view_html":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA","download_json":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA.json","view_paper":"https://pith.science/paper/CGZTFAW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3994&json=true","fetch_graph":"https://pith.science/api/pith-number/CGZTFAW4GAQIYQB2GDTLFIRNFA/graph.json","fetch_events":"https://pith.science/api/pith-number/CGZTFAW4GAQIYQB2GDTLFIRNFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA/action/storage_attestation","attest_author":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA/action/author_attestation","sign_citation":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA/action/citation_signature","submit_replication":"https://pith.science/pith/CGZTFAW4GAQIYQB2GDTLFIRNFA/action/replication_record"}},"created_at":"2026-05-18T02:49:10.171524+00:00","updated_at":"2026-05-18T02:49:10.171524+00:00"}