{"as_of":"2026-08-07T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2472412e06e809ad7c0341fc280f2387a75abdcbfbfb1eec62154b8930aea032","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T22:52:21.348156Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2605.25662/citation-record","integrity":"/paper/2605.25662/integrity","json":"/paper/2605.25662/citation-record.json","paper":"/paper/2605.25662"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03464","last_updated":"2024-06-05T17:12:38Z","snapshot_observed_at":"2026-08-02T00:19:39.067903Z","submitted_at":"2024-06-05T17:12:38Z","title":"Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach","version":1},"cited_work":{"arxiv_id":"2406.03464","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03464","snapshot_observed_at":"2026-07-01T22:16:16.203843Z","title":"Node-wise filtering in graph neural networks: A mixture of experts approach","venue":null,"work_id":"0025d743-4ee0-4f3c-913b-691c396b92ad","year":2024},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"cited_paper":"/paper/2406.03464","citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:9f7fdc47364c9022592014f301874ce15b5e608f5ef9d95e6140a2ddfe8cd796","observation_id":"6428de6e-a1dc-4815-86bb-8a2288c084f9","resolution":{"observed_at":"2026-06-29T22:54:00.810597Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.00808","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:54:00.805577Z","title":"Jianan Zhao, Zhaocheng Zhu, Mikhail Galkin, Hesham Mostafa, Michael Bronstein, and Jian Tang","venue":null,"work_id":"f0ac736a-ba55-48b8-b040-6f2b45ec5bc1","year":null},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:d42d285070bd38cd70e8e2566fd73ff2214f6569030761605c5580f1ea268a00","observation_id":"4a82bb0d-6c56-4164-8ee3-c9ceb6f3aadc","resolution":{"observed_at":"2026-06-29T22:54:00.807491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:52:21.348156Z","title":"2024 reproductions We reproduce all 33 recipes of Luo et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:2bc60d387040b2ee6ebb131bdcf3d21b0af6dcf3f90ba4bf7a8b4e55aded1761","observation_id":"081845ca-a6a0-464a-863f-29807da96a5e","resolution":{"observed_at":"2026-06-29T22:52:21.348156Z","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-06-29T22:52:21.348156Z","title":"Luo et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:dd35ab3c8447b2598e208ee57c2da5303ce70c89319121f0e93b235f126e649f","observation_id":"13050d63-93ca-4cd3-b9df-a8697b3d9537","resolution":{"observed_at":"2026-06-29T22:52:21.348156Z","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-06-29T22:52:21.348156Z","title":"no error bars","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:abf589c5b0ef72acb2c106955cebaf63becea3401868c4e8622960d70f812d2e","observation_id":"a632c6af-76ef-4f25-a775-bdaf71d59506","resolution":{"observed_at":"2026-06-29T22:52:21.348156Z","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":"5453.4482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:54:00.814511Z","title":"Wall-clock per experiment: reproductions of Luo et al","venue":null,"work_id":"5b8d7952-3f08-47ff-bbee-c74e89863e4c","year":2080},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:0bf232d236e67b1c922b145641cd69802ae947804a55028c7bde46a019bbee74","observation_id":"4214c675-f1bb-48da-a65a-08bde3a5d004","resolution":{"observed_at":"2026-06-29T22:54:00.815959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0097.3696","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:54:00.811766Z","title":"recipe).SGC + Ridge: Pipeline A minus C&S, isolating the marginal C&S contribution","venue":null,"work_id":"4ac3fe52-fc30-45ab-8bd0-71510f32cee2","year":2024},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:664143993f48b0a766d7f48815723f2013ca1fc940eed6e220ee0f0e2f3727c0","observation_id":"f10816d4-2b53-42cc-aa95-08597d311804","resolution":{"observed_at":"2026-06-29T22:54:00.813456Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:52:21.348156Z","title":"All” column at 5% unlearn. “–","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T22:52:21.348156Z"},"links":{"citing_paper":"/paper/2605.25662"},"observation_digest":"sha256:c8dc93a1d0a9239c37db7c45dd479557699e9bea746ed7fa83aa2abe25d6c570","observation_id":"1977a6f0-7d0a-4495-a86b-200b7ceff3d0","resolution":{"observed_at":"2026-06-29T22:52:21.348156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.25662","last_updated":"2026-05-25T10:12:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T04:19:51.974746Z","submitted_at":"2026-05-25T10:12:43Z","title":"Closed-Form Node Classification with Exact Graph Unlearning"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":8},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2605.25662."}