{"as_of":"2026-08-13T07:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d52e0da592356cdbe99da76d0f3bc4713d862d6e5723f6c50e264182f906d44e","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-13T06:32:02.005865+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-11T23:09:53.471342Z","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:3bde028399c756250f5a9d71aacf1cd4ca780efdceb303ff6c708daf22342ebc","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:de773afc3e5fcd97824be54add0aba203ae45e80bf9ab641e5794b25d592c238","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:9b50a37475ed0dbf0b21bf5809427f167f4bcc98cb84a98b9dde16e7e214d855","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:bee40e6835b61334e8e4126c66eb2934847612dced619872d5efe7fcc8f26ef9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:ae64e3fd80d24ccb1bc9cee1eb123ee1e7fb1cde5e28561f3ea7bb049c59ec55","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:44f834c210bcdc17dafd1ec341afa2ec1f3e079e9e7de5592f46bb43ab1610f4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:f1176c17a124428adca2b5b6fa3a7225274826733bd7a14275ba6922ce8d316e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:723d6c8d01d5ec349389c2dadb2c6862c7b01292feee7522bad78a7674ec2976","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:2b8237c62745844b161707dc4cdebc1a3fcdf023f884d6522c4cfc0d4e6cee01","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:4789baabc3c2ff590b342beb55e087f0ba6f0e7c11748692129167b49afa565d","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-11T23:09:53.471342Z","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:3bd3a7be0393f87dea748569d712b993988238aa49865750f288bb8dccb72a12","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:58795adea47d60c660194674b00ce4a3ac01e8f3d7a86b1757216fc6886f556f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:ea6b8f522f6db81b84f9887c5cdb9f8b6831ebc7c6e38f5a2a454175af4954df","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:08a25e1ac1c081f4a2162dd7d64b70395873bea5be269023545da705f3c7f3ae","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-06T06:10:06.376505Z","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-11T23:09:53.471342Z","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:7b00a881b6f3ed2cf817116515bd7a850914789f359d861897fc4ee5480bffe5","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-11T23:09:53.471342Z","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:1f1ae0ac16d8b75585748867d42928f5fc61c79e7b3e9bad96c8425a2270d560","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:1744ea447753b1dbc200a4acdb485fc1a9cea9ffa641ea529876f4722d5aaab3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:d7898e93b698c7bb2cbe5de31d84680e97371a2149186088bce1a98e4dcd6381","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-13T05:48:25.049943Z","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-11T23:09:53.471342Z","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:e936f6816303c60dc52b11ca6d734ca1cf71bd1028c620d88c5d151f215bb625","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-11T23:09:53.471342Z","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:35616c11155c65ff751ab97b4a3931a094e02555b46ac8c39841d364f901c1d8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:45428c96d85edd6e626144fd09feba2323368a08cfa370024702d50cb8fcf18c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:6d41c247aca42e14e8146dd0d357eb6a38d41d2bdfd45f80c02d05af8b80334b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:fa0d5c307e04e4c94e59efa2da3192f50bc0f0a4c5ac47826ec104b7a44566d4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:951771276e16bb6fab10fecb483aa64d642a1f5e7aa11fe6bfa304da65ba3584","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:e222100754c9f553587f91c1b2c3458ed45ade675895a42b697c6a0e1e73a9f1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:33ec719eb12c3b2fe9e0ace987f8eb721f103ab277a94ea77e5a6b26d3bdcef2","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:8393878203b06b5575fa1ad1ca0649685dd49c2a7b70034116c239f2ede13ddd","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:11bf6277502a779cd6aaf31812e4258c56cc40840782960627029a2d32a77d63","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:69d06ce449ca30e25e4b73828add3996a487b2c807aa2bcdc03a4f756eb0984e","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-11T23:09:53.471342Z","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:86ecf6db927c7c332e3937e938ae3c3d0976e4dc625107865e86838927163a1f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:41a11e1fe80e838bc441b28c19b2e665f3bbc9bb5adc928a29499dd8280c46c8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:eeccde2cb65785a258687d3745c1598b7f85a8bf2282a0fbe85d3612a188d74d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:0b7e05b666f2334032ce029556fe1a4463e6a069a38c75a853ebb75fe01bea47","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:f46b737c517dcf1baa55e6ce21731afe84085f24c21305293590805cc732e6e5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:35accf5e89cc32b34744a58b085084df09b37e1bc1e9e4992c8c0e58b862e7be","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:d6603fe1fc9beb22590095fde47257cceaab945b3160073d1408ba6c949ef0eb","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:4aa7db601a2bf06f5b2f6cf23bc07c144476b5ab7b97fef9e35d2c555374eed3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:c65273ed02857d8e651e8d35e8e4979931e5a5b1f2155105aaa56d6dda62cf33","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:2ca40103130a9ba1dd4c32440d87b21cab8c0f2ab3f0535d3c87b96a13a63cb5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:3973ecb63e93590b9b0aab55daf4689f13ebc71a26ac9b634b2da10a2edee8a8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:ab96824489a4e250b3cfef0b1469e3693b977087bca578d7c2a8ff8c42f7fd86","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:06931337006992d5f249c9372c8889310210205e8efe8e8d971227c20ab855ce","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:c746ed9c2a71c87bf5494609de1a7eb29b3a834af191f4bde2383d2de4504d31","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:d1d136d455147013502372e2e0c2e15497b87ccb530e81fa20398096620b45ef","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:8cab398c853708d011c83b8be12b7fbd657746ae7267a65c647fbc9d4abc9477","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-06T02:42:28.742490Z","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-11T23:09:53.471342Z","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:f1bfeebb301e49f5a7bc2f7c58da543398ab57e6ac4027e452f20db1f5715f77","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-11T23:09:53.471342Z","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:fe5cff46a85271d1a74884457c47123628ffa02d0af5d9b9ed4a5293902bfb4d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:c38ec984218167f4249e6c6842fc5174b5aff274dcce076210d0dd7d8f0b442c","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-11T23:09:53.471342Z","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:356a87d92a5335746b433bd05bede460b8d904624f6a96ca1e54d4392ca25bfe","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:2a3292a89d0da4c560c2768274d98a9d01bde059acedab1a3d9285159bb596f9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:b8087d87a48d0dca6743c0283198108adb37b78e2c99dcb8c90803f79500cb8d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:ddf71c523973ca93f88a4f02ecd4ecc158c7d34c8b650622320a7b88968265d0","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:d9bd93eee989b7159640d160475e3644518a469db602b17a42831f0671fffcfa","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:03a866987476cc504dcde917386920f691e9dbb94398d61f89fc0b1c0f9bdfb8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:076b098e6ae9314fe00ba3deadcc96452ec412fa8c49063796b3957a22446e6f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:4bc08753c274cdee5a226bfd56e028d54bbe2676210aa0715c16cdc346ceb7ab","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:24b0bb3bdd263499347ebfb6d017c9c25097ffe213c45856140d90a8b1d1fa2d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:e736572c8b131233aaf46a27dad15753321b6080d47b4c8f45966d44b1233309","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:9a4c3e70a7daa631b557860082d7fe7cca29b52d37702cb861d66c5acec90bb3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:cfb5955c03bab6a34d52971e46023416ac4504e1e605c1ba96d1c256b4fe6452","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:db6f863d30b1b6a861507c9041ef2977f60a9213e15db238a5e34f683802237b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:70d47985234fd707e8a7b324f5b48da08db38c7582c320319a45ebb1b45e3e51","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:0fd1f6a2dae10a3aaf5af91ca8ceca1dc7a64f964092cc0d05f5e00ba325efa3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:4b5869d9e24989633969054bd5ff1ab5e9d362b7379e53e0ba1676d1946f2f65","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:2c96b00e621fff43814df5c2ccad13f76ff7f621e2d15aaf06f27e776d455b75","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:a25c3b532a1f4085af711d9c97265bc9c9b2f9873ad4f112ed5a7dec671352e8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:91725475ba2049d6c66d431e3fe4d40042357d128ad172f3a5c7da7a5b3c7344","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T04:42:15.321482Z","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-11T23:09:53.471342Z","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:80bec52d63f9f7f15dcd08a9b3201e8c9aa46aaad7c04dda453fc5c88bc29c83","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:9c4efa72c6b6a31f7f53f9ad1aaeac2ae78146165e4983df17cd5b603ac922a7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:1ffb13cb3ac5091c17d885a164b72e81930c9e4462684bb2dc66744aede5e974","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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:92b63e77ea4e2320593cacff69daf220864b044d1538a8fd75192ffdf3a9b57c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T23:09:53.471342Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2412.02661."}