{"as_of":"2026-08-21T01:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:846a945fc88ec48d56f759fe09f6a114de5bca7a5f3b4d278ffda5a18bdf98e3","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T09:45:28.800481Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2605.28488/citation-record","integrity":"/paper/2605.28488/integrity","json":"/paper/2605.28488/citation-record.json","paper":"/paper/2605.28488"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T09:45:28.800481Z","title":"A note on the relations between mixture models, maximum- likelihood and entropic optimal transport, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:2269a421126ba76d6933bc6ba3aa9f3c16de4708501f62ed082cda26ca61dd64","observation_id":"fff73c56-8138-4637-bc50-f8e9678f90b1","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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":"2018.00361","doi":"10.1109/cvpr.2018.00361","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rohde, and Heiko Hoffmann","venue":null,"work_id":"ce0bd673-b8fa-4fea-9b7e-ea4d710affbb","year":2018},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:38f13d455883ddb90b8f79719db048fed9303f4bf5c06e3cf88f0d3185116c6c","observation_id":"92e32da7-6ed2-4ab0-a39d-6bea53695b06","resolution":{"observed_at":"2026-06-29T09:53:16.965856Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Entropic optimal transport is maximum-likelihood deconvolution, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:02c1b07ae772e839e0e792daf3a86faeb4d60b160eba6d56c29fab3cc6c86c72","observation_id":"6d4da8fb-bf38-480d-9bbd-50a6b0d7fe81","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Stochastic blockmodels: First steps.Social networks, 5(2):109–137, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:a60051d101bfdd35b303cb894bd0cd67a78847652b80801d6934878f698e732e","observation_id":"c61f8b59-2d2e-429e-9889-65c802264381","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Estimation and prediction for stochastic blockstruc- tures.Journal of the American statistical association, 96(455):1077–1087, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:a80d9e1776c9fb9590cb37872b638f98b7d80814a0eb7e839ccfb8eb8d91c774","observation_id":"65901bcf-0db7-40e9-bb11-25b5f9081fd4","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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":"10.1007/s11222-007-9046-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A mixture model for random graphs","venue":"Statistics and Computing","work_id":"84eaf7c7-c7a0-4053-b6d2-8911e1154393","year":2008},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:d01ff4b7ae809f0b71646d370267959a16af080fefd4705cf8a0280fe2c7b2d7","observation_id":"533a7222-0357-4389-bb7a-27be105dce65","resolution":{"observed_at":"2026-06-29T09:53:16.960499Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Network analysis in the social sciences.science, 323(5916):892–895, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:a8847215878801c8578f71e70757dbc349e4eeee281488b104ef703217386305","observation_id":"a9b2e534-b1fc-40ad-aff7-eb5b93ea76ff","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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":"10.1088/1742-5468/2008/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T12:34:38.295421Z","title":"Journal of Statistical Mechanics: Theory and Experiment2008(10), 10008 (2008) https://doi.org/10.1088/1742-5468/2008/ 10/P10008","venue":null,"work_id":"d47e4108-d479-4db4-9c61-75a5a31d6a1f","year":2008},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:a225eb154ee2351ca3f0d8923f910fb5fc35243eca85c49c3f6be33e6043a037","observation_id":"131db4e8-c885-44b8-96be-1389c64f1e42","resolution":{"observed_at":"2026-06-29T09:53:16.972247Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Community detection in graphs.Physics reports, 486(3-5):75–174, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:9fa18c3a26c620019c415042e2ea79ef2ab6abf55cc18d890f10166cab549284","observation_id":"a89d4a73-262a-4703-bfb4-42fd8144f4fd","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"A tutorial on spectral clustering.Statistics and computing, 17(4):395–416, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:4d1a305a5a556097a17e131da2e8990d9f0a310e3629d198c7662f4240897ef8","observation_id":"985a1154-443c-43c7-b0a7-f5c0231cc21d","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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":"10.1214/14-aos1274","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Consistency of spectr al clustering in stochastic block models","venue":"The Annals of Statistics","work_id":"afe75974-7e4e-4d6d-bfeb-7bfece5af9dd","year":2015},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:99c6109ffacb8c97862c14e2830b2a8067e3ccbc133d22cda97cdc2e6bef12dd","observation_id":"bd188c2d-9fce-4473-8cfb-e745e4a025f3","resolution":{"observed_at":"2026-06-29T09:53:16.962124Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Mean-field theory of graph neural networks in graph partitioning.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:318cac4e43bec627e4cce1d8786223ba4250a1072fc675da393f43b80a7855c5","observation_id":"886a4b9f-4d30-4bdd-89b4-ebd455d08b50","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Neurocut: A neural approach for robust graph partitioning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:8e390e10e5e2ba4d314a7a4aee3f1e4a86b23b03766ca88a3ca6bccae64f2edb","observation_id":"838720ad-16ad-4c53-b3b4-eb53e0e2f42a","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Scalable gromov-wasserstein learning for graph partitioning and matching.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:42a57396e2829a783f225f5bbdeca39f6f2164531d0102a042ae93a4ebce8400","observation_id":"6da4db6d-3945-4531-bf47-677f34c547f9","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02753","last_updated":"2022-03-01T16:28:47Z","snapshot_observed_at":"2026-08-20T13:52:39.762255Z","submitted_at":"2021-10-06T13:38:31Z","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","version":3},"cited_work":{"arxiv_id":"2110.02753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.02753","snapshot_observed_at":"2026-06-29T10:03:17.342613Z","title":"Semi- relaxed gromov wasserstein divergence with applications on graphs.CoRR, abs/2110.02753, 2021","venue":null,"work_id":"7a072a49-cb18-49de-9b97-e3bd325878d7","year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"cited_paper":"/paper/2110.02753","citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:350acbda4a50d0f2e5f4a669c8f148b29bd2f7f831b434f2e54d4e63808a6349","observation_id":"8163311f-9a9a-47e7-a857-0d14ff59ef8d","resolution":{"observed_at":"2026-06-29T10:03:17.344495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Heat kernel based community detection","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:add771e3304bb306460d14bcbd1f7e842f6d517fa3f7f0be80efa94934de689c","observation_id":"4438966a-1652-4754-9259-4f6d3072c3ad","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Stochastic blockmodels and community structure in networks.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 83(1):016107, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:e1066cc95c7122aa2a62a1e7e012d56ed3bcb1d073a283866541b86fccc25462","observation_id":"7731d357-2f46-4a71-bbfb-0a7b562438f3","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Assessing a mixture model for clustering with the integrated completed likelihood.IEEE transactions on pattern analysis and machine intelligence, 22(7):719–725, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:073842d5060ca5f1e34437e9c8323afec87a9f78441ef0bdc727b536101b2ddd","observation_id":"317dac7e-230c-4ec2-9fae-855bba67f1e4","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Improved bayesian inference for the stochastic block model with application to large networks.Computational Statistics & Data Analysis, 60:12–31, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:5c4e98038cde79c63ede86a3d8c1db31ffaf8b5738a8845170715b9395a900b4","observation_id":"8d978787-08d9-4a3e-b461-77ad2c54d030","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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":"10.1007/s11634-021-00440-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hierarchical clustering with discrete latent variable models and the integrated classification likelihood.Advances in Data Analysis and Classification, 15(4):957–986, 2021","venue":"Advances in Data Analysis and Classification","work_id":"eba79361-a7f1-47c2-869a-307cdd79223b","year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:8387c30f50e7d363f2f278e4f5941f2e21e5e19b89bcb377ecef4ca95d162943","observation_id":"31907dca-a87d-4b59-b6ea-c9067d29f467","resolution":{"observed_at":"2026-06-29T09:53:16.971989Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/15-aos1354","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annals of Statistics43(6), 2624– 2652 (2015) https://doi.org/10.1214/15-AOS1354","venue":"The Annals of Statistics","work_id":"94dc8b1c-f241-4b67-8449-240d8e3b74bd","year":2015},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:555ece1430bfe80330f16a9968d26bbf9dbd775c7789e4e65821c1fd3f9ec90f","observation_id":"a091c50c-d225-41af-86d1-5daa72da2647","resolution":{"observed_at":"2026-06-29T09:53:16.970068Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jspi.2021.04.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximum likelihood estimation of sparse networks with missing observations.Journal of Statistical Planning and Inference, 215:299–329, 2021","venue":"Journal of Statistical Planning and Inference","work_id":"a2269f9f-4fa3-434a-a691-bdd63c7f132c","year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:486980a60d205aa3e9368dcb0e48e5a50a2438c3556b31a5b086d83a7eb8d835","observation_id":"d5cc6aa6-84a1-46f5-8457-612902e930d5","resolution":{"observed_at":"2026-06-29T09:53:16.967696Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-29T09:45:28.800481Z","title":"Optimality of variational inference for stochasticblock model with missing links","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:ea0fcd995dc7bac39f29aa8dcc4cf022699e7c621b863a28b14305407fa2ea19","observation_id":"9f1026e6-cfe1-420b-baac-d41219202437","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Spectral clustering of graphs with the bethe hessian, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:acc9cf31acb16e9926e06fd69165e8806cc1569298279b4a6489fc98a8e575ad","observation_id":"085f8dda-e89c-4ad4-9297-4c9fbb59a1c2","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Recovering communities in the general stochastic block model without knowing the parameters, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:a09cbd0a15af2721e44e94a3bf29b0844d6da5366fde18a5f4b17a50d535d970","observation_id":"7cb27795-135e-4de8-9585-387dd660e1df","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Grundlehren der mathematis- chen Wissenschaften","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:0f5544ab05f02227235d8adff027f17a70621480f809a37091fdbb49201b371c","observation_id":"d480e89e-5d67-4443-8631-28d66c1d8019","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Computational optimal transport, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:aa3423f9655446b92ce619873270b34c28e197dab5514b6d0b5ae15de278c757","observation_id":"717b809d-8c08-428d-ba80-52559b6ed045","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"A survey on optimal transport for machine learning: Theory and applications.IEEE Access, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:0458aeedef47ba477420a80fdc1ee0ac0b9bf74043f63e909e59a4c5bb4a3924","observation_id":"f858e513-ae67-415e-b1b4-8618c39606c2","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Gromov—wasserstein distances and the metric approach to object matching","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:75b50e73a4b4ffa6e6399e1880bcbfb29cbb677aa46c755d95fcd08c5bd3d6e7","observation_id":"9b026dc0-b245-471d-9815-c19c73918edc","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"American Mathematical Society, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:d3c6185d240085143040b21460d40605af9b6a89d3e2b38a3f70dd1276e38630","observation_id":"721ab98c-e5e5-4068-9a07-4699431ca6a4","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"The gromov–wasserstein distance between networks and stable network invariants.Information and Inference: A Journal of the IMA, 8(4):757–787, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:1876e8fef889d09caeb2d07efe78a498c002bc8167671ae55d8773ffb625141b","observation_id":"8df705fe-be76-44c2-90c2-3da6430ddda0","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Gromov-wasserstein learning for graph matching and node embedding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:3a923a2e862cc48cbb13c528b4c6fe9b3a867aabd45c97487d9e0f1cd50fdcf1","observation_id":"c51f2c53-6c3e-46f3-b1f0-4b612acdebc7","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Quantized gromov-wasserstein","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:73e01c36b96178390cb6c1e7fdc00321217e646cad84ce8b586ac5a51cbd0f33","observation_id":"4fd21264-b4cf-4072-ad33-92a164d6e234","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Gromov-Wasserstein Averaging of Kernel and Distance Matrices","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:ff40fc56f0dbfb50903333bbbf705162fb9d44f11a85fb799746e780a52ab84d","observation_id":"1255bca4-4017-4991-96c9-dca48b2f9ab8","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Optimal transport for structured data with application on graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:d21817e03f5ee6f44c519699d8e78aa8b82e6317c94d2570ec93a1f5f7fe4e6f","observation_id":"589c5105-ab4f-436b-9b90-79ad9847aff8","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Generalized spectral clustering via gromov-wasserstein learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:3eecc103ef07558841e2bd0b0495704770321a853f5310ffed2c23f00064dbe8","observation_id":"8f07cb1d-51c4-4ebe-845b-b95130449905","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Optimal transport-based cluster- ing of attributed graphs with an application to road traffic data, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:ccf0b403e64728c3b07ad27244d74a7d5b5dcc0c31c6129b589562e39705ddaa","observation_id":"cbce82a4-a1ea-44c0-ab6a-ed085afc31e9","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Learning graphons via struc- tured gromov-wasserstein barycenters","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:b0d0717d55397761343bb268686acc7019eefe99201870619442e324536fda80","observation_id":"54fd5f6a-3663-41cc-8f5c-322415acf3a0","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"A gromov-wasserstein geometric view of spectrum-preserving graph coarsening","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:767432198e66877bfd500cde3061f87d9f68bcd122f50ae2497182ac2b401499","observation_id":"0b159da3-f2ac-4e15-a515-a6b7ebffb65c","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Gromov-wasserstein factorization models for graph clustering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:fb3cb14b90c1b67bca7af591251f686bd80910fbc8c97b1000c2676f7fb5f3d5","observation_id":"171adcd3-c863-40ec-85a6-4c68d2b244d7","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Online graph dictionary learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:d2c44b076990a4b32c5b6a04f7817cffad4dc3b0a457d9bd8d130a6b8836695d","observation_id":"34dbd5f4-9f40-449c-8484-99e5be5f22d3","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Robust graph dictionary learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:4bad76b72d14b6116638e58e259e4808dabaf5d5863907c2f3fc8e3b31569af4","observation_id":"f5d316ce-8530-4b06-a45a-a7635d7053ac","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Generative graph dictionary learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:4d81381f2354873d231ce28c222ad410f292fa6514b1403067bd9dbab3b73758","observation_id":"a7fbe284-6686-43fb-8d4b-dd8f782d89c4","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Template based graph neural network with optimal transport distances.Advances in Neural Information Processing Systems, 35:11800–11814, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:4d9a0dc8e6212e3cfeaa40bb055593d66267393575a6d50e5964086d85dbc567","observation_id":"e0e7628d-9827-4e5e-8420-489049e4d978","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Wasserstein barycenter matching for graph size generalization of message passing neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:5af8230e6b7fa28d67ff7e0389a3a4cbd6c3ba796f36ed8d5bb3901225210f89","observation_id":"e6c949e0-2368-4cfe-bd4a-18b7ad3dcd3a","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Reimagining graph classification from a prototype view with optimal transport: Algorithm and theorem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:5460340e046611a3cc86f665b130c85fd3219fcaf946325f92b2764cbc82cb56","observation_id":"5b2227e9-0b39-4d56-925e-4d69e164e009","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"The quest for the GRAph level autoencoder (GRALE)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:2737615a9476aa3e81338bc815aa37ee1d5510b758b967ba37a11d0d0549109e","observation_id":"c92c8c8d-fcf8-42ab-bc79-1e3ce506d406","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Distributional reduction: Unifying dimensionality reduction and clustering with gromov-wasserstein.Transactions on Machine Learning Research Journal, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:d647d4f7e2e092503bab4bc8ddabbf43733fbea531148a7e3c8b2cb8a1716833","observation_id":"ad000501-85ae-4bd6-a585-42f5ab16745d","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Generalized dimension reduction using semi-relaxed gromov-wasserstein distance","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:8ae5975319370de3a956af7c4246822e562844836f2bb6edd4b9a119bad7b0fd","observation_id":"c7384b65-ac6c-4bfb-b675-6254654e5a16","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Kernel k-means: spectral clustering and normalized cuts","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:bc473171a9b595aecd728e678b4029459e3ae5f731b9a7bdc01c258d0e094345","observation_id":"75d9086b-0e55-4693-a1fc-9ddce2ca8380","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"A review of stochastic block models and extensions for graph clustering.Applied Network Science, 4(1):122, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:63a39648d8e6cdff11719b7f10a5fe50f65e61eb19012c6194cba3e164c7cb28","observation_id":"74d75535-6fb4-49ce-8117-daeca5df7def","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Daudin, and Laurent Pierre","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:016bd1e8b4af6cdaff8192d5302f20ef767729873bd63319827395167e0c49bc","observation_id":"b266333f-241e-431b-8088-1f9a90474647","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Convergence of the groups posterior distribution in latent or stochastic block models.Bernoulli, 21(1):537–573, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:ac6426b2aab56fc9f0dd648d8a91b0fde1f7391de73a8b57d36f3fe223fa545b","observation_id":"78a418f3-d6f6-4544-9791-83747349c853","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"A graph matching approach to balanced data sub- sampling for self-supervised learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:010de1e451b525af6551812ba8de1ad7151d7ae6387110b2e135bc5970f134c6","observation_id":"94106d64-28ba-476b-83e4-6ced732fa4b4","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Itera- tive bregman projections for regularized transportation problems.SIAM Journal on Scientific Computing, 37(2):A1111–A1138, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:c83a123286ac1d8d9665db7e64a37e595ec4e09e02ba12e7de2ca4b9e78d70c1","observation_id":"d0727094-917c-429d-9975-0570b93bc630","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"The map equation.The European Physical Journal Special Topics, 178(1):13–23, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:1f7aa260e7e8a1dd9e04712974ca18611e1859fbc1891eb9cf49819a56f25044","observation_id":"24ebd4c9-4661-4d62-8269-55af54ef06bb","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Blockmodels: A r-package for estimating in latent block model and stochastic block model, with various probability functions, with or without covariates, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:3e91d1d6ddb7592760796ef3e41a3b86d0b2fcdddbdfe1a6710eec0e517b35c6","observation_id":"e44a24e1-0b8f-4d7d-aa16-f7566c44c500","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Adjusting for chance clustering comparison measures","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:6a5d6f0f34ab16e3e22f6b0814f37faf77fd0a92b9d8919cd62b6da722593989","observation_id":"7bd63b47-1529-4a47-880c-b41b8a2fe667","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Comparing partitions.J","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:1c4d4d531f1c9e95f44b36736ad9b328921f693d52f9f5c1f59d20974c630cbf","observation_id":"9919ef64-ce20-4bdb-ae5b-12646454ef80","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Cambridge Series in Statistical and Probabilistic Mathematics","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:11e8356b0b9b099d3974dd28628f6687c549d8ce859ad271486d9cab3438a86d","observation_id":"be3af533-d863-4895-9076-cb84acacfb75","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Asymptotic statistics (1998)","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:37f58238af42826fa8db48425fd68b062c26dd8d76ca07c470fb6ed9bb779c0d","observation_id":"1ae6b539-9938-4acd-88f1-c9ed1f5c5fbf","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"Pot python optimal transport (version 0.9.5), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:1fa506ca0e132c9e0b15ce40b2e957136c191e94353f22b3500ff9f686b7286e","observation_id":"3a7ae472-4ce3-42c9-9a94-e1cafa84d482","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:dfe6da33c216924d81e5b3f9e52a7b3ee70c69caf559b9e30187953ab9b64f48","observation_id":"c8052520-7c9c-4632-9c69-c72c35952447","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","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-06-29T09:45:28.800481Z","title":"projection","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:0624103475a477855ebe504ec0e3b6fc2c5269a1e17d99b4e4c81b939ae4267d","observation_id":"fc3cd6aa-2499-4ebb-9a5c-2713133ce28e","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","resolver_source":null,"status":"malformed_identifier"},"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-06-29T09:45:28.800481Z","title":"Justification: The research does not involve human subjects, therefore IRB approval is not applicable","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-29T09:45:28.800481Z"},"links":{"citing_paper":"/paper/2605.28488"},"observation_digest":"sha256:0c154b522883cfc7b303b546474aeb62814723bc81cf67e2c7a81ab28a75676a","observation_id":"0096bcca-eaae-4142-9e60-0a216b8a9712","resolution":{"observed_at":"2026-06-29T09:45:28.800481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.28488","last_updated":"2026-05-28T08:14:25Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-13T19:12:42.702738Z","submitted_at":"2026-05-27T13:44:43Z","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":65},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2605.28488."}