{"as_of":"2026-08-13T09:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd3f34698e145d4d02443d26412198c8ba1d08a69a15d4eee6ec4cc6956b94b0","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:37:39.731695Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T20:20:11.607279Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.17559","last_updated":"2026-06-27T10:14:12Z","snapshot_observed_at":"2026-08-12T22:33:13.708683Z","submitted_at":"2025-01-29T10:46:57Z","title":"GraphChase: A Platform and Benchmark for Urban Network Security Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17559","snapshot_observed_at":"2026-08-07T15:37:39.731695Z","title":"centroid","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14547","last_updated":"2025-05-27T22:43:54Z","snapshot_observed_at":"2026-08-11T19:13:28.482095Z","submitted_at":"2025-05-20T16:03:24Z","title":"GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:39.731695Z"},"links":{"cited_paper":"/paper/2501.17559","citing_paper":"/paper/2505.14547"},"observation_digest":"sha256:bc01c5a19c147baf87527f3f244cc0f1f5938a083298d85b98af6e0acc015545","observation_id":"3b1657c1-a1aa-4742-a55f-90d60f1d5ce5","resolution":{"observed_at":"2026-08-07T15:37:39.731695Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17559","last_updated":"2026-06-27T10:14:12Z","snapshot_observed_at":"2026-08-12T22:33:13.708683Z","submitted_at":"2025-01-29T10:46:57Z","title":"GraphChase: A Platform and Benchmark for Urban Network Security Games","version":2},"cited_work":{"arxiv_id":"2501.17559","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.17559","snapshot_observed_at":"2026-06-30T02:15:33.156183Z","title":"Solving urban network security games: Learning platform, benchmark, and challenge for AI research.arXiv preprint arXiv:2501.17559","venue":null,"work_id":"bc133bbb-6108-4a06-bb6c-ac3662967a2b","year":null},"citing_paper":{"arxiv_id":"2511.17367","last_updated":"2026-05-14T11:57:30Z","snapshot_observed_at":"2026-08-05T22:02:12.858510Z","submitted_at":"2025-11-21T16:34:00Z","title":"R2PS: Worst-Case Robust Real-Time Pursuit Strategies under Partial Observability","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T20:19:24.841090Z"},"links":{"cited_paper":"/paper/2501.17559","citing_paper":"/paper/2511.17367"},"observation_digest":"sha256:9451afb3f89c464a8b144032d81ab0c60a245e9f0d24db18d8c5d0d07c801c4c","observation_id":"2dccd16b-7583-4ddc-bee7-828f7adc3a32","resolution":{"observed_at":"2026-06-30T02:15:33.156183Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17559","last_updated":"2026-06-27T10:14:12Z","snapshot_observed_at":"2026-08-12T22:33:13.708683Z","submitted_at":"2025-01-29T10:46:57Z","title":"GraphChase: A Platform and Benchmark for Urban Network Security Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17559","snapshot_observed_at":"2026-07-13T05:59:47.577200Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08892","last_updated":"2026-08-06T15:00:54Z","snapshot_observed_at":"2026-08-13T08:48:27.640676Z","submitted_at":"2026-07-09T19:33:01Z","title":"Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T05:59:47.577200Z"},"links":{"cited_paper":"/paper/2501.17559","citing_paper":"/paper/2607.08892"},"observation_digest":"sha256:4124296f1c4364394258bf931273b862d56d06f85b917f370be7dfebf99f774c","observation_id":"4afb474f-a9f0-497b-a205-475cad9e7a1d","resolution":{"observed_at":"2026-07-13T05:59:47.577200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.17559/citation-record","integrity":"/paper/2501.17559/integrity","json":"/paper/2501.17559/citation-record.json","paper":"/paper/2501.17559"},"outbound":[],"paper":{"arxiv_id":"2501.17559","last_updated":"2026-06-27T10:14:12Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T22:33:13.708683Z","submitted_at":"2025-01-29T10:46:57Z","title":"GraphChase: A Platform and Benchmark for Urban Network Security Games"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.17559."}