{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7KPOO26CM25NY2UTP65OV6INKU","short_pith_number":"pith:7KPOO26C","schema_version":"1.0","canonical_sha256":"fa9ee76bc266badc6a937fbaeaf90d5525bc2d01de75bfd02f51ae1d9e2912c8","source":{"kind":"arxiv","id":"2503.20324","version":1},"attestation_state":"computed","paper":{"title":"CTS-CBS: A New Approach for Multi-Agent Collaborative Task Sequencing and Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Jianqiang Wang, Junkai Jiang, Ruochen Li, Shaobing Xu, Yibin Yang, Yihe Chen, Yuning Wang","submitted_at":"2025-03-26T08:47:43Z","abstract_excerpt":"This paper addresses a generalization problem of Multi-Agent Pathfinding (MAPF), called Collaborative Task Sequencing - Multi-Agent Pathfinding (CTS-MAPF), where agents must plan collision-free paths and visit a series of intermediate task locations in a specific order before reaching their final destinations. To address this problem, we propose a new approach, Collaborative Task Sequencing - Conflict-Based Search (CTS-CBS), which conducts a two-level search. In the high level, it generates a search forest, where each tree corresponds to a joint task sequence derived from the jTSP solution. In"},"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":"2503.20324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-26T08:47:43Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"236136022036fb589dd81c39dc7e9accebc11172ad1df89a3ccac40e11f325e4","abstract_canon_sha256":"a56d1f3402854c2e9513fcc91cfcd4e5c6bdfa80e20f5e78e49ba355f21eccd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:36.702248Z","signature_b64":"FNR2ZXRDvL1PcMdeQQreIKFy41eRKvxAf8nhw6GqHQxHlwE408FoWeImk9AXrmtXo+WAGXbBIbgJckSydC/JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9ee76bc266badc6a937fbaeaf90d5525bc2d01de75bfd02f51ae1d9e2912c8","last_reissued_at":"2026-07-05T10:39:36.701778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:36.701778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CTS-CBS: A New Approach for Multi-Agent Collaborative Task Sequencing and Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Jianqiang Wang, Junkai Jiang, Ruochen Li, Shaobing Xu, Yibin Yang, Yihe Chen, Yuning Wang","submitted_at":"2025-03-26T08:47:43Z","abstract_excerpt":"This paper addresses a generalization problem of Multi-Agent Pathfinding (MAPF), called Collaborative Task Sequencing - Multi-Agent Pathfinding (CTS-MAPF), where agents must plan collision-free paths and visit a series of intermediate task locations in a specific order before reaching their final destinations. To address this problem, we propose a new approach, Collaborative Task Sequencing - Conflict-Based Search (CTS-CBS), which conducts a two-level search. In the high level, it generates a search forest, where each tree corresponds to a joint task sequence derived from the jTSP solution. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.20324","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/2503.20324/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":"2503.20324","created_at":"2026-07-05T10:39:36.701844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.20324v1","created_at":"2026-07-05T10:39:36.701844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20324","created_at":"2026-07-05T10:39:36.701844+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KPOO26CM25N","created_at":"2026-07-05T10:39:36.701844+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KPOO26CM25NY2UT","created_at":"2026-07-05T10:39:36.701844+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KPOO26C","created_at":"2026-07-05T10:39:36.701844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU","json":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU.json","graph_json":"https://pith.science/api/pith-number/7KPOO26CM25NY2UTP65OV6INKU/graph.json","events_json":"https://pith.science/api/pith-number/7KPOO26CM25NY2UTP65OV6INKU/events.json","paper":"https://pith.science/paper/7KPOO26C"},"agent_actions":{"view_html":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU","download_json":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU.json","view_paper":"https://pith.science/paper/7KPOO26C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.20324&json=true","fetch_graph":"https://pith.science/api/pith-number/7KPOO26CM25NY2UTP65OV6INKU/graph.json","fetch_events":"https://pith.science/api/pith-number/7KPOO26CM25NY2UTP65OV6INKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU/action/storage_attestation","attest_author":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU/action/author_attestation","sign_citation":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU/action/citation_signature","submit_replication":"https://pith.science/pith/7KPOO26CM25NY2UTP65OV6INKU/action/replication_record"}},"created_at":"2026-07-05T10:39:36.701844+00:00","updated_at":"2026-07-05T10:39:36.701844+00:00"}