{"as_of":"2026-08-21T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4806b5fea2e3c3f08a80dbb5fdf24a511dc6ea0e2b2aae1c9e079e0370491b27","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:39:13.510899Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2505.09472/citation-record","integrity":"/paper/2505.09472/integrity","json":"/paper/2505.09472/citation-record.json","paper":"/paper/2505.09472"},"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-15T21:39:13.807392Z","title":"Intractability of time-optimal mul- tirobot path planning on 2d grid graphs with holes","venue":null,"work_id":"c11fd0e3-1b70-46b6-a89b-3136208f4b78","year":2017},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.410961Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:d878fb132b32b83552df0ee093237361c4266755799f76bb064ded7a8b0383d5","observation_id":"7392a733-6a03-4cf9-92ac-e3f6bc71116c","resolution":{"observed_at":"2026-08-15T21:39:13.810785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.751455Z","title":"A multi-label a* algorithm for multi-agent pathfinding","venue":null,"work_id":"225696c1-900f-49ec-971d-91d4a3f0c4ca","year":2019},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.435777Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:f1d1478cd8242568c6043bd883ab8fbc77a1d20b2f5ad69172ea7734e45007b3","observation_id":"a8f1f556-aea1-48da-bf82-de524f4cc407","resolution":{"observed_at":"2026-08-15T21:39:13.755710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.718803Z","title":"Periodic multi-agent path planning","venue":null,"work_id":"8d7529c0-5638-45e4-a518-63d4cf151d24","year":2023},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.449383Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:9094e681b09eb0c7ff96a2daf6b3c3932a2873d4f76c4144236e40e75c4c7041","observation_id":"61852e4b-17db-401e-adaf-19d27841a1f5","resolution":{"observed_at":"2026-08-15T21:39:13.722780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.679650Z","title":"Lifelong multi-agent path finding in large-scale ware- houses","venue":null,"work_id":"ce0fbb04-78c5-45b4-9350-9d726e2f9f6f","year":2021},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.464740Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:13a301a13628681f989290462e7b0f9fe5adb2091b65f0d2ce22e8897787d2d3","observation_id":"8365b1da-f0fc-40c9-b9f8-7935a765ee6b","resolution":{"observed_at":"2026-08-15T21:39:13.683163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.658800Z","title":"Multi-agent path finding with delay probabilities","venue":null,"work_id":"a53dcf06-b953-4bfd-b988-33df9bef0073","year":2017},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.472217Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:61fbf9118b5de10e7411f434efd6a73144338630cc63f9c7dced029b22242713","observation_id":"384878ef-5925-435b-bf8f-f7753e6c6905","resolution":{"observed_at":"2026-08-15T21:39:13.662408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.647586Z","title":"Certify- ing algorithms","venue":null,"work_id":"d702da4a-4894-41fc-8d31-f37d76f7cf63","year":2011},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.475868Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:8f9675206cde11e604db12fe5ae630a48f0579ea9f84a81ad31a8042fc449b08","observation_id":"aa4e5813-db24-4783-8bb8-d1c072295728","resolution":{"observed_at":"2026-08-15T21:39:13.651351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.622803Z","title":"Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T","venue":null,"work_id":"ce813af6-865d-4f3d-8328-9457f3c21cac","year":2019},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.483214Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:a38b7565b7a0bd246f496e950fcaff1af912acd2b9da1f65866a52fa146ffd84","observation_id":"ea475784-edba-4754-81c0-63440b3bdccc","resolution":{"observed_at":"2026-08-15T21:39:13.626780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.611546Z","title":"Online multi-agent pathfinding","venue":null,"work_id":"70221681-462e-434c-9221-3b694ab47555","year":2019},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.486782Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:b0c1e58da043eaab7d6fe4edaef737f9f0586427d52d18e47cf937ab7b52f089","observation_id":"1ef106fe-4d8e-4aec-ba84-ffb436a85d8a","resolution":{"observed_at":"2026-08-15T21:39:13.615360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.598038Z","title":"Multi-goal multi-agent pickup and deliv- ery","venue":null,"work_id":"00a62652-e2d0-4aa0-924f-9d6c2f3b1952","year":2022},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.490787Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:16af25c96bd2f44d9bf1db5a689579397ad8d73a2f3a14642bf537ea18cad738","observation_id":"89ea3bcc-d455-49a4-a120-aea6e71b4444","resolution":{"observed_at":"2026-08-15T21:39:13.602480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.586674Z","title":"Multi-agent path finding with mutex propagation","venue":null,"work_id":"4baf9838-27af-4ba6-8115-dcf136b02947","year":2022},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.494642Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:aa20078218bed6f525b736be29d57e43af92fcf765bf6f40345fde93c6f241f8","observation_id":"60ffb3d1-0c22-4384-9433-123591f4db9a","resolution":{"observed_at":"2026-08-15T21:39:13.590165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.576371Z","title":"Guidance graph op- timization for lifelong multi-agent path finding","venue":null,"work_id":"1d3089ba-a4e2-49d9-b05d-ef84b6cf6ab2","year":2024},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.499471Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:7fdc1250b6f5223c9ae12fe1af555dd7b5b5e9f58cb260f32cded4d5ca313729","observation_id":"f005e847-5e5b-4cf5-9756-6693a048edab","resolution":{"observed_at":"2026-08-15T21:39:13.579556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.566377Z","title":null,"venue":null,"work_id":"8425c8f2-969d-48de-a225-65dc7066fcd9","year":2017},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.503792Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:9218a73e60dadb261e0da6ef681c5a0c80857e4c66d3dc7eee4511cf3c1037fc","observation_id":"81ac2d5d-3930-4b5a-9022-854325981304","resolution":{"observed_at":"2026-08-15T21:39:13.569527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.556685Z","title":null,"venue":null,"work_id":"7cb3e2f5-9a8d-494a-90ac-1c4c1927cecd","year":1984},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.507246Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:b69f6dec753d136bf12102c67e7a31886550e93b66de76e60fe0665964b8abcd","observation_id":"382c3327-3058-42e8-8d30-61e97b865288","resolution":{"observed_at":"2026-08-15T21:39:13.559633Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.543005Z","title":"E Discussion of Non-Uniform Cycle Time In this section, we present the extended definitions of cyclic conflict and constraints for the ASCBS algorithm with non- uniform cycle time","venue":null,"work_id":"27f383f5-3d8d-4a0b-91e2-4a671b204061","year":2011},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.510899Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:114bea5de3601cbceb1222c04fa84b822119437192bdf883a24e6769611f5bd6","observation_id":"775a9e4e-933c-41d1-bcc7-c5d3ed05edac","resolution":{"observed_at":"2026-08-15T21:39:13.549318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.730005Z","title":"Multi-agent path finding for uav traffic management","venue":null,"work_id":"bdc6c991-e9b8-4756-9676-e2f3a78043b3","year":2019},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":1968,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.445400Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:a8f8a8149f8c9a374e5e052651c68075b724ecc756ad7ba9240bdd536c5b30ff","observation_id":"d58213f5-2ef0-4d49-9834-ffc3f5a008fe","resolution":{"observed_at":"2026-08-15T21:39:13.733698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.689491Z","title":"Improved heuristics for multi- agent path finding with conflict-based search","venue":null,"work_id":"590058a1-a484-430d-94a2-da94f321ee6a","year":2019},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.461248Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:d13dc4bc374e88e5ccc8b3c6743d7ad1b5a185f1be5074bad14a257396c766ff","observation_id":"31a497d5-06d5-44c1-b92d-44e4e76bdfaf","resolution":{"observed_at":"2026-08-15T21:39:13.692565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.698788Z","title":"Coordinating pebble motion on graphs, the diameter of permutation groups, and applications","venue":null,"work_id":"40f5624f-2ba9-42f1-a259-f9520919e14b","year":1984},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.457356Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:a5ae53ffff43caeb420ea3a2caf918c39ec5d36c27880440358b39a76761c0ec","observation_id":"7b6c4811-d38c-4c89-9d3e-db7ef9d72baa","resolution":{"observed_at":"2026-08-15T21:39:13.701975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.635733Z","title":"Conflict-based search for optimal multi-agent pathfinding","venue":null,"work_id":"4de14227-e44f-4c9d-bcf7-a5a80cb0ef05","year":2015},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.479616Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:d94f7ec79a3d9d3e23c987f24fdd137acd456acb68aeecfef8b30e6470136c62","observation_id":"532b5440-e3d6-4033-9183-a40f9399f299","resolution":{"observed_at":"2026-08-15T21:39:13.640159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.774402Z","title":"Assembly line balancing: What happened in the last fifteen years? European Journal of Operational Research, 301(3):797–814,","venue":null,"work_id":"2fcad9cd-037c-4491-9527-c09aabfeb8bb","year":2022},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.424695Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:a50ec09b1d65a9c24e53dfcbc78aa1438cd0f947d40344f3ec98f673dc29c731","observation_id":"4b0f702f-d2bb-44a0-8fe7-30b3cdb01348","resolution":{"observed_at":"2026-08-15T21:39:13.778486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.796984Z","title":"From multi-agent pathfinding to 3d pipe routing","venue":null,"work_id":"284d6601-860d-4033-9f23-3584e7c2cd84","year":2020},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.415946Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:de5413293e7700a1e4cf480e6277aeb29e83022ced5bdcaf984221beb1b9a0ce","observation_id":"4fe97119-ad2e-4084-b10f-b10ea9540e02","resolution":{"observed_at":"2026-08-15T21:39:13.800628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.740930Z","title":"A formal basis for the heuristic determination of minimum cost paths","venue":null,"work_id":"4be09355-49a5-4b0a-b234-ab2be8356aff","year":1968},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.440740Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:b6b0f4e9693de853d93f4c42a62d13fdc30a163bc0ec1f5163166e70edfce986","observation_id":"11be0289-cddb-465f-a272-996c0dbc2452","resolution":{"observed_at":"2026-08-15T21:39:13.744508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.786650Z","title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding","venue":null,"work_id":"f342eb62-07e2-422e-8432-75565089d008","year":2015},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.419964Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:354fb29e39d23217700bc97214d54a32eae92372f5d24287018cfdd698a109ca","observation_id":"f2052d32-6735-4d19-8541-cfc691fc168b","resolution":{"observed_at":"2026-08-15T21:39:13.790291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.669482Z","title":"Intersection coordination with priority-based search for autonomous vehicles","venue":null,"work_id":"9aaf854d-d2a9-45c9-906a-9ffd66abb972","year":2023},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.468742Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:24fb44863574bccf18a92c5fc8c0a6994b6c96b574afb4daa8563faf0e074e48","observation_id":"b65d552f-e383-4eb0-9951-a273a9f764db","resolution":{"observed_at":"2026-08-15T21:39:13.673035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.763223Z","title":"Opti- mal sequential task assignment and path finding for multi- agent robotic assembly planning","venue":null,"work_id":"61b086a9-47e6-4127-a759-a4abf502f389","year":2020},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.429675Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:25303b9a180218cb399b894587ba71702e67213f372bff673f56068b9043a8ae","observation_id":"29a9f383-99a6-4015-8cc2-1d937cb842b6","resolution":{"observed_at":"2026-08-15T21:39:13.767107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:39:13.708005Z","title":"Depth-first iterative- deepening: An optimal admissible tree search","venue":null,"work_id":"ebde4cbc-eb91-4f56-9008-ce1606228dcb","year":1985},"citing_paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T21:39:13.453361Z"},"links":{"citing_paper":"/paper/2505.09472"},"observation_digest":"sha256:8ef917e570bf1399b9e189dd5df80f7995e5564dd25dca3bd0fdf95bed9266a0","observation_id":"58c232e5-2055-4ade-8c23-17228525b732","resolution":{"observed_at":"2026-08-15T21:39:13.711751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09472","last_updated":"2025-05-14T15:22:38Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-16T09:11:32.195206Z","submitted_at":"2025-05-14T15:22:38Z","title":"Streaming Multi-agent Pathfinding"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":25},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.09472."}