{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PHSWHPPFEZW5LNOAJVV2MKPOBN","short_pith_number":"pith:PHSWHPPF","schema_version":"1.0","canonical_sha256":"79e563bde5266dd5b5c04d6ba629ee0b4913b4d7883adac4e8e37a7299fe7d15","source":{"kind":"arxiv","id":"2502.16887","version":1},"attestation_state":"computed","paper":{"title":"Primitive-Swarm: An Ultra-lightweight and Scalable Planner for Large-scale Aerial Swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ang Li, Chao Xu, Fei Gao, Jialiang Hou, Neng Pan, Xin Zhou, Yuxiang Guan, Zhongxue Gan","submitted_at":"2025-02-24T06:36:10Z","abstract_excerpt":"Achieving large-scale aerial swarms is challenging due to the inherent contradictions in balancing computational efficiency and scalability. This paper introduces Primitive-Swarm, an ultra-lightweight and scalable planner designed specifically for large-scale autonomous aerial swarms. The proposed approach adopts a decentralized and asynchronous replanning strategy. Within it is a novel motion primitive library consisting of time-optimal and dynamically feasible trajectories. They are generated utlizing a novel time-optimial path parameterization algorithm based on reachability analysis (TOPP-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.16887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-24T06:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"b3c9277b91d12dae9407718f76da20249e2a82d89d49604068fb8c5f02237151","abstract_canon_sha256":"eb47e6db777a794ad49933a5b4979fd25266a1b10402eec01275d36cd5568353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:01.772940Z","signature_b64":"TnYQJKxhmup9zZwrfZykOUprVunGuh8FrV2vDMJPBZOyHOmL3leq5AK30NOkAtq7PC2oUll+oWMXj2wIlUySAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e563bde5266dd5b5c04d6ba629ee0b4913b4d7883adac4e8e37a7299fe7d15","last_reissued_at":"2026-07-05T10:19:01.772426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:01.772426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitive-Swarm: An Ultra-lightweight and Scalable Planner for Large-scale Aerial Swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ang Li, Chao Xu, Fei Gao, Jialiang Hou, Neng Pan, Xin Zhou, Yuxiang Guan, Zhongxue Gan","submitted_at":"2025-02-24T06:36:10Z","abstract_excerpt":"Achieving large-scale aerial swarms is challenging due to the inherent contradictions in balancing computational efficiency and scalability. This paper introduces Primitive-Swarm, an ultra-lightweight and scalable planner designed specifically for large-scale autonomous aerial swarms. The proposed approach adopts a decentralized and asynchronous replanning strategy. Within it is a novel motion primitive library consisting of time-optimal and dynamically feasible trajectories. They are generated utlizing a novel time-optimial path parameterization algorithm based on reachability analysis (TOPP-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16887","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.16887/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.16887","created_at":"2026-07-05T10:19:01.772492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16887v1","created_at":"2026-07-05T10:19:01.772492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16887","created_at":"2026-07-05T10:19:01.772492+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHSWHPPFEZW5","created_at":"2026-07-05T10:19:01.772492+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHSWHPPFEZW5LNOA","created_at":"2026-07-05T10:19:01.772492+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHSWHPPF","created_at":"2026-07-05T10:19:01.772492+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08593","citing_title":"MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN","json":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN.json","graph_json":"https://pith.science/api/pith-number/PHSWHPPFEZW5LNOAJVV2MKPOBN/graph.json","events_json":"https://pith.science/api/pith-number/PHSWHPPFEZW5LNOAJVV2MKPOBN/events.json","paper":"https://pith.science/paper/PHSWHPPF"},"agent_actions":{"view_html":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN","download_json":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN.json","view_paper":"https://pith.science/paper/PHSWHPPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16887&json=true","fetch_graph":"https://pith.science/api/pith-number/PHSWHPPFEZW5LNOAJVV2MKPOBN/graph.json","fetch_events":"https://pith.science/api/pith-number/PHSWHPPFEZW5LNOAJVV2MKPOBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN/action/storage_attestation","attest_author":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN/action/author_attestation","sign_citation":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN/action/citation_signature","submit_replication":"https://pith.science/pith/PHSWHPPFEZW5LNOAJVV2MKPOBN/action/replication_record"}},"created_at":"2026-07-05T10:19:01.772492+00:00","updated_at":"2026-07-05T10:19:01.772492+00:00"}