{"as_of":"2026-08-13T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:285c115f5b8992dbe0ebfc9e8e5564329bdbffd2298b1808183a9b473d259895","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:35:55.956180Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.16134/citation-record","integrity":"/paper/2411.16134/integrity","json":"/paper/2411.16134/citation-record.json","paper":"/paper/2411.16134"},"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-12T13:35:56.501577Z","title":"The robust Canadian traveller problem applied to robot routing,","venue":null,"work_id":"b80ef2b0-0cac-4dc2-985e-a51f2cf6ef3f","year":2019},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.790147Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:ea7cc3c7d384336fae3c9d23fed2eaad8d454fc56e9cdcc420084c3f7d0c7a92","observation_id":"18a87dfd-a3ce-4189-8dcb-d92b0c75741e","resolution":{"observed_at":"2026-08-12T13:35:56.506387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.486935Z","title":"Using reinforcement learning to minimize the probability of delay oc- currence in transportation,","venue":null,"work_id":"587d0566-d824-4a18-8bb5-8dd10c94ad4a","year":2020},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.795404Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:43d0d61128b93ad7ae6a3604bcca4dda5e055eb0aae3692a8eaa81b268c3a7af","observation_id":"03dc5d87-ad88-44ea-90e0-3041953c39c9","resolution":{"observed_at":"2026-08-12T13:35:56.491631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.472784Z","title":"Multi-robot path planning with due times,","venue":null,"work_id":"cb88b439-717f-4de7-8003-d17fab058849","year":2022},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.799772Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:7a1fb261c474507390c126e9302ee899eadc50a536ac981389a8b738a852899b","observation_id":"babcd026-7550-442c-9d60-bb9a582a29e2","resolution":{"observed_at":"2026-08-12T13:35:56.477280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.458125Z","title":"Attention-based priority learning for limited time multi-agent path finding,","venue":null,"work_id":"cddcf679-0c48-481b-b0bf-c19680e75c7f","year":2024},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.804520Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:28a1f185f72640ede370c5f39a59cd2ed442e50e3941c07b60e45b55c8509c0c","observation_id":"1a4190b0-5d98-4ffc-9693-2870a73986fb","resolution":{"observed_at":"2026-08-12T13:35:56.462733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.443519Z","title":"Multiagent-based route guidance for increasing the chance of arrival on time,","venue":null,"work_id":"43fc4743-5364-414c-b320-4aa78f4b0a53","year":2016},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.809072Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:74c6fbc646fe19861655325991c6f6071640bf50dfd45f52c166f94a7d755ce8","observation_id":"82019ab6-c840-4ca9-8ee3-227de3ef74a8","resolution":{"observed_at":"2026-08-12T13:35:56.448160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.429100Z","title":"Multi-agent path finding with delay probabilities,","venue":null,"work_id":"7a4803cf-86dc-4f1a-89c9-e14cfbbf0319","year":2017},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.814097Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:1a1359916a7ea740d7aeaa663ac74dbaf9a7dec3e4dab3137446c60ef03d5ab7","observation_id":"6db1f19f-703d-455a-9576-8ee4bf4683bf","resolution":{"observed_at":"2026-08-12T13:35:56.433924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.414917Z","title":"On the online multi-agent o–d k-Canadian traveller problem,","venue":null,"work_id":"3b29729c-1796-4393-93d4-c8c8ce4db5ef","year":2017},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.819279Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:003b80a1642f900670ceae0f193bdeeaea89334dbc0973579cbb5ed694e8cabf","observation_id":"470102af-302a-45a6-b910-a9d0dada8955","resolution":{"observed_at":"2026-08-12T13:35:56.419516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.400614Z","title":"Shortest paths without a map,","venue":null,"work_id":"8b46d06c-cf2e-42d0-8e15-ba4e0a9d48be","year":1991},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.823647Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:5cfeb2f19d44afcdfaefb3e03b960b9840e307f35ba16efd0a6dccb92a3a4073","observation_id":"34c5de42-6cd9-4be2-8b07-6ac200b11f83","resolution":{"observed_at":"2026-08-12T13:35:56.405080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.386130Z","title":"On the impact of uncertainty for path planning,","venue":null,"work_id":"5ea83ae5-c7b3-4a4a-9580-fc2b8f9380b3","year":2019},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.828096Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:df3f1348edc140fcaea082a795fbada201b3108b91f5b03b6b43f68afe4edfa9","observation_id":"102e20f8-90b1-4755-8d0c-50f3043d8371","resolution":{"observed_at":"2026-08-12T13:35:56.390675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.371724Z","title":"Generalized Canadian traveller problems,","venue":null,"work_id":"7a645f4b-94a9-4fed-99b0-265842fbdc51","year":2015},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.832738Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:7de56e67c265f8a0ca421572c6d95055d17f515e35a0c4c6814668dfed871850","observation_id":"f65f61e7-b7f2-4579-8380-a52f677c8f02","resolution":{"observed_at":"2026-08-12T13:35:56.376303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.356276Z","title":"Route planning under uncertainty: The Canadian traveller problem","venue":null,"work_id":"5c300868-0120-48f1-b461-dee803a23339","year":2008},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.837424Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:459b8d4ae775125770fc757cd19afa507f8026f5b9fd0fa4355626474e07e4c1","observation_id":"8ddc91a0-b8a1-420c-8151-2654a4086da3","resolution":{"observed_at":"2026-08-12T13:35:56.361383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.340595Z","title":"An optimal randomized online algorithm for the k-Canadian traveller problem on node-disjoint paths,","venue":null,"work_id":"753ff740-be8c-4fb5-9ea1-19c6d20bb32f","year":2015},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.841930Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:a742687f67e475773f7f90e8831bdc90c48a0fbe0994009fb4eea4d11085a131","observation_id":"4247a95f-291b-426c-93c2-63f57a9e6292","resolution":{"observed_at":"2026-08-12T13:35:56.345283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.325934Z","title":"The recoverable Canadian traveller problem based on limited provision information,","venue":null,"work_id":"2a1b66a4-c4a1-4234-91b2-150ced5b3867","year":2009},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.846512Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:336ee6682f6c36e72a78ed629c464e411dea61cb01f206ff19a6813f8ce593d8","observation_id":"086e3271-aa33-4d8f-83d5-9e63dd02e7eb","resolution":{"observed_at":"2026-08-12T13:35:56.330601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.311133Z","title":"The covering Canadian traveller problem,","venue":null,"work_id":"3d93a604-8f03-4067-a9a7-4e20de528207","year":2014},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.851371Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:fc64523c1876ab9fb5551e17a182c5056209041a7801c11bee2aedad3ae41a1f","observation_id":"fb88f47a-f197-445e-b82b-9c7544b30815","resolution":{"observed_at":"2026-08-12T13:35:56.316070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.296015Z","title":"Network-flow-problem- based approach to multi-agent path finding for connected autonomous vehicles,","venue":null,"work_id":"d2cbeb2a-c2ed-44b9-96da-a15624704c20","year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.855637Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:a8bf7d9fee36fd7c94d2165963d11fda5ff017cbcd64c7f3bf02ba023c9ab33f","observation_id":"020f3deb-a289-4ed6-83cb-a04436e339ec","resolution":{"observed_at":"2026-08-12T13:35:56.300875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.281009Z","title":"Distributed heuristic multi-agent path finding with communication,","venue":null,"work_id":"8c3a04c3-d54a-4c8c-8414-52e4b5c1cdec","year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.860208Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:c63e74434d4e150ba62864bd2dff879482d19bb99bffb80f5bb4732e56f1c900","observation_id":"5e4dbf24-cbdf-4eee-af00-884d4417c1df","resolution":{"observed_at":"2026-08-12T13:35:56.285681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03063","last_updated":"2024-08-06T09:34:54Z","snapshot_observed_at":"2026-08-12T23:07:54.667792Z","submitted_at":"2024-08-06T09:34:54Z","title":"Social Behavior as a Key to Learning-based Multi-Agent Pathfinding Dilemmas","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03063","snapshot_observed_at":"2026-08-12T13:35:55.864532Z","title":"Social behavior as a key to learning-based multi-agent pathfinding dilemmas,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.864532Z"},"links":{"cited_paper":"/paper/2408.03063","citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:bfea1910407442fd12b86a7cf5d5a4d2650f3050108ba270f9e7057bdbe8b904","observation_id":"28713ab7-c8e1-4d8f-ae2d-c2af4c4ebdfd","resolution":{"observed_at":"2026-08-12T13:35:55.864532Z","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-12T13:35:55.869295Z","title":"Feasibility study: Moving non-homogeneous teams in congested video game environ- ments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.869295Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:e87a02754a9ce6d7c40cefda7f9d32641534fa7f02054014a134fab87727e020","observation_id":"2996a623-ac0e-4e71-bd9b-bd43beb2990f","resolution":{"observed_at":"2026-08-12T13:35:55.869295Z","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-12T13:35:56.256225Z","title":"A comprehensive review on leveraging machine learning for multi-agent path finding,","venue":null,"work_id":"d41db9a2-0b48-40c2-8479-8058e071b5b4","year":2024},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.873934Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:127325b1edfa7c0b8965a047893db77e435b26f0778e0bdb5adf28852a7b1f38","observation_id":"f6e458f1-6e36-4e16-a272-3f20b7614a31","resolution":{"observed_at":"2026-08-12T13:35:56.261051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.240892Z","title":"Alpha: Attention- based long-horizon pathfinding in highly-structured areas,","venue":null,"work_id":"e00bebc0-7fc5-4229-b60d-5c85fef1d9fc","year":2024},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.878567Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:cb4be7b0d11a001fb565a1d8891af2992fcbaeaa40e12c12e1a99a9000da53ca","observation_id":"fc7500e7-29d4-4bc1-bf60-bc65d40e6aed","resolution":{"observed_at":"2026-08-12T13:35:56.245768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:55.883070Z","title":"PRIMAL 2: Pathfind- ing via reinforcement and imitation multi-agent learning-lifelong,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.883070Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:ad2ee4fc7f7b6ffe7967c692c968f1e897554e20d7cbf6e2b9ab2dc8928be1eb","observation_id":"306fd6ac-3c5e-4772-8bd5-5384bad1277f","resolution":{"observed_at":"2026-08-12T13:35:55.883070Z","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-12T13:35:56.216825Z","title":"SCRIMP: Scalable communication for reinforcement-and imitation-learning-based multi- agent pathfinding,","venue":null,"work_id":"bc0e44ac-7209-4e90-bbd0-19fb1948bfb0","year":2023},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.887702Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:02d5c9fd62c240c452320c627359fb73f174b1561c22dd77ff352acc592e5bef","observation_id":"4002f133-ee8c-4151-8293-608a9b32cda7","resolution":{"observed_at":"2026-08-12T13:35:56.221601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.201536Z","title":"Multi-agent path finding with prioritized communication learning,","venue":null,"work_id":"de715be2-9b76-4ebb-8793-1f23206341fb","year":2022},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.892190Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:d7439775524c4eb7ead26ab354372d35f85d7cef3816022b55c21b704e936a93","observation_id":"16a59f07-9203-42d0-8ba2-7f0e542aecce","resolution":{"observed_at":"2026-08-12T13:35:56.206719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:55.896561Z","title":"Graph neural networks for decentralized multi-robot path planning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.896561Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:b01933b07a3bd93baf6b635692f61b0e6d1445d2c95d0ed7c3891a306b863848","observation_id":"a78328c0-c452-492b-bb51-e565d1af9584","resolution":{"observed_at":"2026-08-12T13:35:55.896561Z","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-12T13:35:55.901195Z","title":"Message-aware graph attention networks for large-scale multi-robot path planning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.901195Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:c1ac41bb2e975dab27114dcffb6669cc2dcd2d1d6c6c59deee4222623e675800","observation_id":"961f4ada-b9f5-4c90-9dd7-9148010bbda0","resolution":{"observed_at":"2026-08-12T13:35:55.901195Z","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-12T13:35:56.166730Z","title":"Deep reinforcement learning for multiagent systems: A review of challenges, solutions, and applications,","venue":null,"work_id":"4ea1b586-a684-46a8-9fc9-2eafd4bc3de3","year":2020},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.905661Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:58f0a1fa2cbdf0b29850c5c40b96b2af77c75e602d32ee9e59ac82ae9268425e","observation_id":"bf8b992d-4d50-44e4-bbfe-d92567314827","resolution":{"observed_at":"2026-08-12T13:35:56.171849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:55.910000Z","title":"Deep reinforcement learning for autonomous driving: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.910000Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:4c63dd7fc455f7d9471f5233e54631eb6e2c8e6b678821a9bc8f7ee44bcd15f2","observation_id":"d73f1a2f-61d8-4dc0-97c6-c7088cfc9a4d","resolution":{"observed_at":"2026-08-12T13:35:55.910000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-12T13:35:55.914740Z","title":"Efficient estimation of word representations in vector space,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.914740Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:f230bd829fb6aae25f3b8c1fbe884afe531e7c5bc5e333b834f5be4470edb31f","observation_id":"1e2021f9-5f89-4862-be22-90d7bcce7171","resolution":{"observed_at":"2026-08-12T13:35:55.914740Z","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-12T13:35:55.919553Z","title":"A mathematical theory of communication,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.919553Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:02efd8f285163549c3f3aa49cd3aa8f16b344d75e342d8ba6be84624f222e71a","observation_id":"e55d676d-55aa-478c-a643-fdd7014d7e3b","resolution":{"observed_at":"2026-08-12T13:35:55.919553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-12T13:35:55.924252Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.924252Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:079dce86dde9e567f26ba81a6248eafa34d1cb6e4e0f998ad96c53d80fb18890","observation_id":"f43c0bdd-bdf1-41f4-8705-3edb26ee8bc7","resolution":{"observed_at":"2026-08-12T13:35:55.924252Z","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-12T13:35:55.929345Z","title":"Link prediction based on graph neural net- works,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.929345Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:4cb7f320fbc04c3dfbfb45165f895b401cbc0b135d75df502f1be4430b383b74","observation_id":"ed51a0ed-733b-41ee-a42a-79c9564ced45","resolution":{"observed_at":"2026-08-12T13:35:55.929345Z","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-12T13:35:56.120644Z","title":"Transportation network test problems,","venue":null,"work_id":"d14383a9-49eb-491e-84ce-6dc1bc4d0f93","year":2024},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.933922Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:2e1a4678c18815930d7920fcc9972bace80e17b89fd0f4709409857fba864293","observation_id":"55d3b652-4b7d-4f67-b9d6-537820382f20","resolution":{"observed_at":"2026-08-12T13:35:56.125841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.104137Z","title":"Navigation with time limits in transportation networks: A fourth moment approach,","venue":null,"work_id":"d7de5424-7f3e-4667-88a0-0c643a4ec21b","year":2022},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.938514Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:b9493a1caa596442acb2dea2ef3e28aaa2e7cb3a7fdbe22b5577fb5cd421a5de","observation_id":"94672f56-6706-4d69-8e95-9b72d951a4dd","resolution":{"observed_at":"2026-08-12T13:35:56.109670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.089034Z","title":"Algorithms for most reliable routes on stochastic and time-dependent networks,","venue":null,"work_id":"a44b31c1-b8ee-41d5-a372-7530cc4bbf72","year":2020},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.943147Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:dcc3e4ba9eb0aeec41d0312d6d646d4b58b1f42c6462a53a24b7890b8b3fe02a","observation_id":"a1a651bd-c508-4f51-a7b5-5d4c27f6911d","resolution":{"observed_at":"2026-08-12T13:35:56.093740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.073648Z","title":"Most reliable path-finding algorithm for maximizing on-time arrival probability,","venue":null,"work_id":"760e4720-f05a-4f17-a42d-8c536698cbbb","year":2017},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.947441Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:79b8e44ab395cdd22285d8ef45b65a51e31cd4361cc5f5aa2686f855e236c7b6","observation_id":"e1bd9bfa-704e-4fa3-8e18-afcfd669d8ac","resolution":{"observed_at":"2026-08-12T13:35:56.078470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.058182Z","title":"Dual dynamic programming for the mean standard deviation Canadian traveller problem,","venue":null,"work_id":"5e715f67-a59a-481c-ad9f-294c558de90a","year":2022},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.951726Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:234ac717df5514e876732a9e1bb5373429317d969e52406d6b2ce55a0c4769f4","observation_id":"ea66b6a8-1c72-420c-956a-b8f5fd65e5c3","resolution":{"observed_at":"2026-08-12T13:35:56.063082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:35:56.040606Z","title":"GP4: Gaussian process proactive path planning for the stochastic on time arrival problem,","venue":null,"work_id":"f3ff2153-96a1-44bd-ba5d-7cc2cb2e6a6f","year":2021},"citing_paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T13:35:55.956180Z"},"links":{"citing_paper":"/paper/2411.16134"},"observation_digest":"sha256:9031984ab2a8acc5e1c495a4e3eaccc091b64f1e03b0b31e8150716d57e4ca93","observation_id":"c1ad98e3-24a4-4def-8671-50969a56aa76","resolution":{"observed_at":"2026-08-12T13:35:56.047109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16134","last_updated":"2024-11-25T06:48:50Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-12T13:29:07.832376Z","submitted_at":"2024-11-25T06:48:50Z","title":"Multi-Robot Reliable Navigation in Uncertain Topological Environments with Graph Attention Networks"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":37},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2411.16134."}