{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AUFJGMUDQFMPSF5ACB6PBKJZ4S","short_pith_number":"pith:AUFJGMUD","schema_version":"1.0","canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","source":{"kind":"arxiv","id":"1408.2260","version":2},"attestation_state":"computed","paper":{"title":"On the hardness of unlabeled multi-robot motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2014-08-10T18:32:12Z","abstract_excerpt":"In unlabeled multi-robot motion planning several interchangeable robots operate in a common workspace. The goal is to move the robots to a set of target positions such that each position will be occupied by some robot. In this paper, we study this problem for the specific case of unit-square robots moving amidst polygonal obstacles and show that it is PSPACE-hard. We also consider three additional variants of this problem and show that they are all PSPACE-hard as well. To the best of our knowledge, this is the first hardness proof for the unlabeled case. Furthermore, our proofs can be used to "},"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":"1408.2260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-08-10T18:32:12Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"3d30954df31925f8714a4eba65cb9d4ce6f643b4a72a076d15dc17be360c5c9e","abstract_canon_sha256":"dba47281b629194e9ab2a806433ad4fafc7956646a72eb6750630cbdc456836c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.730806Z","signature_b64":"j7QIAPYhbX5phkDiI5nYCzeJaZ/qkXncdbu9DKemjEr+nlIITeIpUrCCTlFSdkN2nKGbnax3Jcc4eWmoGKitAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","last_reissued_at":"2026-05-18T02:18:23.730261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.730261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of unlabeled multi-robot motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2014-08-10T18:32:12Z","abstract_excerpt":"In unlabeled multi-robot motion planning several interchangeable robots operate in a common workspace. The goal is to move the robots to a set of target positions such that each position will be occupied by some robot. In this paper, we study this problem for the specific case of unit-square robots moving amidst polygonal obstacles and show that it is PSPACE-hard. We also consider three additional variants of this problem and show that they are all PSPACE-hard as well. To the best of our knowledge, this is the first hardness proof for the unlabeled case. Furthermore, our proofs can be used to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2260","kind":"arxiv","version":2},"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":"1408.2260","created_at":"2026-05-18T02:18:23.730355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2260v2","created_at":"2026-05-18T02:18:23.730355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2260","created_at":"2026-05-18T02:18:23.730355+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUFJGMUDQFMP","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUFJGMUDQFMPSF5A","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUFJGMUD","created_at":"2026-05-18T12:28:19.803747+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/AUFJGMUDQFMPSF5ACB6PBKJZ4S","json":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S.json","graph_json":"https://pith.science/api/pith-number/AUFJGMUDQFMPSF5ACB6PBKJZ4S/graph.json","events_json":"https://pith.science/api/pith-number/AUFJGMUDQFMPSF5ACB6PBKJZ4S/events.json","paper":"https://pith.science/paper/AUFJGMUD"},"agent_actions":{"view_html":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S","download_json":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S.json","view_paper":"https://pith.science/paper/AUFJGMUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2260&json=true","fetch_graph":"https://pith.science/api/pith-number/AUFJGMUDQFMPSF5ACB6PBKJZ4S/graph.json","fetch_events":"https://pith.science/api/pith-number/AUFJGMUDQFMPSF5ACB6PBKJZ4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/action/storage_attestation","attest_author":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/action/author_attestation","sign_citation":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/action/citation_signature","submit_replication":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/action/replication_record"}},"created_at":"2026-05-18T02:18:23.730355+00:00","updated_at":"2026-05-18T02:18:23.730355+00:00"}