{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OUMGTTE7HS5N45YHFRMMUBP7XQ","short_pith_number":"pith:OUMGTTE7","schema_version":"1.0","canonical_sha256":"751869cc9f3cbade77072c58ca05ffbc24012ccd84d96b22c1f9833af8b87693","source":{"kind":"arxiv","id":"1610.09005","version":2},"attestation_state":"computed","paper":{"title":"Fast and Consistent Algorithm for the Latent Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Antoine Channarond, Vincent Brault","submitted_at":"2016-10-27T20:36:58Z","abstract_excerpt":"The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are equivalent under the complete and observed (with unknown labels) models and the groups posterior distribution to converge as the size of the data increases to a Dirac mass located at the actual groups configuration. Based on these observations, the algorithm $Largest$ $Gaps$ is proposed in this paper to perform clustering using only the marginals of the matri"},"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":"1610.09005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-10-27T20:36:58Z","cross_cats_sorted":["stat.CO","stat.TH"],"title_canon_sha256":"545f296905d6b6c9d6949cfd187ea4979aec4e9155c381a8092694156cfc3346","abstract_canon_sha256":"8d751eb479e34c8b8704fb14fe8073503a67415619cbc308e726f4fbea4a16c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:25.283852Z","signature_b64":"XvMP/zn0D/odluE/qpDjYNkKl6nuaGaGiLsHeIZHskspYfy1hqAscoClHqh5O6Z1XeXyv3jDQiPIsAKhhl/tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751869cc9f3cbade77072c58ca05ffbc24012ccd84d96b22c1f9833af8b87693","last_reissued_at":"2026-07-05T05:49:25.283344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:25.283344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Consistent Algorithm for the Latent Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Antoine Channarond, Vincent Brault","submitted_at":"2016-10-27T20:36:58Z","abstract_excerpt":"The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are equivalent under the complete and observed (with unknown labels) models and the groups posterior distribution to converge as the size of the data increases to a Dirac mass located at the actual groups configuration. Based on these observations, the algorithm $Largest$ $Gaps$ is proposed in this paper to perform clustering using only the marginals of the matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09005","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/1610.09005/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":"1610.09005","created_at":"2026-07-05T05:49:25.283407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09005v2","created_at":"2026-07-05T05:49:25.283407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09005","created_at":"2026-07-05T05:49:25.283407+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUMGTTE7HS5N","created_at":"2026-07-05T05:49:25.283407+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUMGTTE7HS5N45YH","created_at":"2026-07-05T05:49:25.283407+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUMGTTE7","created_at":"2026-07-05T05:49:25.283407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.08884","citing_title":"A Multiscale Scan Statistic for Adaptive Submatrix Localization","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ","json":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ.json","graph_json":"https://pith.science/api/pith-number/OUMGTTE7HS5N45YHFRMMUBP7XQ/graph.json","events_json":"https://pith.science/api/pith-number/OUMGTTE7HS5N45YHFRMMUBP7XQ/events.json","paper":"https://pith.science/paper/OUMGTTE7"},"agent_actions":{"view_html":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ","download_json":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ.json","view_paper":"https://pith.science/paper/OUMGTTE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09005&json=true","fetch_graph":"https://pith.science/api/pith-number/OUMGTTE7HS5N45YHFRMMUBP7XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OUMGTTE7HS5N45YHFRMMUBP7XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ/action/storage_attestation","attest_author":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ/action/author_attestation","sign_citation":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ/action/citation_signature","submit_replication":"https://pith.science/pith/OUMGTTE7HS5N45YHFRMMUBP7XQ/action/replication_record"}},"created_at":"2026-07-05T05:49:25.283407+00:00","updated_at":"2026-07-05T05:49:25.283407+00:00"}