Paper Citation Record · LEDGER

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound

As of 9 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2507.15658.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2507.15658 v1

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T15:45:55.580359Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

31 of 31 outbound references displayed

verified exact1
verified fuzzy25
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d9ba3bbb-be29-4512-911a-cc474efe374d · outbound

This paper cites The continuum random tree iii.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound The continuum random tree iii

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.092024Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 57a465b0-ee7d-4c8c-92af-53f1f710ec37 · outbound

This paper cites Search Games with Predictions.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Search Games with Predictions

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T15:45:55.442396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 997e955a-84f9-4489-b256-63225d6a4a05 · outbound

This paper cites Graph Searching with Predictions.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Graph Searching with Predictions

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-06T15:45:55.644719Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e3373717-e440-4807-aba1-034b811ae041 · outbound

This paper cites Multirobot tree and graph exploration.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Multirobot tree and graph exploration

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.076746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b1769b49-78df-403b-a789-c29d4413bf0c · outbound

This paper cites Shortest paths without a map, but with an entropic regularizer.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Shortest paths without a map, but with an entropic regularizer

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.062031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 331af32a-6e31-4691-8740-f80adf74c372 · outbound

This paper cites The randomized k-server conjecture is false! In Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages 581--594, 2023.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound The randomized k-server conjecture is false! In Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages 581--594, 2023

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.046095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation fdbff82e-2ecc-4aa3-ae7d-55e3d4c27320 · outbound

This paper cites On the power of randomization in on-line algorithms.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound On the power of randomization in on-line algorithms

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.031069Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e9d58095-2708-4066-b26b-4927a595805a · outbound

This paper cites A nearly optimal randomized algorithm for explorable heap selection.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound A nearly optimal randomized algorithm for explorable heap selection

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.015287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f4876fd0-3d1d-4b71-a2f4-5ac70ab034fa · outbound

This paper cites Exploration of graphs with excluded minors.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Exploration of graphs with excluded minors

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:56.000785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 52aaf76c-3c62-4335-951e-7300b9446ede · outbound

This paper cites Flex: an adaptive exploration algorithm for nonlinear systems.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Flex: an adaptive exploration algorithm for nonlinear systems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.985070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5f89ea50-4117-40a6-9b85-c020b404a4ab · outbound

This paper cites Traversing layered graphs using the work function algorithm.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Traversing layered graphs using the work function algorithm

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.969816Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 564b51e2-5aa3-422d-aee8-39496312f81e · outbound

This paper cites Improved analysis of a multirobot graph exploration strategy.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Improved analysis of a multirobot graph exploration strategy

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.953559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1b15adb6-b59a-4d11-adce-1d49fc95419a · outbound

This paper cites Barely random algorithms and collective metrical task systems.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Barely random algorithms and collective metrical task systems

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.936762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6eae04a8-a3e5-497a-a870-f8ff716a0d6c · outbound

This paper cites Collective tree exploration via potential function method.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Collective tree exploration via potential function method

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.921285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 21468676-bf93-4da6-8b60-57ff279a239b · outbound

This paper cites Efficient collaborative tree exploration with breadth-first depth-next.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Efficient collaborative tree exploration with breadth-first depth-next

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.901335Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3b2ace4e-c9e9-446b-968c-c8b71f8bd748 · outbound

This paper cites Breaking the k/log k barrier in collective tree exploration via tree-mining.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Breaking the k/log k barrier in collective tree exploration via tree-mining

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.885716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b4824c8c-7bda-4554-b2f9-caa90102c665 · outbound

This paper cites Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-06T15:45:55.510080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d4eda84-9832-4984-aaca-8fed15ed50f2 · outbound

This paper cites Fast collaborative graph exploration.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Fast collaborative graph exploration

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.870466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 61d26944-65a5-469b-bc84-355861a8a187 · outbound

This paper cites Smart robot teams exploring sparse trees.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Smart robot teams exploring sparse trees

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.854340Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 31fd461a-e6b2-416d-b8ee-7ece507d8716 · outbound

This paper cites Power-aware collective tree exploration.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Power-aware collective tree exploration

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.839323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation fc7202bc-988e-478f-8018-d3973aff0ba6 · outbound

This paper cites Why robots need maps.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Why robots need maps

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.821771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3a454c41-6e42-4d87-813a-cd636664a975 · outbound

This paper cites A general lower bound for collaborative tree exploration.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound A general lower bound for collaborative tree exploration

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.805561Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 7215329f-785c-4b6e-9499-9a8eede51732 · outbound

This paper cites Competitive algorithms for layered graph traversal.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Competitive algorithms for layered graph traversal

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.789397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3e084a60-724b-4ab4-a7c6-3ee0da91216e · outbound

This paper cites Kowalski, and Andrzej Pelc.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Kowalski, and Andrzej Pelc

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.772174Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3657641c-1ba0-44f5-bea1-5c2619815b09 · outbound

This paper cites Online graph exploration algorithms for cycles and trees by multiple searchers.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Online graph exploration algorithms for cycles and trees by multiple searchers

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.756527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cbc87539-7555-4f7e-9fe4-c3187d59bfa0 · outbound

This paper cites A recursive approach to multi-robot exploration of trees.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound A recursive approach to multi-robot exploration of trees

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.741520Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ee743e9b-aaf5-49fe-b67c-78a8da6567b0 · outbound

This paper cites Papadimitriou and Mihalis Yannakakis.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Papadimitriou and Mihalis Yannakakis

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.725422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 56ffeacc-5824-48a1-b761-a56dfe0090cc · outbound

This paper cites On traversing layered graphs on-line.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound On traversing layered graphs on-line

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T15:45:55.709779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a4f9de1c-f48e-46aa-875f-867df9ba5166 · outbound

This paper cites Beyond the worst-case analysis of algorithms.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Beyond the worst-case analysis of algorithms

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-06T15:45:55.571364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3dc39f1-a312-4d2e-a295-0d77fe3a3155 · outbound

This paper cites Chain-of-thought prompting elicits reasoning in large language models.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Chain-of-thought prompting elicits reasoning in large language models

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-06T15:45:55.575873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20d38ebb-a9b1-44e6-8e41-d686157c77a4 · outbound

This paper cites Tree of thoughts: Deliberate problem solving with large language models.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Tree of thoughts: Deliberate problem solving with large language models

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-06T15:45:55.580359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.