{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YOANNLQ3JOTM5SK4RTCORGQW3I","short_pith_number":"pith:YOANNLQ3","schema_version":"1.0","canonical_sha256":"c380d6ae1b4ba6cec95c8cc4e89a16da17da49686b3b123fc736df357e2cb3bd","source":{"kind":"arxiv","id":"2311.15598","version":1},"attestation_state":"computed","paper":{"title":"Optimal Clustering of Discrete Mixtures: Binomial, Poisson, Block Models, and Multi-layer Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dong Xia, Ting Li, Zhongyuan Lyu","submitted_at":"2023-11-27T07:48:50Z","abstract_excerpt":"In this paper, we first study the fundamental limit of clustering networks when a multi-layer network is present. Under the mixture multi-layer stochastic block model (MMSBM), we show that the minimax optimal network clustering error rate, which takes an exponential form and is characterized by the Renyi divergence between the edge probability distributions of the component networks. We propose a novel two-stage network clustering method including a tensor-based initialization algorithm involving both node and sample splitting and a refinement procedure by likelihood-based Lloyd algorithm. Net"},"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":"2311.15598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-11-27T07:48:50Z","cross_cats_sorted":["cs.LG","cs.SI","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"198f2e4fbdd358025b2f6e52b84f3f0250d899e53ed3573df917fe6043c81b51","abstract_canon_sha256":"23e9f1f6d5d919a811bd1eeed28033b5acd5e004f21500766fc403f2f49087e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:06.437779Z","signature_b64":"71hseA9SbLa1Wc9inF84sZ84whAp1EHsyxAID7Q4Bka+FT0NlwaP7q51+K00EgTBEPIcLXX9OVJ+FEq8J5KuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c380d6ae1b4ba6cec95c8cc4e89a16da17da49686b3b123fc736df357e2cb3bd","last_reissued_at":"2026-07-05T07:17:06.437348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:06.437348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Clustering of Discrete Mixtures: Binomial, Poisson, Block Models, and Multi-layer Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dong Xia, Ting Li, Zhongyuan Lyu","submitted_at":"2023-11-27T07:48:50Z","abstract_excerpt":"In this paper, we first study the fundamental limit of clustering networks when a multi-layer network is present. Under the mixture multi-layer stochastic block model (MMSBM), we show that the minimax optimal network clustering error rate, which takes an exponential form and is characterized by the Renyi divergence between the edge probability distributions of the component networks. We propose a novel two-stage network clustering method including a tensor-based initialization algorithm involving both node and sample splitting and a refinement procedure by likelihood-based Lloyd algorithm. Net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15598","kind":"arxiv","version":1},"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/2311.15598/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":"2311.15598","created_at":"2026-07-05T07:17:06.437407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.15598v1","created_at":"2026-07-05T07:17:06.437407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15598","created_at":"2026-07-05T07:17:06.437407+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOANNLQ3JOTM","created_at":"2026-07-05T07:17:06.437407+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOANNLQ3JOTM5SK4","created_at":"2026-07-05T07:17:06.437407+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOANNLQ3","created_at":"2026-07-05T07:17:06.437407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06483","citing_title":"Statistically and Computationally Optimal Estimation and Inference of Common Subspaces","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I","json":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I.json","graph_json":"https://pith.science/api/pith-number/YOANNLQ3JOTM5SK4RTCORGQW3I/graph.json","events_json":"https://pith.science/api/pith-number/YOANNLQ3JOTM5SK4RTCORGQW3I/events.json","paper":"https://pith.science/paper/YOANNLQ3"},"agent_actions":{"view_html":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I","download_json":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I.json","view_paper":"https://pith.science/paper/YOANNLQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.15598&json=true","fetch_graph":"https://pith.science/api/pith-number/YOANNLQ3JOTM5SK4RTCORGQW3I/graph.json","fetch_events":"https://pith.science/api/pith-number/YOANNLQ3JOTM5SK4RTCORGQW3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I/action/storage_attestation","attest_author":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I/action/author_attestation","sign_citation":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I/action/citation_signature","submit_replication":"https://pith.science/pith/YOANNLQ3JOTM5SK4RTCORGQW3I/action/replication_record"}},"created_at":"2026-07-05T07:17:06.437407+00:00","updated_at":"2026-07-05T07:17:06.437407+00:00"}