{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QZ2RT2P3GKF3VCIBMI7DUWRYDX","short_pith_number":"pith:QZ2RT2P3","canonical_record":{"source":{"id":"1202.1499","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T19:17:58Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"e7b41e55332d6b8decf7531dc850684ee625c2ea89d5a65540c1e7f55f49618c","abstract_canon_sha256":"6354a6a2c2cd701b26e268e136d952df976e4ec9bcd4a813103f36d96209ea38"},"schema_version":"1.0"},"canonical_sha256":"867519e9fb328bba8901623e3a5a381dd7e86ce796a5a90f08c3b541032abcf5","source":{"kind":"arxiv","id":"1202.1499","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1499","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1499v4","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1499","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"QZ2RT2P3GKF3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZ2RT2P3GKF3VCIB","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZ2RT2P3","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QZ2RT2P3GKF3VCIBMI7DUWRYDX","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1499","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T19:17:58Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"e7b41e55332d6b8decf7531dc850684ee625c2ea89d5a65540c1e7f55f49618c","abstract_canon_sha256":"6354a6a2c2cd701b26e268e136d952df976e4ec9bcd4a813103f36d96209ea38"},"schema_version":"1.0"},"canonical_sha256":"867519e9fb328bba8901623e3a5a381dd7e86ce796a5a90f08c3b541032abcf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:23.257850Z","signature_b64":"Zdx84dPl1ZLOGxPOvc0o982ttjTE/eCtgvDlAf6sk8m/2wyRfykAzgeVHDw/J7NVUWsxyrpmn1hf6QwKf8+7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"867519e9fb328bba8901623e3a5a381dd7e86ce796a5a90f08c3b541032abcf5","last_reissued_at":"2026-05-18T03:48:23.257035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:23.257035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1499","source_version":4,"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-18T03:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e95hReqHa3AmCVhUhYERYJW3nwGVQ0+p4PJjosuVV6HreaSqxEroGDqYm+G6mrBH4EeAvSbX0uMttehK78G6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:50:40.402511Z"},"content_sha256":"18cb50fedda905902f90bd53d74807cde807a7e140f1de6ccab1b45570367cfc","schema_version":"1.0","event_id":"sha256:18cb50fedda905902f90bd53d74807cde807a7e140f1de6ccab1b45570367cfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QZ2RT2P3GKF3VCIBMI7DUWRYDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Block Models and Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Allan Sly, Elchanan Mossel, Joe Neeman","submitted_at":"2012-02-07T19:17:58Z","abstract_excerpt":"The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics, and computer science. In its simplest form, the planted partition model is a model for random graphs on $n$ nodes with two equal-sized clusters, with an between-class edge probability of $q$ and a within-class edge probability of $p$. Although most of the literature on this model has focused on the case of increasing degrees (ie.\\ $pn, qn \\to \\infty$ as $n \\to \\infty$), the sparse case $p, q = O(1/n)$ is interesting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1499","kind":"arxiv","version":4},"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-18T03:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gSkv8yLJJ6O7nOixDqQlILXLPDEMuFbFKVPAF+k6rQHs9NTRgh7MbD7hG9YXv1kiZOHX/oVEQnqSuMiZTj6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:50:40.403033Z"},"content_sha256":"4df3e9a348977e4457c7ba854d93cced222ebc8ac9089c446b9cb19c8528bb7a","schema_version":"1.0","event_id":"sha256:4df3e9a348977e4457c7ba854d93cced222ebc8ac9089c446b9cb19c8528bb7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/bundle.json","state_url":"https://pith.science/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/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-26T18:50:40Z","links":{"resolver":"https://pith.science/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX","bundle":"https://pith.science/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/bundle.json","state":"https://pith.science/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZ2RT2P3GKF3VCIBMI7DUWRYDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QZ2RT2P3GKF3VCIBMI7DUWRYDX","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":"6354a6a2c2cd701b26e268e136d952df976e4ec9bcd4a813103f36d96209ea38","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T19:17:58Z","title_canon_sha256":"e7b41e55332d6b8decf7531dc850684ee625c2ea89d5a65540c1e7f55f49618c"},"schema_version":"1.0","source":{"id":"1202.1499","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1499","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1499v4","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1499","created_at":"2026-05-18T03:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"QZ2RT2P3GKF3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZ2RT2P3GKF3VCIB","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZ2RT2P3","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:4df3e9a348977e4457c7ba854d93cced222ebc8ac9089c446b9cb19c8528bb7a","target":"graph","created_at":"2026-05-18T03:48:23Z","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":"The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics, and computer science. In its simplest form, the planted partition model is a model for random graphs on $n$ nodes with two equal-sized clusters, with an between-class edge probability of $q$ and a within-class edge probability of $p$. Although most of the literature on this model has focused on the case of increasing degrees (ie.\\ $pn, qn \\to \\infty$ as $n \\to \\infty$), the sparse case $p, q = O(1/n)$ is interesting","authors_text":"Allan Sly, Elchanan Mossel, Joe Neeman","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T19:17:58Z","title":"Stochastic Block Models and Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1499","kind":"arxiv","version":4},"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:18cb50fedda905902f90bd53d74807cde807a7e140f1de6ccab1b45570367cfc","target":"record","created_at":"2026-05-18T03:48:23Z","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":"6354a6a2c2cd701b26e268e136d952df976e4ec9bcd4a813103f36d96209ea38","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T19:17:58Z","title_canon_sha256":"e7b41e55332d6b8decf7531dc850684ee625c2ea89d5a65540c1e7f55f49618c"},"schema_version":"1.0","source":{"id":"1202.1499","kind":"arxiv","version":4}},"canonical_sha256":"867519e9fb328bba8901623e3a5a381dd7e86ce796a5a90f08c3b541032abcf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"867519e9fb328bba8901623e3a5a381dd7e86ce796a5a90f08c3b541032abcf5","first_computed_at":"2026-05-18T03:48:23.257035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:23.257035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zdx84dPl1ZLOGxPOvc0o982ttjTE/eCtgvDlAf6sk8m/2wyRfykAzgeVHDw/J7NVUWsxyrpmn1hf6QwKf8+7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:23.257850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1499","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18cb50fedda905902f90bd53d74807cde807a7e140f1de6ccab1b45570367cfc","sha256:4df3e9a348977e4457c7ba854d93cced222ebc8ac9089c446b9cb19c8528bb7a"],"state_sha256":"2203c72b8ab50ae50c8a028d8d7c52a46adcfb6090f6998766adc66b5d44c059"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsgR78776/aX26HaDKD2La8INndNh3PPT15Q9kGF4QZ6lul9PnHZe+yKyvDCfMDLiyIK9PG7ylNbAa9M3XRGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:50:40.406133Z","bundle_sha256":"c65d6026c8701f72de33eb07a8c8fef933f3b2bc45c8529ea3ef0efdf0dd5046"}}