{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2O5J3UT252TRANYQMVXR24GG2A","short_pith_number":"pith:2O5J3UT2","schema_version":"1.0","canonical_sha256":"d3ba9dd27aeea7103710656f1d70c6d03d199dd2d436ba1f99c486393043746a","source":{"kind":"arxiv","id":"2304.06903","version":3},"attestation_state":"computed","paper":{"title":"Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Braun","submitted_at":"2023-04-14T02:30:43Z","abstract_excerpt":"In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), a popular model for bipartite graphs with a community structure. We consider the high dimensional setting where the number $n_1$ of type I nodes is far smaller than the number $n_2$ of type II nodes. The recent work of Braun and Tyagi (2022) established a sufficient and necessary condition on the sparsity level $p_{max}$ of the bipartite graph to be able to recover the latent partition of type I nodes. They proposed an iterative method that extends the one proposed by Ndaoud et al. (2022) to achieve this goal. Their method"},"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":"2304.06903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-04-14T02:30:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"619f05be1cc878d02e9ed4f01a91a0e098212571e3009d4a246a291623d207c3","abstract_canon_sha256":"76af0a578443bd95a08e0f71b22b17bee2469dd4e8074f3dc0826bb0dae8788c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:30.686045Z","signature_b64":"ejroU5IJQFDc5HkO+KY5kscl5fiNj90pCjDeuGFlbdFZSVPf3B8xXL3eCqzGTFjPmDqX+8qr/hSF+k/qh7NZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3ba9dd27aeea7103710656f1d70c6d03d199dd2d436ba1f99c486393043746a","last_reissued_at":"2026-07-05T06:44:30.685270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:30.685270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Braun","submitted_at":"2023-04-14T02:30:43Z","abstract_excerpt":"In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), a popular model for bipartite graphs with a community structure. We consider the high dimensional setting where the number $n_1$ of type I nodes is far smaller than the number $n_2$ of type II nodes. The recent work of Braun and Tyagi (2022) established a sufficient and necessary condition on the sparsity level $p_{max}$ of the bipartite graph to be able to recover the latent partition of type I nodes. They proposed an iterative method that extends the one proposed by Ndaoud et al. (2022) to achieve this goal. Their method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.06903","kind":"arxiv","version":3},"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/2304.06903/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":"2304.06903","created_at":"2026-07-05T06:44:30.685354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.06903v3","created_at":"2026-07-05T06:44:30.685354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.06903","created_at":"2026-07-05T06:44:30.685354+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O5J3UT252TR","created_at":"2026-07-05T06:44:30.685354+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O5J3UT252TRANYQ","created_at":"2026-07-05T06:44:30.685354+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O5J3UT2","created_at":"2026-07-05T06:44:30.685354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A","json":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A.json","graph_json":"https://pith.science/api/pith-number/2O5J3UT252TRANYQMVXR24GG2A/graph.json","events_json":"https://pith.science/api/pith-number/2O5J3UT252TRANYQMVXR24GG2A/events.json","paper":"https://pith.science/paper/2O5J3UT2"},"agent_actions":{"view_html":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A","download_json":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A.json","view_paper":"https://pith.science/paper/2O5J3UT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.06903&json=true","fetch_graph":"https://pith.science/api/pith-number/2O5J3UT252TRANYQMVXR24GG2A/graph.json","fetch_events":"https://pith.science/api/pith-number/2O5J3UT252TRANYQMVXR24GG2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A/action/storage_attestation","attest_author":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A/action/author_attestation","sign_citation":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A/action/citation_signature","submit_replication":"https://pith.science/pith/2O5J3UT252TRANYQMVXR24GG2A/action/replication_record"}},"created_at":"2026-07-05T06:44:30.685354+00:00","updated_at":"2026-07-05T06:44:30.685354+00:00"}