{"as_of":"2026-08-10T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a3867eea0cf38ab43a29cf667f123ccd374b6df2cc02a17ee986b105e382258","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:44:17.146116Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.18372/citation-record","integrity":"/paper/2505.18372/integrity","json":"/paper/2505.18372/citation-record.json","paper":"/paper/2505.18372"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.288228Z","title":"Community detection and stochastic block models: recent developments","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.288228Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:179347d1e20a17f107d262cff945621485cb6a50e4136666875aaf2ba0984dc8","observation_id":"c6e1d7e9-00dd-4f53-bfc3-0756ca1214c8","resolution":{"observed_at":"2026-08-07T14:44:04.288228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.343815Z","title":"Community detection in general stochastic block models: Fun- damental limits and efficient algorithms for recovery","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.343815Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:d927405cc07c1dacf5744970d4ba640c5a77e4cb22b82cdbc75a669c1bade628","observation_id":"c1d1c5c1-1ba5-4553-9415-5cae4f1bcb3f","resolution":{"observed_at":"2026-08-07T14:44:04.343815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.445684Z","title":"Statistical mechanics of complex networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.445684Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:3dec93a53870025d8a46dab5d95ae0f2c2e142f6dcbbca377c9ab308b5659322","observation_id":"0a263be5-6532-4687-b2ab-3ccdfb174d9e","resolution":{"observed_at":"2026-08-07T14:44:04.445684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.603923Z","title":"GLOBAL TESTING UNDER SPARSE ALTERNATIVES: ANOVA, MULTIPLE COMPARISONS AND THE HIGHER CRITICISM","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.603923Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:e123e2ead72d40d3ca892283a7620987e0c744a639c2ee94ce081b785fd52c95","observation_id":"5aa368f4-d109-4c43-9101-ca449a63e939","resolution":{"observed_at":"2026-08-07T14:44:04.603923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.720250Z","title":"Community detection in dense random networks","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.720250Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:d35988ca17710c87ae54a83585481d0b1a027d726eef88ea53d2dcd2cf7c5124","observation_id":"81544ce3-c9b6-4a7e-9d5d-b89068281575","resolution":{"observed_at":"2026-08-07T14:44:04.720250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:04.908959Z","title":"The sparse Poisson means model","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.908959Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:6687c4c312ab52ed06941f5592d92bff5d43be7ca202bc40e21c8f39c2840cee","observation_id":"97e9a6b9-dfa1-4a6a-ac4a-4c17f351a1a6","resolution":{"observed_at":"2026-08-07T14:44:04.908959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.012466Z","title":"Contiguity and non-reconstruction results for planted partition models: the dense case","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.012466Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:c2e0948b4989bc1108b3d3504afe1b3cd752ba3c4a878cd491d5ea1a324eb868","observation_id":"9f708208-1b5a-4fd9-b0e8-fec7f7c185be","resolution":{"observed_at":"2026-08-07T14:44:05.012466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.05305","last_updated":"2017-08-10T19:12:38Z","snapshot_observed_at":"2026-08-09T07:55:28.704730Z","submitted_at":"2017-05-15T15:49:08Z","title":"Optimal hypothesis testing for stochastic block models with growing degrees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.05305","snapshot_observed_at":"2026-08-07T14:44:05.112294Z","title":"Optimal hypothesis testing for stochastic block models with growing degrees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.112294Z"},"links":{"cited_paper":"/paper/1705.05305","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:340c34bf66033d8c26d7f3c75c2fee3577f8e194ac3f7509cd8bd55637f07322","observation_id":"7e8dd8ae-4993-48a2-afa2-36a41896b6be","resolution":{"observed_at":"2026-08-07T14:44:05.112294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.219783Z","title":"Information-theoretic thresholds for community detection in sparse networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.219783Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:64a390b4e7129ecaf32079c8e8dc0afe84e22543192fd274ba9cbb351c42d798","observation_id":"eaae0b80-9ed6-4e18-9e50-fc6f1701f5a5","resolution":{"observed_at":"2026-08-07T14:44:05.219783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.327577Z","title":"Network biology: understanding the cell’s functional organization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.327577Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ac3260cdc82bdc2cfa8719f651ac94c876258b6891d415ec63f43c91eafdd7b2","observation_id":"6132a4b5-1ec7-4a62-983f-8bb45cbea1c9","resolution":{"observed_at":"2026-08-07T14:44:05.327577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.503436Z","title":"Non-asymptotic minimax rates of testing in signal detection","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.503436Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:f35044d556a12849bc0a8a4d6636ee9d4c433ab90d6aae914206215120cf6a81","observation_id":"d04b1952-ddb2-47a2-b01a-e6ce4173c4ac","resolution":{"observed_at":"2026-08-07T14:44:05.503436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.696518Z","title":"Optimal detection of sparse principal components in high dimension","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.696518Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ebd1a71b4c7472ebcef7878d929e2d3ac7db2eb7fd992e5aa1000a375e631e12","observation_id":"670ef5a2-de4a-4310-9fcd-2ce8b319b94a","resolution":{"observed_at":"2026-08-07T14:44:05.696518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.881476Z","title":"Reducibility and computational lower bounds for problems with planted sparse structure","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:05.881476Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5dc6820228c52b466ab5da2942f19c14dcabd5cdf19c7602eea3d6e83b7dafa8","observation_id":"4ffda23f-2123-4491-8e40-bb1f171ed3bf","resolution":{"observed_at":"2026-08-07T14:44:05.881476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.011967Z","title":"Phase transitions for detecting latent geometry in random graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.011967Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:b4273d601d2b661495b6e020198c993c8c53e23ea405f677e2f041b3d44a885b","observation_id":"ffc921e2-c9a3-4141-a0e1-e8020ff1779a","resolution":{"observed_at":"2026-08-07T14:44:06.011967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.177020Z","title":"Testing for high-dimensional geometry in random graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.177020Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:f8f4209f88d9a975a1e73511fb41c65c5279aafab0cd4ae9aa209fbaa21e26d5","observation_id":"e06e4cfc-de82-4b34-a19c-048b9ec454ae","resolution":{"observed_at":"2026-08-07T14:44:06.177020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.340774Z","title":"Detection of a sparse submatrix of a high-dimensional noisy matrix","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.340774Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ac1d7283c8d0a88b8d5444f45c630b654732ab6784afb8893772c55e9bad8eae","observation_id":"2f4b02ba-49c4-48fa-aeff-99c2b862146b","resolution":{"observed_at":"2026-08-07T14:44:06.340774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.481803Z","title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.481803Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:693d9a2a98e83fc5591c946c15e466c06e735ebc257fbcb4c857bf471306fa56","observation_id":"6e4eabeb-58ec-40e5-8216-dcf3299b4057","resolution":{"observed_at":"2026-08-07T14:44:06.481803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.638535Z","title":"Goodness-of-fit testing for Hölder-continuous densities: Sharp local minimax rates","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.638535Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:afafc0a3529a13df1f56ebf7b2f17b6755568269f191cbbc87cb29bd91973038","observation_id":"2c346171-2c50-41df-8461-078e2ec52f19","resolution":{"observed_at":"2026-08-07T14:44:06.638535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.774740Z","title":"Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.774740Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:fedd996b9393b3206d6197c4a91cde900c1f7c25ffabecfcc656d472d8bbf655","observation_id":"a5d7f709-6e6d-4d06-8839-0c69ba5ca638","resolution":{"observed_at":"2026-08-07T14:44:06.774740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.922990Z","title":"Sparse signal detection in heteroscedastic Gaussian sequence models: sharp minimax rates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:06.922990Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5fa5c0e7306f14b4993396225332caa8545c3d3dfe0b8a54d1fbb5e8d79a959b","observation_id":"8d6a6551-7961-4e3e-83bf-ac4cc0656132","resolution":{"observed_at":"2026-08-07T14:44:06.922990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:07.071588Z","title":"Graph partitioning via adaptive spectral techniques","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.071588Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:a603130ce4b8d6634950da994e06202a5e694997607a11832c1cf647a0a2d6e2","observation_id":"4be21670-8e30-4e8a-a982-e349f673705c","resolution":{"observed_at":"2026-08-07T14:44:07.071588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:07.190931Z","title":"Minimax estimation of linear and quadratic functionals on sparsity classes","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.190931Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:78b87e9722623bb23ba29e6bb12ad14fc44f7099dc64dd4baa2b91cd8286183b","observation_id":"f3421065-6ab2-4693-9594-1fcfcbdcc840","resolution":{"observed_at":"2026-08-07T14:44:07.190931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:07.353533Z","title":"Detection and recovery of hidden submatrices","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.353533Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9ed64147ca4e62e74237d0b9ec00b8c47ff91ff15f4694a21783ad12a93af44c","observation_id":"f017ce6d-6a25-412b-b004-8a8ff7e8cad1","resolution":{"observed_at":"2026-08-07T14:44:07.353533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:33.839626Z","title":"Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications","venue":null,"work_id":"62038266-045c-4dc8-8e08-f9a6c995a25f","year":2011},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.510539Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5a273eb1998bfcc125e9f4a45def204070f124f759ae545a9c448c26d67f3524","observation_id":"5d588ef4-14bd-4dce-a2f4-bc35a7d0db7d","resolution":{"observed_at":"2026-08-07T14:44:33.913798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:33.647747Z","title":"Community detection in complex networks: From statistical foundations to data science applications","venue":null,"work_id":"c6184aec-660b-4557-8a73-82b179629420","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.642280Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:01674ebf02cb46e542c1133d1d6568a05b334aaaeb0b138482064baf26737fb2","observation_id":"c9ad162c-ab8e-40da-bb57-c5c74bea0045","resolution":{"observed_at":"2026-08-07T14:44:33.734700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:33.499689Z","title":"Random geometric graph: Some recent developments and perspectives","venue":null,"work_id":"fb8adeed-fdf6-44ee-9b04-faa8b2379054","year":2023},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.786794Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:dcebc73d33d5696aae20dbd6f711dfbb9f72b363d344f68a58e2f9981e4e3d20","observation_id":"90bd959c-ad27-40bc-a1e5-f59f9d7d62bf","resolution":{"observed_at":"2026-08-07T14:44:33.555802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19069","last_updated":"2025-05-18T18:13:59Z","snapshot_observed_at":"2026-08-07T16:40:12.801200Z","submitted_at":"2025-03-24T18:54:43Z","title":"Detecting Arbitrary Planted Subgraphs in Random Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19069","snapshot_observed_at":"2026-08-07T14:44:07.999224Z","title":"Detecting Arbitrary Planted Subgraphs in Random Graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:07.999224Z"},"links":{"cited_paper":"/paper/2503.19069","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:bb69aa101a8b8dceb10b8f4a97500d2a1fe8da3d391c8b605618f5962ca8f79c","observation_id":"5218d1af-0a8e-40ed-9e19-279526d140c7","resolution":{"observed_at":"2026-08-07T14:44:07.999224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:33.185918Z","title":"20 years of network community detection","venue":null,"work_id":"898451e3-604b-4e2f-bef0-ad0fc7d5224c","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.118707Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5c4bd8b534cdc50b5a59646b5335d6c1038c334543dafb03474e60a260ac194a","observation_id":"1f9b059b-c5bf-4aea-be13-3b7fa448e18e","resolution":{"observed_at":"2026-08-07T14:44:33.329422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.06742","last_updated":"2017-04-22T03:34:30Z","snapshot_observed_at":"2026-07-06T05:38:50.178739Z","submitted_at":"2017-04-22T03:34:30Z","title":"Testing Network Structure Using Relations Between Small Subgraph Probabilities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.06742","snapshot_observed_at":"2026-08-07T14:44:08.213641Z","title":"Testing network structure using relations between small subgraph probabilities","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.213641Z"},"links":{"cited_paper":"/paper/1704.06742","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:507633865cf4f4a51372ab1a8d01508dc38443c77b946a1ee42dd9090afcfd5f","observation_id":"f666da97-33be-4d2b-85bc-e10b4cd1a9dd","resolution":{"observed_at":"2026-08-07T14:44:08.213641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:32.907873Z","title":"Community detection in degree-corrected block models","venue":null,"work_id":"e419bf7c-be03-4242-ab4b-8642ec8434b6","year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.314983Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4a93f117fd869bb7423b2f8b59164add0b0babf60e943c353095811822c1d035","observation_id":"6e381eec-181c-450e-b6c0-81008236a086","resolution":{"observed_at":"2026-08-07T14:44:33.054544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:32.615785Z","title":"Community structure in social and biological networks","venue":null,"work_id":"eeb24d84-dc40-4eba-9cfa-275916a47ef6","year":2002},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.404264Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:6dcd394ac00c397ac55a6a3e276c15893224e337a57be756232a374e9752a8a1","observation_id":"c4c0e581-7571-4732-bf8a-774df4319d3f","resolution":{"observed_at":"2026-08-07T14:44:32.766450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:32.314791Z","title":"Computational lower bounds for community detection on random graphs","venue":null,"work_id":"09cccf30-e311-490f-a3e8-85cf575ea930","year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.475884Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9bf971827d7e60a7f5b72b34bacb83d69b9d1b26255dc42b7035f9d3c7fb2d94","observation_id":"8994905a-cb40-4822-842c-e66fe9fc8429","resolution":{"observed_at":"2026-08-07T14:44:32.469729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:32.098523Z","title":"Information limits for recovering a hidden community","venue":null,"work_id":"e117e2b2-0869-4b1c-bb11-db968f996e13","year":2017},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.584406Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:313c4fbb402aa9f0d453ee322a4f6db0ef90fb78e26ada2e53815dd6315afb85","observation_id":"23241233-2736-4c75-a60e-ca263744a733","resolution":{"observed_at":"2026-08-07T14:44:32.175365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0167-7152(94)00090-u","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions","venue":"Statistics & Probability Letters","work_id":"c3c2d2b4-93bf-4d9e-9500-49d2c52b005c","year":1995},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.746063Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:928c5cfdba9f7a4e2347115ddd449d4d839a4aa64117294196249f6dc91468f1","observation_id":"219146fa-615a-4dc7-8234-a655f29de31d","resolution":{"observed_at":"2026-08-07T14:44:17.862139Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.932599Z","title":"Random subgraph detection using queries","venue":null,"work_id":"170a0acc-66f9-45b6-8fa1-4360cbcc510c","year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:08.869863Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5a8e9e7f1a8bdf20a90fcaacbd745db86aac05ae775e29ac6e1472fc9f6303b8","observation_id":"1fbfd2ba-5190-4627-99cd-90d09740a7d0","resolution":{"observed_at":"2026-08-07T14:44:32.033255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.767490Z","title":"Minimax testing of nonparametric hypotheses on a distribution density in the L_p metrics","venue":null,"work_id":"80d8ec4c-8995-45a9-9203-3d9a205e0852","year":1987},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.007740Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9d04c6bb7f6b42f044c95e8cf6c6c166a2e3ba3ba3ab02e1ea6eec9735d994bf","observation_id":"8d65255a-c4c8-4610-87e6-f38dddba4592","resolution":{"observed_at":"2026-08-07T14:44:31.843067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.601530Z","title":null,"venue":null,"work_id":"7ab5f7b8-c741-43d4-9c68-368baaf50046","year":2012},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.144332Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:799d8edfa7811326d3ad4eb09b4b92ddf8597081c16d7bb68196c2cd3a28258f","observation_id":"02a86c15-2f6b-400c-81b7-25cd02293115","resolution":{"observed_at":"2026-08-07T14:44:31.676555Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.445638Z","title":"Detection boundary in sparse regression","venue":null,"work_id":"be347f46-608f-4dfb-84ac-8e3802305744","year":2010},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.254249Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:7d4ad4d72912ec715e44def00abd7068bff4ec057e08e1004d0a71b2a4f059fe","observation_id":"c5b83363-f993-418d-bd61-6c4df9af87fa","resolution":{"observed_at":"2026-08-07T14:44:31.513070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.259879Z","title":"On the minimax nonparametric detection of signals in white gaussian noise","venue":null,"work_id":"adddab70-6c2e-45a2-bea4-d67120cb0e28","year":1982},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.321918Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:809e88df127828ec8eacdc3d899bb0baa3dea2996cf4ebe726805fbf8e24ff8c","observation_id":"019edf06-513b-4ab7-9837-1591525f22b0","resolution":{"observed_at":"2026-08-07T14:44:31.351194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:31.133817Z","title":"Asymptotic equivalence and contiguity of some random graphs","venue":null,"work_id":"d414d31a-0c58-411c-9244-dc39e8cf560f","year":2010},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.417440Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:b29c01559c435afecf76cd9de2699591cb594ad4fa05c7db41a78d25b698f00f","observation_id":"0df3067a-a993-476d-b4a6-68d682caa809","resolution":{"observed_at":"2026-08-07T14:44:31.191673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08871","last_updated":"2024-09-13T14:35:10Z","snapshot_observed_at":"2026-08-02T15:29:35.575592Z","submitted_at":"2024-09-13T14:35:10Z","title":"Locally sharp goodness-of-fit testing in sup norm for high-dimensional counts","version":1},"cited_work":{"arxiv_id":"2409.08871","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.08871","snapshot_observed_at":"2026-08-07T14:44:18.478901Z","title":"Locally sharp goodness-of-fit testing in sup norm for high-dimensional counts","venue":"math.ST","work_id":"ad141dee-11fc-492d-a389-a4a4e3411d4e","year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.514459Z"},"links":{"cited_paper":"/paper/2409.08871","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4bcca8b2b1d3c43406479242678cd43831d8d6c19400bbb0dbfbd1e938c10feb","observation_id":"a5fab890-45e9-4945-a90d-bc076fe5f5a7","resolution":{"observed_at":"2026-08-07T14:44:18.617817Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.933180Z","title":"Minimax rates for sparse signal detection under correlation","venue":null,"work_id":"d048cc6e-4138-4ae8-ab73-fb0a039ae040","year":2023},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.587531Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ed04b4b93d14228eb1a5bd3ab5d7eefa1692ef5b800e164c23eaa1bc32df3a9b","observation_id":"107fb984-8705-43bf-9dcb-1d5601f0ba67","resolution":{"observed_at":"2026-08-07T14:44:31.033297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09356","last_updated":"2025-01-22T01:36:27Z","snapshot_observed_at":"2026-08-06T06:52:15.462978Z","submitted_at":"2023-12-14T21:39:25Z","title":"Sparsity meets correlation in Gaussian sequence model","version":2},"cited_work":{"arxiv_id":"2312.09356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.09356","snapshot_observed_at":"2026-08-07T14:44:18.149452Z","title":"Sparsity meets correlation in Gaussian sequence model","venue":"math.ST","work_id":"25bd875b-df9b-4357-a962-1c2f6e2edb6e","year":2023},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.684180Z"},"links":{"cited_paper":"/paper/2312.09356","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ecbc4b921b0d0db2caf0f1ea4721ec2d3713e2211370d258f17bc1687eea52fd","observation_id":"cf21c7e6-9efd-4d66-bead-58ecc7f416c2","resolution":{"observed_at":"2026-08-07T14:44:18.244610Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.746100Z","title":"Convergence of estimates under dimensionality restrictions","venue":null,"work_id":"d1fe86a3-cee2-4ed4-a34d-290904241114","year":1973},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.776996Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ddae614d99b8752254ee0e32f7e615de1b898bfa1a23ce53636add703e07fc67","observation_id":"1b72146e-ac60-4d8e-9c47-dafcb27ca474","resolution":{"observed_at":"2026-08-07T14:44:30.850020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:09.877667Z","title":"Minimax rates in sparse, high-dimensional change point detection","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.877667Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4d0d0570fa607d3794b7f70bd51cb7ba3967e5820d151ff4a250db5b9c42ac59","observation_id":"b45c8203-fdf3-43f6-998b-a138d4b577bb","resolution":{"observed_at":"2026-08-07T14:44:09.877667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.623613Z","title":"Phase transition in noisy high-dimensional random geometric graphs","venue":null,"work_id":"7e1b99f2-1246-453a-ab05-6dc2de94f058","year":2023},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:09.953332Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:fdbabf2e170140e2fd6d2b915eec6f6cc9382c147c85544991f77042f5ab690f","observation_id":"8dc012a0-c463-4366-936b-aa0907d82b6c","resolution":{"observed_at":"2026-08-07T14:44:30.673377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.488905Z","title":"Tensor clustering with planted structures: Statistical optimality and computational limits","venue":null,"work_id":"10de0526-b9f5-4538-8647-71b8a29b8370","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.037838Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:df349f332feaecf64a7f8aa1eac82746773966792e4544a2e079617a6ed4f247","observation_id":"7fb9336a-a38b-4d1f-9f83-c6b00d848bd1","resolution":{"observed_at":"2026-08-07T14:44:30.557308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.338430Z","title":"COMPUTATIONAL BARRIERS IN MINIMAX SUBMATRIX DETECTION","venue":null,"work_id":"5373bddb-f226-49eb-b0e6-14465e1b9538","year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.108123Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4532eeeb21e199a6d84f642f177709aec89d433d7efdee86dbfda3d7aa3975ae","observation_id":"f163aa91-6c88-469d-a5d6-ff8e9a96b39e","resolution":{"observed_at":"2026-08-07T14:44:30.416795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:30.085154Z","title":"Bipartite graphs and recommendation systems","venue":null,"work_id":"2122dc24-e4cd-4635-a536-7d4f9b79c1db","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.197110Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:029559ec8986295ed387dfdc99b9d62920a33a87d07713a329c890b9c869a314","observation_id":"e7f234c0-42bc-4271-84b8-3a0e4f04c960","resolution":{"observed_at":"2026-08-07T14:44:30.160820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:29.829401Z","title":"Community detection thresholds and the weak Ramanujan property","venue":null,"work_id":"0072f712-2e17-420a-b442-5c6040c5e3c1","year":2014},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.293709Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:3e3b47983959d19c67f2c45d0c7709eaa1c1d9b0fc0a91c3d3390f6129ab91b4","observation_id":"6a244c24-82a5-429b-87ad-fa47f3c3e431","resolution":{"observed_at":"2026-08-07T14:44:29.929198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:29.593979Z","title":"A proof of the block model threshold conjecture","venue":null,"work_id":"33a494bb-3d85-4fc4-b8a0-9bf59f683e12","year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.379975Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:d1e525df1418c0a77d38322668a9047fd02ec273b9375eaac161caf11c8186b4","observation_id":"e5afa8d5-9021-4a0c-b642-506545947df6","resolution":{"observed_at":"2026-08-07T14:44:29.723237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:29.305291Z","title":"Belief propagation, robust reconstruction and optimal recovery of block models","venue":null,"work_id":"8769c00e-1268-4037-811d-a7b0544da3eb","year":2014},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.486295Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:0826ee39a814481c62f90cc5304a5b41023d74af4720267cd8bf914c0623f5bf","observation_id":"e6437e9e-fb92-474e-aff0-c383187961ea","resolution":{"observed_at":"2026-08-07T14:44:29.459385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:29.048683Z","title":"Reconstruction and estimation in the planted partition model","venue":null,"work_id":"606162c6-cd9f-4e0e-9586-7c2b57e894fb","year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.581188Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:2c8b3848a934a0c6be07456ea995736467e27947ed9a038ed1991ce281af7c58","observation_id":"329d1491-af0e-4678-8953-59527d1562f7","resolution":{"observed_at":"2026-08-07T14:44:29.168967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15957","last_updated":"2025-02-21T19:38:54Z","snapshot_observed_at":"2026-07-06T18:35:31.141952Z","submitted_at":"2024-06-22T23:08:03Z","title":"Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15957","snapshot_observed_at":"2026-08-07T14:44:10.681866Z","title":"Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.681866Z"},"links":{"cited_paper":"/paper/2406.15957","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:e5f2a7bd61034f429592ad2eac8309c54c2367915d94ad5c63a8c6f4d1f1e2e3","observation_id":"bb2bb8f5-d1b7-422e-9d5a-20c81b7c73ac","resolution":{"observed_at":"2026-08-07T14:44:10.681866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:28.843741Z","title":"Uncovering the overlapping community structure of complex networks in nature and society","venue":null,"work_id":"997776d0-77c9-4c5c-9210-9856591c37b2","year":2005},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.781905Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:57e7684d3084066a734bc2adc8aa9e691de11559a03e9cdca4ea516f9dc1273d","observation_id":"d83a56b7-eca2-4eb2-847d-267ee9b11d02","resolution":{"observed_at":"2026-08-07T14:44:28.963086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:28.660608Z","title":"Bipartite graphs in systems biology and medicine: a survey of methods and applications","venue":null,"work_id":"6f5dc5cd-5a67-4dfc-a18d-58fdd20c0ecb","year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:10.903161Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9508c5d603e3f945728ee254d9dfb333bf9ab5b3b032670958e3bc7cd8b7f1c1","observation_id":"593316de-d974-4c83-a3d7-5b9cad726df5","resolution":{"observed_at":"2026-08-07T14:44:28.744983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:28.398794Z","title":"Bipartite graphs as models of population structures in evolutionary multiplayer games","venue":null,"work_id":"3af8db32-8fa3-482c-bfe5-86ea874ac9b9","year":2012},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.019647Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:7b40addaeaf308749cd5c188ddd7a02fe306746add83044a8970c6f7ef17a673","observation_id":"dfb36028-8bac-4e18-8d53-e1c35df5f7fe","resolution":{"observed_at":"2026-08-07T14:44:28.530567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19244","last_updated":"2023-10-30T03:22:54Z","snapshot_observed_at":"2026-08-10T01:05:13.838009Z","submitted_at":"2023-10-30T03:22:54Z","title":"High-Dimensional Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19244","snapshot_observed_at":"2026-08-07T14:44:11.157039Z","title":"High-dimensionalstatistics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.157039Z"},"links":{"cited_paper":"/paper/2310.19244","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:41afdbdcf69da2554975e0206d4cb8add8daf36f0494cee683f10e2fdbab9239","observation_id":"3dade95c-4b1d-4720-af7a-d273a3beb314","resolution":{"observed_at":"2026-08-07T14:44:11.157039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:28.239316Z","title":"Modern discrete probability: An essential toolkit","venue":null,"work_id":"2aaf920f-3e34-4242-abe0-ea478cf654fc","year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.279916Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:263d3dab95c56ac27263365cb658c49df9fa3ff7f1ccfa4d2ff92bc87d02846b","observation_id":"8bb2e5c4-668f-473f-9aee-04fd45fab225","resolution":{"observed_at":"2026-08-07T14:44:28.320421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:28.036504Z","title":"Maps of random walks on complex networks reveal community structure","venue":null,"work_id":"a06ccfb0-8e17-4742-9a16-c62ea628196d","year":2008},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.381329Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:bea78579621e0d7711d7fb8a97322b20703f4db83e7b9178da4b90579a95e206","observation_id":"d35c7597-cdfc-4504-9e2e-c57f4801f195","resolution":{"observed_at":"2026-08-07T14:44:28.139289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:27.835173Z","title":"Planted Bipartite Graph Detection","venue":null,"work_id":"ab4b3b4e-952e-40a0-8d03-8ba916ca4424","year":2024},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.569556Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:79bfca6fb5f02d6fb4e0ebaac1b75d68989de0108f9a8647f6cb44252c88f83c","observation_id":"bf1e4cb9-7c68-498f-a347-1c30330acd75","resolution":{"observed_at":"2026-08-07T14:44:27.915852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:27.621518Z","title":"Distribution inequalities for the binomial law","venue":null,"work_id":"855b6a9c-e590-488a-87f9-e2fcdaec78c4","year":1977},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.725839Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9c3ebb8141db41bfcff72a52406e8e43d8c3b6edf74265863253e193666e38aa","observation_id":"730435ab-2c10-4703-b66c-4aa713c6c18c","resolution":{"observed_at":"2026-08-07T14:44:27.743844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:27.354501Z","title":"Community detection in sparse random networks","venue":null,"work_id":"0a47eb31-9881-4a25-8350-6df29e719c2c","year":2015},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.820897Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:fe0e62412b30085dfcc791936f03949d9df5de413c6b4095b305ed5bcab3a825","observation_id":"b7835fb1-34fb-4fba-ae63-c05a7398e66f","resolution":{"observed_at":"2026-08-07T14:44:27.444028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00118","last_updated":"2018-08-12T23:12:45Z","snapshot_observed_at":"2026-08-05T05:53:33.195405Z","submitted_at":"2018-05-31T22:07:52Z","title":"Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00118","snapshot_observed_at":"2026-08-07T14:44:11.907925Z","title":"Statistical problems with planted structures: Information-theoretical and computational limits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:11.907925Z"},"links":{"cited_paper":"/paper/1806.00118","citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:061509625f011e0b6fd82e6c052cd1b940046c0573612d6d04901847db1e9bfe","observation_id":"4bee0e10-f45f-4b09-89ff-c57eb53a18f9","resolution":{"observed_at":"2026-08-07T14:44:11.907925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:27.149798Z","title":"Sharp detection boundaries on testing dense subhypergraph","venue":null,"work_id":"eb331869-fa23-483f-a9a5-f62728398e8a","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.037888Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:be5e557a8bf0c9253b2e7666caa47b2f176379201913922f494e6ba8932a25e2","observation_id":"66f750e1-608a-47cc-a862-7b8403f9876d","resolution":{"observed_at":"2026-08-07T14:44:27.267427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:26.959287Z","title":"Testing community structure for hypergraphs","venue":null,"work_id":"d34a31c9-ce4c-443e-9e18-125202cd5331","year":2022},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.138641Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:3619e1dfef3e02ffad4dbf71ebeb6c98e9ca037289573f13a4e8d04fcf02af62","observation_id":"f226782d-8206-427a-b97d-4ff79e2f73c7","resolution":{"observed_at":"2026-08-07T14:44:27.020841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:26.741645Z","title":null,"venue":null,"work_id":"2ba838bb-27ed-4802-b059-98c17fc38d5e","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.237863Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:b4dd4aa71370a251d3b54c055bc7612017aaf81232992df44aea67c7a5fe125b","observation_id":"6ec7382a-632d-4a73-a2e8-a6fc52c838d9","resolution":{"observed_at":"2026-08-07T14:44:26.814132Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:26.490508Z","title":"In this case, the problem roughly reduces to the sparse signal detection 20 problem in a standard Gaussian sequence model","venue":null,"work_id":"28b84f1d-563e-4bf6-bf0b-ecec2bca6431","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.330613Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:70140f5397122dd3971d3106afc0197ac965b740a6b8bbed05e73424ef92feb5","observation_id":"3e5b399c-296d-4c2f-82ea-27cc6dd8e613","resolution":{"observed_at":"2026-08-07T14:44:26.636145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:26.245750Z","title":"Then if µ2 <C−1 ∗ n1 k2 1 log ( cn2 k2 ) + cµ k2 log (C∗ 2e ) , it holds E [ exp(µ2XY )1 ( X≥⌈C∗ k2 1 n1 ⌉ )] <α","venue":null,"work_id":"549966f6-c835-485a-a2f3-95b455f0b58f","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.427597Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:ccc7159c716994ea5ad1e1a8c00c8bb801493bb3537b2e02db6159d19744f66b","observation_id":"4f65d398-f28e-4bf3-b18d-19ac1e2f4afc","resolution":{"observed_at":"2026-08-07T14:44:26.361028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:25.915846Z","title":"Then if µ2 < cµ k2 log (k2n1 log(cn2 k2 ) cµ2ek2 1 ) , it holds E [ exp(µ2XY )1 ( X≥⌈C∗ k2 1 n1 ⌉ )] <α","venue":null,"work_id":"d4cd7738-338d-4c1b-921d-5e2896fb96cd","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.543791Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:64edc05a9afa1aba37ca839ff1c42d2f71e29862454b1bf5d7606960f0ff59a6","observation_id":"37ae9fdc-1444-4ce1-b56c-07cf91d362fe","resolution":{"observed_at":"2026-08-07T14:44:26.091768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:25.663930Z","title":null,"venue":null,"work_id":"b13210e6-cb51-4a94-ac0d-fba7a1f2af4f","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.609839Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:0946d17ce5e903c82df194b2ca4a6e14d89aabb8fba0519b7d96e67f04ec14cf","observation_id":"8a4a0f5e-c318-4372-b195-87dba0bf9703","resolution":{"observed_at":"2026-08-07T14:44:25.767424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:25.395791Z","title":"Thenf is increasing overA, and by our assumption onµ2, it holds µ2 <C−1 ∗ n1 k2 1 log ( cn2 k2 ) + cµ k2 log (C∗ 2e ) ≤ min k∈A f(k) ≤ min k∈A g(k)","venue":null,"work_id":"93427278-8aac-4717-ab5f-a66e0eb8f007","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.708072Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:bc8652abd255c0b3e4e331678740989168626127db7ab69734ed30a53dfc09fa","observation_id":"163f9782-330c-4537-a21d-84f546acd050","resolution":{"observed_at":"2026-08-07T14:44:25.539102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:25.031649Z","title":"Then by our assumption onµ2, we have µ2 < cµ k2 log (k2n1 log(cn2 k2 ) cµ2ek2 1 ) ≤ min k∈A f(k) ≤ min k∈A g(k)","venue":null,"work_id":"7ef437f1-55bd-4d8c-a7bb-144746469ef0","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.771006Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4dd1dc844c3b89b82acc6a451d560a3dec7711ae635f7471a188aa6bad759c79","observation_id":"67514e33-9d8d-422d-bd59-e834203ea3f0","resolution":{"observed_at":"2026-08-07T14:44:25.220439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:24.762065Z","title":"Thenf is decreasing overA and is minimized atk =k1","venue":null,"work_id":"a2ebbed2-dc9b-471a-9217-3cdbfcaa264e","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.878199Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:5bafcd36d156fc3b3d383dbe5ced3b50002dd0e3039d64d1ad84544c3046ce92","observation_id":"d97f9532-5ff0-44bc-864e-12412d1e2011","resolution":{"observed_at":"2026-08-07T14:44:24.906873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:24.573160Z","title":null,"venue":null,"work_id":"1db290f2-9091-44c4-99db-de2575ec7f85","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:12.951104Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:dbf2d1a2a09b6c93fb29369d69563d09269ca22fb6826cff0ba0d835b8428592","observation_id":"4b907a90-4984-4058-861b-31d78dd9aab1","resolution":{"observed_at":"2026-08-07T14:44:24.673556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:24.376176Z","title":null,"venue":null,"work_id":"aef71848-1b4e-4e32-8114-7fa5a43a6393","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.058847Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:a3d84adb9fb0e9cdf53fca18ae42202795d8d83217c5293b2ccd9d8077d14566","observation_id":"4886460c-8e4b-401a-9384-663d8249ae45","resolution":{"observed_at":"2026-08-07T14:44:24.482973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:24.152822Z","title":"34 Proof of Lemma 8","venue":null,"work_id":"c02e552b-e2b9-4525-91a8-b91c4258c292","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.157666Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:d7e8619ed720673ecea07a7a6df19e039a39f113a3ed232e44b82486b1cab97d","observation_id":"307178ae-7acd-474d-a8ff-f108b0b54ca8","resolution":{"observed_at":"2026-08-07T14:44:24.254390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.960097Z","title":"We start by showing that ψ21∧ϕ12≍ψ21∧~ϕ12","venue":null,"work_id":"9c22e94e-5daa-4593-add4-15774e1a9264","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.274451Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:68a4dfa7b9b45c27fba07c123c3154991335f66ff4f3acf70be5c961c38007a5","observation_id":"7eb85441-b3c6-45a5-80ab-05086f21311c","resolution":{"observed_at":"2026-08-07T14:44:24.064322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.750163Z","title":"Assume first thatc−1 µ k2 log ( cn2 k2 ) ≤ C∗ k2 1 n1","venue":null,"work_id":"cfc63f1a-98c2-4c81-98fc-494e70267408","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.469048Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:9befa671ba9ab6be682b34678cb281ba90d8b84ed75b09e09dae839026c95e63","observation_id":"fbef75ad-250e-441f-ba4d-37b211e68624","resolution":{"observed_at":"2026-08-07T14:44:23.857330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.525237Z","title":"We now prove the converse bound","venue":null,"work_id":"c3516815-0518-48a3-a698-cea7a25058b6","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.633925Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:3a7911dfb32d85d2b3519df6a938bc77c4e1ab6302472bc7ca3f990cf0556e24","observation_id":"a77e92d6-ebac-4b97-ba5c-bdc900f5d791","resolution":{"observed_at":"2026-08-07T14:44:23.609216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.363223Z","title":"Hence, for any α> 0, there exists a constantc′ µ > 0 such that, wheneverµ2≤c′ µR, we have E [ exp(µ2XY )1 ( 1∨C∗ k2 1 n1 ≤X≤k1∧ k2 log (n1k2 k2 1 ) )] <α","venue":null,"work_id":"f4ff5920-2d38-4298-b8bc-af63f2467f82","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:13.870320Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:bfd6f7b53979d983836cf2301e68592a6131a60f4e44e777da9ce36a1f58e60c","observation_id":"672261cd-2ba8-4817-894d-f0b4b29d624c","resolution":{"observed_at":"2026-08-07T14:44:23.431419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.282003Z","title":null,"venue":null,"work_id":"ad571058-d821-48ec-a684-b6389c4ab682","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.081266Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:3a9fe6f0d45936aba1f389393f3d99b760e0e644db57134c18cd701ff411be08","observation_id":"9ed8a9b3-1e05-4244-907d-8f8fcd8327cb","resolution":{"observed_at":"2026-08-07T14:44:23.312878Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.215581Z","title":"Proof of Lemma 9","venue":null,"work_id":"eef796ca-a56a-49a6-be9a-9d00c0a1664a","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.303913Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:566d9b86c364414db74a4721802a54457f32444803c72f055ae2d35a29dd3c8b","observation_id":"a4d672c9-74c5-4f70-b575-afab7cbf787a","resolution":{"observed_at":"2026-08-07T14:44:23.234682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:23.125057Z","title":null,"venue":null,"work_id":"b54b9554-920b-453d-bb3e-64e36ec8f80e","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.422434Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:e35639200575da33243cb398d4c4185cdd0e00655d60de93cdd311d5c9c30471","observation_id":"97d1236b-9e74-4e4c-84f7-37dc6c43351f","resolution":{"observed_at":"2026-08-07T14:44:23.170100Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:22.873046Z","title":"Assume first thatk1≤ k2 log ( n1k2 k2 1 )","venue":null,"work_id":"cc96d643-8310-4d36-94ad-dbc276d88e34","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.587637Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:370cdac40960dedbece26b7117f6d59462df57a4cc3bc1d398b5ca34598b7f34","observation_id":"d6dec52f-941e-467c-ba42-e4137d204b1a","resolution":{"observed_at":"2026-08-07T14:44:23.014867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:22.618919Z","title":"We aim to prove thatψ21 +β12 ≳ ψ12 +β21","venue":null,"work_id":"95aaf864-16c4-4bb5-ad2a-d22b1831513c","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.771505Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:1af3beaa1fc74535521c92969760c77ca52261caf8a538266405dee2b00adb84","observation_id":"7e3dd590-92a2-4ce0-a8e8-76789a0dca42","resolution":{"observed_at":"2026-08-07T14:44:22.702181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:22.449957Z","title":null,"venue":null,"work_id":"ccd60177-acab-4b9c-9d98-4bf4a49617d0","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:14.937253Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:24c74e84ac8ad2ce715b14dda41d0020c820c76a9e547d4b8fbfe2455f0d3a91","observation_id":"203fcf2f-36bb-47b7-9efc-05a94ad374ec","resolution":{"observed_at":"2026-08-07T14:44:22.534687Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:22.247264Z","title":"Consequently, we haveR≥ ( ψ21 +β12 ) ∧ ( ψ12 +β21 ) ∧ϕ12∧ϕ21","venue":null,"work_id":"2ffbcbf9-b616-4884-97fe-ca6952eb7402","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:15.135006Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:cce6ce0af3824895289b99d666362aac60a193d2e7a00db3409faf0bf4a6d92e","observation_id":"c71cd4d6-d648-4d25-91dd-af383f02b361","resolution":{"observed_at":"2026-08-07T14:44:22.343802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:22.103492Z","title":null,"venue":null,"work_id":"c5c66fa7-3a7b-43da-94fa-628a5f17dfdd","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:15.313721Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:8682a2cd4bdaf35738eabfb046e16a15394577056e06c4ce01ceafdd50c7419d","observation_id":"07d1dbb1-a111-4236-9f14-87b09887565f","resolution":{"observed_at":"2026-08-07T14:44:22.165427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.943301Z","title":"Then we have ψ12 = 1 k1 log ( 1 +n2k1 k2 2 log (n1 k1 )) ≥ 1 k1 log ( 1 +n2 k2 ) ≥β12, which yields the desired result","venue":null,"work_id":"64a93048-cbcc-4bbb-a0d1-865e8ce22952","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:15.520079Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:8a2857c30d7ad0d8e361f2942b1ea6ee82046b11fa748cf1dad729e82e5bfee4","observation_id":"96ffba5a-4421-44be-bf9e-80bf333252e2","resolution":{"observed_at":"2026-08-07T14:44:22.021859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.725632Z","title":null,"venue":null,"work_id":"666d7d04-1db2-4349-8518-70bd6a0af7ec","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:15.624553Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:689afb35a3b09403f61016148decc6ad4f4fa93091478d247bb2c1afc4875f49","observation_id":"5292466e-b5a4-4969-8b82-b277790a1647","resolution":{"observed_at":"2026-08-07T14:44:21.820577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.535913Z","title":"Consequently, we haveR≥ ( ψ21 +β12 ) ∧ ( ψ12 +β21 ) ∧ϕ12∧ϕ21","venue":null,"work_id":"7aa21917-29b6-4049-9643-c493ac01d229","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:15.790323Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:e1f3ed690078f56113aa066750848c6deb5b216f975e5fc20402f47f104fd2a9","observation_id":"074e67eb-294a-4ce6-a298-a04901917459","resolution":{"observed_at":"2026-08-07T14:44:21.615588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.353767Z","title":null,"venue":null,"work_id":"ec1822db-c070-4d27-a8c1-e30c371e3d44","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.006367Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:48d354d27f2b985e7f74b43af58f4cddf6e49c40d75c11fe959a0a7c7967b100","observation_id":"632febab-bd6a-422c-8f5a-efc039f5a0bc","resolution":{"observed_at":"2026-08-07T14:44:21.436748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.243925Z","title":null,"venue":null,"work_id":"2cf69466-96f0-48dd-b7ee-ccbdf522f682","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.198622Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:0530d6e858b3b2758ef3d1d207485f5db3c8357178cf1d695fb58070e0fe4d31","observation_id":"b98879e4-e681-46ab-8227-5923802a2b5c","resolution":{"observed_at":"2026-08-07T14:44:21.284379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:21.038862Z","title":"Similarly, if˜R =ϕ21 and n1 >k 2 1, the result follows by Lemma 16","venue":null,"work_id":"2c4a18dd-a7d4-4b24-a4a4-f7bf0d700816","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.343485Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:4b744d1d8a1b766b8a99c1f63adb35a9e73711a57ba78b2a05bb16b5c5f92c31","observation_id":"af003ea8-7c47-41cf-87a7-69e0bd6a0287","resolution":{"observed_at":"2026-08-07T14:44:21.152317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:20.704198Z","title":null,"venue":null,"work_id":"adc909a7-8370-4566-8d30-441cc5be8f16","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.444174Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:2abcf7ff57740d8c4bc5238012b8ebb366f2aa572d017ee41716317617731396","observation_id":"e87b9b80-4cce-45f3-add8-42a898bf4f2b","resolution":{"observed_at":"2026-08-07T14:44:20.852763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:20.439658Z","title":null,"venue":null,"work_id":"acbbe6b2-d042-4240-83a6-47b47a7924bf","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.594169Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:283e568a4817e568e92348e7b12afe4dc3ee29b98a2ab60c9c8d4330a1cd08a1","observation_id":"15f768dc-e733-49fb-aed3-71dc40d19388","resolution":{"observed_at":"2026-08-07T14:44:20.561029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:20.187609Z","title":null,"venue":null,"work_id":"2ed8536b-976f-4a90-a2f0-94bfb6bdd615","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.756185Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:6f639e2b37726f559ff2df59e55647848c0fee14dceeefa22dd1ec7e53e5393e","observation_id":"be24df4f-f6c0-4888-9ecb-f21ad90a97b3","resolution":{"observed_at":"2026-08-07T14:44:20.326190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:19.963355Z","title":"Proof of Lemma 32","venue":null,"work_id":"b686f6e0-0a11-4592-afdc-40a1e2449454","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:16.932183Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:6136db4e694ae271c63658d56caed707b3def8899a3bef0b29b4254419d1d812","observation_id":"9f3ba37b-7d5e-46d5-b1a6-ff5cf229439e","resolution":{"observed_at":"2026-08-07T14:44:20.073514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:19.563419Z","title":null,"venue":null,"work_id":"fbcbcdd7-df94-4bc9-b2b4-3a1c1ca4c08f","year":null},"citing_paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:17.146116Z"},"links":{"citing_paper":"/paper/2505.18372"},"observation_digest":"sha256:d42263366e3a167b07e47b4a22eb1b54c454dad462328a30b89bfc2819d904de","observation_id":"4efed9b9-b931-4b23-8dc8-2d039b57a038","resolution":{"observed_at":"2026-08-07T14:44:19.715887Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18372","last_updated":"2025-05-23T20:58:55Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-10T01:05:27.776018Z","submitted_at":"2025-05-23T20:58:55Z","title":"Optimal community detection in dense bipartite graphs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":3,"verified_fuzzy":52},"total_outbound_references":102},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 0 inbound Pith citation observations for arXiv:2505.18372."}