{"as_of":"2026-08-13T11:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0847b6442dbffac019ef6ecebd0b92554f5505d3b8c0a21282c225c7c39b44b2","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T09:50:23.876950Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.06334/citation-record","integrity":"/paper/2607.06334/integrity","json":"/paper/2607.06334/citation-record.json","paper":"/paper/2607.06334"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/140953800","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optim.24.4 (2014), pp","venue":"SIAM Journal on Optimization","work_id":"3daa8c1a-44d5-48f1-b16a-ce537170044a","year":2014},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:dc84e7320944c737dcd5b03ec4779552c1ce3905a83ffc1f265971eb09341c20","observation_id":"70d4b48f-e799-4d69-bc6b-b3b66235cbcf","resolution":{"observed_at":"2026-07-08T09:54:50.876822Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:05.704604+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:05.704604+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2013.676014","doi":"10.1109/cdc.2013.6760148","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Barreto, E","venue":null,"work_id":"3e26e4c0-7c87-4a9e-864a-bffd5d5731ab","year":2013},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:201f81b6afb3ba1655833802219650328757cf561166ad29d9c3545974d55229","observation_id":"a5c343da-f58b-477a-85c0-c4ba007108b5","resolution":{"observed_at":"2026-07-08T09:54:50.890839Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2017.07.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Guterman.Tropical Polyhedra are Equivalent to mean Payoff Games.Int","venue":"Journal of Symbolic Computation","work_id":"3ae7ce86-0c10-4d4b-a82f-b2b55b71fd4e","year":2012},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:dc434ffac083907c9503b59d7146f1535f524180281206eae8b80005657ce27d","observation_id":"6c959f4d-4afd-45d5-8e94-89d512de6655","resolution":{"observed_at":"2026-07-08T09:54:50.910223Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:06.22828+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:06.22828+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In 32nd European Conference on Object-Oriented Programming (ECOOP 2018)","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"74c3329f-8204-4fce-a337-6f66b116862f","year":2021},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:37e473c56d6870cc7a3a611b420b784a74ccba45e5f29dbed9384349e3ef987a","observation_id":"9d3258f8-cc28-4c77-916d-953fc3d1ab18","resolution":{"observed_at":"2026-07-08T09:54:50.906741Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10703-010-0105-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"4 Antonio Casares","venue":"Formal Methods in System Design","work_id":"f909d9a3-5c63-4c83-8736-16e1d34bc991","year":2011},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:e08b65d8d1b334a6c421f7797ddd2f8793129693a5f4a1af2ab9151452f6674f","observation_id":"d082c45f-ee61-4601-9166-37ebbd215203","resolution":{"observed_at":"2026-07-08T09:54:50.884497Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:06.457565+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:06.457565+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4757-3069-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bender and S","venue":null,"work_id":"298ff8bd-0d00-4c8d-bba8-c09598ea1ae4","year":1999},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:fc70de1770184cd51a5adccf941cebdcb7e777aecab74d1fbf26ca3c2b6ba297","observation_id":"cfe3d357-b01c-43a3-9031-2540dc45d66f","resolution":{"observed_at":"2026-07-08T09:54:50.886894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:06.67805+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:06.67805+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/lmcs-18(3:29)2022","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"9 Thomas Colcombet and Damian Niwiński","venue":"Logical Methods in Computer Science","work_id":"9f725d86-afaa-4042-929d-f9821d94769d","year":2019},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:09645159f259ce9f7910fe9dd0935c282d91d87d65b1cec768913da3e7a4d6c8","observation_id":"49150547-be45-4057-a2e4-1b46f0ab9769","resolution":{"observed_at":"2026-07-08T09:54:50.927593Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:06.913726+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:06.913726+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1991.185392","doi":"10.1109/sfcs.1991.185392","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Allen Emerson and Charanjit S","venue":null,"work_id":"d8cdf958-3674-4f98-9e8b-69a4de37cc22","year":1991},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:fb3cb8d10d07e9ac14c07c7cffcf7728da84f8daef938117dfb44473ae5f6345","observation_id":"759d515a-787d-4e1d-9f71-87a701f55177","resolution":{"observed_at":"2026-07-08T09:54:50.914421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:07.147109+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:07.147109+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-08T09:54:51.226752Z","title":"Princeton, NJ: Princeton University Press, 1957, pp","venue":null,"work_id":"bc848d18-0bbf-4644-ad04-6522b20608df","year":1957},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:c2ece00780c095ef64990644b1ffabc642bfcf47a95fdd6a22b6cbdaba69ea2e","observation_id":"e9c1bd2a-fd5d-4f31-8043-746f69a7307e","resolution":{"observed_at":"2026-07-08T09:54:51.228911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-14162-1_46","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fearnley , title =","venue":"Lecture notes in computer science","work_id":"cd4bd729-9d13-4905-a35b-7a2ec4378817","year":2010},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:14d05e9d328a319d36257bcaabc8147a33602589f1d3c99391ec71b8a682aba9","observation_id":"47497c4d-64d0-4f4b-992b-8f5c0954fa78","resolution":{"observed_at":"2026-07-08T09:54:50.916978Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:07.379645+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:07.379645+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10009-019-00509-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, 34:1–34:15.doi:10","venue":"International Journal on Software Tools for Technology Transfer","work_id":"5572c3d8-6d44-41fb-833b-b4814df83956","year":2020},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:dc96ec5d799644aab1aee29069a82f11aadc16ddc05608ec5ca6f8da575f0dc3","observation_id":"153c8d73-3a14-414a-a1f5-0686e0aeefdc","resolution":{"observed_at":"2026-07-08T09:54:50.899564Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:07.72126+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:07.72126+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rsa.10034","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Randomized Optimization by Simplex Type Methods","venue":"Random Structures and Algorithms","work_id":"6e44d6c5-75fd-4410-91f5-d63154c75567","year":1988},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:f208a2b21f9f1bf370b051ba4ee1f4e5a040cc5c23f6a18d725b969b14a7b1fd","observation_id":"e145b68e-beaf-4b97-9c18-8c9ee3392566","resolution":{"observed_at":"2026-07-08T09:54:50.903121Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:07.952964+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:07.952964+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.01953","last_updated":"2017-04-24T08:26:37Z","snapshot_observed_at":"2026-07-06T05:29:05.528612Z","submitted_at":"2017-02-07T10:49:57Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","version":4},"cited_work":{"arxiv_id":"1702.01953","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.01953","snapshot_observed_at":"2026-07-08T09:54:50.946446Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","venue":"cs.FL","work_id":"0a72a81d-20dd-4bb1-b290-e143263d158b","year":2017},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"cited_paper":"/paper/1702.01953","citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:d939f366f94d294c72ca7de8f47538bc1d1ca676af09aa39f0185e00c407cfb3","observation_id":"6e358343-e26d-4565-b2e1-8e3e230b0208","resolution":{"observed_at":"2026-07-08T09:54:50.948504Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-007-9090-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Princeton, NJ: Princeton University Press, 1957, pp","venue":"Algorithmica","work_id":"f2ed41d8-5c2a-4b0b-83bd-40f2372cd984","year":1957},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:424d4900f38851c0b48c5955533b8bfae34ea278cc58d6d9db354152ee0d8889","observation_id":"4dd76126-8a3a-4975-bc7c-9821056e0cf3","resolution":{"observed_at":"2026-07-08T09:54:50.881927Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:08.254839+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:08.254839+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T09:54:50.871937Z","title":"Thegreatestcommondivisor:acasestudy for program extraction from classical proofs","venue":null,"work_id":"fa1905d6-3347-4ba2-9b5f-0d4c184ada97","year":2002},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:54c2221c4cc669da008834ecaa4bff7aef1866539aa10364e9a1b4568e57a724","observation_id":"de5f4580-9821-4b0f-b22b-442ce0adabc0","resolution":{"observed_at":"2026-07-08T09:54:50.874083Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6539.274655","doi":"10.1145/2746539.2746551","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Razenshteyn","venue":null,"work_id":"2c02d016-3e89-4ead-b2bf-aaadd5aae5a1","year":2015},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:9dcc54f59d2855176c3003bca482fce094387e7426fbe81e46b234307ccd315f","observation_id":"5488f570-19e0-49ba-97ae-02caef06d4c5","resolution":{"observed_at":"2026-07-08T09:54:50.931279Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0097-3165(81)90049-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"639–648.doi:10","venue":"Journal of Combinatorial Theory Series A","work_id":"e4156aad-4678-4d21-9d08-28769bd043b6","year":2018},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:9b45de0ee684eb3c0585f67a258ed1259159e48f2be5eda01bc65c87aa56a7fe","observation_id":"5e546685-15c6-4c7f-8aea-ed79e311d75c","resolution":{"observed_at":"2026-07-08T09:54:50.925054Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:08.714275+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:08.714275+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/9780470316887","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T09:06:59.010744Z","title":"Wiley Series in Probability and Statistics, Wiley (1994)","venue":"Wiley Series in Probability and Statistics","work_id":"02ff1fe9-a285-487d-a56f-1e5ddd479dd7","year":1994},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:66fd304612cb996902ede1403bbd34be3c785124f025994a0894f7c0b7d0e4f0","observation_id":"5e3c63fa-79b9-40ba-930a-f13192de2f1f","resolution":{"observed_at":"2026-07-08T09:54:50.922281Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-18T13:51:14.01528+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T13:51:14.01528+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.0753","doi":"10.1287/moor.2015.0753","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematics of Operations Research","work_id":"5bb2a2fa-a53e-4bed-bbc3-356c7f2896cf","year":2016},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:b6951fb82f548be515a713c450edadca1c4f4c0a54359ab80ce809811e5b12ad","observation_id":"060935af-7296-4ca9-b656-05f402970d48","resolution":{"observed_at":"2026-07-08T09:54:50.935412Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:09.178245+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:09.178245+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/9781009029704","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[SW01] Tibor Szabó and Emo Welzl.Unique Sink Orientations of Cubes","venue":"Cambridge University Press eBooks","work_id":"9710b161-15c1-4dc9-a02a-5cf00211fc3b","year":2022},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:a9cbb056630513f023221f2fdb1b6ee325a7d71872611821ea218ea9f96ef367","observation_id":"0f5c516a-162d-450a-99bc-48a7a79d6bc5","resolution":{"observed_at":"2026-07-08T09:54:50.919312Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:09.401678+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:09.401678+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/gsm/140","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Teschl, Ordinary Differential Equations and Dynamical Systems, Vol","venue":"Graduate studies in mathematics","work_id":"6a88a6ac-d894-430f-bd13-4eb38971aa17","year":2012},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:b45f11b8f9262af0a978da427bad76e9702151073dc42b53c3dcc5b4e2c54c9d","observation_id":"6ea08ac5-701d-4e3a-bbf3-08411f66dd08","resolution":{"observed_at":"2026-07-08T09:54:50.870632Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:09.634736+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:09.634736+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4612-0601-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A trajectory-based classification of ERA-Interim ice clouds in the region of the North Atlantic storm track","venue":"Graduate texts in mathematics","work_id":"82b5a0af-ef81-45d3-b328-cbdf23119f80","year":1998},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:cba505f7db9481edc7e674ff2f292eb0db134588d15d579af717fcb5083e09d3","observation_id":"27928f16-6708-4587-a464-968d7014a814","resolution":{"observed_at":"2026-07-08T09:54:50.879041Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-10T22:20:09.869947+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T22:20:09.869947+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T09:47:49.192518Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":2,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":0,"verified_exact":13,"verified_fuzzy":1},"total_outbound_references":22},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2607.06334."}