{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:22Z","timestamp":1781031442421,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2327010"],"award-info":[{"award-number":["CCF-2327010"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2440113"],"award-info":[{"award-number":["CCF-2440113"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800835","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1242-1253","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Secretary, Prophet, and Stochastic Probing via Big-Decisions-First"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6900-8612","authenticated-orcid":false,"given":"Aviad","family":"Rubinstein","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-6479","authenticated-orcid":false,"given":"Sahil","family":"Singla","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.GEB.2018.05.006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212512"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283429"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing","volume":"49","author":"Bradac Domagoj","year":"2019","unstructured":"Domagoj Bradac, Sahil Singla, and Goran Zuzic. 2019. (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. In Proceedings of APPROX\/RANDOM. 49:1\u201349:21.","journal-title":"Proceedings of APPROX\/RANDOM."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Ning Chen Nicole Immorlica Anna R Karlin Mohammad Mahdian and Atri Rudra. 2009. Approximating matches made in heaven. In International colloquium on automata languages and programming. 266\u2013278.","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_3_2_1_9_1","volume-title":"The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl, 4","author":"Dynkin E. B.","year":"1963","unstructured":"E. B. Dynkin. 1963. The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl, 4 (1963)."},{"key":"e_1_3_2_1_10_1","unstructured":"F. Echenique N. Immorlica and V. V. Vazirani. 2023. Online and Matching-Based Market Design. Cambridge University Press."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996452"},{"key":"e_1_3_2_1_12_1","first-page":"205","article-title":"A Stochastic Probing Problem with Applications","volume":"7801","author":"Gupta Anupam","year":"2013","unstructured":"Anupam Gupta and Viswanath Nagarajan. 2013. A Stochastic Probing Problem with Applications. In Proceedings of IPCO. 7801, 205\u2013216.","journal-title":"Proceedings of IPCO."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch120"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.111"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435.015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649734"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_18_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel U.","year":"1978","unstructured":"U. Krengel and L. Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Advances in Probability and Related Topics, 4 (1978), 197\u2013266.","journal-title":"Advances in Probability and Related Topics"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2504.15547"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Submodular Norms with Applications To Online Facility Location and Stochastic Probing","volume":"275","author":"Patton Kalen","year":"2023","unstructured":"Kalen Patton, Matteo Russo, and Sahil Singla. 2023. Submodular Norms with Applications To Online Facility Location and Stochastic Probing. In Proceedings of APPROX\/RANDOM. 275, 23:1\u201323:22.","journal-title":"Proceedings of APPROX\/RANDOM."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.110"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167279"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800835","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:02:56Z","timestamp":1781028176000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":25,"alternative-id":["10.1145\/3798129.3800835","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800835","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}