{"as_of":"2026-08-24T03:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:151de45be308ebdc01ee094e65ba5d748952800c910330e02a409f9973c7b96c","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:54:04.103463Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.16328/citation-record","integrity":"/paper/2412.16328/integrity","json":"/paper/2412.16328/citation-record.json","paper":"/paper/2412.16328"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2021.03.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.153128Z","title":"org/10.1016/j.jcss.2021.03.005","venue":null,"work_id":"98cd9b12-933e-4aae-ac4c-96b5317d4c77","year":2021},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.092770Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:f358dd6304e945fd9d1bea0180966268f4d52ffdd6e213f8b3a95a5594b051ff","observation_id":"b620c8d4-5a1e-4d98-b473-d9c80496100a","resolution":{"observed_at":"2026-08-11T10:54:04.157038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.099963Z","title":"Pnueli and R","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.099963Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:d08fb91ccd53ce619d85dba6ac8bcb64bf4129012c2a831438bd7ebac2265d0a","observation_id":"33cfa453-a4e0-41e1-b633-d252ce2131eb","resolution":{"observed_at":"2026-08-11T10:54:04.099963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/1999283","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.129789Z","title":"Complexity of subcases of presburger arithmetic.Transactions of the American Mathematical Society, 284(1):203–218, 1984.doi:10.2307/1999283","venue":null,"work_id":"a70da9ac-5133-41b5-a2e9-b70df04d9c07","year":1984},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.103463Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:48a41986e77eb0734e2bc1a179725f44bb0a0fc014b886fefc99027cd1900fb6","observation_id":"e960b80e-6c13-4a0b-8d6c-45f8d88bffb0","resolution":{"observed_at":"2026-08-11T10:54:04.135785Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.453161Z","title":"Gusev, Dmitriy Malyshev, and Viktor Zamaraev","venue":null,"work_id":"6fe1de77-cfc7-487f-b13e-136a97b90d22","year":2022},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.050837Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:21be91aa6234b69fd8243fe65c19ae54f4d3fa9860e1a03f189279a6d520aea8","observation_id":"425b08fb-ac55-4296-8e7b-bd638071ea08","resolution":{"observed_at":"2026-08-11T10:54:04.456576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.084884Z","title":"Distributed computation in dynamic networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.084884Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:1dadbb943ca26d8307b9b4c230744c41401b2c18900ce2e0acf217afd7ac976c","observation_id":"c470faad-63c8-41f1-a4ec-551140398d15","resolution":{"observed_at":"2026-08-11T10:54:04.084884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.428414Z","title":"The complexity of online graph games","venue":null,"work_id":"67ab92b6-886b-466e-9aa3-9b6baa56d67e","year":2024},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.080928Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:d34606b63cc126225f4a9fa42272f1e21ea7cc8ec6f1ecd1e141c5c1cf9882b3","observation_id":"d3511475-e61c-4d55-aff9-f72c655ea9fb","resolution":{"observed_at":"2026-08-11T10:54:04.432529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.088865Z","title":"Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.088865Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:973eb2f714d5539ad5a80e6a4c4cd259fb1d73d4ef894fcbb12ec7194944a35d","observation_id":"bcac6c91-a363-4290-bd51-e98961c0c962","resolution":{"observed_at":"2026-08-11T10:54:04.088865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.441332Z","title":"On temporal graph exploration","venue":null,"work_id":"616d8e74-c9e1-4696-b2da-35976f9f0bc3","year":2021},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.071878Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:4034fe30d32280c46b722b48fdff617b10da119a757ebdac40bb0996aa45f165","observation_id":"72407bd0-18a7-46ac-9bb7-ad35cb9cd9ce","resolution":{"observed_at":"2026-08-11T10:54:04.445324Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-21T23:22:04.387124Z","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-11T10:54:04.076217Z","title":"Games on graphs, 2023.arXiv:2305.10546","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.076217Z"},"links":{"cited_paper":"/paper/2305.10546","citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:bb4036fbe8d9e8133a51c970b508d0a7d4a31ca4f63ab64bd33cd1273ffef52f","observation_id":"b432c97a-cc55-4361-8dc9-670819e01a67","resolution":{"observed_at":"2026-08-11T10:54:04.076217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.096448Z","title":"Spirakis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.096448Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:e0b2da33ab6131821d5b8b1ee160ae7566402589e30101e3f23a38a7eb808fb9","observation_id":"7e4af24c-ce97-4710-801a-97774d6810c9","resolution":{"observed_at":"2026-08-11T10:54:04.096448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2016.06.017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.180525Z","title":"URL: https://www.sciencedirect.com/science/article/ pii/S0304397516302535,doi:https://doi.org/10.1016/j.tcs.2016.06.017","venue":null,"work_id":"3bdda0b4-0814-46b0-8c7e-c992cc02000e","year":2014},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.063878Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:42e37895493f944e638d13839324de3b444b2d41e046e01ec2288e1f84b06df2","observation_id":"674b95f4-6884-4fa3-ac1c-f928459783c5","resolution":{"observed_at":"2026-08-11T10:54:04.184684Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2168/lmcs-7(4:8)2011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.192746Z","title":"Henzinger, and Vinayak S","venue":null,"work_id":"54e2acc3-f150-4070-8f7e-1fe97f81646e","year":2011},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.059682Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:3ce7390aab3da74a9b586b94cbe2bb1a571fb3a542c38dc64893aa869bb39306","observation_id":"00e92168-44c3-43c3-840a-83f5b58edfed","resolution":{"observed_at":"2026-08-11T10:54:04.196889Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.055443Z","title":"3 Eleni C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.055443Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:56622a2e0a138eae96f8cd01f7e59000010d7061b7d26ee2a74c616f7a80c40c","observation_id":"3f03b7e8-142b-4eea-9606-733fd04e6eb4","resolution":{"observed_at":"2026-08-11T10:54:04.055443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:54:04.067873Z","title":"Minimizing reachability times on temporal graphs via shifting labels","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T10:54:04.067873Z"},"links":{"citing_paper":"/paper/2412.16328"},"observation_digest":"sha256:d7c0dbd80d4bc3bfd2eab8f8d6a8dcb3b2644b94aa98d5399a2d520e8fc4b5ba","observation_id":"fa79ba77-4afc-44c0-8d3d-786ba11ba61e","resolution":{"observed_at":"2026-08-11T10:54:04.067873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.16328","last_updated":"2025-06-13T07:37:56Z","latest_version":3,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-18T15:57:54.107820Z","submitted_at":"2024-12-20T20:33:46Z","title":"Temporal Explorability Games"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":4,"verified_fuzzy":2},"total_outbound_references":14},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2412.16328."}