{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FETAQVCS4YLLXCBSZ22XPKLU6L","short_pith_number":"pith:FETAQVCS","canonical_record":{"source":{"id":"1806.02485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T01:56:03Z","cross_cats_sorted":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"title_canon_sha256":"001faf776fcad7bcf145bb028c1ccc03b39b4ae01f00dadd53c6be0df484b78d","abstract_canon_sha256":"8e612c7d9dfb1bb1ce8ec37ee0df67c547761837656747ccc27be64a3edb821f"},"schema_version":"1.0"},"canonical_sha256":"2926085452e616bb8832ceb577a974f2db3ca7b2b782642b1ce1225abf8a5357","source":{"kind":"arxiv","id":"1806.02485","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02485","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02485v2","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02485","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"FETAQVCS4YLL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FETAQVCS4YLLXCBS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FETAQVCS","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FETAQVCS4YLLXCBSZ22XPKLU6L","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T01:56:03Z","cross_cats_sorted":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"title_canon_sha256":"001faf776fcad7bcf145bb028c1ccc03b39b4ae01f00dadd53c6be0df484b78d","abstract_canon_sha256":"8e612c7d9dfb1bb1ce8ec37ee0df67c547761837656747ccc27be64a3edb821f"},"schema_version":"1.0"},"canonical_sha256":"2926085452e616bb8832ceb577a974f2db3ca7b2b782642b1ce1225abf8a5357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:38.167974Z","signature_b64":"4z9Kdi1DDytz3gIWmQIVA695UChL2/tVKIVmt0uuFu+cqcE3WX1NaixpdXDmyBVNOQFNIDnr+/l9W3z+/WPVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2926085452e616bb8832ceb577a974f2db3ca7b2b782642b1ce1225abf8a5357","last_reissued_at":"2026-05-17T23:45:38.167171Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:38.167171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02485","source_version":2,"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-17T23:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXHccTfvOlYcn4WgrpzvTLgz4zNSyYvvn5howA6wUPt1lBZsWTZXFyxoAW5WNwfec0HCfBDyUXRkVnmkUUYSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:36:11.539082Z"},"content_sha256":"c7cd45f1b40074f0c5cd523b3e43e52960fab4f1544c4a8e5a4da78616455a11","schema_version":"1.0","event_id":"sha256:c7cd45f1b40074f0c5cd523b3e43e52960fab4f1544c4a8e5a4da78616455a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FETAQVCS4YLLXCBSZ22XPKLU6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Block Models are a Discrete Surface Tension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"primary_cat":"cs.SI","authors_text":"Andrea L. Bertozzi, Mason A. Porter, Zachary M. Boyd","submitted_at":"2018-06-07T01:56:03Z","abstract_excerpt":"Networks, which represent agents and interactions between them, arise in myriad applications throughout the sciences, engineering, and even the humanities. To understand large-scale structure in a network, a common task is to cluster a network's nodes into sets called \"communities\", such that there are dense connections within communities but sparse connections between them. A popular and statistically principled method to perform such clustering is to use a family of generative models known as stochastic block models (SBMs). In this paper, we show that maximum likelihood estimation in an SBM "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02485","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"},"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-17T23:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1s1NDgfScLHHJ0+mudfLweZq6yl/02FtkuXHgtIFJIi8sT8snXEKMiU0uRwIjTAHIFsshJFP9Z4gWbBYYcocDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:36:11.539496Z"},"content_sha256":"f62609da4490cda8c0da10f92b67487eead369cb026671e431aabaac3008ba09","schema_version":"1.0","event_id":"sha256:f62609da4490cda8c0da10f92b67487eead369cb026671e431aabaac3008ba09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/bundle.json","state_url":"https://pith.science/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/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-05-20T14:36:11Z","links":{"resolver":"https://pith.science/pith/FETAQVCS4YLLXCBSZ22XPKLU6L","bundle":"https://pith.science/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/bundle.json","state":"https://pith.science/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FETAQVCS4YLLXCBSZ22XPKLU6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FETAQVCS4YLLXCBSZ22XPKLU6L","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":"8e612c7d9dfb1bb1ce8ec37ee0df67c547761837656747ccc27be64a3edb821f","cross_cats_sorted":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T01:56:03Z","title_canon_sha256":"001faf776fcad7bcf145bb028c1ccc03b39b4ae01f00dadd53c6be0df484b78d"},"schema_version":"1.0","source":{"id":"1806.02485","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02485","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02485v2","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02485","created_at":"2026-05-17T23:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"FETAQVCS4YLL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FETAQVCS4YLLXCBS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FETAQVCS","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f62609da4490cda8c0da10f92b67487eead369cb026671e431aabaac3008ba09","target":"graph","created_at":"2026-05-17T23:45:38Z","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":"Networks, which represent agents and interactions between them, arise in myriad applications throughout the sciences, engineering, and even the humanities. To understand large-scale structure in a network, a common task is to cluster a network's nodes into sets called \"communities\", such that there are dense connections within communities but sparse connections between them. A popular and statistically principled method to perform such clustering is to use a family of generative models known as stochastic block models (SBMs). In this paper, we show that maximum likelihood estimation in an SBM ","authors_text":"Andrea L. Bertozzi, Mason A. Porter, Zachary M. Boyd","cross_cats":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T01:56:03Z","title":"Stochastic Block Models are a Discrete Surface Tension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02485","kind":"arxiv","version":2},"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:c7cd45f1b40074f0c5cd523b3e43e52960fab4f1544c4a8e5a4da78616455a11","target":"record","created_at":"2026-05-17T23:45:38Z","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":"8e612c7d9dfb1bb1ce8ec37ee0df67c547761837656747ccc27be64a3edb821f","cross_cats_sorted":["cond-mat.stat-mech","math.ST","nlin.AO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T01:56:03Z","title_canon_sha256":"001faf776fcad7bcf145bb028c1ccc03b39b4ae01f00dadd53c6be0df484b78d"},"schema_version":"1.0","source":{"id":"1806.02485","kind":"arxiv","version":2}},"canonical_sha256":"2926085452e616bb8832ceb577a974f2db3ca7b2b782642b1ce1225abf8a5357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2926085452e616bb8832ceb577a974f2db3ca7b2b782642b1ce1225abf8a5357","first_computed_at":"2026-05-17T23:45:38.167171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:38.167171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4z9Kdi1DDytz3gIWmQIVA695UChL2/tVKIVmt0uuFu+cqcE3WX1NaixpdXDmyBVNOQFNIDnr+/l9W3z+/WPVCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:38.167974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02485","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7cd45f1b40074f0c5cd523b3e43e52960fab4f1544c4a8e5a4da78616455a11","sha256:f62609da4490cda8c0da10f92b67487eead369cb026671e431aabaac3008ba09"],"state_sha256":"90a770297bdd2736956952d9fa7224177806ba7dfa6186cb0964679db9b07c26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eq0czLIW0Alh+xACNO5h2buVUGSJpVr8yfaBbPvqyWkb8OpVrr68lJp8nyOlGMGuUavx2YAQ0hQchoSO740+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:36:11.541615Z","bundle_sha256":"6c649ca94ba3226647a3fb2ebd640b7550975a29ea11949cf8e71685b667acb1"}}