{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:26Z","timestamp":1743071126787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031191343"},{"type":"electronic","value":"9783031191350"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19135-0_7","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:03:49Z","timestamp":1665529429000},"page":"93-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Stochastic Arrival Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Webster","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992)","journal-title":"Inf. Comput."},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1137\/020504","volume":"5","author":"L Csanky","year":"1976","unstructured":"Csanky, L.: Fast parallel matrix inversion algorithms. SIAM J. Comput. 5(4), 618\u2013623 (1976). https:\/\/doi.org\/10.1137\/020504","journal-title":"SIAM J. Comput."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-44479-6_14","volume-title":"A Journey Through Discrete Mathematics","author":"J Dohrau","year":"2017","unstructured":"Dohrau, J., G\u00e4rtner, B., Kohler, M., Matou\u0161ek, J., Welzl, E.: ARRIVAL: a zero-player graph game in $${\\sf NP}\\cap {\\sf coNP}$$. In: Loebl, M., Ne\u0161et\u0159il, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 367\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-44479-6_14"},{"unstructured":"Fearnley, J., Gairing, M., Mnich, M., Savani, R.: Reachability switching games. Log. Methods Comput. Sci. 17(2) (2021)","key":"7_CR4"},{"unstructured":"Fearnley, J., Gordon, S., Mehta, R., Savani, R.: Unique end of potential line. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), LIPIcs, vol. 132, pp. 1\u201315 (2019)","key":"7_CR5"},{"unstructured":"G\u00e4rtner, B., Hansen, T.D., Hub\u00e1cek, P., Kr\u00e1l, K., Mosaad, H., Sl\u00edvov\u00e1, V.: ARRIVAL: next stop in CLS. In: 45th International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 107, pp. 1\u201313 (2018)","key":"7_CR6"},{"unstructured":"G\u00e4rtner, B., Haslebacher, S., Hoang, H.P.: A subexponential algorithm for ARRIVAL. In: 48th International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, pp. 1\u201314 (2021)","key":"7_CR7"},{"doi-asserted-by":"crossref","unstructured":"Gill, J.T.: Computational complexity of probabilistic turing machines. In: Proceedings of the sixth annual ACM Symposium on Theory of Computing, pp. 91\u201395. STOC, ACM Press (1974)","key":"7_CR8","DOI":"10.1145\/800119.803889"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in $${\\sf UP}\\cap {\\sf coUP}$$. Inf. Process. Lett. 68(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Karthik, C.S.: Did the train reach its destination: the complexity of finding a witness. Inf. Process. Lett. 121, 17\u201321 (2017)","key":"7_CR10","DOI":"10.1016\/j.ipl.2017.01.004"},{"unstructured":"Manuell, G.: A simple lower bound for ARRIVAL. arXiv preprint arXiv:2108.06273 (2021)","key":"7_CR11"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci. 31(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Simon, J.: On some central problems in computational complexity, Ph. D. thesis, Cornell University (1975)","key":"7_CR13"},{"issue":"1\u20132","key":"7_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1\u20132), 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19135-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:09:43Z","timestamp":1665529783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19135-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031191343","9783031191350"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19135-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaiserslautern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2022.mpi-sws.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited talks are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}