{"as_of":"2026-08-10T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ced91b2551a4b87c888264046cb57c9602b56f1cf84f688a4a21a85d93195da","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-09T06:31:02.800959+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-07T10:25:54.024854Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T21:30:00.736856Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.05896","last_updated":"2024-11-08T15:29:03Z","snapshot_observed_at":"2026-08-09T05:00:21.824749Z","submitted_at":"2024-11-08T15:29:03Z","title":"Stochastic Graphon Games with Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05896","snapshot_observed_at":"2026-08-07T10:25:54.024854Z","title":"Stochastic graphon games with memory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05894","last_updated":"2025-06-06T09:06:06Z","snapshot_observed_at":"2026-08-09T15:39:17.826413Z","submitted_at":"2025-06-06T09:06:06Z","title":"Policy Optimization for Continuous-time Linear-Quadratic Graphon Mean Field Games","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:25:54.024854Z"},"links":{"cited_paper":"/paper/2411.05896","citing_paper":"/paper/2506.05894"},"observation_digest":"sha256:8fb06253598b236a926fa40925fc4002dc5a13d0262110d09e523e5cac5757f1","observation_id":"21362dd4-02e6-4ad6-a1d4-04b54f59df70","resolution":{"observed_at":"2026-08-07T10:25:54.024854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05896","last_updated":"2024-11-08T15:29:03Z","snapshot_observed_at":"2026-08-09T05:00:21.824749Z","submitted_at":"2024-11-08T15:29:03Z","title":"Stochastic Graphon Games with Memory","version":1},"cited_work":{"arxiv_id":"2411.05896","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.05896","snapshot_observed_at":"2026-08-06T21:30:00.736856Z","title":"Stochastic Graphon Games with Memory","venue":"math.OC","work_id":"33f030c7-77e7-48b9-8cc4-247f8cf62cfa","year":2024},"citing_paper":{"arxiv_id":"2507.00561","last_updated":"2025-07-01T08:29:33Z","snapshot_observed_at":"2026-08-08T22:03:13.250963Z","submitted_at":"2025-07-01T08:29:33Z","title":"Stochastic Graphon Games with Interventions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:30:00.280415Z"},"links":{"cited_paper":"/paper/2411.05896","citing_paper":"/paper/2507.00561"},"observation_digest":"sha256:f697f1cbd8b69f3b03af9e69909deb0b6971a0ca16d141970d40d0746bf6a47a","observation_id":"3d05de9b-293b-4286-b540-e93b4cd783b2","resolution":{"observed_at":"2026-08-06T21:30:00.758814Z","resolver_source":"local_arxiv","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":"2411.05896","last_updated":"2024-11-08T15:29:03Z","snapshot_observed_at":"2026-08-09T05:00:21.824749Z","submitted_at":"2024-11-08T15:29:03Z","title":"Stochastic Graphon Games with Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05896","snapshot_observed_at":"2026-08-03T20:49:33.414780Z","title":"Stochastic graphon games with memory.arXiv preprint arXiv:2411.05896, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.18636","last_updated":"2026-07-17T13:03:10Z","snapshot_observed_at":"2026-08-08T10:55:36.012014Z","submitted_at":"2025-11-23T22:22:53Z","title":"Optimal Control of Heterogeneous Mean-Field Stochastic Differential Equations with Common Noise and Applications","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T20:49:33.414780Z"},"links":{"cited_paper":"/paper/2411.05896","citing_paper":"/paper/2511.18636"},"observation_digest":"sha256:23d3b60d0a4ed2904e7c23ba653b9032d018ef2363b6cbdd647be6cfdc9b4bb5","observation_id":"590719d4-42de-4ec5-8f48-5e7581fb2eb5","resolution":{"observed_at":"2026-08-03T20:49:33.414780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.05896/citation-record","integrity":"/paper/2411.05896/integrity","json":"/paper/2411.05896/citation-record.json","paper":"/paper/2411.05896"},"outbound":[],"paper":{"arxiv_id":"2411.05896","last_updated":"2024-11-08T15:29:03Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T05:00:21.824749Z","submitted_at":"2024-11-08T15:29:03Z","title":"Stochastic Graphon Games with Memory"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2411.05896."}