{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UHHUH5BZ2VXQOOUE3Q7PX634F7","short_pith_number":"pith:UHHUH5BZ","schema_version":"1.0","canonical_sha256":"a1cf43f439d56f073a84dc3efbfb7c2fd162cdaaca087baee303c713da591bb8","source":{"kind":"arxiv","id":"2505.15679","version":1},"attestation_state":"computed","paper":{"title":"SwarmDiff: Swarm Robotic Trajectory Planning in Cluttered Environments via Diffusion Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Chang Liu, Chunxuan Jiao, Kang Ding, Kangjie Zhou, Pengying Wu, Yao Mu, Yunze Hu","submitted_at":"2025-05-21T15:56:55Z","abstract_excerpt":"Swarm robotic trajectory planning faces challenges in computational efficiency, scalability, and safety, particularly in complex, obstacle-dense environments. To address these issues, we propose SwarmDiff, a hierarchical and scalable generative framework for swarm robots. We model the swarm's macroscopic state using Probability Density Functions (PDFs) and leverage conditional diffusion models to generate risk-aware macroscopic trajectory distributions, which then guide the generation of individual robot trajectories at the microscopic level. To ensure a balance between the swarm's optimal tra"},"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":"2505.15679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-05-21T15:56:55Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"5e3a43ed1f3f8a5632e5f8d6f62c12e62e52ab1f547ee79766b39949cc7a356e","abstract_canon_sha256":"31816dc410dd9106af0e141859ac0eadafabd926080da402dbed9afec81b2cd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:49.464104Z","signature_b64":"dOMsH+WSESwaWFtUQHl4nY1cWvZRiHsLl7axwvQAKxkUWAZGupR2E8acjfAWWiI5KCTDeu/eRo/9XmVXEdZiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1cf43f439d56f073a84dc3efbfb7c2fd162cdaaca087baee303c713da591bb8","last_reissued_at":"2026-07-05T11:06:49.463668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:49.463668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SwarmDiff: Swarm Robotic Trajectory Planning in Cluttered Environments via Diffusion Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Chang Liu, Chunxuan Jiao, Kang Ding, Kangjie Zhou, Pengying Wu, Yao Mu, Yunze Hu","submitted_at":"2025-05-21T15:56:55Z","abstract_excerpt":"Swarm robotic trajectory planning faces challenges in computational efficiency, scalability, and safety, particularly in complex, obstacle-dense environments. To address these issues, we propose SwarmDiff, a hierarchical and scalable generative framework for swarm robots. We model the swarm's macroscopic state using Probability Density Functions (PDFs) and leverage conditional diffusion models to generate risk-aware macroscopic trajectory distributions, which then guide the generation of individual robot trajectories at the microscopic level. To ensure a balance between the swarm's optimal tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15679","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/2505.15679/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":"2505.15679","created_at":"2026-07-05T11:06:49.463725+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15679v1","created_at":"2026-07-05T11:06:49.463725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15679","created_at":"2026-07-05T11:06:49.463725+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHHUH5BZ2VXQ","created_at":"2026-07-05T11:06:49.463725+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHHUH5BZ2VXQOOUE","created_at":"2026-07-05T11:06:49.463725+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHHUH5BZ","created_at":"2026-07-05T11:06:49.463725+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.17244","citing_title":"Scalable Multi Agent Diffusion Policies for Coverage Control","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7","json":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7.json","graph_json":"https://pith.science/api/pith-number/UHHUH5BZ2VXQOOUE3Q7PX634F7/graph.json","events_json":"https://pith.science/api/pith-number/UHHUH5BZ2VXQOOUE3Q7PX634F7/events.json","paper":"https://pith.science/paper/UHHUH5BZ"},"agent_actions":{"view_html":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7","download_json":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7.json","view_paper":"https://pith.science/paper/UHHUH5BZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15679&json=true","fetch_graph":"https://pith.science/api/pith-number/UHHUH5BZ2VXQOOUE3Q7PX634F7/graph.json","fetch_events":"https://pith.science/api/pith-number/UHHUH5BZ2VXQOOUE3Q7PX634F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7/action/storage_attestation","attest_author":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7/action/author_attestation","sign_citation":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7/action/citation_signature","submit_replication":"https://pith.science/pith/UHHUH5BZ2VXQOOUE3Q7PX634F7/action/replication_record"}},"created_at":"2026-07-05T11:06:49.463725+00:00","updated_at":"2026-07-05T11:06:49.463725+00:00"}