{"as_of":"2026-08-22T12:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d10e902791b62f2b7396eb918726f41d69b954a26293b64f7913a3417f60981","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-22T06:32:14.747728+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-08-12T20:06:01.726432Z","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-12T00:46:53.246286Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1202.3898","last_updated":"2012-02-17T12:37:42Z","snapshot_observed_at":"2026-08-15T04:19:00.804748Z","submitted_at":"2012-02-17T12:37:42Z","title":"Exact Algorithms for Solving Stochastic Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1202.3898","snapshot_observed_at":"2026-08-12T20:06:01.726432Z","title":"Tsi- garidas","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.10107","last_updated":"2025-03-27T11:06:35Z","snapshot_observed_at":"2026-08-12T19:55:57.631184Z","submitted_at":"2024-11-15T11:07:05Z","title":"Monotone Contractions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T20:06:01.726432Z"},"links":{"cited_paper":"/paper/1202.3898","citing_paper":"/paper/2411.10107"},"observation_digest":"sha256:116968a72ba38ad24d6d72b5ec653ddbe8c1fa4337613179a9abc26f2e38b2e5","observation_id":"d7708438-6fa0-41cb-8540-d3cd0ab7d434","resolution":{"observed_at":"2026-08-12T20:06:01.726432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1202.3898","last_updated":"2012-02-17T12:37:42Z","snapshot_observed_at":"2026-08-15T04:19:00.804748Z","submitted_at":"2012-02-17T12:37:42Z","title":"Exact Algorithms for Solving Stochastic Games","version":1},"cited_work":{"arxiv_id":"1202.3898","doi":null,"metadata_source":"pith","pith_arxiv_id":"1202.3898","snapshot_observed_at":"2026-08-12T00:46:53.246286Z","title":"Exact Algorithms for Solving Stochastic Games","venue":"cs.GT","work_id":"01d19dec-9ef3-4d76-acf1-d2291075e248","year":2012},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.562392Z"},"links":{"cited_paper":"/paper/1202.3898","citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:5ea8db797e4f76e0279af28f51da538981e8d2d997831715b8c1ddd3352e1068","observation_id":"19bddd23-1f7f-4a98-9724-2213b00ba42e","resolution":{"observed_at":"2026-08-12T00:46:53.252979Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1202.3898/citation-record","integrity":"/paper/1202.3898/integrity","json":"/paper/1202.3898/citation-record.json","paper":"/paper/1202.3898"},"outbound":[],"paper":{"arxiv_id":"1202.3898","last_updated":"2012-02-17T12:37:42Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-15T04:19:00.804748Z","submitted_at":"2012-02-17T12:37:42Z","title":"Exact Algorithms for Solving Stochastic 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1202.3898."}