{"as_of":"2026-08-22T21:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a31c293a5d43b21d571919334f2844bed2309684921e8e822312d8cf90467b4","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-14T15:33:56.392402Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/1908.00914/citation-record","integrity":"/paper/1908.00914/integrity","json":"/paper/1908.00914/citation-record.json","paper":"/paper/1908.00914"},"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-14T15:33:56.609871Z","title":"The rendezvous search problem","venue":null,"work_id":"2fa57766-ed58-4796-89dc-e0b86091a91f","year":1995},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.329753Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:33d8e46c7ddc74204f598ba6970a1c47a1dbe4b3ce12b32371604335e5f8ae23","observation_id":"b83ef159-1be1-433e-9899-c69d730d3b67","resolution":{"observed_at":"2026-08-14T15:33:56.613110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.601351Z","title":"The freeze-tag problem: how to wake up a swarm of robots","venue":null,"work_id":"1524cae8-d366-4af2-b453-33cb26328323","year":2006},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.334691Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:0c4d94a829906a95f94fe675aec084082a90c7995a8705b31fa16ccb8608ec82","observation_id":"01d809ab-997d-491a-93e6-426ee8b901db","resolution":{"observed_at":"2026-08-14T15:33:56.604254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.588868Z","title":"Randomized gossip algorithms","venue":null,"work_id":"a4d8797d-41ea-4871-adea-d6fb455c8936","year":2006},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.338392Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:4df6e70f9609ede87d8d36068cc42e1dd2a01f78b63b8ff81b6c7abb50208517","observation_id":"03abce71-70b7-494a-aa6c-2606522d9be2","resolution":{"observed_at":"2026-08-14T15:33:56.592142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.579224Z","title":"Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions","venue":null,"work_id":"4dcb3445-1959-439d-b899-edd37ff37aa3","year":2006},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.341777Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:516fdfbbd813d45ead98089919154d1cdcc86dad6dde80b5339a864e29bae890","observation_id":"81e5e30e-084b-4286-b4e1-565d2b2147aa","resolution":{"observed_at":"2026-08-14T15:33:56.582685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.569784Z","title":"Asynchronous network formation in unknown unbounded environments","venue":null,"work_id":"32fb5508-29ad-42d7-bcb3-3f34b1ce24dc","year":2018},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.344912Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:b4248809e0310ca7adef572716df95bfb56cc8b5e3ce6bc3a2f9bbe6a1cf0894","observation_id":"1bb407bb-aa3e-416a-baee-952309496c35","resolution":{"observed_at":"2026-08-14T15:33:56.573220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.560579Z","title":"Minimizing movement to establish the connectivity of randomly deployed robots","venue":null,"work_id":"0a8fd17a-88c1-478d-a116-563af0281b2e","year":2018},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.348747Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:462ee1b4dbcda804c1efb84f8f18e8f59e71e10c18bad8b2739ad7142993f053","observation_id":"e17f98eb-d58a-4638-8edc-d37124ef2ff9","resolution":{"observed_at":"2026-08-14T15:33:56.564035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.551501Z","title":"Critical power for asymp- totic connectivity in wireless networks","venue":null,"work_id":"3468959a-3977-4259-abfa-d90967aa6c80","year":1999},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.352154Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:26a1aa9d815ee8905ecef6c45a1b646a8b1d74a43f9a8645ca05276f738d28e9","observation_id":"292913de-dc61-440f-98c3-52dcaba78146","resolution":{"observed_at":"2026-08-14T15:33:56.554844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.542401Z","title":"The online freeze-tag problem","venue":null,"work_id":"8a27c7fd-156f-4935-9cf0-3d43ebb8cf4f","year":2006},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.354940Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:98c59a184726eab4743fa2aa0b2daf5999d43bc547307be2b1978270ec133fea","observation_id":"783de534-9c0a-4749-84cd-51a9cab1ca8e","resolution":{"observed_at":"2026-08-14T15:33:56.545871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.532417Z","title":"Distributed coordination control of multiagent systems while preserving connectedness","venue":null,"work_id":"6a6fbad3-61fe-4957-90e7-cc6830937591","year":2007},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.357960Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:f0933fde4ac6d4055373aa8b8a9a22cfff754c98a5ede59a781a114d40de9697","observation_id":"ad22dffb-dad1-4771-a4a6-d94ba8b41b1a","resolution":{"observed_at":"2026-08-14T15:33:56.536252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.522533Z","title":"Multi- target rendezvous search","venue":null,"work_id":"03f1c80f-6dab-4b48-8952-11b0016f8e29","year":2016},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.360591Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:d56bdec37a977f7cbdd588d1f6f497054501f46e1f24116f403da0ff155cb38b","observation_id":"80bb0096-78f6-40c8-b340-34ca48e3fad8","resolution":{"observed_at":"2026-08-14T15:33:56.526103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.512212Z","title":"Probabilistic network for- mation through coverage and freeze-tag","venue":null,"work_id":"817b1025-280e-4d43-a5a9-67c378ec696e","year":2009},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.363310Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:19b49a293c829f41935b0eeb980ce808fa197e8422fd66f5d492dc184617034e","observation_id":"594d315d-5ffc-4054-aff6-0521bcb82bcc","resolution":{"observed_at":"2026-08-14T15:33:56.516044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.502867Z","title":"Randomized algorithms","venue":null,"work_id":"dc7f8186-806b-4633-8b54-9239c592468f","year":2010},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.366023Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:b70eeb5218fd2522579fee90cff8ee9afdeea1569fa937e3f1b7d9d8db87e5e1","observation_id":"64eda768-4c63-47df-91e6-2cdb5df4c4f7","resolution":{"observed_at":"2026-08-14T15:33:56.505979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.494094Z","title":"Symmetric rendezvous search on the line with an unknown initial distance","venue":null,"work_id":"df72995e-ad34-46da-ae39-a1b85c3b380d","year":2013},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.369177Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:5390d0c0b3089dc0051225d015237a0d3b60f6b2bf55284c3aa60e58bb5ebfed","observation_id":"d29f15f5-5ff9-44db-a52b-55d02c016c5f","resolution":{"observed_at":"2026-08-14T15:33:56.497177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.485268Z","title":"Rendezvous in planar environments with obstacles and unknown initial distance","venue":null,"work_id":"22790a81-499a-4607-a6ac-cdcf10b5d29b","year":2019},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.372754Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:911c18bbedaf9d44732acd5ada507993c0d4a4ca92091090f1cc2d9082270971","observation_id":"b873621e-9b2a-48ff-8822-a74fb2afc613","resolution":{"observed_at":"2026-08-14T15:33:56.488468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.474646Z","title":"Latency analysis of coales- cence for robot groups","venue":null,"work_id":"744c61cd-dbdd-4f5e-96da-ac3b21d6ab10","year":2007},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.376048Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:a9556b3f21a93e6915eeaa6e4c164153ac5bf5daad5478579bb36c475d7a1791","observation_id":"6eeb900d-7860-479e-bbeb-dd68d05133cc","resolution":{"observed_at":"2026-08-14T15:33:56.478542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.463893Z","title":"Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations","venue":null,"work_id":"d493b175-2e93-456a-88da-0b46122f3b86","year":2001},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.379425Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:059b9b4e2aa69b80e54fecbd8cfe3a317f2b75f611147eef10930186a733ea28","observation_id":"5fcf983a-4e0f-40d4-a70a-3ab0afaf28fd","resolution":{"observed_at":"2026-08-14T15:33:56.467587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.454123Z","title":"Gossip algorithms","venue":null,"work_id":"0e7dee1e-3b5d-44e6-bc0b-2f49ffddb5cb","year":2009},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.382565Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:b61b69b7a0de28f327108565a46646d49040dc81760bd05ccbd106965a656545","observation_id":"ff5fbb0b-3ef4-49a6-a40b-cf0f51d884f0","resolution":{"observed_at":"2026-08-14T15:33:56.457466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.443660Z","title":"Multi-agent coordination under connectivity constraints","venue":null,"work_id":"a1af4de2-a449-4c9e-b26f-c34e4f4eb529","year":2008},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.385809Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:83d3c827de7f14ee36e02d1ec8f876cdf49d40b6c0b65333296cca504b7f0d37","observation_id":"fffb5d9b-626a-45ce-bae8-6d9a216f6651","resolution":{"observed_at":"2026-08-14T15:33:56.447336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.433614Z","title":"Graph-theoretic connectivity control of mobile robot networks","venue":null,"work_id":"7d887578-4336-4202-9520-53ead2c68b27","year":2011},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.389266Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:b9d26b714b90d8db11e4be608f98a4c297624168f808366efbe2b63cfb295c0a","observation_id":"ac23c9c5-a503-4dd4-83dc-4bc78778e4d0","resolution":{"observed_at":"2026-08-14T15:33:56.437027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T15:33:56.420262Z","title":"Controlling connectivity of dynamic graphs","venue":null,"work_id":"91704e44-aa59-4297-a738-183e84cae965","year":2005},"citing_paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:56.392402Z"},"links":{"citing_paper":"/paper/1908.00914"},"observation_digest":"sha256:f54424c3eb98ce73c34678db7268ab02aad7e7b437c31fddcc06e55234d683c5","observation_id":"4a910f88-a19e-4591-b049-b653015f2c1a","resolution":{"observed_at":"2026-08-14T15:33:56.426216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.00914","last_updated":"2019-08-02T15:35:29Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T19:42:38.658997Z","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":20},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.00914."}