{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T02:03:53Z","timestamp":1780452233800,"version":"3.54.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018978","name":"Indian Institute of Technology Ropar","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018978","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116073","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T06:31:52Z","timestamp":1780122712000},"page":"116073","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Pebble guided rendezvous despite fault"],"prefix":"10.1016","volume":"1081","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4767-8862","authenticated-orcid":false,"given":"Ashish","family":"Saxena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barun","family":"Gorain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhrangsu","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116073_bib0001","series-title":"Stabilization, Safety, and Security of Distributed Systems","article-title":"Brief announcement: pebble guided rendezvous despite fault","author":"Saxena","year":"2025"},{"issue":"1","key":"10.1016\/j.tcs.2026.116073_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3280823","article-title":"Deterministic graph exploration with advice","volume":"15","author":"Gorain","year":"2018","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.116073_bib0003","series-title":"Principles of Distributed Systems","first-page":"263","article-title":"Tradeoffs between cost and information for rendezvous and treasure hunt","author":"Miller","year":"2014"},{"key":"10.1016\/j.tcs.2026.116073_bib0004","series-title":"The Strategy of Conflict","volume":"Vol. 55","author":"Schelling","year":"1960"},{"issue":"1","key":"10.1016\/j.tcs.2026.116073_bib0005","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","article-title":"Deterministic rendezvous in graphs","volume":"46","author":"Dessmark","year":"2006","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.tcs.2026.116073_bib0006","doi-asserted-by":"crossref","DOI":"10.1145\/2601068","article-title":"Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences","volume":"10","author":"Ta-Shma","year":"2014","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.116073_bib0007","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/3214827","article-title":"The rendezvous problem on discrete locations","volume":"28","author":"Anderson","year":"1990","journal-title":"J. Appl. Probab."},{"key":"10.1016\/j.tcs.2026.116073_bib0008","series-title":"Proceedings of the Fourteenth Annual Symposium on Computational Geometry","first-page":"365","article-title":"Asymmetric rendezvous on the plane","author":"Anderson","year":"1998"},{"key":"10.1016\/j.tcs.2026.116073_bib0009","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","article-title":"Two dimensional rendezvous search","volume":"49","author":"Edward J. Anderson","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2026.116073_bib0010","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02798690","article-title":"Yet more on the linear search problem","volume":"8","author":"Anatole Beck","year":"1970","journal-title":"Israel J. Math"},{"issue":"2","key":"10.1016\/j.tcs.2026.116073_bib0011","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","article-title":"Online searching with turn cost","volume":"361","author":"Demaine","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116073_bib0012","series-title":"29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16\u201319, 2018, Jiaoxi, Yilan, Taiwan","first-page":"48:1","article-title":"Deterministic treasure hunt in the plane with angular hints","volume":"vol. 123","author":"Bouchard","year":"2018"},{"key":"10.1016\/j.tcs.2026.116073_bib0013","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2022.04.011","article-title":"Pebble guided optimal treasure hunt in anonymous graphs","volume":"922","author":"Gorain","year":"2022","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"10.1016\/j.tcs.2026.116073_bib0014","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","article-title":"Tree exploration with advice","volume":"206","author":"Fraigniaud","year":"2008","journal-title":"Inf. Comput."},{"issue":"24","key":"10.1016\/j.tcs.2026.116073_bib0015","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","article-title":"Online computation with advice","volume":"412","author":"Emek","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116073_bib0016","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","article-title":"How many ants does it take to find the food?","volume":"608","author":"Emek","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116073_bib0017","series-title":"Stabilization, Safety, and Security of Distributed Systems","first-page":"99","article-title":"Treasure hunt in graph using pebbles","author":"Bhattacharya","year":"2022"},{"key":"10.1016\/j.tcs.2026.116073_bib0018","series-title":"Structural Information and Communication Complexity","first-page":"161","article-title":"Mobile agents rendezvous when tokens fail","author":"Flocchini","year":"2004"},{"key":"10.1016\/j.tcs.2026.116073_bib0019","series-title":"Distributed Computing and Networking","first-page":"292","article-title":"Mobile agent rendezvous in a ring using faulty tokens","author":"Das","year":"2008"},{"issue":"2","key":"10.1016\/j.tcs.2026.116073_bib0020","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.tcs.2008.04.034","article-title":"Memoryless search algorithms in a network with faulty advice","volume":"402","author":"Hanusse","year":"2008","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10.1016\/j.tcs.2026.116073_bib0021","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ipl.2012.03.017","article-title":"Deterministic network exploration by a single agent with Byzantine tokens","volume":"112","author":"Dieudonn\u00e9","year":"2012","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.116073_bib0022","series-title":"37th International Symposium on Distributed Computing, DISC 2023, October 10\u201312, 2023, L\u2019Aquila, Italy","first-page":"8:1","article-title":"Treasure hunt with volatile pheromones","volume":"vol. 281","author":"Bampas","year":"2023"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:11:54Z","timestamp":1780449114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":22,"alternative-id":["S0304397526003233"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116073","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pebble guided rendezvous despite fault","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116073","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116073"}}