{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XRC44CYD3CGGCGP3KJ52DNLOVO","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":"d97fea0a603dac8903229c735be9bb955ef4d1bb34271baa5dba4c7beb1e8c64","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-05-23T20:58:55Z","title_canon_sha256":"b132888031bcbc356e29c38b056b051ac651fa6f35456bd88e4002f10d878f32"},"schema_version":"1.0","source":{"id":"2505.18372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18372","created_at":"2026-07-05T11:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18372v1","created_at":"2026-07-05T11:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18372","created_at":"2026-07-05T11:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"XRC44CYD3CGG","created_at":"2026-07-05T11:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"XRC44CYD3CGGCGP3","created_at":"2026-07-05T11:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"XRC44CYD","created_at":"2026-07-05T11:08:45Z"}],"graph_snapshots":[{"event_id":"sha256:44e7985d38cc1b6033d7407c9c02f259d9a8c15a43d79bb9d0cbbf87800ecda3","target":"graph","created_at":"2026-07-05T11:08:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.18372/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of detecting a community of densely connected vertices in a high-dimensional bipartite graph of size $n_1 \\times n_2$. Under the null hypothesis, the observed graph is drawn from a bipartite Erd\\H{o}s-Renyi distribution with connection probability $p_0$. Under the alternative hypothesis, there exists an unknown bipartite subgraph of size $k_1 \\times k_2$ in which edges appear with probability $p_1 = p_0 + \\delta$ for some $\\delta > 0$, while all other edges outside the subgraph appear with probability $p_0$. Specifically, we provide non-asymptotic upper and lower bounds","authors_text":"Julien Chhor, Parker Knight","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18372","kind":"arxiv","version":1},"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:d71c717b2643a8965c2a966e8a0e5ece1019a2ae6ae159cef2ea7e02689b5e5a","target":"record","created_at":"2026-07-05T11:08:45Z","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":"d97fea0a603dac8903229c735be9bb955ef4d1bb34271baa5dba4c7beb1e8c64","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-05-23T20:58:55Z","title_canon_sha256":"b132888031bcbc356e29c38b056b051ac651fa6f35456bd88e4002f10d878f32"},"schema_version":"1.0","source":{"id":"2505.18372","kind":"arxiv","version":1}},"canonical_sha256":"bc45ce0b03d88c6119fb527ba1b56eaba7d1502c05a3b37b93ff70c3c0404717","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc45ce0b03d88c6119fb527ba1b56eaba7d1502c05a3b37b93ff70c3c0404717","first_computed_at":"2026-07-05T11:08:45.513196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:45.513196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOysxh3bk68Vk6YZjBGMGqQMMzrq8sU76jANevEY54HgEGgye05K+8W5+bprVpGlLx0NsiqSwTv/3fl86I3KAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:45.513730Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71c717b2643a8965c2a966e8a0e5ece1019a2ae6ae159cef2ea7e02689b5e5a","sha256:44e7985d38cc1b6033d7407c9c02f259d9a8c15a43d79bb9d0cbbf87800ecda3"],"state_sha256":"746a3e6cdb3fbe67151c153ed32ad8d001f6e234b4ffc88e7559d4156547184c"}