{"as_of":"2026-08-09T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb99131745b2552177af392f1ed7d4c0ce4ffc9e7d05a2fd79152bbdf5d55b22","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:47:19.900181Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01214","snapshot_observed_at":"2026-08-07T14:47:19.900181Z","title":"Revisiting random walks for learning on graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.900181Z"},"links":{"cited_paper":"/paper/2407.01214","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:5a675d90bc2a6220771d97dcd82a6ebbcf657aeb1f250c6d62567e728c340199","observation_id":"841ba0c8-5812-4957-96df-6c7a0d0868b4","resolution":{"observed_at":"2026-08-07T14:47:19.900181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01214","snapshot_observed_at":"2026-08-07T00:26:20.814785Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14114","last_updated":"2025-06-17T02:12:19Z","snapshot_observed_at":"2026-08-08T21:03:30.013618Z","submitted_at":"2025-06-17T02:12:19Z","title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:20.814785Z"},"links":{"cited_paper":"/paper/2407.01214","citing_paper":"/paper/2506.14114"},"observation_digest":"sha256:3f23365213a2b86fceebff6f93da9b7812056bd2faf6c63516df035b0f14af42","observation_id":"c44ce8d4-aa4e-4ee4-ae2a-a8b7bc04b415","resolution":{"observed_at":"2026-08-07T00:26:20.814785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2407.01214","doi":"10.48550/arxiv.2407.01214","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01214","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Revisiting random walks for learning on graphs.arXiv preprint arXiv:2407.01214","venue":"arXiv (Cornell University)","work_id":"7a89190e-c23d-45c5-801b-ce0d65eb85d8","year":null},"citing_paper":{"arxiv_id":"2605.01484","last_updated":"2026-05-02T15:11:52Z","snapshot_observed_at":"2026-08-02T04:58:06.359776Z","submitted_at":"2026-05-02T15:11:52Z","title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-09T15:09:03.417040Z"},"links":{"cited_paper":"/paper/2407.01214","citing_paper":"/paper/2605.01484"},"observation_digest":"sha256:815b143da09fdea009cf00b6443832314250d3b9009244edecf1b480daa5fe19","observation_id":"ba2f73d5-cbea-4321-a001-3004effad0c9","resolution":{"observed_at":"2026-05-09T22:13:58.028920Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2407.01214","doi":"10.48550/arxiv.2407.01214","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01214","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Revisiting random walks for learning on graphs.arXiv preprint arXiv:2407.01214","venue":"arXiv (Cornell University)","work_id":"7a89190e-c23d-45c5-801b-ce0d65eb85d8","year":null},"citing_paper":{"arxiv_id":"2605.04834","last_updated":"2026-05-06T12:30:50Z","snapshot_observed_at":"2026-08-08T07:12:46.232151Z","submitted_at":"2026-05-06T12:30:50Z","title":"Bridging Input Feature Spaces Towards Graph Foundation Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T17:18:21.259797Z"},"links":{"cited_paper":"/paper/2407.01214","citing_paper":"/paper/2605.04834"},"observation_digest":"sha256:36aa4974c9e34fe1a83e219025e55d142ed156bc1893b9c3bc59df83eeb978fc","observation_id":"d4583cec-c343-4adf-a6d0-3f93184c834b","resolution":{"observed_at":"2026-05-11T17:41:08.664973Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.01214/citation-record","integrity":"/paper/2407.01214/integrity","json":"/paper/2407.01214/citation-record.json","paper":"/paper/2407.01214"},"outbound":[],"paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2407.01214."}