{"as_of":"2026-08-22T03:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dcd1c8d4fbc5a1a3d0f253fd969b720f700e95dc5eae67e23a8b32f431c69e93","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:20:11.264509Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2412.02661/citation-record","integrity":"/paper/2412.02661/integrity","json":"/paper/2412.02661/citation-record.json","paper":"/paper/2412.02661"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:20:14.099909Z","title":"Community Detection and Stochastic Block Models: Recent Developments","venue":null,"work_id":"78da89db-94c0-4c9f-ba82-485d080947ac","year":2018},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.517880Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:d66e69cbfb762f8fefd1b894627f7d0d092ad3e9719e968ff24ff34379066206","observation_id":"d6fe149d-ae6e-4040-8ef4-fbd4ff986e04","resolution":{"observed_at":"2026-08-11T23:20:14.111284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:14.074390Z","title":"Bandeira, and Georgina Hall","venue":null,"work_id":"ab367409-22b9-4a82-bb17-8419e4d179b6","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.525539Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:a91c4402aabda6eb8273923369374d40fc0bafe3e1055657aca691b63bfa3da2","observation_id":"13dbd4be-8327-4025-bff6-7d640e31412a","resolution":{"observed_at":"2026-08-11T23:20:14.080634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:14.052481Z","title":"Entrywise eigenvector analysis of random matrices with low expected rank.The Annals of Statistics, 48(3):1452–1474, 2020","venue":null,"work_id":"420a9879-5902-4753-9762-472e3993e5eb","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.532546Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:815f5eb545176edaa5d0132d07ae716ad767c1b6ac833ce11ebcd4a08f406784","observation_id":"94803ba1-cb4b-4fcc-a0fc-4a61c310614a","resolution":{"observed_at":"2026-08-11T23:20:14.060807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:14.019159Z","title":"Community detection in general stochastic block mod- els: Fundamental limits and efficient algorithms for recovery","venue":null,"work_id":"53278d2b-f6c6-4849-9612-23247bc7b0ed","year":2015},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.538675Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:8d7b49875fa947886d4144b1862dbbfbc09e55ee2dbacc0175dd5f00c63ec8b9","observation_id":"653aa85f-3465-4ab6-a5ee-962eabd45b89","resolution":{"observed_at":"2026-08-11T23:20:14.029354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.979199Z","title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","venue":null,"work_id":"be6da3bb-a864-4c99-aa3b-7903f4e2478e","year":2019},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.546974Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e3f257f0e2763da099228b5d51895b15cf81f025fc3fb90d7adff6c24c25cfbf","observation_id":"13b35655-bb13-4610-8650-8c6ba2875c9e","resolution":{"observed_at":"2026-08-11T23:20:13.988078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.938804Z","title":"Constant Time Generation of Rooted Trees","venue":null,"work_id":"ede9bfe0-7df8-4a3d-99bc-2398d460f64a","year":1980},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.553831Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:9925d7a753ddc5eb502e2bc07eb9f0fc0900baa35dbdf59c366d1e54958ed15a","observation_id":"ffe6ce10-fd05-4c9b-8069-4058ccf4ed7e","resolution":{"observed_at":"2026-08-11T23:20:13.948304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.914180Z","title":"Vec-sbm: Optimal community detection with vec- torial edges covariates","venue":null,"work_id":"12a11ee3-77ad-47f5-a0c4-9061b7457d47","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.561583Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:faad686b5125fa41ff0d0e27bfa963146925b7bee4ccbd5b894c716fcc7e721e","observation_id":"5aa1214c-4a7b-4ba4-b29e-764078e65a17","resolution":{"observed_at":"2026-08-11T23:20:13.921319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.855701Z","title":"De-anonymization of heterogeneous random graphs in quasilinear time","venue":null,"work_id":"6e8e827e-8d91-4d92-a269-3ef9eabc1056","year":2014},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.571883Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:4b452b8867755bc7eede56309eef98f2dba0142d5841ad819ba679ee53399cfd","observation_id":"188f0d42-fc44-4fd8-92fa-9568a69f707c","resolution":{"observed_at":"2026-08-11T23:20:13.871913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.830652Z","title":"Testing for high-dimensional geometry in random graphs","venue":null,"work_id":"f59c3eb7-9c18-4951-81f4-50f5a1a986b8","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.583183Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:8dc9426cc169eb68f0f23493fafd563bcc7bd13260ebde16a0c06f4d1da6951a","observation_id":"f8ea7743-f153-41bf-a357-55e715b5dcbd","resolution":{"observed_at":"2026-08-11T23:20:13.839637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:10.601536Z","title":"A computational transition for detecting correlated stochastic block models by low-degree polynomials","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.601536Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:ef75c2089b598b54136c98b7bfac876d4367c3c1d02495a0fa25d634a27fbc65","observation_id":"df86dd62-8cee-49c0-959d-b6ad75838d2d","resolution":{"observed_at":"2026-08-11T23:20:10.601536Z","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-11T23:20:13.792796Z","title":"Social Network De- Anonymization Under Scale-Free User Relations","venue":null,"work_id":"3951baad-fe9e-488d-9991-42ece72da0e2","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.609986Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:49a244ffb4865a32a3f4a788b82e9162083d3cd266118ef49c5b325d0dfc26f7","observation_id":"6c8d1fc3-d97f-4be3-90a3-18265b6f5a7a","resolution":{"observed_at":"2026-08-11T23:20:13.804469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.764304Z","title":"Colbourn and Kellogg S","venue":null,"work_id":"d93eea4e-e904-4afa-806b-93e3bc94cc83","year":1981},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.617385Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:2d6898c57e9fff5e8df9599225ad3a08ff9266bbf1c9cb21b1a450bce1e382e0","observation_id":"205b4312-bc55-41ec-9f72-2ae0d2819d43","resolution":{"observed_at":"2026-08-11T23:20:13.774174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.731999Z","title":"Thirty years of graph matching in pattern recognition","venue":null,"work_id":"a4a9803b-2928-4b65-93c0-1ce719b7fbcb","year":2004},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.628599Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:7f0765d2e32dc06a0fadc09f0dd95abea4ae6ad8b38be45c217856d457211af9","observation_id":"9e26fd30-46a7-4535-a471-6b25acd2110a","resolution":{"observed_at":"2026-08-11T23:20:13.744224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.682586Z","title":"Improved Achievability and Converse Bounds for Erd˝ os- R´ enyi Graph Matching","venue":null,"work_id":"7a4b4ec1-e2f0-486a-99f0-801fe43ef280","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.644177Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e34abfedd6d6e08369101a19ffd911da51eaffc256957ba17f722759d295e385","observation_id":"9248503d-ec32-49b0-8b2c-c4bbf8896109","resolution":{"observed_at":"2026-08-11T23:20:13.695284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06783","last_updated":"2018-05-14T04:27:12Z","snapshot_observed_at":"2026-08-16T07:38:32.245373Z","submitted_at":"2017-11-18T00:57:18Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-08-11T23:20:10.669432Z","title":"Exact alignment recovery for correlated Erd˝ os-R´ enyi graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.669432Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:8a9c891da8b6e4a70e441449dfa937310817088c1101d858c6ab15b240dfc053","observation_id":"0450fa50-b9cb-4e91-a48b-551367ac5d83","resolution":{"observed_at":"2026-08-11T23:20:10.669432Z","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-11T23:20:13.661398Z","title":"Vincent Poor","venue":null,"work_id":"78e06153-c0c1-4f4b-b6fe-0f6b36f7f7f7","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.678838Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:4226c001bb9f50804828b318b22182a91b95e88a3ca28db786f3a7939c3a8bfd","observation_id":"372beac9-0b97-447a-89da-c8674b703802","resolution":{"observed_at":"2026-08-11T23:20:13.666970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.635982Z","title":"Matching recovery threshold for correlated random graphs","venue":null,"work_id":"e57c3795-583c-49e2-9c17-e48526e8ea89","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.696312Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:cd6d07b2a97cf36cdee7b0ffdb862a5b6efd1bb0dada5fbaa5475c6d077beacf","observation_id":"4a9e6658-0808-4b0d-84ef-e7178fe4b5cf","resolution":{"observed_at":"2026-08-11T23:20:13.641506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:10.703126Z","title":"Low-Degree Hardness of Detection for Correlated Erd˝ os-R´ enyi Graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.703126Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:66cca9b1c5522c81f3919fd65e40c146efd7c446ea4a8881dbac84a62647a10f","observation_id":"3de5017f-f515-4139-9ca9-202ee65ea23c","resolution":{"observed_at":"2026-08-11T23:20:10.703126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-08-11T23:20:10.723544Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.723544Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:eede874284767b4d3bd132846c423506db9a029f0532b8da409eac0d8e89fef8","observation_id":"440cb041-a9c9-421c-9adc-4221191960f6","resolution":{"observed_at":"2026-08-11T23:20:10.723544Z","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-11T23:20:13.599947Z","title":"A polynomial-time iterative algorithm for random graph match- ing with non-vanishing correlation","venue":null,"work_id":"af0b3c85-b6ec-41c3-93dc-1259b0afd393","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.730992Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:491d3a4961f1aa3198470d833dd46c253600f7b7016510da4f385c7296fe4ae0","observation_id":"8f47056a-2847-4c44-b4a3-768835ac64fe","resolution":{"observed_at":"2026-08-11T23:20:13.610008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.557651Z","title":"Efficient random graph matching via degree profiles","venue":null,"work_id":"5d11374e-6f9b-4408-8a23-604d0f938999","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.744154Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:bb1cc001f723ebed8cc636c21d7905d94b53ed5bb7f8a494687e7ec6565756f1","observation_id":"53b219ac-6df9-4859-bdda-0aad3604529b","resolution":{"observed_at":"2026-08-11T23:20:13.576816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.513084Z","title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory","venue":null,"work_id":"1b1b95f7-a18e-4342-82c9-8589b01d4f43","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.771709Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:b991080e35916fb832c9ea93293daeeaf6c79be286411e67406adcce3fafe06a","observation_id":"b847e7dc-7178-4513-a020-23c962e59b92","resolution":{"observed_at":"2026-08-11T23:20:13.521812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.465370Z","title":"From tree matching to sparse graph alignment","venue":null,"work_id":"a4641cc5-7ab0-458b-87ee-1774fbda0b74","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.784091Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:31ac32bde4a91542924e6d88615b935dcecfbd128002e48fc4d8c7659dccd48e","observation_id":"7a7b7215-4ec1-461b-9940-66f96e3e265f","resolution":{"observed_at":"2026-08-11T23:20:13.478045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.404660Z","title":"Impossibility of Partial Recovery in the Graph Alignment Problem","venue":null,"work_id":"884815dd-d4ec-4ef2-9cc8-00e860a6d89c","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.798169Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:66e0652f6486724ed76377be9cdac75b71827b20eca4fc18de2c83a1b2a8cd7c","observation_id":"0e199066-79af-4f29-ba6f-c9c4c214b00f","resolution":{"observed_at":"2026-08-11T23:20:13.428788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.376891Z","title":"R´ acz, and Anirudh Sridhar","venue":null,"work_id":"23b4b625-df2e-4d1e-8001-22869a188582","year":2022},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.805751Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:9c2bd79184b86fb55eb3ceab31c77b7083496c70a2d40a3bae415a42c2f29bc3","observation_id":"a408cf40-71b5-4436-a054-2ef4b3d8a138","resolution":{"observed_at":"2026-08-11T23:20:13.383682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.337286Z","title":"Goh and Eric Schmutz","venue":null,"work_id":"9b2bc0e2-2a6d-442a-97f4-31ae22df109b","year":1994},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.818246Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:bf0ce2668d1330893f3f32c1705d5d47d9a9a8d6a78d01dbbfcec8b940ebf564","observation_id":"3daea534-5512-4bec-a096-4cc245b2fdb5","resolution":{"observed_at":"2026-08-11T23:20:13.346666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.294799Z","title":"Partial recovery in the graph alignment problem","venue":null,"work_id":"905e135c-8521-4636-a381-714cf1f34d5e","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.826984Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:b4af174f787b44e7e76f5a5844c37f482cd03db5021646de84cdbf8f0a05d22f","observation_id":"1796fcbe-56e4-4874-b2ba-351a2dccbafc","resolution":{"observed_at":"2026-08-11T23:20:13.307829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.256988Z","title":"Consistent estimation of dynamic and multi- layer block models","venue":null,"work_id":"4fde3ed9-0cc3-4076-b872-e0d1ecdfd2b2","year":2015},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.834364Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:b7d6d31e00e4a34e0c369599d6197ecb4831c371fd3be8c4ef55a869b318f4e9","observation_id":"8c678ea9-5909-4977-944b-42eaa8cdd7d7","resolution":{"observed_at":"2026-08-11T23:20:13.269225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:10.841189Z","title":"Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.841189Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:7b4aed480ecfea170ce6dc98f029b54519bbb540e49d4862c7a8c456c6e37ec2","observation_id":"ae4e47f3-1b62-4f29-8dee-8442827bf19d","resolution":{"observed_at":"2026-08-11T23:20:10.841189Z","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-11T23:20:13.185928Z","title":"Network-adjusted covariates for community detection","venue":null,"work_id":"921b9427-7ec2-4d1e-aad5-a44ab9cd2af5","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.850714Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:dae4977fc8fb25aae07c7ab39c0aa94c75d1233b79c35155688b9a6154ba77f0","observation_id":"00968ca6-f64c-41ac-9ead-046f6c6fcdd7","resolution":{"observed_at":"2026-08-11T23:20:13.202615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.153161Z","title":"Random Graphs","venue":null,"work_id":"68fb13c2-1c31-41bf-86da-d426432c868e","year":2000},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.858675Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:fc1a7348168cf5d6c760fc614a0b2f7ab738dee96d5ccbdf76e1276078c8b535","observation_id":"732e3549-aea2-44b2-9f31-636c73b42099","resolution":{"observed_at":"2026-08-11T23:20:13.159910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.106685Z","title":"An efficient reconciliation algorithm for social networks","venue":null,"work_id":"d95fb4c4-a0c1-41f6-8cec-3e05986cc9e5","year":2014},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.870412Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:a17374311f3af3f9ab15665ddea4d20efa4c586b17cc9e07bf859754b116198a","observation_id":"a1349ec9-7ec3-4e9c-8e25-7cd2c6b5a24d","resolution":{"observed_at":"2026-08-11T23:20:13.115913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.069900Z","title":"Consistent community detection in multi-layer net- work data","venue":null,"work_id":"311cb0b4-3cab-47b2-965d-1ea2ca3a3126","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.877490Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:ea6e24698beab38f224cfd973832370d2e0d133b7c1663527344e1639f22fe29","observation_id":"f5ead340-0cc9-4f3f-9546-35e9f5f058de","resolution":{"observed_at":"2026-08-11T23:20:13.081079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.043672Z","title":"Information recovery in shuffled graphs via graph matching","venue":null,"work_id":"3821c71b-2317-4475-953d-8d5f2b3f65fe","year":2018},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.887602Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:7eed2009229681a5c6954da286aa1669ec9741a6a609a5876ce1f1a7a58617d7","observation_id":"4ca90fda-b6a7-412f-bfe5-b0dfd3b040b9","resolution":{"observed_at":"2026-08-11T23:20:13.057608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:13.008258Z","title":"Sussman, Donniell E","venue":null,"work_id":"03e527ec-3050-46bf-a802-4c56f6907015","year":2015},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.903136Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:0c499812138b212739335ae2c525b516a9a317bcd39799960835dd7d5d9a008f","observation_id":"332ff036-5039-4f70-bba8-5058d46f031e","resolution":{"observed_at":"2026-08-11T23:20:13.023176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.958964Z","title":"Image matching from handcrafted to deep features: A survey","venue":null,"work_id":"b631fffe-ea34-4525-ae31-942042106a90","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.909812Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:f605fdee9ddf532bec5273ba031d13b46f2d00cb4348447c20fc895b136ea6e9","observation_id":"862c54b0-0257-498d-af2f-65cfca69e024","resolution":{"observed_at":"2026-08-11T23:20:12.972535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.925902Z","title":"Community detection with contextual multilayer networks","venue":null,"work_id":"4a896ed9-4569-4efb-91e6-54d55336c03d","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.915535Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:3807e67b5023133eb8ddb933056f3d35d842b9a1e55d181ea775d3ef374d4715","observation_id":"039a7fff-edb7-4198-9938-d59b3c0833ac","resolution":{"observed_at":"2026-08-11T23:20:12.937832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.900012Z","title":"Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation al- gorithm","venue":null,"work_id":"b5b0e83a-8bfd-49bd-9611-090bf6be7a80","year":2010},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.928049Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:7878fd149b3a1c80e6a8de9d652aa2a13af7a9cb85a91b25b66e482dace6919f","observation_id":"c9f94856-0ec7-4f66-88c2-88648a914f7b","resolution":{"observed_at":"2026-08-11T23:20:12.908422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.856564Z","title":"Random Graph Matching with Im- proved Noise Robustness","venue":null,"work_id":"12033901-cb98-43ac-9d42-35e19742b335","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.940530Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:8dfe578bc628baa0c5b4dc747e26aa78680bd22a8ade11bb6f088518dc7564ad","observation_id":"aeccc80a-8548-4c22-943f-f029cdbcc497","resolution":{"observed_at":"2026-08-11T23:20:12.863008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.821894Z","title":"Exact matching of random graphs with constant correlation","venue":null,"work_id":"73f28b61-d2ad-43cb-b705-7c7c2c12a173","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.947100Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:de2533328e62615c6c4646a53a05141d2635c57598f49dcdc2694a7b4ca79371","observation_id":"41019409-ea0c-4218-b810-cf1df5f36eae","resolution":{"observed_at":"2026-08-11T23:20:12.836182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.786144Z","title":null,"venue":null,"work_id":"6e29b9d6-cfe4-407e-88b3-28cd8d811ebf","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.955117Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:fef8e6aaabd2c6a119f41c8cf18adc96b6e395d52e3901537b27f43838ed94aa","observation_id":"42a15082-fec0-46ab-a3da-47308d10b986","resolution":{"observed_at":"2026-08-11T23:20:12.794077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.757629Z","title":null,"venue":null,"work_id":"fe74af06-7b94-41d2-a528-9bcf024ad49a","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.974488Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:463fb6e655b0ea16d24b7f6dca88036cb35ad7736f4d189b97352bab13ba906b","observation_id":"3ad586f6-6d21-4958-bc8c-b2466bd68b72","resolution":{"observed_at":"2026-08-11T23:20:12.768750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.713313Z","title":"Community detection thresholds and the weak Ramanujan property","venue":null,"work_id":"6999fbd6-2ea0-433b-b29c-743e9aae62d8","year":2014},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.981883Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:9bf5384942b0819418d5fe87e15040009b17ed730f6201d7dc8810e99f350ca9","observation_id":"93a672d4-7916-4b17-b070-f2b90df20423","resolution":{"observed_at":"2026-08-11T23:20:12.730410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.661949Z","title":"Mutual information in community detection with co- variate information and correlated networks","venue":null,"work_id":"8f9b65ff-fe28-4687-9049-c233d3c3325d","year":2019},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.988435Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:c6ae8b759d4c7e3c2e8c1958c333ee2d27acacb0dbeb330be34f6346a6b9e9d3","observation_id":"f13f4a8b-c144-448a-843e-758407cf6a26","resolution":{"observed_at":"2026-08-11T23:20:12.671848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.606498Z","title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","venue":null,"work_id":"4ddd8d2f-0803-4afa-935b-8c9a9c2d42c8","year":2005},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.005142Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:485d2625ff2bfe1883862c910855f29eb59f252d226f21c4d2a7697cd0f68c30","observation_id":"3195e9e5-0685-426c-9eea-84fddc9c4536","resolution":{"observed_at":"2026-08-11T23:20:12.617085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1202.1499","last_updated":"2012-08-22T00:36:24Z","snapshot_observed_at":"2026-08-15T04:20:01.771021Z","submitted_at":"2012-02-07T19:17:58Z","title":"Stochastic Block Models and Reconstruction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1202.1499","snapshot_observed_at":"2026-08-11T23:20:11.012812Z","title":"Stochastic block models and reconstruction","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.012812Z"},"links":{"cited_paper":"/paper/1202.1499","citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:b5f0255abbe83d02cb40d11c534da5afb8b83c949c67236b9f5a662fe79cbadd","observation_id":"1c948da4-3e74-4bda-99d0-b3b6ceac4e70","resolution":{"observed_at":"2026-08-11T23:20:11.012812Z","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-11T23:20:12.564041Z","title":"Consistency thresholds for the planted bisection model","venue":null,"work_id":"f85c0948-8a8a-457f-9bb1-1f77cdf7495e","year":2015},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.020906Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:66a01b16db5e7ed6a4871c7f2fa07f0e4eb6be0c956b6d956c16e97a02c67b14","observation_id":"a5a5cbe9-09a9-414d-aba7-7bad55313f4e","resolution":{"observed_at":"2026-08-11T23:20:12.577033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.029928Z","title":"A proof of the block model threshold conjecture","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.029928Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:0528c41102936d05cd4d3c551cb899c1fa7f6475f5ef8ab3bc07db16b8a81493","observation_id":"c9fa104d-1472-434a-ade4-4cb2eeca16f8","resolution":{"observed_at":"2026-08-11T23:20:11.029928Z","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-11T23:20:12.486242Z","title":"Seeded graph matching via large neighborhood statistics","venue":null,"work_id":"590f5e97-4d5d-40f6-8088-c4f8c88c6cc5","year":2020},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.038086Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:60f157779f6093a46fc2250857febb2517df6d8de16fbf56808373b3c5726a1c","observation_id":"930e7153-b7f9-4acd-bdeb-19d93468a31f","resolution":{"observed_at":"2026-08-11T23:20:12.502862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.446155Z","title":"Faster algorithms for the alignment of sparse cor- related Erd˝ os–R´ enyi random graphs","venue":null,"work_id":"d8d0cc21-6ac4-4c41-bd3f-e292732a7b9b","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.046333Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:476dd86261756b2b12b041c0462872d3e9a1c1f56a6033a67f061e4a6fc946b3","observation_id":"9e580c95-6aa8-44b9-9980-cf309a6570e3","resolution":{"observed_at":"2026-08-11T23:20:12.464277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.404606Z","title":"De-anonymizing social networks","venue":null,"work_id":"01e5b8c4-d2a1-45e1-9e6d-180f9a6572a7","year":2009},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.055632Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e3f50156f16c3c5d923ea386691eb7c8b9d77bf37176b026a06919992635f2e2","observation_id":"4ebd3bea-9934-4fb5-8cf8-d458c2973873","resolution":{"observed_at":"2026-08-11T23:20:12.414802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.376741Z","title":"Hardness of robust graph iso- morphism, lasserre gaps, and asymmetry of random graphs","venue":null,"work_id":"55e34a50-aad6-4f50-93bd-0c38e0b709ea","year":2014},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.062690Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:4058367e3064c38278b9ea70d6427e6b7a6d02ad70d4ccf205bbcc476eb4b54d","observation_id":"adadfb7b-be81-4fe7-ae1f-adec01303963","resolution":{"observed_at":"2026-08-11T23:20:12.384309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.343327Z","title":"Automorphisms of Random Trees","venue":null,"work_id":"b1f06192-f98b-4e03-912c-7c4dc749e32a","year":2022},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.074778Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:f2059a7c6317c5583bececa77588ac622388f6217bb19f14dd1a1231c2e8bfd8","observation_id":"b86c7c68-d70c-4b33-91dc-e2ce6feb2327","resolution":{"observed_at":"2026-08-11T23:20:12.352413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.297426Z","title":"Optimal de-anonymization in random graphs with community structure","venue":null,"work_id":"3c6d1442-d825-4758-af76-0896e9d3b87e","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.081768Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:fbdd0c5b70329dce13655caae3c05286606c341f1c5b26505368064b6608da74","observation_id":"d4643ad9-1fbd-4808-b418-a1be987c8f6b","resolution":{"observed_at":"2026-08-11T23:20:12.320205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.262783Z","title":"The Number of Trees","venue":null,"work_id":"b5d08be7-7e5a-4f29-a564-aa159cc979d2","year":1948},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.089103Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e0c36e62ec70d39718469cdd51e50d021fe37dc5914ad0d37d1e816002122a5c","observation_id":"033de2e8-764c-4344-931d-df510bc71729","resolution":{"observed_at":"2026-08-11T23:20:12.274552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.211778Z","title":"On the privacy of anonymized networks","venue":null,"work_id":"8ee9057b-23f0-4c05-b8b7-440d684fe4e4","year":2011},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.099809Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:ff58a7472f042191d816265cf1f08b415fbf4029eca832f75c7c6f9fe7f06214","observation_id":"aa7be877-ba2b-4294-b04b-9b84b1e40bd2","resolution":{"observed_at":"2026-08-11T23:20:12.230209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.179850Z","title":"R´ acz and Anirudh Sridhar","venue":null,"work_id":"06cafe5c-cdc1-4dbc-902a-16a5ceea3a76","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.108712Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e1dda74fb726335da9293edbf06ce701831d6eb33755713760e71bab14b89da1","observation_id":"f9a71086-fab1-46ff-97a4-8a22facb54aa","resolution":{"observed_at":"2026-08-11T23:20:12.190457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.133714Z","title":"R´ acz and Anirudh Sridhar","venue":null,"work_id":"dabfbe95-1d0e-4ed5-b979-32da05c68a62","year":2022},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.124678Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:28f104c5f8add2606703f34dd641eb65700f87c803bf95a141d145d3d59bced9","observation_id":"25d2a502-ec9a-4766-9656-fb1baa88a97f","resolution":{"observed_at":"2026-08-11T23:20:12.146049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.099897Z","title":"R´ acz and Anirudh Sridhar","venue":null,"work_id":"cdc1b305-b403-4747-bd8b-ce9f6aaeace3","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.136491Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:e094bdf3526749eaf4edbbb8e008635a56aadebc55befbf867afee3139b1d9b3","observation_id":"fd8a8dc1-993e-44bd-b0b9-86779bd87bcc","resolution":{"observed_at":"2026-08-11T23:20:12.106000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.062274Z","title":"R´ acz and Jifan Zhang","venue":null,"work_id":"1fc828d7-a761-4321-9dbe-7ed197c18525","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.145370Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:a5983adffb8dcac5cc44c2e5f3c8e3f8daf557eace7987e7647cbd9e63d9d1a6","observation_id":"4b660aad-3016-4382-8137-37dfd078241c","resolution":{"observed_at":"2026-08-11T23:20:12.071810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:12.035901Z","title":"Global alignment of multiple protein interac- tion networks with application to functional orthology detection","venue":null,"work_id":"99598fdb-feee-4b17-96b3-6a55c9a8f90d","year":2008},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.172366Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:fc500d3af2958557eacb79c3190ece8b8a5428c8f419dd599278f28bd741db3b","observation_id":"352f2330-c68e-48ac-ac7f-df7813ddf9bc","resolution":{"observed_at":"2026-08-11T23:20:12.042770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.995478Z","title":"Massucci, Roger Guimer` a, and Marta Sales-Pardo","venue":null,"work_id":"07f99688-a990-4dd2-b9a6-9b8076b2bab5","year":2016},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.186578Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:a447c2dcd54ac091d6475356fcb0b7c256659edbc1e51922327c4760bbd43b2f","observation_id":"ca8ec570-4ec2-4c1a-aa68-35f601f64b17","resolution":{"observed_at":"2026-08-11T23:20:12.010428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.970670Z","title":"Random Graph Matching in Ge- ometric Models: the Case of Complete Graphs","venue":null,"work_id":"2f328517-ce76-4c82-868e-dfa226c97151","year":2022},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.205060Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:9a79c3d873038ed3d55a5048e76c84791205813f9d3aed9f3f57bace67089d46","observation_id":"4eeb6857-391e-45ca-8071-f0c082321de2","resolution":{"observed_at":"2026-08-11T23:20:11.976785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.936353Z","title":"Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation","venue":null,"work_id":"0c9390bd-5a09-4833-bb55-217aca7e9fc5","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.212303Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:29bf475729da7f26e302a1c59804a73a6d013c5586a30dcff338d090568a5438","observation_id":"c38a866d-63d0-4746-9216-17374ce80a76","resolution":{"observed_at":"2026-08-11T23:20:11.949796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.907170Z","title":null,"venue":null,"work_id":"126dfb7c-e4f6-4ebf-a941-1d330784d437","year":2022},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.218828Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:91ed5660a2043ad7abff299f9d35d67a7e4388496572bb3ea254cd6403de8902","observation_id":"813b02b1-c35b-43be-b2a3-0675eabc32fc","resolution":{"observed_at":"2026-08-11T23:20:11.915979Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.882540Z","title":"Graph matching in correlated stochastic block models for improved graph clustering","venue":null,"work_id":"1f8aab9d-d8a0-40a6-a5e8-e0a831919f9d","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.226187Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:b8fb2dfb2a4edf34ada0a31177d21945ea7afca66508d376a57a492d3d8d93c9","observation_id":"0522f9a8-c696-415e-b07d-726a933e0c42","resolution":{"observed_at":"2026-08-11T23:20:11.889486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.848820Z","title":"Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation","venue":null,"work_id":"92947a91-9dd3-4b0c-9419-b5f5470147af","year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.233340Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:cf4a28b27a89b79a35524ca507baf5c1b6fbadfa419ab964165e4229a29b75b7","observation_id":"a20c2b67-ed9f-441e-b825-e90d211bad09","resolution":{"observed_at":"2026-08-11T23:20:11.854892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08167","last_updated":"2024-01-16T07:13:32Z","snapshot_observed_at":"2026-08-16T14:27:13.548888Z","submitted_at":"2024-01-16T07:13:32Z","title":"Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models","version":1},"cited_work":{"arxiv_id":"2401.08167","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.08167","snapshot_observed_at":"2026-08-11T23:20:11.326401Z","title":"Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models","venue":"math.ST","work_id":"5c36f2d9-35a9-4d53-9d1f-a899ffff42c9","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.239809Z"},"links":{"cited_paper":"/paper/2401.08167","citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:3dde31d330a29d60d678397b967fe6c9fead853bfa5c71f6d453cc3ed6ae6d47","observation_id":"f9135ec0-29b5-47cf-95e3-5734ca2b6f52","resolution":{"observed_at":"2026-08-11T23:20:11.335316Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.813165Z","title":"On the Performance of Percolation Graph Matching","venue":null,"work_id":"4def9188-7782-4fa0-a08d-3914454aeadd","year":2013},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.250132Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:16c81db3a0c3b0b27304600aba49b2c85180e8448d08936bcff7a6b5b6a86ac8","observation_id":"bf7ef44f-b92b-4da9-82b1-6042a3e62863","resolution":{"observed_at":"2026-08-11T23:20:11.820981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.761171Z","title":"The Power of D-hops in Matching Power-Law Graphs","venue":null,"work_id":"0cd26dab-7c27-417d-9637-c85897a4546c","year":2021},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.257458Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:7da88dc265d94f01c83fbabd95021b58fb1d1a308d4e52e6956fb11c0db1752e","observation_id":"f838b726-8a70-419a-bc0f-8ad07df91650","resolution":{"observed_at":"2026-08-11T23:20:11.770124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T23:20:11.732892Z","title":"Consistent community detection in inter- layer dependent multi-layer networks","venue":null,"work_id":"faf5a411-9b48-4673-b861-012fd4065cd2","year":2024},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:11.264509Z"},"links":{"citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:27100b8d639cef1a2fc181bb20c6a1c0c52c8fd7f7e5905d0ec143dc1c3b65bf","observation_id":"d6ffeee3-ec66-49d1-91d5-57929b4f64e9","resolution":{"observed_at":"2026-08-11T23:20:11.741021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":60},"total_outbound_references":71},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2412.02661."}