{"as_of":"2026-08-13T03:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed86767d2d3d5f46e1c83d2cf179ff2ea9e27597128478ba99a0af7555b23db2","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:42:31.521634Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.16457/citation-record","integrity":"/paper/2412.16457/integrity","json":"/paper/2412.16457/citation-record.json","paper":"/paper/2412.16457"},"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-11T10:42:32.390146Z","title":"Robust graph matching when nodes are corrupt","venue":null,"work_id":"284aad23-a6ef-4ccd-8923-4060fd9a8d7f","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.278448Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:91597c015060d09d609bf17ee0572113a46d5afff62afb6085ad4d5d88f52b4e","observation_id":"d36d7234-796e-4b49-af4f-fc228928a115","resolution":{"observed_at":"2026-08-11T10:42:32.394421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.379148Z","title":"Graph isomorphism in quasi-polynomial time","venue":null,"work_id":"c47b1ffc-2c7e-4bf5-845e-d4163f593f56","year":2016},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.283353Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:6c70d40ffa10cd42bd7076de59aae3f4cff040e68e9bf9abea5842ec2d423ff4","observation_id":"127cf646-44c9-4eb6-8de9-f8ce3cd67910","resolution":{"observed_at":"2026-08-11T10:42:32.383269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.368367Z","title":"Robust linear regression: optimal rates in polynomial time","venue":null,"work_id":"e5367e99-4168-4d75-8b89-8b25162ee651","year":2021},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.287133Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:e608dfe1556d5566a02297f97b1140ad16827429b31310b3aecb2ae48454caec","observation_id":"b7234544-0990-4851-a693-f3c008a2ae17","resolution":{"observed_at":"2026-08-11T10:42:32.371984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.358772Z","title":"( N early) efficient algorithms for the graph matching problem on correlated random graphs","venue":null,"work_id":"23778c31-cf37-4085-b71b-4a310c03852b","year":2019},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.293139Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:a9ba68b781b90ca98510a41a68ca11701fbf1e66c722f5e58e3a61cd417e00e9","observation_id":"367b02cf-733f-4fc8-91e9-7838eec1cdad","resolution":{"observed_at":"2026-08-11T10:42:32.362032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.296786Z","title":"The dynamics of message passing on dense graphs, with applications to compressed sensing","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.296786Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:5bf77f4e100877a0e52096a7ec7ef53853d43962a276e7d7f1d1957299255df0","observation_id":"8b95880f-d27f-494e-87f1-c0ada5e59927","resolution":{"observed_at":"2026-08-11T10:42:31.296786Z","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-11T10:42:32.342468Z","title":"Berg, Tamara L","venue":null,"work_id":"ce44484d-3bdc-4a5f-9e88-0ec615ffdac3","year":2005},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.300873Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:d51c637f4f998aa88ab7b755cc7ac1a981233096bd8885e1f872a9b18087182c","observation_id":"db7cc936-3f10-4448-85de-c1c7a25e17db","resolution":{"observed_at":"2026-08-11T10:42:32.345582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.332975Z","title":"An iterative construction of solutions of the TAP equations for the S herrington- K irkpatrick model","venue":null,"work_id":"0f00f299-170f-4139-85df-c0b2c652d3d1","year":2014},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.304954Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:0d7bb451c33baf41f79ec5a016531abd94ad2c13cac5cb1a08d09355a6600cbc","observation_id":"5bb4fefb-519c-43a7-9d8c-b8a70ce2cb29","resolution":{"observed_at":"2026-08-11T10:42:32.336596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.323246Z","title":"Gardner formula for I sing perceptron models at small densities","venue":null,"work_id":"966c757f-f368-49aa-a048-5fe1fd7d3d15","year":1911},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.308391Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:3956a89678bbb54fc3f6c5744ef3c6d0d6029a3c9adbf8716bbbad076b9242b4","observation_id":"fdf74450-66d6-4321-8ec7-b501d2e32515","resolution":{"observed_at":"2026-08-11T10:42:32.326624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.06334","last_updated":"2020-09-28T06:53:22Z","snapshot_observed_at":"2026-08-11T22:37:37.245423Z","submitted_at":"2019-07-15T05:28:07Z","title":"Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.06334","snapshot_observed_at":"2026-08-11T10:42:31.311683Z","title":"Seedless graph matching via tail of degree distribution for correlated Erd o s-R\\' e nyi graphs","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.311683Z"},"links":{"cited_paper":"/paper/1907.06334","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:eea93aebdec38643f6135e1a6423940f0cb53da69ad6586f76a1c2a80aea9859","observation_id":"8a87ce69-974b-4801-9873-8619b14f17b2","resolution":{"observed_at":"2026-08-11T10:42:31.311683Z","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-11T10:42:32.313321Z","title":"Burkard, Eranda Cela, Panos M","venue":null,"work_id":"4e5919af-c738-4fc7-afde-9c69f4f8e44b","year":1998},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.315232Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:463e399a00e2fc386d15f9b77705cc51f268a9788c030b2bed4f86a2ff789c87","observation_id":"8b988063-603c-4dcc-8370-9dc1f0eb438a","resolution":{"observed_at":"2026-08-11T10:42:32.316781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.303417Z","title":null,"venue":null,"work_id":"5d736db9-1230-46b5-94be-1343f80ec52e","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.318719Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:1f0bc5832b42b6e217a5f92d3393ce47e236113ae4279707797233f3a8a2a7f3","observation_id":"c03d1753-e657-498c-8011-a5ddba6e072a","resolution":{"observed_at":"2026-08-11T10:42:32.307011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.322937Z","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.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.322937Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:f733a7b80cd726b80373aff5eac8b6b23be0045af618fec405431ee79f04828c","observation_id":"9aae7823-962e-41b3-83e5-fc351b47726e","resolution":{"observed_at":"2026-08-11T10:42:31.322937Z","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-11T10:42:32.293229Z","title":"Balanced graph matching","venue":null,"work_id":"0da2494e-63de-42fd-8d50-e244a53d37e4","year":2006},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.327120Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:d962f66ba6b5f9744fd19a7d05edf62d24cfd5adfe46ac1a63198685d31916d4","observation_id":"73c12efa-40c3-4418-8be3-f3488eb34efa","resolution":{"observed_at":"2026-08-11T10:42:32.296822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.283170Z","title":"Improved achievability and converse bounds for Erd o s-R\\' e nyi graph matching","venue":null,"work_id":"94629f13-80ec-4454-9d41-cde99edacc6e","year":2016},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.330587Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:441bee9ea2348b79d53ffe55c6452a6496d065f75deecf20a4d2ac736b6dcbbc","observation_id":"41a67090-610d-4bf6-9016-412331ea95f3","resolution":{"observed_at":"2026-08-11T10:42:32.286891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.334129Z","title":"Exact alignment recovery for correlated Erd o s-R\\' e nyi graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.334129Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:79c4495aa7120c6bcac2085ddec843e724fe301726c78c4977f3d38484891dde","observation_id":"ef47fdca-56e6-48a7-9882-2ee7dd32bd46","resolution":{"observed_at":"2026-08-11T10:42:31.334129Z","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-11T10:42:32.273061Z","title":"Vincent Poor","venue":null,"work_id":"f927a404-ad09-4741-a1b9-d7259f9315fa","year":2020},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.338186Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:19bea253a3c7b884b6d90baf81c4601eee687d137bd07083a56675c93b2519d5","observation_id":"4365cabd-4629-40e8-b22e-42b350d76529","resolution":{"observed_at":"2026-08-11T10:42:32.276900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.262980Z","title":"Information-theoretically optimal sparse PCA","venue":null,"work_id":"3fa29c29-2e0b-4e88-8c60-c29ea03468d3","year":2014},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.341551Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:662d3ca66019cc2e0784e45dc48f7ae255c27a362817a54786717e394eb66e9a","observation_id":"512d0e79-49aa-4a82-a299-e00d961ff590","resolution":{"observed_at":"2026-08-11T10:42:32.266727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.252409Z","title":"Detection threshold for correlated Erd o s-R\\' e nyi graphs via densest subgraph","venue":null,"work_id":"b7c685cb-1a8d-4760-96ad-cc38181b5c0d","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.345056Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:2613536132228d3121e26c84a6498f460ce7283e8db518e38bdae11bf5a2e508","observation_id":"bb654ef9-6c96-46aa-aad9-b39d53ba3ebb","resolution":{"observed_at":"2026-08-11T10:42:32.256121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.242193Z","title":"Matching recovery threshold for correlated random graphs","venue":null,"work_id":"b11a4603-360e-4e55-9189-0063cda74db6","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.348456Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:382cc2bdd3c39fa71416f875a55a5f9ba3d8d4252999a62b22b6146230c4c578","observation_id":"2bf2b065-5dc8-4715-a126-342379d7de0b","resolution":{"observed_at":"2026-08-11T10:42:32.245737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-10T13:21:12.376453Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-08-11T10:42:31.352343Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.352343Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:63a7df6068bc4cdbec692fb81014b9c2c0c4e8e68b42fe074316c90983ca7a43","observation_id":"bd63f753-2941-4e1a-9ecf-07051004b23e","resolution":{"observed_at":"2026-08-11T10:42:31.352343Z","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-11T10:42:32.232124Z","title":"A polynomial time iterative algorithm for matching G aussian matrices with non-vanishing correlation","venue":null,"work_id":"0f17e376-d304-4ba9-8015-27bf7fa7d4d7","year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.356747Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:5b69f2a46437c1b0a9bbd99a55f9806c31cf8fe2121b0f21f3e3fe6b3feb313f","observation_id":"f3b26bdc-6c26-475a-ba0f-cc9d4def80cb","resolution":{"observed_at":"2026-08-11T10:42:32.235851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.222490Z","title":"Capacity lower bound for the I sing perceptron","venue":null,"work_id":"ea31c3c6-e515-4ce5-8c78-be4b49d67147","year":2019},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.360545Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:70dcd4baeb2b0a4f4a29b93c20b263a67073f92ff49bab2c892bfc2ef5fb24d0","observation_id":"c59bb00b-0455-4f28-9bf6-cd16ed8c16c2","resolution":{"observed_at":"2026-08-11T10:42:32.225793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.211682Z","title":"Efficient random graph matching via degree profiles","venue":null,"work_id":"a850e07d-e3a3-47c8-9e7d-22f506b36ad2","year":2021},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.363911Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:ef775c5a3a0c8431d00d567f164e301b4345831bb23f8a4ae4a857b413afa913","observation_id":"7fbe8517-0c25-40af-94c6-6414cdedb473","resolution":{"observed_at":"2026-08-11T10:42:32.216002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-12T19:55:53.210333Z","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-11T10:42:31.367073Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.367073Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:4adc8c1615d8059f6da8303b99325f651c9bdfcc128d570389543230290994fa","observation_id":"23c16cd2-c490-4c63-9bd3-d8433cbd5b2e","resolution":{"observed_at":"2026-08-11T10:42:31.367073Z","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-11T10:42:32.201983Z","title":"Low-degree hardness of detection for correlated Erd o s-R\\' e nyi graphs","venue":null,"work_id":"44444fa1-97c5-4728-939a-a6a80943158e","year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.370673Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:b3c448829fb0d18389fecad0b330ea91b7b5f08b4fc638505275bf7190138c64","observation_id":"49fe9713-c534-49ac-8167-ffc1beeea2bd","resolution":{"observed_at":"2026-08-11T10:42:32.205298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.191293Z","title":"Robust recovery for stochastic block models","venue":null,"work_id":"70343b54-261f-4f4e-9d92-21395c5e0e04","year":2022},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.374231Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:0dfa0b89cc675fad1f81e75ca5d9f744b6f5e364a9705e11f6f20fc2fa347061","observation_id":"f8ea1aa2-210c-4862-8c4a-9edd4b667e98","resolution":{"observed_at":"2026-08-11T10:42:32.195708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.180395Z","title":"Donoho, Arian Maleki, and Andrea Montanari","venue":null,"work_id":"6ecbd20f-7935-4c8b-b220-b9659bc5c8f7","year":2009},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.377996Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:02cf278ae9de6b3cc01ce1d3978e0d745ef4e28ed3db9213b1d62d5023053431","observation_id":"46d8e65d-cd81-4ef3-83ff-4fc23172c171","resolution":{"observed_at":"2026-08-11T10:42:32.184504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-09T16:19:41.564914Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-11T10:42:31.381606Z","title":"Optimal recovery of correlated graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.381606Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:a54160834566da5f3237ace3d14b82f7ea6a0386f1033b7c1728a2acc8d69458","observation_id":"eee1b8ca-32c7-49fb-8982-3b9f9b91bd76","resolution":{"observed_at":"2026-08-11T10:42:31.381606Z","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-11T10:42:32.169514Z","title":"Dubhashi and Alessandro Panconesi","venue":null,"work_id":"5650eb58-7e9f-4b8e-a1aa-85619a83c3e5","year":2009},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.385689Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:7f689e1a51d4ed69957cdc64a632ed6fe9aa2fe41b9db7bd7fefdfbd68dcb8cb","observation_id":"90f76dba-7c22-422a-b51d-373ef96e3e67","resolution":{"observed_at":"2026-08-11T10:42:32.173412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.157042Z","title":"The replica-symmetric free energy for I sing spin glasses with orthogonally invariant couplings","venue":null,"work_id":"a72aeed2-590c-4979-83cd-6cd692d704a3","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.389332Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:c68dd965a83571244fd456378df068d5d0909182e97d11bb8569a2bbda7c0f0e","observation_id":"df560357-d607-4c45-972b-d0c24e208769","resolution":{"observed_at":"2026-08-11T10:42:32.161139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.143266Z","title":"Spectral graph matching and regularized quadratic relaxations I : The G aussian model","venue":null,"work_id":"4801aa28-8306-4956-8fce-4838c6b4cb83","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.393431Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:46f55cb3c0d76a8769d5f1b5e218d80bd55ef06abbebca6ac51f12f6a561e96a","observation_id":"8bc77694-c071-4303-93b9-2b825ae35b5c","resolution":{"observed_at":"2026-08-11T10:42:32.147790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.129773Z","title":"Spectral graph matching and regularized quadratic relaxations II : Erd o s-R\\' e nyi graphs and universality","venue":null,"work_id":"5b1c991b-2ddc-4ce9-a8cd-ce262ddc1afe","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.397163Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:7d8c11d80642ead13ec0bb9ae5724c20c21ca686e990b57400694875e3e60b3d","observation_id":"c1423119-3d9f-4746-861b-ab8d3f6e64bc","resolution":{"observed_at":"2026-08-11T10:42:32.134961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.114460Z","title":"TAP equations for orthogonally invariant spin glasses at high temperature","venue":null,"work_id":"89fa6fd7-9198-4484-82df-96e24d7d0442","year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.400792Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:20d4f45ff4755be392f046aa32ff7fceb99fb582b9e41db1ab82082f94c3b131","observation_id":"0cb3f1e3-1706-4d8e-ae76-a80e1d345398","resolution":{"observed_at":"2026-08-11T10:42:32.119788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.100481Z","title":"Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J","venue":null,"work_id":"6cd028e1-6879-4ab5-aade-8c700d18c6f1","year":2022},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.404522Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:7890a312792ef4978e46cac7c54dd77344771110c3531e2821c7428ccb51775e","observation_id":"7066fc0a-fff4-4c1d-b2bf-1837709f91f1","resolution":{"observed_at":"2026-08-11T10:42:32.104719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.087604Z","title":"From tree matching to sparse graph alignment","venue":null,"work_id":"bff91311-c6b5-43ff-9135-fb7e7c0366b2","year":2020},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.407595Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:a76fe93848da4a5c0798836e755618a0c8c3aa47232817d2ed033dfd29ce7f71","observation_id":"7236b0f6-88a2-469c-be85-a21219e64c14","resolution":{"observed_at":"2026-08-11T10:42:32.092465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.074691Z","title":"Impossibility of partial recovery in the graph alignment problem","venue":null,"work_id":"468e8542-dd9e-499d-8f0b-d13ee278d59b","year":2021},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.410709Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:cd35da6ebab35a65d60947eb056795a2c131c0ca954771cfc1f0cab1019025d8","observation_id":"7398f51c-e431-48b0-90b8-ea95c077d128","resolution":{"observed_at":"2026-08-11T10:42:32.078843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.061189Z","title":"Correlation detection in trees for planted graph alignment","venue":null,"work_id":"6cac4cf3-2319-4eef-a100-7391531181aa","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.413963Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:094fb416543e78dc0a850a231690e90f7899622ec164fdd6bedec362a10f1594","observation_id":"d8bdf62b-2a5f-4daf-9679-1ca0698ecd41","resolution":{"observed_at":"2026-08-11T10:42:32.066407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.048833Z","title":"Statistical limits of correlation detection in trees","venue":null,"work_id":"bd2c2e70-a609-41e6-8e77-4ec677bf4560","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.417231Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:9909ae3b34af7057a51a75500d9256eb3ca56144a3b8913c4ca779ccc39f5170","observation_id":"bb4e7b82-04d3-4159-a5b6-b45eadcb22ed","resolution":{"observed_at":"2026-08-11T10:42:32.053140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15095","last_updated":"2026-04-07T01:31:00Z","snapshot_observed_at":"2026-07-06T17:34:24.337596Z","submitted_at":"2024-02-23T04:58:54Z","title":"The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15095","snapshot_observed_at":"2026-08-11T10:42:31.420206Z","title":"The U meyama algorithm for matching correlated G aussian geometric models in the low-dimensional regime","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.420206Z"},"links":{"cited_paper":"/paper/2402.15095","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:362066b6f1ad30edf4f5a2a2c138a22ce82da9be5ba22918a33492a3e812c3a6","observation_id":"b7c27c37-81b0-4bae-895a-96e9c0f0c86a","resolution":{"observed_at":"2026-08-11T10:42:31.420206Z","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-11T10:42:32.037789Z","title":"Robust textual inference via graph matching","venue":null,"work_id":"d127da67-276d-475c-b922-21c473850515","year":2005},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.423582Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:bd525efe6fd2bd1d3ac70f779ea9cc84b1bacfab6439682616b31ce085820324","observation_id":"665ff53d-81a7-46d3-ac85-c14880cdf79a","resolution":{"observed_at":"2026-08-11T10:42:32.041444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.025714Z","title":"Partial recovery in the graph alignment problem","venue":null,"work_id":"41af676b-e52c-4489-83af-bd0c70594f86","year":2022},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.426625Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:ef4fff3097afd99f690782611914f45f319feff290664905d459465167639408","observation_id":"22ff4534-2db8-4a89-80e7-94bdbc2d51d7","resolution":{"observed_at":"2026-08-11T10:42:32.029942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.013888Z","title":"Semidefinite programs simulate approximate message passing robustly","venue":null,"work_id":"87e5695c-b65d-4344-ba67-ea9b4ed71f23","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.429454Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:c7a6403c3befb692d1cce26faf00dbf475416e6fc16275cf8764ea5e42600980","observation_id":"34792c53-2d03-49ab-b330-5190ad526519","resolution":{"observed_at":"2026-08-11T10:42:32.017947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:32.002273Z","title":"Fast, robust approximate message passing","venue":null,"work_id":"c766c805-9fdc-47a2-80d2-1deee211eb85","year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.432961Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:e038c6e3a2f607bfffbf772e36705a31c967b1379a192fef10b34189dcc4ebbc","observation_id":"0d11561e-d917-4da2-99da-7eb503c7618b","resolution":{"observed_at":"2026-08-11T10:42:32.006244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.436435Z","title":"Probabilistic graphical models: principles and techniques","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.436435Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:f65ff49a581cead8752cd1d87c6bb7d6c6d5e148d332337e4f0e602c3f32fbc7","observation_id":"d2c374e4-5202-4901-8dc2-5e5243add4f6","resolution":{"observed_at":"2026-08-11T10:42:31.436435Z","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-11T10:42:31.983304Z","title":"Kothari, Jacob Steinhardt, and David Steurer","venue":null,"work_id":"4b73c40a-e245-47cb-8073-639233c3fecc","year":2018},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.439729Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:b6938cacfa98df9d685b53ffe7ac43c4f0d53c1fb3fa18a1ffee45d51b71acb8","observation_id":"8b88e5b8-d685-426b-ad49-e841ab399a5c","resolution":{"observed_at":"2026-08-11T10:42:31.987235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.971099Z","title":"Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices","venue":null,"work_id":"2775351e-f250-4956-b5b9-5c0c2a48fc78","year":2012},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.443298Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:c8015451a98ec35e6ef1a2547ebbea67bed169cfbb52be1bc352721ec31fa9d8","observation_id":"f92213d5-583a-4a2d-bd82-85bcfd248fc2","resolution":{"observed_at":"2026-08-11T10:42:31.975355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.959350Z","title":null,"venue":null,"work_id":"d3cfbfdf-546a-4de7-a3d8-3631ccc11763","year":1955},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.446754Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:597a590dbf8b4cba7d0e969819f6a13028b041c85e4b478972abac1279e4ccd7","observation_id":"498f9a42-064c-48b1-b2cd-1b6992f24201","resolution":{"observed_at":"2026-08-11T10:42:31.963214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.949002Z","title":"Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm","venue":null,"work_id":"6ba1578f-1fd8-4718-b85f-2b10d7cbdb91","year":2010},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.449955Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:50be9b18eb395847da7a259d42b94cd1909cb394187b990cbacaa79d27d136da","observation_id":"4309b53e-4b8d-4066-b77e-47403b6be362","resolution":{"observed_at":"2026-08-11T10:42:31.952841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.938331Z","title":"Random graph matching with improved noise robustness","venue":null,"work_id":"5bf843c3-0454-40a0-a1b1-07f9905f9ea6","year":2021},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.453442Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:78d1031a61e3abe6a40a1cc32fa82b468f1f948f24e2606ed215b08e05464d13","observation_id":"87115437-066f-4ae7-82d2-ff7d88524970","resolution":{"observed_at":"2026-08-11T10:42:31.942400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.928181Z","title":"Exact matching of random graphs with constant correlation","venue":null,"work_id":"f86e1f76-3e93-4daf-808d-0573d0682562","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.456866Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:2ced558cf848b2bd29a4e753eae7ee2f85226eae25996f5dbfde4489d7a71723","observation_id":"3f86f7d1-eed9-43e0-88a8-17609896701e","resolution":{"observed_at":"2026-08-11T10:42:31.931834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.917537Z","title":null,"venue":null,"work_id":"baf0f4e7-37a0-4120-8124-8ff8649ab5de","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.460881Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:6bb160e4a477de92c46373de62353004c2615079f74585e2ab9b7a146ad8bdad","observation_id":"f8243079-f685-4309-8966-0d071634619d","resolution":{"observed_at":"2026-08-11T10:42:31.921133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.906437Z","title":null,"venue":null,"work_id":"25f9edfa-ef85-4a2a-aadf-0bc48666ddf5","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.465300Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:ea754cd03d1d2e0158dd4f68a09ea7bfc3cbc27b21e460d46284b985f9893820","observation_id":"8d30a639-9113-4399-979a-46cccd0050ae","resolution":{"observed_at":"2026-08-11T10:42:31.910631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.895903Z","title":null,"venue":null,"work_id":"dc1ba7e4-c6ca-41e3-9565-7c37908eac4b","year":2024},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.469079Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:6a30a5395b991310e5d63c380c6550d836d6b3cfdd3e17551d4482b3cf90d310","observation_id":"5b3f1e4f-c0bf-446c-836e-3034460b7c6f","resolution":{"observed_at":"2026-08-11T10:42:31.899357Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.885766Z","title":"Graphical models concepts in compressed sensing","venue":null,"work_id":"e3a36a29-4522-4b15-b931-862bafda27a3","year":2012},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.473278Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:c1506d46fa98c6926e890cb380bb293b84933a6539981aad92676878c7235e1a","observation_id":"c8c2b3f4-a705-441b-ab74-561c5b8d8f2f","resolution":{"observed_at":"2026-08-11T10:42:31.889328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.873239Z","title":"Non-negative principal component analysis: Message passing algorithms and sharp asymptotics","venue":null,"work_id":"fc9b8c9e-8d1c-423a-a18c-7dac2bc665e4","year":2015},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.477328Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:a2a087022bfa09c56451c5e14d5a968807a7925bc9e8a258ecc5f27a34fb8277","observation_id":"57082ac7-94d6-428a-a8de-6aa7afd52c8d","resolution":{"observed_at":"2026-08-11T10:42:31.877367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.862976Z","title":"Semidefinite programs on sparse random graphs and their application to community detection","venue":null,"work_id":"2ca01068-8f25-4db7-bb96-566f978ad93f","year":2016},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.480915Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:31ce21fb70c51c674b76eb55477d7aececaef55f88c9e3bd85ebe48a98b2e6f8","observation_id":"76477e28-310e-4f60-91cf-85b814a5c360","resolution":{"observed_at":"2026-08-11T10:42:31.866831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.852385Z","title":"Seeded graph matching via large neighborhood statistics","venue":null,"work_id":"31dc0cfc-b139-4534-bc34-169ddc786140","year":2020},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.485032Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:59e72cf86dc063587754e2ddef04e5cf0f338003faeda2e1e7772654973c544f","observation_id":"86611652-5441-462c-83ef-ff71f7947090","resolution":{"observed_at":"2026-08-11T10:42:31.856080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.840780Z","title":"Robust de-anonymization of large sparse datasets","venue":null,"work_id":"2ca62487-2177-40bb-9806-661408daf6ff","year":2008},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.488594Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:ec1b7700e365933b1b9d7dc287afd22641ea7295eec5480c66e1a54e5834120b","observation_id":"f5e9f3f0-a834-454c-9978-df4e6638320d","resolution":{"observed_at":"2026-08-11T10:42:31.844626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.828580Z","title":"De-anonymizing social networks","venue":null,"work_id":"6b55973d-8a9a-4f61-9ccc-5fa53603473a","year":2009},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.492229Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:708b7d9c1ab0d6546b7dcf6bec7836799067c586ca11918a06f3c5d07fc89894","observation_id":"8eba13df-6f0e-4473-9afa-34c30ebe9ea9","resolution":{"observed_at":"2026-08-11T10:42:31.832595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.816684Z","title":"Racz and Anirudh Sridhar","venue":null,"work_id":"357a1ef2-c373-47b6-9a9b-0d3c80400e7c","year":2021},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.496209Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:68c3bff28ef1bec642a26930473fef22eeec0efb3e5fc9f06b72ecec61f9e505","observation_id":"0d0a4353-191d-44dd-87d6-0464f091867a","resolution":{"observed_at":"2026-08-11T10:42:31.820652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.805164Z","title":"Global alignment of multiple protein interaction networks with application to functional orthology detection","venue":null,"work_id":"e97615cb-19f0-491a-820f-b7eb4f7e30ac","year":2008},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.499715Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:81d2da83ff46b67a0ac3d3a1d2f21fc88987f1433fd75048fa67e86cb9724341","observation_id":"f2215b22-1804-4075-bb38-ea284edbe8b7","resolution":{"observed_at":"2026-08-11T10:42:31.808985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.793652Z","title":"Thouless, Philip W","venue":null,"work_id":"5551f622-0ce5-44be-bcb7-b914c5b7f017","year":1977},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.503128Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:d9ff75736fa6eaea6d33fee9ae2a264a1cfe795310259eec77aab88e949eae7d","observation_id":"6743bcc0-06f4-4fa7-9b2a-8014645196bd","resolution":{"observed_at":"2026-08-11T10:42:31.797628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.781989Z","title":"High-dimensional probability: An introduction with applications in data science","venue":null,"work_id":"6763931c-e9be-4f5c-a4bb-9d19b2c4fe99","year":2018},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.506552Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:3f813d3ca3662e45a2bee50253ad3af530c7d7bd9047a63e3f3ee6eff5ad5710","observation_id":"9b16f8f5-ad05-4cfa-aa17-387350aa0f69","resolution":{"observed_at":"2026-08-11T10:42:31.785729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.770833Z","title":"Random graph matching in geometric models: the case of complete graphs","venue":null,"work_id":"97a25c00-ebc5-470c-979b-3cf303d99c2e","year":2022},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.510074Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:aa4cd2784a0e739452e9b8f0397ae276b56a61c99354901a51576d83a60847e9","observation_id":"9fcfcada-8b8e-4d80-b521-b25c166b4dba","resolution":{"observed_at":"2026-08-11T10:42:31.774602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.760329Z","title":null,"venue":null,"work_id":"67260445-fbac-4118-acef-920b7379cb89","year":2022},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.513509Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:a5d9dbfc87dd1d250778e2539e6ea73821f4a084689ac6d99d7ccb7b9609b8c4","observation_id":"46fc7c2a-31f8-461e-9276-0a9cc9e9e178","resolution":{"observed_at":"2026-08-11T10:42:31.764152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.749627Z","title":null,"venue":null,"work_id":"9d389553-b9d7-4ab2-8dc1-ebf76075adb5","year":2023},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.517775Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:f2a9d7a0f69ce18eeb83f9efb7cd25a6520f6ec55622eb38dbacc7ed947381aa","observation_id":"f8711cd9-a3dc-446f-b1c9-42900c24ca69","resolution":{"observed_at":"2026-08-11T10:42:31.752994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:42:31.737410Z","title":"On the performance of percolation graph matching","venue":null,"work_id":"c228d2ab-8142-46c3-ac3d-c43abd5d06ce","year":2013},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.521634Z"},"links":{"citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:e4bd718f1fbfba668f6d2aae619e62899f280459d9b29810eb9c854431f323f5","observation_id":"322cc067-88bd-4dde-b6be-92e29e8f46d8","resolution":{"observed_at":"2026-08-11T10:42:31.742649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-11T15:53:28.587848Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":67},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2412.16457."}