{"as_of":"2026-08-21T13:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a3b8738d6966916097bfeac3cc0bb7669a1ca08cf56e70d981744e928d08968","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T12:39:00.860795Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.03086/citation-record","integrity":"/paper/2510.03086/integrity","json":"/paper/2510.03086/citation-record.json","paper":"/paper/2510.03086"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.900938Z","title":"SciPy is a set of open source (BSD licensed) scientific and numerical tools for Python","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.900938Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:e12fcae03d27129370b019f05f63376d2dedd677099c637710018f5c6cfc08d1","observation_id":"ac317cbb-3589-4527-b744-0aba6d89b983","resolution":{"observed_at":"2026-08-04T12:38:59.900938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.578602Z","title":"doi: https://doi.org/10.1016/0166-218X(91)90049-3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.578602Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:9dfc0706659fe804acb09aaeec49d1cce9d1932822c0b10a9456189014271265","observation_id":"80f3d2c6-5e99-44d6-ac2a-360af25f32de","resolution":{"observed_at":"2026-08-04T12:38:59.578602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.128963Z","title":"These instances are small (from 12 to 40 nodes) with full (integer- valued) matrices","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.128963Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:c11e7c8135838e6c41342f4745a795004879645dea3b590ea15dbde2b0f191c8","observation_id":"eaafbaa5-0aa5-49e9-9e0f-a78507ed1ee2","resolution":{"observed_at":"2026-08-04T12:39:00.128963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.285108Z","title":"These algorithms achieve partial recovery (positive accuracy) whenp noise is suffi- ciently small, though well below the information-theoretic threshold of1−d −1","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.285108Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:52b8d8905204e0e297f7083c20ce7f701274cc6c161c58848de131966229a9be","observation_id":"ed26dd6a-75ac-48d3-8bf0-29357bc6e575","resolution":{"observed_at":"2026-08-04T12:39:00.285108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.424895Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.424895Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:67b4c296c1b835448b4fa8388ab7f710c9e7c8b830d91407dd2397e3f8870350","observation_id":"c7fdc1c2-4441-4378-97b4-ba1b3470940b","resolution":{"observed_at":"2026-08-04T12:39:00.424895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.579383Z","title":"The red curve labeled FAQ corresponds toFAQ(Dcx) and the blue curve labeled message passing are results from (Muratori & Semerjian, 2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.579383Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:97c0304307606832789fdf9b158dcaa508a5fe0e039fec35ec2824b0ca9c6d8c","observation_id":"22f95a57-88ef-470c-b81e-f829fdc94330","resolution":{"observed_at":"2026-08-04T12:39:00.579383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.860795Z","title":"24 Table 10: Number of common edges (nce) defined in (4) for dense Erd˝os-R´enyi graphs as a function of the noisep noise","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.860795Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:099d67aa7afba75a936e82643dcdf109978e7b4ab6ece1c42202990e86dcfd7d","observation_id":"28ea8c44-e01e-4115-b94b-391fe28cf94a","resolution":{"observed_at":"2026-08-04T12:39:00.860795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:39:00.713520Z","title":null,"venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":500,"source":"pdf_text","source_observed_at":"2026-08-04T12:39:00.713520Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:e97c61da415eb136fb944437b6793a02235b3fce7ed60c459eb80d35d65eb39e","observation_id":"68482400-8c15-4c74-a2af-d91ee30d5ed6","resolution":{"observed_at":"2026-08-04T12:39:00.713520Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.193430Z","title":"URLhttps: //onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800020109","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":1955,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.193430Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:b48c1587a37de7e8298d4d33652466430b376eec5d64881cb49a526b4c0b0768","observation_id":"fa4b7c39-503c-45eb-8f71-93a2b0e9178b","resolution":{"observed_at":"2026-08-04T12:38:59.193430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.426154Z","title":"Aligning random graphs with a sub-tree similarity message-passing algorithm.Journal of Statistical Mechanics: Theory and Experiment, 2022(6):063401,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.426154Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:e25bc945ebe8ca091b54b7e0c55d42a2e076cfdddf8a33ce40c7435515dfc639","observation_id":"4a00fc09-f556-4761-9d7f-522a6847764b","resolution":{"observed_at":"2026-08-04T12:38:59.426154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:58.653454Z","title":"doi: 10.1007/978-1-4613-0303-9","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:58.653454Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:6959e38a2a8f93ee15a9b060930f51dae9fdde06931065fefdd8e4356b3d5f7e","observation_id":"24ae998a-a03a-4c7f-a40e-74f4adb803aa","resolution":{"observed_at":"2026-08-04T12:38:58.653454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.674904Z","title":"14 A.2 Technical details for the GNN architecture and training","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.674904Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:ae7a17672c7d0d52c7d30e4c4740529a8f1a7efa1657d75f125bc248257c1e64","observation_id":"00517d32-77a4-47c2-a74b-a5f578c324f8","resolution":{"observed_at":"2026-08-04T12:38:59.674904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08421","last_updated":"2024-09-17T17:20:05Z","snapshot_observed_at":"2026-08-18T00:48:20.559776Z","submitted_at":"2024-05-14T08:30:29Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08421","snapshot_observed_at":"2026-08-04T12:38:59.251637Z","title":"Faster algorithms for the alignment of sparse correlated erd\\” os-r\\’enyi random graphs.arXiv preprint arXiv:2405.08421,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.251637Z"},"links":{"cited_paper":"/paper/2405.08421","citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:420aff38e9d63dd2887febbfaa1298e0588e2e17b5f26ba2b37b6ded1de29dd6","observation_id":"1632bd53-618e-42e0-9e83-1310a26574be","resolution":{"observed_at":"2026-08-04T12:38:59.251637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.030107Z","title":"Impossibility of partial recovery in the graph alignment problem","venue":null,"work_id":null,"year":2080},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.030107Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:24ce35bf6fbff60fc3bb4b418dde623022d8d23b8adc77ac2ae86e666e1b3651","observation_id":"7daecaa6-7a04-4e38-a4b1-afd826ad631c","resolution":{"observed_at":"2026-08-04T12:38:59.030107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.777043Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.777043Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:1ae0519644c3c1d148dacb1d496a36661ce3bfd060d44eb706e032a5d884b3b1","observation_id":"ec7e74d2-2e2b-4580-85cb-055eaf260547","resolution":{"observed_at":"2026-08-04T12:38:59.777043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:58.819977Z","title":"doi: 10.1145/2964791.2901460","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:58.819977Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:7d83c57d5847ed2875d025966c8a78da824d50734bbd99c3267b4777b10170c7","observation_id":"ae3ffaa4-4c3a-49df-b260-64635d6bcf55","resolution":{"observed_at":"2026-08-04T12:38:58.819977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.977207Z","title":"The first stage is the same as our first step but with a MPNN instead of our FGNN","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.977207Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:1ed6aa40111e5b0a69413eaee9845bd3506135ca100196300d5064b224d885f8","observation_id":"aa516567-6f52-421c-98ca-9beb734d966f","resolution":{"observed_at":"2026-08-04T12:38:59.977207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.495336Z","title":"Deep graph matching via blackbox differentiation of combinatorial solvers","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.495336Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:d61748a67ec9295388487e0b6c9618a8e6df1369a78e5531a8db23a3f1c37ee4","observation_id":"9bfb747f-f2f3-43ff-825c-a901b6d607da","resolution":{"observed_at":"2026-08-04T12:38:59.495336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","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-04T12:38:58.891476Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation.arXiv preprint arXiv:2306.00266,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:58.891476Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:76d94d19fa726b06064ca4fc07b54b9c6563a02a2b622c78c77e51641b1fe014","observation_id":"769b6a9d-3f63-415a-805a-8466c4ee97a6","resolution":{"observed_at":"2026-08-04T12:38:58.891476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:38:59.351131Z","title":"Robust de-anonymization of large sparse datasets","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.351131Z"},"links":{"citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:2e878be62df92ad082dd0e03f4af2d1aea72c4ec472fa2224a222b269c1dab86","observation_id":"d299227f-6166-4775-b4d0-7324cc73c121","resolution":{"observed_at":"2026-08-04T12:38:59.351131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2510.03086."}