{"as_of":"2026-08-16T08:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:652f3e8370f967ad98b4b37de6f1458965d4d50a695026439137b73da4f7a66a","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:59:25.164328Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:25:45.123846Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T11:25:45.185142Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"cited_work":{"arxiv_id":"2505.02789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.02789","snapshot_observed_at":"2026-08-05T11:25:45.185142Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","venue":"cs.DC","work_id":"2a4f0094-3ac6-4e89-8d19-da126ac3d3c0","year":2025},"citing_paper":{"arxiv_id":"2509.02909","last_updated":"2025-09-03T00:32:17Z","snapshot_observed_at":"2026-08-12T02:59:16.150953Z","submitted_at":"2025-09-03T00:32:17Z","title":"Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:25:45.123846Z"},"links":{"cited_paper":"/paper/2505.02789","citing_paper":"/paper/2509.02909"},"observation_digest":"sha256:a2a3a410a5eaf8f16a3eed18cd3e19951b4468b4b76f007eb705fcf65a7bc1e3","observation_id":"09933146-20f0-4988-ae0f-c2abacfcbbdd","resolution":{"observed_at":"2026-08-05T11:25:45.190713Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.02789/citation-record","integrity":"/paper/2505.02789/integrity","json":"/paper/2505.02789/citation-record.json","paper":"/paper/2505.02789"},"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-16T00:59:25.419440Z","title":"Moses Jr","venue":null,"work_id":"04136851-c375-4d9e-af51-1ea6fd10ffc0","year":2018},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.088443Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:fe1ffb95555247a14ec8dc0b2dee23994e8658b19d1bf6b7dcd3b5fc382bbc33","observation_id":"2b1bac59-2d58-46f2-83c5-17b957c33b87","resolution":{"observed_at":"2026-08-16T00:59:25.422856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.407512Z","title":"Zero-memory graph exploration with unknown inports, 2023","venue":null,"work_id":"e3c1ec5d-556a-4485-ba41-7b13f9d49f8d","year":2023},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.092917Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:b19f4bf9697fa0f9961f16ebe121a8d1bc6432a19da676601d0260016ea4b3b4","observation_id":"ed55eb18-ab3e-4f20-936c-b853836c44aa","resolution":{"observed_at":"2026-08-16T00:59:25.411996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.395646Z","title":"Zero-memory graph exploration with unknown inports","venue":null,"work_id":"8081ba1b-efae-4c97-b54b-8d32bd5a0999","year":2023},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.096705Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:b77803b76ced00ade56b09a26cad14caa4ddc64cc748c3411d85d36b968abdca","observation_id":"db557e6c-267e-42f0-a2d4-87c7066a8296","resolution":{"observed_at":"2026-08-16T00:59:25.399455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.382375Z","title":"Kowalski, and Dominik Pająk","venue":null,"work_id":"9b61333f-30c6-4070-9806-b565f2027bb3","year":2022},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.100563Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:4e56700c7fed8c382469389be04af25d4dd54cb644f3239d03cf84dc86a79f13","observation_id":"fc689721-91e2-4653-862e-f17b146f6dc9","resolution":{"observed_at":"2026-08-16T00:59:25.386972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.372663Z","title":"Searching for a black hole in arbitrary networks: Optimal mobile agents protocols.Distributed Computing, 19:1–99999, 2006","venue":null,"work_id":"0b00a487-63c0-4cb1-8b93-5d17d24ef0c4","year":2006},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.104430Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:4e15826f341c835e0e76596f010f162b168327ace0dcd89378ce4989213a9f4a","observation_id":"0101e42b-62da-47f4-a694-eb9ac52ff934","resolution":{"observed_at":"2026-08-16T00:59:25.375808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.361586Z","title":"Mobile search for a black hole in an anonymous ring.Algorithmica, 48:67–90, 2007","venue":null,"work_id":"222c0792-67f2-4b12-a48c-1bd98f7acdc2","year":2007},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.108882Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:75eef6d96b1afff83b88d515666f9b1ff5be7e848a0fa9317fd49f827cbfcbe0","observation_id":"5ebac21c-54e8-415f-98cb-f92fd76bc55d","resolution":{"observed_at":"2026-08-16T00:59:25.365312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.347663Z","title":"Using scattered mobile agents to locate a black hole in an un-oriented ring with tokens.International Journal of Foundations of Computer Science, 19(06):1355–1372, 2008","venue":null,"work_id":"c605c9d0-2403-49f5-9161-10b358bbe626","year":2008},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.112921Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:c0739f3595aefb7b27fef954d245c195d1a1a611f4ea27a5dd2416ae26fa59da","observation_id":"bd250be9-e2ab-42e4-b4ba-9b3da9c5cb73","resolution":{"observed_at":"2026-08-16T00:59:25.353039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.335725Z","title":"Efficient dispersion of mobile robots on graphs","venue":null,"work_id":"52a6528e-7699-4ff7-92a6-378bef917040","year":2019},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.117221Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:7ed9737ca85c33cb29cbcbd9f7ab6f2409dc7add5384d177bc56f93c5d4ec85a","observation_id":"cb7e6ad2-1640-4bd3-92c0-45e3479c98a3","resolution":{"observed_at":"2026-08-16T00:59:25.339660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05352","last_updated":"2019-04-27T12:42:17Z","snapshot_observed_at":"2026-08-16T06:29:38.300501Z","submitted_at":"2018-12-13T10:23:19Z","title":"Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05352","snapshot_observed_at":"2026-08-16T00:59:25.121148Z","title":"Efficient dispersion of mobile robots on arbitrary graphs and grids.arXiv preprint arXiv:1812.05352, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.121148Z"},"links":{"cited_paper":"/paper/1812.05352","citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:e678843d0575915d326872a278f12f9f2d740fa31b390a88547a29d3426a7df8","observation_id":"1461b80f-7ef3-4fa5-ab76-303aad57bcc2","resolution":{"observed_at":"2026-08-16T00:59:25.121148Z","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-16T00:59:25.323770Z","title":"Fast dispersion of mobile robots on arbitrary graphs","venue":null,"work_id":"d77c2621-cb37-4a68-b1ac-3de2e7f5b8c4","year":2019},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.125280Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:a270b929fb648eb6e5b7a2c10b19746a20ab8cf900e03bdc305be0c9dcfa1e37","observation_id":"dc29b56d-bf7b-4afd-a7a6-9db1d1812a0f","resolution":{"observed_at":"2026-08-16T00:59:25.328368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.312554Z","title":"Randomized gathering of mobile agents in anonymous unidirectional ring networks.IEEE Transactions on Par- allel and Distributed Systems, 25(5):1289–1296, 2013","venue":null,"work_id":"20cb9b67-6412-44ee-a51d-a237255c8620","year":2013},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.129457Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:8edd68eedd5808dcc7704c54a3b9047a14202a3a5f083fdea7252a3d491b9326","observation_id":"498a8bf6-0fb2-4ec9-8405-5d145ab50d89","resolution":{"observed_at":"2026-08-16T00:59:25.317030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.301911Z","title":"Panaite and A","venue":null,"work_id":"f64942b2-84cc-43b5-8a63-27f2ba1d50ed","year":1999},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.133658Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:f56b117ff470dea4e4af26efc3b97cbc35b2a617b413c7e251a633e782004605","observation_id":"0d05f423-cd6a-4463-8f77-5ebbf0e398f0","resolution":{"observed_at":"2026-08-16T00:59:25.305726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.290233Z","title":"Eulerian walkers as a model of self-organized criticality.Physical Review Letters, 77(25):5079, 1996","venue":null,"work_id":"9beae2da-a759-45f8-b4a7-0f2970c4a29a","year":1996},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.138274Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:55cb3f704fed2a2ba5d75f7a9ad5b647b1a3930d8e7315a59c35f32968cb652b","observation_id":"7eeef5f1-dcc7-433e-9b0b-da40a7042555","resolution":{"observed_at":"2026-08-16T00:59:25.294544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.277428Z","title":"Reingold","venue":null,"work_id":"104e7314-1ac8-4080-88fb-5237e16190cb","year":2008},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.141563Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:6d2d6b9d58e253de63d677dd49ef88d3653c1da686096505a62298df818756eb","observation_id":"4670991e-9e07-4e1c-84d4-f7a5ba7721a4","resolution":{"observed_at":"2026-08-16T00:59:25.281638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.265360Z","title":"Uniform deployment of mobile agents in asynchronous rings","venue":null,"work_id":"c3b9cb77-5c5b-438f-baa7-5595bc798f3d","year":2016},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.144540Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:9b89e7b3525a0a91d2070acaf643b9a85aeff895fe1a3b4edff883d041ee1108","observation_id":"3f2968d4-b4fa-4cae-bbca-cfb6b777df22","resolution":{"observed_at":"2026-08-16T00:59:25.269322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.251819Z","title":"Partial gathering of mobile agents in arbitrary networks.IEICE TRANSACTIONS on Information and Systems, 102(3):444–453, 2019","venue":null,"work_id":"ca81f25e-fb92-4e2c-a8d9-495a55d03157","year":2019},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.148111Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:26c39eef02ce9acfaadee503e98478bea2d12daca19304f4d9dc9624e1a9163a","observation_id":"29e323a9-b33d-4f1b-b275-1146d8a62d45","resolution":{"observed_at":"2026-08-16T00:59:25.255997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.238751Z","title":"Uniform deployment of mobile agents in dynamic rings","venue":null,"work_id":"b33eda94-0d11-4930-a50a-f1f8d01d1195","year":2020},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.151892Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:ff76d33979ea5bbec56e3089a8aa6b27301501254d38b54dcd92e73ed0ce3b7b","observation_id":"d17b9f18-2811-4722-9a87-eb17265bd393","resolution":{"observed_at":"2026-08-16T00:59:25.243024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.225814Z","title":"A single agent exploration in unknown undirected graphs with whiteboards","venue":null,"work_id":"ec3ba5e0-837b-45d2-8cc1-c732f108bfc1","year":2015},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.155852Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:5ab55f4a5dcecf2664216fb1f4e39168713bf44004664cd56f6b6afd8f981a29","observation_id":"c78d4442-d0e7-4679-b4d1-094e27a53b5f","resolution":{"observed_at":"2026-08-16T00:59:25.230574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.213997Z","title":"Self-stabilizing graph exploration by a sin- gle agent","venue":null,"work_id":"f67c7f04-4f64-4914-8dad-19b5f99c13af","year":2025},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.160097Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:cd71d8e71079f03ddad6efc0d2be8a1a3f27572cec4f71de33e4b40577f4d61d","observation_id":"bd930423-2413-4b52-97de-43e65be25c8d","resolution":{"observed_at":"2026-08-16T00:59:25.217871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:59:25.201503Z","title":"Near- Linear Time Dispersion of Mobile Agents","venue":null,"work_id":"d0a6cc8d-49ef-40ed-9a5d-cd6afd2baa8c","year":2024},"citing_paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:25.164328Z"},"links":{"citing_paper":"/paper/2505.02789"},"observation_digest":"sha256:f6da371d213e8b83266bc170123d6fa3c3b2b72b386c95a7bbb4cf63c7456d62","observation_id":"8af578d9-7922-49f8-b651-151bc0b74617","resolution":{"observed_at":"2026-08-16T00:59:25.206477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.02789","last_updated":"2025-05-05T17:03:55Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T00:38:27.040842Z","submitted_at":"2025-05-05T17:03:55Z","title":"Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":20},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2505.02789."}