{"as_of":"2026-08-11T07:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82a632b72a481201cfe43b936f44000330564d6e1cf77716a023f110f73d0bd4","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-11T06:34:44.6726+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-11T04:39:11.809918Z","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:551a0f26b5483432f2fbd5fbf44b6a9b8573aa77936edae2264b14db3cf00335","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-11T04:38:17.517520Z","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-11T04:39:11.809918Z","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:c8e4763b964d006c516e2ef883bb209c8cf9e059d8db52a4af8e733757a70ead","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-11T04:39:11.809918Z","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:393d6f2aa737ab00c05c7cc95bda092d72347b76066ff892d6a1cab7466d68f9","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:e7082fb58e626a603b722a299aa686264c2a8d71fe059bff7f649c9b7b2e1e1b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:c0ad293cd320fd6c97447815d95c819b0cb0da3f5fe76d70101144d761831968","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:213acf0eaacbfcfbc936c5649ccb002a0b7dcfeddd10cfa34141a8fbc3db1c9d","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:3df50d5db4e2b4516a8284c9dc9626b81582ec662f17d6657b305964b6af22fc","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:02f7d3a98090a4b94dcc0a69c954de595c116bcd268ac0ba6d1c58636e183ad2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:0655453ad00c709c50dcaa6d04dd48a9b73ac049a74c6b733b66379d907c86dc","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:fa893a0dd551cce8cc90edf55b0d3272baa0bb4e978bbe408c14d4a6dc4afaf9","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:10df337e8ee4826c3059b59d00a3e6ced2216b46f5a774298f26c6825e875178","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:f406443b1403af8b5d1abadfcdd4858e081730b8b66c48353a7a72e2ee251c22","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:80b4d9bea4064d01b18f75e01e6246d4ddd4c8611ad4be6a704997f8d39cd3a7","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:4efcebd27c857205ef604e126d8c379f2d6163535340429232734b171a453dea","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:416338b5781cb199e5125119f8d71a2e264d35c46153c8d1a1a300cf25a769dd","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:9f656ea350d375a66bc13e34fcadfe581152b8d5f2e2d3a10b2f0979dcb3f4fc","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:18b938f1e5289b77622069cccef5ba8b9d5b6532ff53974bfaa34f61026f9006","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-11T04:39:11.809918Z","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:732a53268061804cfed8d54c3a0061f481b916b5b850bf649d2392bdf912931b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:981de16915aeccf8356c5b31bed6cbd757d19aa600d4e7cb6ee91d4e011a0c6f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:0b56487607fed7f0026af9101d92f920e45266df906a59583ae2e7cf7376bd0a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:5e24538eb60110010b3957e5aaf2ca0bb9bc72323acfb49a67525557d06d70e6","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:8306b756b390f03ffdac99a5255c09823b9f10fa674824ea27bcc7a1e6d5d4a6","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:ec0ffbe19ab3369e0185aaa7afd960a56876b0c3c0a9a00fd74ba6dcf975a9d2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:00ec768ae8595fdb7217fbf19c65b28923582b3669130b281a1663837ec8f4f5","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:9c35d38ead815a0048fc27d51df73538198d618624c36768ea55bca2f6bfceee","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:c98857376291c5dea53e0dcfb262923dc50f05aca8da9537110e5dd7cff4282d","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:f609d1bd4dbe830f512622988c9d61ccd8c94d7e0a4cce7de4dece8f94430a44","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:71a74b0eea4a00caeb603bfcd546e5ba9643c93170096bc6d8df8a8e76da4648","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:39:11.809918Z","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:a38d45c7f387e3bcd240fd0a2e890bf8584c563d17211442de4632a663da69a4","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-11T04:39:11.809918Z","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:35b524b296bfc101b126e5804771847da511aafdad8d3ec150f01714cec7fc15","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-11T04:39:11.809918Z","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:e241400281e1ed63ccc4c1ed7dba3d00c88b06cf370d7c2bbe5687d3faee1463","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-11T04:39:11.809918Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2507.15658."}