{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JV6OEEJB72NHCVX6N5LISHPV57","short_pith_number":"pith:JV6OEEJB","schema_version":"1.0","canonical_sha256":"4d7ce21121fe9a7156fe6f56891df5eff5fe857b7cb91fa7328c6e751521f666","source":{"kind":"arxiv","id":"2607.06334","version":1},"attestation_state":"computed","paper":{"title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Uri Zwick","submitted_at":"2026-07-07T14:29:47Z","abstract_excerpt":"We give a concise description and an improved analysis of the Random-Action-Removal algorithm for solving 2-player, 0-sum, turn-based, possibly infinite duration, stochastic or non-stochastic games played on graphs, or on finite sets of states. More generally, the algorithm can be used to find the sink of an Acyclic Unique Sink Orientation (AUSO) of a non-binary hypercube. The families of games that can be solved by the algorithm include discounted and non-discounted stochastic games (SGs) and Mean Payoff Games (MPGs). The obtained algorithm is the fastest known randomized algorithm for solvin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.06334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T14:29:47Z","cross_cats_sorted":[],"title_canon_sha256":"154b6f30ec967a2558a91a350a7e5444175d9ab26c2379c187894b827f16eb83","abstract_canon_sha256":"cca4192f5ab696934518a68a87432f76c8d26b36c49773ee1d7db404d4428c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:21.675396Z","signature_b64":"sPtL7cYNZe1PNomZd7CQM8VYl6hEPW1qSp5+QAPwsnJlt2Vm6endSRrBFawpY1XFtXqnmdOpXm7TKDI1EZzeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d7ce21121fe9a7156fe6f56891df5eff5fe857b7cb91fa7328c6e751521f666","last_reissued_at":"2026-07-08T01:19:21.674954Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:21.674954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Uri Zwick","submitted_at":"2026-07-07T14:29:47Z","abstract_excerpt":"We give a concise description and an improved analysis of the Random-Action-Removal algorithm for solving 2-player, 0-sum, turn-based, possibly infinite duration, stochastic or non-stochastic games played on graphs, or on finite sets of states. More generally, the algorithm can be used to find the sink of an Acyclic Unique Sink Orientation (AUSO) of a non-binary hypercube. The families of games that can be solved by the algorithm include discounted and non-discounted stochastic games (SGs) and Mean Payoff Games (MPGs). The obtained algorithm is the fastest known randomized algorithm for solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06334","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.06334/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.06334","created_at":"2026-07-08T01:19:21.675015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06334v1","created_at":"2026-07-08T01:19:21.675015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06334","created_at":"2026-07-08T01:19:21.675015+00:00"},{"alias_kind":"pith_short_12","alias_value":"JV6OEEJB72NH","created_at":"2026-07-08T01:19:21.675015+00:00"},{"alias_kind":"pith_short_16","alias_value":"JV6OEEJB72NHCVX6","created_at":"2026-07-08T01:19:21.675015+00:00"},{"alias_kind":"pith_short_8","alias_value":"JV6OEEJB","created_at":"2026-07-08T01:19:21.675015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57","json":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57.json","graph_json":"https://pith.science/api/pith-number/JV6OEEJB72NHCVX6N5LISHPV57/graph.json","events_json":"https://pith.science/api/pith-number/JV6OEEJB72NHCVX6N5LISHPV57/events.json","paper":"https://pith.science/paper/JV6OEEJB"},"agent_actions":{"view_html":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57","download_json":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57.json","view_paper":"https://pith.science/paper/JV6OEEJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06334&json=true","fetch_graph":"https://pith.science/api/pith-number/JV6OEEJB72NHCVX6N5LISHPV57/graph.json","fetch_events":"https://pith.science/api/pith-number/JV6OEEJB72NHCVX6N5LISHPV57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57/action/storage_attestation","attest_author":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57/action/author_attestation","sign_citation":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57/action/citation_signature","submit_replication":"https://pith.science/pith/JV6OEEJB72NHCVX6N5LISHPV57/action/replication_record"}},"created_at":"2026-07-08T01:19:21.675015+00:00","updated_at":"2026-07-08T01:19:21.675015+00:00"}