{"as_of":"2026-08-22T07:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3542945210b591613d9fb8841e771656da0a5168e75d2c890daf849b43192349","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:58:42.265846Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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/2505.08593/citation-record","integrity":"/paper/2505.08593/integrity","json":"/paper/2505.08593/citation-record.json","paper":"/paper/2505.08593"},"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:58:43.684097Z","title":"Drone swarm path planning for mobile edge computing in industrial internet of things,","venue":null,"work_id":"d3ff562f-b7d2-4be4-a377-3f59674bdd56","year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.331741Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:eb7f4ea9ffd1cb92d8990b09c65d036aa9481bab4c8dc83fc6c73acf6e8907f6","observation_id":"a714f5a6-7844-4efa-8a1d-d545c0cfc1a4","resolution":{"observed_at":"2026-08-15T21:58:43.738404Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:41.403862Z","title":"Multi-uav trajectory planning for 3d visual inspection of complex structures,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.403862Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:99e5d7b8612620739842fc092cfc23cb8e62cf297ff1cf227fb3892035d2bba9","observation_id":"f1e77e35-805d-440a-a02e-3153b0459bdc","resolution":{"observed_at":"2026-08-15T21:58:41.403862Z","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-15T21:58:41.505972Z","title":"Scalable cooperative transport of cable-suspended loads with uavs using distributed trajectory optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.505972Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:68171c04820ccab522afbeb6fdc23038ce2880ea6b2df82098ca03a2c797f0c7","observation_id":"a10f46f5-a5af-4ba1-a1db-26fc64c09b25","resolution":{"observed_at":"2026-08-15T21:58:41.505972Z","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-15T21:58:43.634559Z","title":"Decentralized multi-agent planning using model predictive control and time-aware safe corridors,","venue":null,"work_id":"d830c68a-8f0a-468d-8a31-029f8a731c9a","year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.510666Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:e9e4086e9f1c855d9e89456c930d2233e06a7e59442498b654a2a5f1170b062d","observation_id":"63091698-8bdf-48cb-b1dd-8218f6984069","resolution":{"observed_at":"2026-08-15T21:58:43.639703Z","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-15T21:58:43.618625Z","title":"Robust mader: Decentralized multiagent trajectory planner robust to communication delay in dynamic environments,","venue":null,"work_id":"e69bf433-1dfa-4c35-aeff-b0301fd9d1a8","year":2023},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.515256Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:ff849531e45d57a3bfdc9106a37a9d750d3d4ebcc19edaee55d1742a655b76c0","observation_id":"18004f0b-f77b-420f-a539-10420587c453","resolution":{"observed_at":"2026-08-15T21:58:43.623767Z","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-15T21:58:43.588299Z","title":"Deadlock resolution and recursive feasibil- ity in mpc-based multi-robot trajectory generation,","venue":null,"work_id":"fdc30042-8d07-4f61-833b-860e8a9fab30","year":2024},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.525240Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:b1b1e0c961fce747d23e069d0d98a1faa135fcba9fd1e71420b733b6d01b47fc","observation_id":"5e8b995e-2256-49f0-9854-94cc3acaed32","resolution":{"observed_at":"2026-08-15T21:58:43.593549Z","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":{"arxiv_id":"2502.16887","last_updated":"2025-02-24T06:36:10Z","snapshot_observed_at":"2026-08-20T15:12:49.487945Z","submitted_at":"2025-02-24T06:36:10Z","title":"Primitive-Swarm: An Ultra-lightweight and Scalable Planner for Large-scale Aerial Swarms","version":1},"cited_work":{"arxiv_id":"2502.16887","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.16887","snapshot_observed_at":"2026-08-15T21:58:42.530293Z","title":"Primitive-Swarm: An Ultra-lightweight and Scalable Planner for Large-scale Aerial Swarms","venue":"cs.RO","work_id":"3a1e32ed-f148-4b30-bd39-a32790e6c41f","year":2025},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.529656Z"},"links":{"cited_paper":"/paper/2502.16887","citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:249e13b3853aa0c650a8362b89fa2150313f59de6472506c7cd41fc15683e656","observation_id":"8d1277b7-4889-4f87-a989-3b095fee1509","resolution":{"observed_at":"2026-08-15T21:58:42.535657Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-15T21:58:43.537653Z","title":"Multirobot exploration of communication-restricted environments: A survey,","venue":null,"work_id":"acb206ae-9023-4347-907a-58167037f579","year":2017},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.534523Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:6a7502b5fbbda63061c0bdc6d017c75902e4a8cb7dcd70280abc0b43f194bff9","observation_id":"338eae30-afbc-48a9-bd2e-eead1840eb87","resolution":{"observed_at":"2026-08-15T21:58:43.578596Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:41.539281Z","title":"Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.539281Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:948f47e735a6c42f82ecd6a2464c32455e3d2046ff313aae55e7a224d1c3dcbd","observation_id":"a1aa31bf-ada3-4463-822a-db863ca5c01e","resolution":{"observed_at":"2026-08-15T21:58:41.539281Z","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-15T21:58:43.405779Z","title":"Efficient multi-agent trajectory planning with feasibility guarantee using relative bernstein polynomial,","venue":null,"work_id":"2b62b56b-f895-4523-9307-01f2723a0226","year":2020},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.543730Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:2c1bba920231a8f55e53f117f291029efdb260c598dcab0d7724984159c3b777","observation_id":"4db4db38-2fc7-4f2d-9684-16d3cb8d1af2","resolution":{"observed_at":"2026-08-15T21:58:43.469444Z","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-15T21:58:43.392315Z","title":"Safe and complete trajectory generation for robot teams with higher-order dynamics,","venue":null,"work_id":"3538910d-b961-4b81-972b-8db59b5085cb","year":2016},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.548359Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:d4efd1358b1fb79aff274421872b76f8df159cce936789f119dbc169f2401b45","observation_id":"d30d118a-057e-488e-b0aa-695d22fc88b4","resolution":{"observed_at":"2026-08-15T21:58:43.396460Z","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-15T21:58:43.375365Z","title":"High-speed motion planning for aerial swarms in unknown and cluttered environments,","venue":null,"work_id":"3490df7b-6c6c-4e0a-b32f-b3615cc45385","year":2024},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.552541Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:7c16f39a275dd18920ec1b83caa4d70bf84bc5d6d3be8aa8919b7bc7fb3bd117","observation_id":"f23d9b9f-b939-4e47-9009-ddce273afb13","resolution":{"observed_at":"2026-08-15T21:58:43.381000Z","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-15T21:58:43.291761Z","title":"T-star: Time-optimal swarm trajectory planning for quadrotor unmanned aerial vehicles,","venue":null,"work_id":"497bd7fa-d66b-4c0f-bd12-c64a8c0dacdb","year":2025},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.642989Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:ac2197aed012fd6ad4b6ebbaea76f00292e3e48e0664043f038f2781e8f25560","observation_id":"3970cf11-bf24-442f-83e4-248dc3f32700","resolution":{"observed_at":"2026-08-15T21:58:43.337748Z","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-15T21:58:43.142373Z","title":"Mader: Trajectory planner in multiagent and dynamic environments,","venue":null,"work_id":"2e38c1a2-226f-40f1-a8df-dc73601205e0","year":2021},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.756195Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:3c9152b4e3be42b474de9478541ce7092b52d32243691e2460de7986900c11c9","observation_id":"1b4e859a-a372-4a17-ae2d-552b411d1553","resolution":{"observed_at":"2026-08-15T21:58:43.198484Z","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-15T21:58:43.128280Z","title":"Minvo basis: Finding simplexes with minimum volume enclosing polynomial curves,","venue":null,"work_id":"869b6acc-c1be-4af8-8847-5c98384bb774","year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.760978Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:35223584c141c8347b3349bb6f62be5ff13f4339486b31c3000433477ffa0c9b","observation_id":"a114653a-0e66-4bf2-83d3-66ef1426a7e4","resolution":{"observed_at":"2026-08-15T21:58:43.132956Z","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-15T21:58:43.112922Z","title":"Swarm of micro flying robots in the wild,","venue":null,"work_id":"4c818efd-36bd-4faa-873b-0e8a71bc28c9","year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.765304Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:f0d884874df0591d044a2e4ca9bf4af206dfe857b56594c65b1151f27b9573a0","observation_id":"f6211042-42ec-45a4-90d8-c3e0d5e7f2c1","resolution":{"observed_at":"2026-08-15T21:58:43.117759Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:41.769867Z","title":"Geometrically constrained tra- jectory optimization for multicopters,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.769867Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:84234a2db01cc2a8730eaa3c90236372f96a24bd4b0f568b3467d9401736689c","observation_id":"c2a7c1a3-f122-45c2-a8ed-2dcca4c45f2e","resolution":{"observed_at":"2026-08-15T21:58:41.769867Z","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-15T21:58:43.087572Z","title":"Dream: Decentralized real-time asynchronous probabilistic trajectory planning for collision-free multi- robot navigation in cluttered environments,","venue":null,"work_id":"7c2aadc6-72fa-4489-af9c-93780d72fa15","year":2024},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.775047Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:526e6358f4ee6c5afd48eab82ff2241318b69e10d9948dc5bbb6a7de71c7f3a0","observation_id":"01cb6b37-c2f5-4360-9869-0bd21bdf6f5f","resolution":{"observed_at":"2026-08-15T21:58:43.092909Z","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-15T21:58:42.983615Z","title":"Gcbf+: A neural graph control barrier function framework for distributed safe multi-agent control,","venue":null,"work_id":"bcdf673e-6dab-4342-8d7f-82b39887cceb","year":2025},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.779721Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:717c16a9014eb984496e349ee628561fa89babd86c9f3454fa1f6a3ef88b7bc4","observation_id":"0ceedd14-9279-4ee1-81b2-01714f106410","resolution":{"observed_at":"2026-08-15T21:58:43.010545Z","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":{"arxiv_id":"2310.19511","last_updated":"2025-05-06T08:57:44Z","snapshot_observed_at":"2026-08-16T14:47:39.645820Z","submitted_at":"2023-10-30T13:10:05Z","title":"Rule-Based Lloyd Algorithm for Multi-Robot Motion Planning and Control with Safety and Convergence Guarantees","version":3},"cited_work":{"arxiv_id":"2310.19511","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.19511","snapshot_observed_at":"2026-08-15T21:58:42.303736Z","title":"Rule-Based Lloyd Algorithm for Multi-Robot Motion Planning and Control with Safety and Convergence Guarantees","venue":"cs.RO","work_id":"c7043b68-a0ef-42f4-af23-c0a29cf718c3","year":2023},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.784338Z"},"links":{"cited_paper":"/paper/2310.19511","citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:cc0daa443c6d269983b942a02184ca5f0038120a70d1452757dd08f199e6dbea","observation_id":"f59e82c8-dbd6-47dd-b02c-9748a4efb162","resolution":{"observed_at":"2026-08-15T21:58:42.366290Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-15T21:58:42.967707Z","title":"Reactive mission and motion planning with deadlock resolution avoiding dynamic obstacles,","venue":null,"work_id":"3f11b43b-30f1-4727-bef9-d7688231f4c7","year":2018},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.789519Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:d238c2f2607647babfc199100bf653eeb5af3411f0dad24752c2fbcf2cdbb1c3","observation_id":"3829b35b-8ac4-4cb1-883e-df5d258a5861","resolution":{"observed_at":"2026-08-15T21:58:42.973286Z","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-15T21:58:42.952389Z","title":"Decentralized trajectory planning for quadrotor swarm in cluttered environments with goal convergence guarantee,","venue":null,"work_id":"2dbe09b8-923e-4e88-a21d-df6dbce27b01","year":null},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:41.883331Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:b3afd13216a402aa6ec3f8aa4d09708370864a0fb2aadb512de29c21a87e04b0","observation_id":"e37eb230-bf55-4a1a-89f8-3dfd67f723a4","resolution":{"observed_at":"2026-08-15T21:58:42.957043Z","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-15T21:58:42.928194Z","title":"Weighted buffered voronoi cells for distributed semi-cooperative behavior,","venue":null,"work_id":"fe6fd217-09d2-478d-9d88-98a38ac4880d","year":2020},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.030118Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:ebf26c1bf369f2025c2f19340ac5dc95c101fae59ea43de86067188676f04933","observation_id":"d447eb90-7385-461a-ad14-8bd99707898e","resolution":{"observed_at":"2026-08-15T21:58:42.932891Z","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-15T21:58:43.604030Z","title":"Deadlock prediction and recovery for distributed collision avoidance with buffered voronoi cells,","venue":null,"work_id":"c3fba9c9-5701-4513-9756-1b2a794f2da1","year":2021},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.035473Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:4ea7b35b31b9996967d7346add1b9ea2e557386daf5585e79fdcb893dd8e10db","observation_id":"a9c2cbdb-06f1-4f84-a692-6f3108ea695d","resolution":{"observed_at":"2026-08-15T21:58:43.608893Z","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-15T21:58:42.857118Z","title":"Grpavoid: Multigroup collision- avoidance control and optimization for uav swarm,","venue":null,"work_id":"72f7adf6-9516-4db6-962e-56fee93b541b","year":2021},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.040150Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:d5ed8675d59e134b9169637183c7289f0c47fb9f57e3d702de642d44c5884fd4","observation_id":"e74eb27f-7d19-4fe5-8257-3d53fff2a9cc","resolution":{"observed_at":"2026-08-15T21:58:42.881879Z","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-15T21:58:42.842282Z","title":"Multi-uav cooper- ative motion planning under global spatio-temporal path inspiration in constraint-rich dynamic environments,","venue":null,"work_id":"62380b22-b6c7-49f5-90ed-ac5e0e80860d","year":2024},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.044860Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:8e96fe9f39cd0972ac282cbb3ca458015a07870912274a00565a19390bdf3dae","observation_id":"3fab0419-78e4-462a-a471-300844ef0783","resolution":{"observed_at":"2026-08-15T21:58:42.847718Z","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-15T21:58:43.360552Z","title":"Force-based algorithm for motion planning of large agent,","venue":null,"work_id":"e58cf2b4-e40a-49f3-9db8-898589d967b9","year":2020},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.049347Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:cbbd30e0989b61f0f1be128716a8a8f1868f69888d48f10ca5827271116ad737","observation_id":"f0c4866b-ef62-45db-be79-a37d267706d0","resolution":{"observed_at":"2026-08-15T21:58:43.365276Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:42.054503Z","title":"Least squares quantization in pcm,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.054503Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:259a342e2049b216b76a611cbb0d0e68ec4df1d8253c09d6c5cc95773975d9dc","observation_id":"fe5d7333-93b7-4ff3-bf65-a7b1beeca937","resolution":{"observed_at":"2026-08-15T21:58:42.054503Z","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-15T21:58:42.060111Z","title":"Online distributed trajectory planning for quadrotor swarm with feasibility guarantee using linear safe corridor,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.060111Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:c7e35afd208483b1d9ae414b5ec8248b4a2fc52cb0661ea9f8a673404872e2fc","observation_id":"7eff2add-1143-4789-b451-4ee602305862","resolution":{"observed_at":"2026-08-15T21:58:42.060111Z","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-15T21:58:42.809892Z","title":"Dlsc: Distributed multi-agent trajectory planning in maze-like dynamic environments using linear safe corridor,","venue":null,"work_id":"5a99addc-4359-4690-9de4-75dd9e0bf2a0","year":2023},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.064179Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:44b46aa901b098acc346d96096cc0451c5d393c813b76fcf4feadd6c98cbf9a1","observation_id":"ec816719-e6d8-4fce-ac96-bf0625187a1e","resolution":{"observed_at":"2026-08-15T21:58:42.814591Z","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-15T21:58:42.726381Z","title":"Network time protocol version 4: Protocol and algorithms specification,","venue":null,"work_id":"fde74177-58c1-4d12-8960-bde2943adce9","year":2010},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.124099Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:b770fbc9d5e0c277841b84ad305a4a6535a32fd623b0355c4ca9372af947dd57","observation_id":"0d22f9bb-b325-47ea-b527-cedf2b7e7478","resolution":{"observed_at":"2026-08-15T21:58:42.762303Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:42.187376Z","title":"Decentralized deadlock-free trajectory planning for quadrotor swarm in obstacle-rich environments,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.187376Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:2b796e24b159e1c389af8f564298a76c3fb55ee8f71099e005d28e16c61e30ee","observation_id":"82e204ac-4517-4330-b64a-531fa61f2945","resolution":{"observed_at":"2026-08-15T21:58:42.187376Z","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-15T21:58:42.226868Z","title":"Priority inheri- tance with backtracking for iterative multi-agent path finding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.226868Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:0decda509bd597d30440a4170196c7a43319bb78d7cdf59bf4eab86258f05c18","observation_id":"33d93802-d164-4cc0-9a11-6fd67c03ef34","resolution":{"observed_at":"2026-08-15T21:58:42.226868Z","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-15T21:58:42.693341Z","title":"Real-time trajectory generation for constrained nonlinear dynamical systems using non-uniform rational b-spline basis functions,","venue":null,"work_id":"b0d0b08c-d5a6-4867-811d-188f5194b01a","year":2008},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.231567Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:2391b2e3aacf0baffbcf314a774e3d8292e39f64a2ef12d5006a44d8b2ed93c0","observation_id":"27cbf569-e04d-4896-807c-ddf9eb360400","resolution":{"observed_at":"2026-08-15T21:58:42.698063Z","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-15T21:58:42.677803Z","title":"Efficient multi-agent trajectory planning with feasibility guarantee using relative bernstein polynomial,","venue":null,"work_id":"73a650dc-8701-4896-82a1-694b0b39ec51","year":2020},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.236321Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:6dc1ccfd7b3e09939b7d1150dd900eac9d2670aadc50b96a2884f9959138f3cb","observation_id":"5f17cc5e-4619-4161-98d9-d2f54222fdfb","resolution":{"observed_at":"2026-08-15T21:58:42.682785Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:42.241154Z","title":"Fast, on-line collision avoidance for dynamic vehicles using buffered voronoi cells,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.241154Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:341de05a44ae70866196ef4db8e0d2b32fef254f33c37cb50302900c19aa42d9","observation_id":"59fb007a-0302-494b-9d1a-8bba3adbdab3","resolution":{"observed_at":"2026-08-15T21:58:42.241154Z","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-15T21:58:42.631637Z","title":"Asynchronous real-time decentral- ized multi-robot trajectory planning,","venue":null,"work_id":"fb5a5dca-86cb-47b6-ac10-3a5e21458889","year":2022},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.245909Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:1a8721c923513e03e580a35482c7c0bf2f3b9c482cf9ef39e149663a83438797","observation_id":"440b9bc0-25aa-49c6-a0a7-16143714bf96","resolution":{"observed_at":"2026-08-15T21:58:42.667193Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:58:42.251021Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.251021Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:d378c9f92857088e40230258bfa01feaf26b06dae4034d8f22ca26e42be7b817","observation_id":"ce80d62f-8487-4d4a-817c-2750287777b2","resolution":{"observed_at":"2026-08-15T21:58:42.251021Z","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-15T21:58:42.255426Z","title":"Octomap: An efficient probabilistic 3d mapping framework based on octrees,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.255426Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:3859d115c4e8edf0394164c903382d8e58d03320d7e57b39d6425b9ccdbcac0f","observation_id":"5613f921-612e-470f-85bc-82ce87b61188","resolution":{"observed_at":"2026-08-15T21:58:42.255426Z","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-15T21:58:42.562094Z","title":"12.7. 0 user’s manual,","venue":null,"work_id":"c736d423-255b-4c2a-9021-e38d4dacbc56","year":2016},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.260832Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:2be67d3124c84b9563b26c984a9657c8791eb53e8469678b614ce70287b3cbdc","observation_id":"cef6d0d3-12e9-4e95-8267-48c486407c66","resolution":{"observed_at":"2026-08-15T21:58:42.567019Z","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-15T21:58:42.546400Z","title":"Crazyflie 2.0 quadrotor as a platform for research and education in robotics and control engineering,","venue":null,"work_id":"d2351e57-fd76-44aa-9b64-5533b8513683","year":2017},"citing_paper":{"arxiv_id":"2505.08593","last_updated":"2025-05-13T14:05:07Z","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:58:42.265846Z"},"links":{"citing_paper":"/paper/2505.08593"},"observation_digest":"sha256:338f3a103a82a916a348118fedc2aa2442940b56a48c4916ac27cfa2763b5c96","observation_id":"16efd0e6-a727-4598-be13-57a0bb5bf6c0","resolution":{"observed_at":"2026-08-15T21:58:42.552035Z","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":"2505.08593","last_updated":"2025-05-13T14:05:07Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T21:36:59.969525Z","submitted_at":"2025-05-13T14:05:07Z","title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":28},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2505.08593."}