{"as_of":"2026-08-13T07:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e28faf2e961eb8067a20bdb48ddd6ec75c744dd2b4a277b6547daff4094405db","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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-13T07:17:39.533149Z","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:7ec832c9189c0145ebdbaced79771a8e9a3e2f781131ca9e18c1d1bcbed2679e","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-13T07:17:39.533149Z","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:978f1b3bd55b6608f58582abdc4d4d640533d088c127397f16dc02827de52ff6","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-13T07:17:39.533149Z","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:e23a4ffce195a178e9d850787e1dbe4e5b5201760d02b531419f00508bd9ed5e","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-13T07:17:39.533149Z","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:bd35e92a66f2bb25b036c21c0e4e1ce5cdcfb1bc12790fe9be09bdb4b5d0a157","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-13T07:17:39.533149Z","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:5ca4b53cdcd0d2594a6809b7e6b04d09c1580e487d23ead96e45c93d56ab7e22","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-13T07:17:39.533149Z","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:9572b8fa03a7e8039cf9bcbb9604a35c19428c09fa646437d55fd208edf0557d","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-13T07:17:39.533149Z","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:402d1bbbdb166c9e225213755476e3bdce8743df59a9e0cd4479411d1c78a8e9","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-13T07:17:39.533149Z","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:deb7d7e8027f488f049762340bdb2d6d7e6d1d8fcbabcd5d74f745f883791511","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-13T07:17:39.533149Z","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:0244b41cd07797bc01afe1a51c885aa9fb931a57854ee207d4c005ef45e37d3e","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-13T07:17:39.533149Z","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:05e2ede8900d1ecab6c8575f1d520d166add38e518c96fae9da3d91a1fc02d54","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-13T07:17:39.533149Z","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:216490d6fed47155cbbe7e03d8f85436ffc71ab071baebbba35da4e01edb07d5","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-13T07:17:39.533149Z","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:fa67ab7f04274ccf5e018a215fd5f64059ff09009021ee2be083cf991833985f","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-13T00:08:11.908556Z","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-13T07:17:39.533149Z","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:ab1629da0db43907e2b63242c3606ad94c6ff299e1a146e2f6cdc4e3fb0c8d49","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-13T07:17:39.533149Z","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:93de76bcf2d6ab8a6030ff2d8d31a954f318fe413ff687f752d109b93ccbd23f","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-13T07:17:39.533149Z","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:e29d398153ae54a6d4d4809cd7b8404a09934652ff7cdf7370d1a865ffa91509","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-13T07:17:39.533149Z","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:0ea7335ee0af1075152c06d984a529ad4d7a7a0e923864158425db1a4ddf7a98","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-13T07:17:39.533149Z","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:c1a5b526f1419729b760da935dca4200f5789a541753c65e592c8cd58052d500","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-13T07:17:39.533149Z","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:8aad8d3d64c35221bd12d85aac0388d04a041bf946f3238352e4bb460d1919d8","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-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-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-13T07:17:39.533149Z","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:3f8e3994b355f4901e9be5f0e34114b90ac3524f858783a8a236525bb2afd28e","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-13T07:17:39.533149Z","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:e412d33da50af8df36918a3870efe3a70286922c7ef951af4b4301afddf7c81f","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-13T07:17:39.533149Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2510.03086."}