{"as_of":"2026-08-11T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94ded2e0e2d2449bf5ba5bf754501a2fdd02491a54d46cbaded3f22ab9788479","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T21:54:37.686286Z","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-07-01T19:56:11.093608Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.12075","last_updated":"2019-10-26T14:37:49Z","snapshot_observed_at":"2026-07-06T08:32:28.197163Z","submitted_at":"2019-10-26T14:37:49Z","title":"Finding Mixed Strategy Nash Equilibrium for Continuous Games through Deep Learning","version":1},"cited_work":{"arxiv_id":"1910.12075","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.12075","snapshot_observed_at":"2026-07-01T19:56:11.093608Z","title":"Finding mixed strategy nash equilibrium for continuous games through deep learning","venue":null,"work_id":"14949dd5-6863-470e-a31e-fd269f01cb38","year":1910},"citing_paper":{"arxiv_id":"2308.01144","last_updated":"2026-05-12T07:57:37Z","snapshot_observed_at":"2026-07-06T16:01:41.830509Z","submitted_at":"2023-08-02T13:33:52Z","title":"Near-Optimal Mixed Strategy for Zero-Sum Differential Games","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T07:12:23.870634Z"},"links":{"cited_paper":"/paper/1910.12075","citing_paper":"/paper/2308.01144"},"observation_digest":"sha256:68751252c4c8868800eafe47f59c161671e3fb9b0c8544ffdac0bdec2084a458","observation_id":"2dd935f9-76ee-4f9f-b998-8667d233d734","resolution":{"observed_at":"2026-05-24T07:14:05.425776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12075","last_updated":"2019-10-26T14:37:49Z","snapshot_observed_at":"2026-07-06T08:32:28.197163Z","submitted_at":"2019-10-26T14:37:49Z","title":"Finding Mixed Strategy Nash Equilibrium for Continuous Games through Deep Learning","version":1},"cited_work":{"arxiv_id":"1910.12075","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.12075","snapshot_observed_at":"2026-07-01T19:56:11.093608Z","title":"Finding mixed strategy nash equilibrium for continuous games through deep learning","venue":null,"work_id":"14949dd5-6863-470e-a31e-fd269f01cb38","year":1910},"citing_paper":{"arxiv_id":"2605.30886","last_updated":"2026-05-29T06:22:35Z","snapshot_observed_at":"2026-07-06T23:40:07.833692Z","submitted_at":"2026-05-29T06:22:35Z","title":"Near-Optimal Mixed Strategy for Zero-Sum Linear-Quadratic Differential Games","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T21:54:37.686286Z"},"links":{"cited_paper":"/paper/1910.12075","citing_paper":"/paper/2605.30886"},"observation_digest":"sha256:cd7d3316bcac580cc1306f1aab8a244b4b3338d11d7d93e7616bc8aed36d5876","observation_id":"f3a5b8f5-e0a9-471b-a749-ab307ebb3551","resolution":{"observed_at":"2026-07-01T19:56:11.095432Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.12075/citation-record","integrity":"/paper/1910.12075/integrity","json":"/paper/1910.12075/citation-record.json","paper":"/paper/1910.12075"},"outbound":[],"paper":{"arxiv_id":"1910.12075","last_updated":"2019-10-26T14:37:49Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T08:32:28.197163Z","submitted_at":"2019-10-26T14:37:49Z","title":"Finding Mixed Strategy Nash Equilibrium for Continuous Games through Deep Learning"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1910.12075."}