{"as_of":"2026-08-09T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb3f0f7067197d65e73d16261d890c4dbb27a35087f31d2447f36393e81c6fc4","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:32:27.453757Z","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-07-09T19:46:28.691052Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-08-05T18:32:27.453757Z","title":"Preliminaries","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.14725","last_updated":"2025-08-20T14:07:43Z","snapshot_observed_at":"2026-08-05T18:32:25.863148Z","submitted_at":"2025-08-20T14:07:43Z","title":"Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T18:32:27.453757Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2508.14725"},"observation_digest":"sha256:afb95c3293cb86c2b905d2774d0519a08bd11a459144a09aeee329c04d50eabd","observation_id":"6c595047-8395-4473-82b1-cdd5852bec31","resolution":{"observed_at":"2026-08-05T18:32:27.453757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-08-05T10:25:12.202732Z","title":"In: Fijalkow, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.04129","last_updated":"2025-09-04T11:54:19Z","snapshot_observed_at":"2026-08-05T10:25:10.701636Z","submitted_at":"2025-09-04T11:54:19Z","title":"Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T10:25:12.202732Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2509.04129"},"observation_digest":"sha256:dd67f43a3c8fabb1ba4ac525773b912b0497922353f359bba572e08d6fc2c6b1","observation_id":"59c2515a-81c8-4b64-84e9-6d90d82adae2","resolution":{"observed_at":"2026-08-05T10:25:12.202732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":"2305.10546","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-07-09T19:46:28.691052Z","title":"Games on Graphs: From Logic and Automata to Algorithms","venue":"cs.GT","work_id":"69d7845a-8c3c-4195-abc6-012c04f8514a","year":2023},"citing_paper":{"arxiv_id":"2511.11545","last_updated":"2026-04-13T17:55:32Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T18:30:51Z","title":"Incremental Data-Driven Policy Synthesis via Game Abstractions","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-17T22:04:05.740495Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2511.11545"},"observation_digest":"sha256:895e03febcd4954d631889134ef02e1fddf2241762e7dca10f22b8d3f96cb547","observation_id":"bbae6d2c-38f1-4052-9691-c38f6b665334","resolution":{"observed_at":"2026-05-17T22:05:21.433498Z","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":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-07-11T22:18:47.090289Z","title":"Fijalkow, C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04014","last_updated":"2026-07-04T20:21:18Z","snapshot_observed_at":"2026-08-08T16:24:43.275024Z","submitted_at":"2026-07-04T20:21:18Z","title":"Ample sets in Cartesian products","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T22:18:47.090289Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2607.04014"},"observation_digest":"sha256:1cb6f491868780a046a7a1c449ad0779fbd239eeb3839cbd65a411b3050353f1","observation_id":"14894bc7-71df-42a3-859d-6b528eb922ee","resolution":{"observed_at":"2026-07-11T22:18:47.090289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":"2305.10546","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-07-09T19:46:28.691052Z","title":"Games on Graphs: From Logic and Automata to Algorithms","venue":"cs.GT","work_id":"69d7845a-8c3c-4195-abc6-012c04f8514a","year":2023},"citing_paper":{"arxiv_id":"2607.07151","last_updated":"2026-07-08T08:40:18Z","snapshot_observed_at":"2026-08-06T07:57:44.170039Z","submitted_at":"2026-07-08T08:40:18Z","title":"Simple Nash Equilibria for Qualitative Multiplayer Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T19:42:55.705462Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2607.07151"},"observation_digest":"sha256:aed49fa6bc322eccdd6e2e2351fdce40651216b4e99d043d2949c33e6674344c","observation_id":"4a1f721d-aa0b-45b4-96fc-15c1505b99bf","resolution":{"observed_at":"2026-07-09T19:46:28.693095Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"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":"2305.10546","last_updated":"2025-07-29T12:45:59Z","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10546","snapshot_observed_at":"2026-07-31T00:22:21.842625Z","title":"CoRR , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27456","last_updated":"2026-07-29T20:45:06Z","snapshot_observed_at":"2026-08-08T09:01:38.859814Z","submitted_at":"2026-07-29T20:45:06Z","title":"Multi-Player Discrete-Bidding Games; Determinacy, Equilibria, and Complexity","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-31T00:22:21.842625Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2607.27456"},"observation_digest":"sha256:9ad33d22c968a848f5b41ec5eaf042c2008d0935b30878bdb7981f16b626b592","observation_id":"70c34a3e-f875-4d0b-906c-c9717af5c0ee","resolution":{"observed_at":"2026-07-31T00:22:21.842625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.10546/citation-record","integrity":"/paper/2305.10546/integrity","json":"/paper/2305.10546/citation-record.json","paper":"/paper/2305.10546"},"outbound":[],"paper":{"arxiv_id":"2305.10546","last_updated":"2025-07-29T12:45:59Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-05T07:01:00.392387Z","submitted_at":"2023-05-17T20:06:14Z","title":"Games on Graphs: From Logic and Automata to Algorithms"},"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 6 inbound Pith citation observations for arXiv:2305.10546."}