{"as_of":"2026-08-09T20:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45564c7278af145143a90ccd1b65f65478e5d8ec26d077317146fa3f5d483d94","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:45:55.580359Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.15658/citation-record","integrity":"/paper/2507.15658/integrity","json":"/paper/2507.15658/citation-record.json","paper":"/paper/2507.15658"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.087786Z","title":"The continuum random tree iii","venue":null,"work_id":"7b73445e-44da-495a-b44c-89bb9cca3b49","year":1993},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.436867Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:354e8453aa639be33d975c16449b54c68c51d69938d7f579d3b98d1169e580b9","observation_id":"d9ba3bbb-be29-4512-911a-cc474efe374d","resolution":{"observed_at":"2026-08-06T15:45:56.092024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","snapshot_observed_at":"2026-07-06T17:10:48.157731Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01149","snapshot_observed_at":"2026-08-06T15:45:55.442396Z","title":"Search games with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.442396Z"},"links":{"cited_paper":"/paper/2401.01149","citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:8d96d33153a90182ae751d9a2117d77f49fd7afc2f0a8b30a3202cc9fda86d87","observation_id":"57a465b0-ee7d-4c8c-92af-53f1f710ec37","resolution":{"observed_at":"2026-08-06T15:45:55.442396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14220","last_updated":"2022-12-29T08:41:45Z","snapshot_observed_at":"2026-08-07T05:46:24.754775Z","submitted_at":"2022-12-29T08:41:45Z","title":"Graph Searching with Predictions","version":1},"cited_work":{"arxiv_id":"2212.14220","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.14220","snapshot_observed_at":"2026-08-06T15:45:55.637886Z","title":"Graph Searching with Predictions","venue":"cs.DS","work_id":"90d4138e-1560-48f8-bbd4-6e613e2f6a74","year":2022},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.447631Z"},"links":{"cited_paper":"/paper/2212.14220","citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:a572fb94e3f0324e41895e99c69450766c039aa8a831ea78bebd3763a8572b9c","observation_id":"997e955a-84f9-4489-b256-63225d6a4a05","resolution":{"observed_at":"2026-08-06T15:45:55.644719Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.072184Z","title":"Multirobot tree and graph exploration","venue":null,"work_id":"52a1d36d-cccf-44e1-b1e7-c6372b2d9fb1","year":2011},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.452480Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:1e66db521e5a1f226c06681bc7d882cb1585469033e002125205c2061503967d","observation_id":"e3373717-e440-4807-aba1-034b811ae041","resolution":{"observed_at":"2026-08-06T15:45:56.076746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.057292Z","title":"Shortest paths without a map, but with an entropic regularizer","venue":null,"work_id":"289f0a1c-f49d-441a-b190-9474cad39a36","year":2022},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.457728Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:5f8e6efbd4c9bd07ea3e61980815572c37a76c52c8fc38d987bdbf2de91c3d51","observation_id":"b1769b49-78df-403b-a789-c29d4413bf0c","resolution":{"observed_at":"2026-08-06T15:45:56.062031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.041611Z","title":"The randomized k-server conjecture is false! In Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages 581--594, 2023","venue":null,"work_id":"cb7e0eb5-0ac6-4f7d-8771-cb4fff3c3a38","year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.462217Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:4fface7debc1c5a23c661821ab2f73b6cd1b3c259a209f85c239f758e365b9cc","observation_id":"331af32a-6e31-4691-8740-f80adf74c372","resolution":{"observed_at":"2026-08-06T15:45:56.046095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.026166Z","title":"On the power of randomization in on-line algorithms","venue":null,"work_id":"2120c7a5-9d9d-4d67-8d43-d63d2101eecd","year":1994},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.467366Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:b73e129742e91c77fd7107f463c09f2d1d31168aa1caa9b0d8c4f11d3eee0e7e","observation_id":"fdbff82e-2ecc-4aa3-ae7d-55e3d4c27320","resolution":{"observed_at":"2026-08-06T15:45:56.031069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:56.010793Z","title":"A nearly optimal randomized algorithm for explorable heap selection","venue":null,"work_id":"86b30d55-44e0-43af-bcdc-7d66c3371878","year":2025},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.471514Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:599845c25d2061047a0e8e5424b0fa52432eb5345ade5deea898d740fee2e73a","observation_id":"e9d58095-2708-4066-b26b-4927a595805a","resolution":{"observed_at":"2026-08-06T15:45:56.015287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.996236Z","title":"Exploration of graphs with excluded minors","venue":null,"work_id":"41f0a999-3bcd-404b-8cf5-f6e33c1d8fe0","year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.475451Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:2e97747d44135fc95618b8c971f61b8e785e566d8483a99ed8554084a4f0763f","observation_id":"f4876fd0-3d1d-4b71-a2f4-5ac70ab034fa","resolution":{"observed_at":"2026-08-06T15:45:56.000785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.980460Z","title":"Flex: an adaptive exploration algorithm for nonlinear systems","venue":null,"work_id":"57978957-ba62-49dd-ae3a-ff84da923b93","year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.479764Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:c9bdf8fe91eccdd02b7e05327ec0406681e18162c98aab76df58f839a19fa078","observation_id":"52aaf76c-3c62-4335-951e-7300b9446ede","resolution":{"observed_at":"2026-08-06T15:45:55.985070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.964632Z","title":"Traversing layered graphs using the work function algorithm","venue":null,"work_id":"d539442d-960b-4c07-8733-f1e5b612c29f","year":1996},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.484085Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:8b34297a01b804303f27213a8cf69524f7452f8304dd27f79e4a3e0cd16d6001","observation_id":"5f89ea50-4117-40a6-9b85-c020b404a4ab","resolution":{"observed_at":"2026-08-06T15:45:55.969816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.948693Z","title":"Improved analysis of a multirobot graph exploration strategy","venue":null,"work_id":"55789f6c-c602-490f-8482-a3ee18f79c7a","year":1906},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.488078Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:03d51d5e9bb502c85f540bd6e074a4bb09ce6cea376e964b7bfc305d57813789","observation_id":"564b51e2-5aa3-422d-aee8-39496312f81e","resolution":{"observed_at":"2026-08-06T15:45:55.953559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.931914Z","title":"Barely random algorithms and collective metrical task systems","venue":null,"work_id":"7a615a92-5fb2-4259-974e-1d105dc6836a","year":2024},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.492301Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:c345e140c6d675750db2134d8ca8092e786527868f36c71f35ddbbbf36a71001","observation_id":"1b15adb6-b59a-4d11-adce-1d49fc95419a","resolution":{"observed_at":"2026-08-06T15:45:55.936762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.914159Z","title":"Collective tree exploration via potential function method","venue":null,"work_id":"f65b053e-5c9d-4b50-acd8-10ce412cd2b6","year":2024},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.496626Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:d8eec9a27f49bee19c707580a4da841498ee74c0b2ead2ed757ee5c2db147c4d","observation_id":"6eae04a8-a3e5-497a-a870-f8ff716a0d6c","resolution":{"observed_at":"2026-08-06T15:45:55.921285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.896406Z","title":"Efficient collaborative tree exploration with breadth-first depth-next","venue":null,"work_id":"7daa0e43-baec-4339-bc75-d58d427bd83f","year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.501135Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:5cded2c49be0bbaf00d5a283ba7910d56331aca451d396a32fdb0884e22f6d10","observation_id":"21468676-bf93-4da6-8b60-57ff279a239b","resolution":{"observed_at":"2026-08-06T15:45:55.901335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.880596Z","title":"Breaking the k/log k barrier in collective tree exploration via tree-mining","venue":null,"work_id":"db23aa06-f222-41aa-ba5e-46ba54416c83","year":2024},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.505511Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:ccb581505f49e3f5333fe0e4c0683347136feda766d69d6434dd7ea62ca00fe1","observation_id":"3b2ace4e-c9e9-446b-968c-c8b71f8bd748","resolution":{"observed_at":"2026-08-06T15:45:55.885716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05029","last_updated":"2023-10-08T06:18:14Z","snapshot_observed_at":"2026-08-08T12:19:42.193742Z","submitted_at":"2023-10-08T06:18:14Z","title":"Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05029","snapshot_observed_at":"2026-08-06T15:45:55.510080Z","title":"Walking down the memory maze: Beyond context limit through interactive reading","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.510080Z"},"links":{"cited_paper":"/paper/2310.05029","citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:50dd142848ea633c87a26ce9a7e9193730332a929595d342b143b41044142308","observation_id":"b4824c8c-7bda-4554-b2f9-caa90102c665","resolution":{"observed_at":"2026-08-06T15:45:55.510080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.865940Z","title":"Fast collaborative graph exploration","venue":null,"work_id":"ab8ebc0b-b852-4c09-8573-ac3a12ddf5b3","year":2013},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.515367Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:93a33429c9b2e267136aef365f474e8b5e2d9d0df001b1c365547a62ecbf0034","observation_id":"4d4eda84-9832-4984-aaca-8fed15ed50f2","resolution":{"observed_at":"2026-08-06T15:45:55.870466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.849904Z","title":"Smart robot teams exploring sparse trees","venue":null,"work_id":"0df55fa1-e122-4439-8bcf-25e4ee78e6e8","year":2006},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.520583Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:d1f41da7c2be67a194c7170aa5f3fc485f1cf29b86b0295fd8733c46640c80aa","observation_id":"61d26944-65a5-469b-bc84-355861a8a187","resolution":{"observed_at":"2026-08-06T15:45:55.854340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.832110Z","title":"Power-aware collective tree exploration","venue":null,"work_id":"09719b95-4b50-4232-9ba4-e4e4c141ad7c","year":2006},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.525623Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:a45c5d658b3eb2e10c48e2f846be0ed8d9314588120f0ca2dddc4cd79650a78a","observation_id":"31fd461a-e6b2-416d-b8ee-7ece507d8716","resolution":{"observed_at":"2026-08-06T15:45:55.839323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.817118Z","title":"Why robots need maps","venue":null,"work_id":"ac1ace90-644c-4baf-8a02-46a96c94be3d","year":2007},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.530841Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:2143745a3ce23b9a1ee9be918434bcda469b17fbbf51c4014bc008611b9f5a67","observation_id":"fc7202bc-988e-478f-8018-d3973aff0ba6","resolution":{"observed_at":"2026-08-06T15:45:55.821771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.799972Z","title":"A general lower bound for collaborative tree exploration","venue":null,"work_id":"7ae67031-30f4-45dd-88c3-7cf8fe01f00f","year":2017},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.535380Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:d637f34fa5b91c8ec5cc7e6095ae399e522dd376a7344b37499c6e4d34d1f0f7","observation_id":"3a454c41-6e42-4d87-813a-cd636664a975","resolution":{"observed_at":"2026-08-06T15:45:55.805561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.784179Z","title":"Competitive algorithms for layered graph traversal","venue":null,"work_id":"cafd52d9-d65e-4d90-8174-e91950b468a2","year":1991},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.540839Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:8bc2306ae3e055cc17e682a4cb8bfc6b8a94ce860a32f2bec6f800f01cfa6c35","observation_id":"7215329f-785c-4b6e-9499-9a8eede51732","resolution":{"observed_at":"2026-08-06T15:45:55.789397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.767360Z","title":"Kowalski, and Andrzej Pelc","venue":null,"work_id":"901802a2-c720-4236-9db8-771e0651a121","year":2006},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.546804Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:67f297baf949e4ee24ee4ba77473fba6907e3e0e8340cddcf14ec38d0d36a616","observation_id":"3e084a60-724b-4ab4-a7c6-3ee0da91216e","resolution":{"observed_at":"2026-08-06T15:45:55.772174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.752121Z","title":"Online graph exploration algorithms for cycles and trees by multiple searchers","venue":null,"work_id":"0cd4527d-64b6-4393-8531-4dc62f894ee3","year":2014},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.551090Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:f7f3658f03f1b8acf4cdc561c3ed78c4a8654fbb049f4cb1215d9e7da12416f4","observation_id":"3657641c-1ba0-44f5-bea1-5c2619815b09","resolution":{"observed_at":"2026-08-06T15:45:55.756527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.736887Z","title":"A recursive approach to multi-robot exploration of trees","venue":null,"work_id":"eeaafeb7-1822-46e1-9033-2608269e316d","year":2014},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.555896Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:9f04cc6f04afdffa3d6969c0c5fc55de40eb5931f069c17d287d5c6dbe01d46e","observation_id":"cbc87539-7555-4f7e-9fe4-c3187d59bfa0","resolution":{"observed_at":"2026-08-06T15:45:55.741520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.720620Z","title":"Papadimitriou and Mihalis Yannakakis","venue":null,"work_id":"a4d20a73-5a2f-43bb-be33-b21e0361acb4","year":1991},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.560848Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:d9f6339c7dee7b16f9649a30a70aa2f4eb2659b3c2a61d103e674e1fe66549c1","observation_id":"ee743e9b-aaf5-49fe-b67c-78a8da6567b0","resolution":{"observed_at":"2026-08-06T15:45:55.725422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.704805Z","title":"On traversing layered graphs on-line","venue":null,"work_id":"1013f9db-39cd-4ae2-983a-cfd334ff8dee","year":1995},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.565947Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:12f04a3c567e7e66a0339f11e614c02ec031dfe2fe8cd0fae83d18e86ef82fa4","observation_id":"56ffeacc-5824-48a1-b761-a56dfe0090cc","resolution":{"observed_at":"2026-08-06T15:45:55.709779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.571364Z","title":"Beyond the worst-case analysis of algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.571364Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:f60ec3d2953321b4734e57a91f15ec0d81f1fae8e2aa90f0d97094ff48a69ef0","observation_id":"a4f9de1c-f48e-46aa-875f-867df9ba5166","resolution":{"observed_at":"2026-08-06T15:45:55.571364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.575873Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.575873Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:69b3e61871d858930c5b7c0f736fb21d28ccfc35be45a42258806884e882c222","observation_id":"f3dc39f1-a312-4d2e-a295-0d77fe3a3155","resolution":{"observed_at":"2026-08-06T15:45:55.575873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:45:55.580359Z","title":"Tree of thoughts: Deliberate problem solving with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.580359Z"},"links":{"citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:4febcec482f62651e7d7e571f34829b6c198ae74ce8c7efcc868d24eb041bc19","observation_id":"20d38ebb-a9b1-44e6-8e41-d686157c77a4","resolution":{"observed_at":"2026-08-06T15:45:55.580359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}