{"as_of":"2026-08-16T03:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee878727cd9b68a7ec338b6c30cb9eb545962d35df2ac8cbbb07b11ac6e4cb4e","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T07:57:39.809343Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T00:46:31.482035Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17142","snapshot_observed_at":"2026-08-02T00:46:31.482035Z","title":"and MASSOULIÉ, L","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14948","last_updated":"2026-07-16T12:57:28Z","snapshot_observed_at":"2026-08-11T10:11:03.490726Z","submitted_at":"2026-07-16T12:57:28Z","title":"Graph alignment in sparse inhomogeneous models via self-overlap","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T00:46:31.482035Z"},"links":{"cited_paper":"/paper/2502.17142","citing_paper":"/paper/2607.14948"},"observation_digest":"sha256:9e539fd0fbb1b88601cff162e6035890ed3d8ae3c74803ceca3cc6bd91466d37","observation_id":"0889d0c0-040e-499b-8e12-0362bea87804","resolution":{"observed_at":"2026-08-02T00:46:31.482035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.17142/citation-record","integrity":"/paper/2502.17142/integrity","json":"/paper/2502.17142/citation-record.json","paper":"/paper/2502.17142"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.06783","last_updated":"2018-05-14T04:27:12Z","snapshot_observed_at":"2026-08-14T20:12:24.786930Z","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":"1711.06783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-07-03T16:28:38.790966Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","venue":"cs.IT","work_id":"c2b5bab0-5f93-4201-bf02-c62c9ed66cef","year":2017},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:f7c8fea47af608b13ad4d038329572265a55b25c83552d29bb52ffacce548443","observation_id":"26729de5-bda6-42ea-a6d0-41c8f492cf72","resolution":{"observed_at":"2026-05-25T08:00:29.829183Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Massoulié, L","venue":null,"work_id":"d4fb9ac0-cff8-4812-a7d2-2521aa97cd81","year":2021},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:9f48107a07ba00ab5efdfc86f1d05998a7544e88d5dbfdec33e7ba3ca092889a","observation_id":"59cff416-19fd-473c-b5df-6e8312c55738","resolution":{"observed_at":"2026-05-25T08:10:33.004907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Du, H","venue":null,"work_id":"5c8071a1-749a-430c-9a59-053b84afa458","year":2023},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:ff07113aa7a88a0a6880bd0cd3efaefef20beeeb095475b7e2debd333e3ad5b5","observation_id":"c667b8ed-aada-4858-bf86-9cdb031134a1","resolution":{"observed_at":"2026-05-25T08:10:32.948595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"41a6090d-d70e-4662-9ea7-8b792eb6ab13","year":2022},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:90125fb2cbd6659132eb8327e6921696e3e100fbd89878cf823a7b764989a67c","observation_id":"c0320a45-c58c-4a72-aa68-bbb23204a97b","resolution":{"observed_at":"2026-05-25T08:10:32.997605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Vershynin, R","venue":null,"work_id":"08f8071a-ba03-43f5-9010-3101791f5c66","year":2013},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:8f8f935c6f7689ae5580d56a58aa07d364ed0c4771f3c5354216fb791b1037e4","observation_id":"154c6704-ccdd-466c-a703-919322bec207","resolution":{"observed_at":"2026-05-25T08:10:32.976786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Lugosi, G","venue":null,"work_id":"f0e8b8df-771c-4045-ad6a-e196dbed6eb7","year":2013},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:4678e241fb9b3460b8fd7c88c738876c7046de8a5db5951a0b0a5ed3ef2c9676","observation_id":"83083729-c9b5-4d21-80ab-e89f0fb8f517","resolution":{"observed_at":"2026-05-25T08:10:32.986052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2ee20857-9191-47e4-a8a6-0168932731f5","year":2022},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:7c704c68bf7a4b70f72c7732a5da97e2399dd076c208ce6eb871da35fd13757e","observation_id":"3c9e0ffb-b544-4aea-9932-2dc17bb23433","resolution":{"observed_at":"2026-05-25T08:10:32.968297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Kiyavash, N","venue":null,"work_id":"8d7afd64-bbd5-4afa-968f-40b20016683e","year":2019},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:00f597b2cb9d2ceec4cdaf72b5e3c7c0163e21074fb86bce34ce320e11a4d1e3","observation_id":"99c0d030-8d64-4e0e-b28c-6a6c15472040","resolution":{"observed_at":"2026-05-25T08:10:32.982206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Du, H","venue":null,"work_id":"db305133-ce0a-44de-aaab-4d6dbc58ec6f","year":2022},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:dda8701f20f6907c1bed9c805768f89651968f330153cbfbb2c253acae60a542","observation_id":"ffb8c6e9-f329-4e2d-a786-b88bb3594e6b","resolution":{"observed_at":"2026-05-25T08:10:32.972843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"644eb91d-ff9b-4f36-b017-104b6720dcc9","year":1985},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:a0346a3e7f5ab82227b2c6ced0a674de212882e6437b26a467d05bd688f4cf8d","observation_id":"f04e921f-cdaa-478c-8cfc-2c81f11bba98","resolution":{"observed_at":"2026-05-25T08:10:32.956541Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7f79b299-26e1-44ea-a799-635b7c3da5d5","year":2001},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:4ad3992af34cc9db1d295f187a686e2a084adaa52ea8ea329f99341f658bd259","observation_id":"ebd894f2-a505-4db0-a953-393bf3ae5b1c","resolution":{"observed_at":"2026-05-25T08:10:32.960165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Grama, I","venue":null,"work_id":"0a200e7e-3127-4fc6-b3ab-658cf730bd7f","year":2015},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:ef12a44b654993de0ce6cb2a36ff9e1d42fd309226e013cbde005b0a51e83829","observation_id":"6d232c8a-c386-4d8a-9e05-be3fc3ed7162","resolution":{"observed_at":"2026-05-25T08:10:33.001115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04181","last_updated":"2017-09-05T00:35:32Z","snapshot_observed_at":"2026-08-14T22:10:32.432862Z","submitted_at":"2016-02-12T19:38:33Z","title":"Spectral Alignment of Graphs","version":2},"cited_work":{"arxiv_id":"1602.04181","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04181","snapshot_observed_at":"2026-07-03T06:57:42.566859Z","title":"Spectral Alignment of Graphs","venue":"cs.DS","work_id":"f90a696d-13f5-4fb8-bdc3-4dfff5f8d8dc","year":2016},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/1602.04181","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:0c80ef16cb2d0a8115fe1c88265872d72a46ce6c03b9b882ec27ec20499699da","observation_id":"f94882b0-6a62-4b12-9132-e5c2560f93d7","resolution":{"observed_at":"2026-05-25T08:00:29.823275Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.08880","last_updated":"2019-07-20T23:36:41Z","snapshot_observed_at":"2026-08-02T23:44:34.169859Z","submitted_at":"2019-07-20T23:36:41Z","title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","version":1},"cited_work":{"arxiv_id":"1907.08880","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.08880","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","venue":"stat.ML","work_id":"2b4c9659-8e76-4261-b4e8-90a536287de4","year":2019},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/1907.08880","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:0a3f1ebd33edd1f16809b6d3b1421965923626f741154de52a2686f14d909dd3","observation_id":"283a2383-fdfb-4cbf-945d-a9b686fd139b","resolution":{"observed_at":"2026-05-25T08:00:29.834732Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Mao, C","venue":null,"work_id":"3635a381-d40b-4856-9fce-4b5a3e413899","year":2019},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:d3a928251874e07802d2a193cc5ee05eb935fab997273b86ccaf964bc226a7e7","observation_id":"feadb3d9-cfd9-4ad6-bbc7-24b1990a81f2","resolution":{"observed_at":"2026-05-25T08:10:32.993764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.00231","last_updated":"2021-05-11T16:09:36Z","snapshot_observed_at":"2026-08-11T01:10:44.596209Z","submitted_at":"2019-11-30T16:45:33Z","title":"Spectral Alignment of Correlated Gaussian matrices","version":2},"cited_work":{"arxiv_id":"1912.00231","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.00231","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lelarge, M","venue":null,"work_id":"14be3d33-90aa-43cf-85b2-0d2f9b6ad50b","year":2019},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/1912.00231","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:72a9637bddb84a6edc8430670227ed9eb4a4b048b6ff0b8ed836ce71966e821c","observation_id":"4fe2d9e6-367d-431a-b843-777a74c96c36","resolution":{"observed_at":"2026-05-25T08:00:29.815850Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7e01dd0e-e897-47bf-8a78-7adf2af13378","year":2018},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:4e6ddfb04dd4661dd4588a14da8fd987a241914d2a9b0507efcf9210d84a1611","observation_id":"fdea8d98-27b3-4400-8f64-86475719fa31","resolution":{"observed_at":"2026-05-25T08:10:32.952920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Maron, H","venue":null,"work_id":"a6f95193-e691-48a8-9e91-3d33a18e9ddb","year":2017},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:7328a9c81b8a8354e6b46296e781a5d7adf97b2cd14a6b316cae4be0581f96df","observation_id":"170637ea-4500-4f61-bd7e-caea29039898","resolution":{"observed_at":"2026-05-25T08:10:32.989560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0db20000-a179-4b4e-bd77-9f6bb1a067b1","year":2022},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:87ce9ddc121b2b1e18fde1b532e373278313cd78d61ee84bcd6083cdd0856903","observation_id":"4e49133c-da06-4454-8016-48eba2b57fcb","resolution":{"observed_at":"2026-05-25T08:10:32.964340Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14532","last_updated":"2024-05-23T13:18:51Z","snapshot_observed_at":"2026-08-12T23:59:53.154069Z","submitted_at":"2024-05-23T13:18:51Z","title":"Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem","version":1},"cited_work":{"arxiv_id":"2405.14532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.14532","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ganassali, L","venue":null,"work_id":"076f1856-510a-4be2-a82b-f3a1acef97d2","year":2024},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/2405.14532","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:56b3531ea4a3ff17cb853dde4295750fd66fb69367572abdaa9e356d16d37b63","observation_id":"ca60765e-6224-4c55-be48-bf46bc538191","resolution":{"observed_at":"2026-05-25T08:00:29.810351Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Shmatikov, V","venue":null,"work_id":"8486ffa4-d992-4f63-8a63-10b416e71dc0","year":2009},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:96cf48f74e084c2f2d47df9ff630ffeb4db12f67a305d37d99529b66c440c602","observation_id":"e2684638-b0b8-4f5b-bdb3-53e29056119f","resolution":{"observed_at":"2026-05-25T08:10:32.944164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Gleich, D.\\!F","venue":null,"work_id":"c356b96b-124d-4e76-9870-e59e83a8d9b8","year":2013},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:d7644291cebba7e911cdae918c9ce7b6c726fb6a58ba8a8296e33a7be79ed47f","observation_id":"89923ebc-462f-442b-808e-35493ad21f4c","resolution":{"observed_at":"2026-05-25T08:10:32.932903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Hassani, H","venue":null,"work_id":"6aeecbc1-6815-47f2-9a97-1c9b9128462c","year":2016},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:3f2e5bf67febe7da3521439f5fc1d10f6aa3931ac444205607810bc84e27f890","observation_id":"f45cc953-19f0-4d81-acce-f755a772e76d","resolution":{"observed_at":"2026-05-25T08:10:32.936630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Massoulié, L","venue":null,"work_id":"77d1f06d-baff-4260-ae02-aee663038662","year":2024},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:f1be6f5aaa6ad71ac3dbdbf1d1daec29cd796e4c2f22d9db8fd2a8c5b5d72918","observation_id":"bce43eab-f526-43d7-946d-d9c935e84e9c","resolution":{"observed_at":"2026-05-25T08:10:32.924095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2311.15931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"be03a5af-34fe-4879-a041-98d1a6cf52ca","year":2023},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:a9af7660f6b00bf506f41093c65307784240e4deb4ba78c4a2f56a559e4f4ea6","observation_id":"e38b1d23-499c-41f9-ad8c-8157db92b812","resolution":{"observed_at":"2026-05-25T08:00:29.780951Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"Zhu, L","venue":null,"work_id":"71baa141-fd61-4cf1-89c5-fb9e11dcc018","year":2024},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:c4eb766a07d0ed221a1dad0d60fc019f0f0f1a3416dff4cb9ecfcbe1aed68943","observation_id":"6b91246f-2ee4-4f28-95a9-238386b42c80","resolution":{"observed_at":"2026-05-25T08:10:32.929053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":"and Milenković, T","venue":null,"work_id":"8f29305f-b8f6-4717-9f1e-669c4d559036","year":2016},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:4ede854fa250e6e0d1649d7454994051fd6ed85a786569f908c9991d054f2340","observation_id":"8b2b386a-2344-4ff7-9e5b-2982960c94a2","resolution":{"observed_at":"2026-05-25T08:10:32.919707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"913fddc4-a94f-46c1-876e-8972b07cd82b","year":2009},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:ba8ccf04161e6e01102c47e9328ae441e4967f68c166cafa680ea61d277c01cd","observation_id":"084fefd2-fad3-43f3-896f-23cabb21c25d","resolution":{"observed_at":"2026-05-25T08:10:32.940127Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12293","last_updated":"2025-06-29T21:18:24Z","snapshot_observed_at":"2026-08-13T00:03:34.092314Z","submitted_at":"2024-05-20T18:01:11Z","title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery","version":2},"cited_work":{"arxiv_id":"2405.12293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12293","snapshot_observed_at":"2026-07-03T16:28:38.789613Z","title":"and Hajek, B","venue":null,"work_id":"6c356315-6a95-4e89-aa61-9e1b6bf488ab","year":2024},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/2405.12293","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:1100fa58998c17d4659115d5aebb4cb44b0c2b9505237b0d6ece246927e701ce","observation_id":"824ea0c7-a4a2-42ca-9d34-f78a6bd9ca4f","resolution":{"observed_at":"2026-05-25T08:00:29.803897Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16279","last_updated":"2026-06-11T17:22:37Z","snapshot_observed_at":"2026-08-08T08:27:03.057975Z","submitted_at":"2025-04-22T21:30:25Z","title":"Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks","version":2},"cited_work":{"arxiv_id":"2504.16279","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16279","snapshot_observed_at":"2026-06-12T02:09:05.734112Z","title":"and Hajek, B","venue":null,"work_id":"6d19878c-d56e-4063-b29a-6aecd6e6b1cf","year":2025},"citing_paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-25T07:57:39.809343Z"},"links":{"cited_paper":"/paper/2504.16279","citing_paper":"/paper/2502.17142"},"observation_digest":"sha256:1b0fb68ce5a082add8e33a22cc3376df3125b535d24658d222f66e6a2cd6f5da","observation_id":"ece56ce3-d1f6-4322-b905-44ae107f61c3","resolution":{"observed_at":"2026-06-12T02:09:05.734112Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.17142","last_updated":"2026-05-22T09:50:10Z","latest_version":4,"primary_category":"math.ST","snapshot_observed_at":"2026-08-14T05:00:00.445842Z","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":8,"verified_fuzzy":15},"total_outbound_references":30},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2502.17142."}