{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IU2TFGYVXV7PDT5W3HAGM43ARX","short_pith_number":"pith:IU2TFGYV","schema_version":"1.0","canonical_sha256":"4535329b15bd7ef1cfb6d9c06673608df83b9d200f21802c93e92335a030302f","source":{"kind":"arxiv","id":"1202.6174","version":3},"attestation_state":"computed","paper":{"title":"k-Color Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2012-02-28T10:37:05Z","abstract_excerpt":"We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a sampling-based algorithm specifically designed for solving it. At the heart of the algorithm is a novel technique where the k-color problem is reduced to several discrete multi-robot motion planning pro"},"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":"1202.6174","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-28T10:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"dfb38815508df8d339632b41e15cbaae1af78afb73a0233cce7abeefc08efc5d","abstract_canon_sha256":"16d5edd507302868f85a05bc043bb5f5ad208fc1c13e1b3f1d95bbfdc87586ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:59.568330Z","signature_b64":"kBmOX96LL7zK2zo0ZmHiy7zkH+of5QX6oTSRJT126F/MZrev7lhxAWkUqg4cmpsXy90bj9bDsOjzLC8QAXv1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4535329b15bd7ef1cfb6d9c06673608df83b9d200f21802c93e92335a030302f","last_reissued_at":"2026-05-18T03:25:59.567796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:59.567796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Color Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2012-02-28T10:37:05Z","abstract_excerpt":"We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a sampling-based algorithm specifically designed for solving it. At the heart of the algorithm is a novel technique where the k-color problem is reduced to several discrete multi-robot motion planning pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6174","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1202.6174","created_at":"2026-05-18T03:25:59.567881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6174v3","created_at":"2026-05-18T03:25:59.567881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6174","created_at":"2026-05-18T03:25:59.567881+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU2TFGYVXV7P","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU2TFGYVXV7PDT5W","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU2TFGYV","created_at":"2026-05-18T12:27:09.501522+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/IU2TFGYVXV7PDT5W3HAGM43ARX","json":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX.json","graph_json":"https://pith.science/api/pith-number/IU2TFGYVXV7PDT5W3HAGM43ARX/graph.json","events_json":"https://pith.science/api/pith-number/IU2TFGYVXV7PDT5W3HAGM43ARX/events.json","paper":"https://pith.science/paper/IU2TFGYV"},"agent_actions":{"view_html":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX","download_json":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX.json","view_paper":"https://pith.science/paper/IU2TFGYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6174&json=true","fetch_graph":"https://pith.science/api/pith-number/IU2TFGYVXV7PDT5W3HAGM43ARX/graph.json","fetch_events":"https://pith.science/api/pith-number/IU2TFGYVXV7PDT5W3HAGM43ARX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX/action/storage_attestation","attest_author":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX/action/author_attestation","sign_citation":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX/action/citation_signature","submit_replication":"https://pith.science/pith/IU2TFGYVXV7PDT5W3HAGM43ARX/action/replication_record"}},"created_at":"2026-05-18T03:25:59.567881+00:00","updated_at":"2026-05-18T03:25:59.567881+00:00"}