{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:R4UUFNWLLNEGQHZ6RRPVX67WEK","short_pith_number":"pith:R4UUFNWL","schema_version":"1.0","canonical_sha256":"8f2942b6cb5b48681f3e8c5f5bfbf622be6e28b8710eb96f5f8867e3017c00bb","source":{"kind":"arxiv","id":"2306.07948","version":2},"attestation_state":"computed","paper":{"title":"Optimal Inference in Contextual Stochastic Block Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"L. Zdeborov\\'a, O. Duranthon","submitted_at":"2023-06-06T10:02:57Z","abstract_excerpt":"The contextual stochastic block model (cSBM) was proposed for unsupervised community detection on attributed graphs where both the graph and the high-dimensional node information correlate with node labels. In the context of machine learning on graphs, the cSBM has been widely used as a synthetic dataset for evaluating the performance of graph-neural networks (GNNs) for semi-supervised node classification. We consider a probabilistic Bayes-optimal formulation of the inference problem and we derive a belief-propagation-based algorithm for the semi-supervised cSBM; we conjecture it is optimal in"},"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":"2306.07948","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2023-06-06T10:02:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7f5feeb91af6aa30afbe77fac8f537f7862f13fdd8863396714953e6e10afa0b","abstract_canon_sha256":"f9f717fc9a0c541e669a97f71c0844a2e5ff7eca6ada8843b7b990032990d207"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:46.194033Z","signature_b64":"wpr/bE6CVxSHGXV1r261PJW6X1JCw2hFaRbyeeHYv2mLBMHHuUARi9wXm8LLTyl4OYEiSMIlFMbCIaW4rTsBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f2942b6cb5b48681f3e8c5f5bfbf622be6e28b8710eb96f5f8867e3017c00bb","last_reissued_at":"2026-07-05T08:45:46.193651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:46.193651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Inference in Contextual Stochastic Block Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"L. Zdeborov\\'a, O. Duranthon","submitted_at":"2023-06-06T10:02:57Z","abstract_excerpt":"The contextual stochastic block model (cSBM) was proposed for unsupervised community detection on attributed graphs where both the graph and the high-dimensional node information correlate with node labels. In the context of machine learning on graphs, the cSBM has been widely used as a synthetic dataset for evaluating the performance of graph-neural networks (GNNs) for semi-supervised node classification. We consider a probabilistic Bayes-optimal formulation of the inference problem and we derive a belief-propagation-based algorithm for the semi-supervised cSBM; we conjecture it is optimal in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07948","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.07948/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.07948","created_at":"2026-07-05T08:45:46.193708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07948v2","created_at":"2026-07-05T08:45:46.193708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07948","created_at":"2026-07-05T08:45:46.193708+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4UUFNWLLNEG","created_at":"2026-07-05T08:45:46.193708+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4UUFNWLLNEGQHZ6","created_at":"2026-07-05T08:45:46.193708+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4UUFNWL","created_at":"2026-07-05T08:45:46.193708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22935","citing_title":"Is Noise Conditioning Necessary? A Unified Theory of Unconditional Graph Diffusion Models","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK","json":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK.json","graph_json":"https://pith.science/api/pith-number/R4UUFNWLLNEGQHZ6RRPVX67WEK/graph.json","events_json":"https://pith.science/api/pith-number/R4UUFNWLLNEGQHZ6RRPVX67WEK/events.json","paper":"https://pith.science/paper/R4UUFNWL"},"agent_actions":{"view_html":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK","download_json":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK.json","view_paper":"https://pith.science/paper/R4UUFNWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07948&json=true","fetch_graph":"https://pith.science/api/pith-number/R4UUFNWLLNEGQHZ6RRPVX67WEK/graph.json","fetch_events":"https://pith.science/api/pith-number/R4UUFNWLLNEGQHZ6RRPVX67WEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK/action/storage_attestation","attest_author":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK/action/author_attestation","sign_citation":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK/action/citation_signature","submit_replication":"https://pith.science/pith/R4UUFNWLLNEGQHZ6RRPVX67WEK/action/replication_record"}},"created_at":"2026-07-05T08:45:46.193708+00:00","updated_at":"2026-07-05T08:45:46.193708+00:00"}