{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AUFJGMUDQFMPSF5ACB6PBKJZ4S","short_pith_number":"pith:AUFJGMUD","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"},"canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","source":{"kind":"arxiv","id":"1408.2260","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2260","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2260v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2260","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"AUFJGMUDQFMP","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUFJGMUDQFMPSF5A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUFJGMUD","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AUFJGMUDQFMPSF5ACB6PBKJZ4S","target":"record","payload":{"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"},"canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","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"},"source_kind":"arxiv","source_id":"1408.2260","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dC4WW4NJSctEkvTggrgGc7mfLnj69aiD9+7njLhofFjwCDIRqeulEInoi7AJM0ysm48gDg9s144ZVdgLbmGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:49:07.131373Z"},"content_sha256":"593206edb5bc9f000f3f589fc007c81956786f8e3820b26308ed6972fc48dce6","schema_version":"1.0","event_id":"sha256:593206edb5bc9f000f3f589fc007c81956786f8e3820b26308ed6972fc48dce6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AUFJGMUDQFMPSF5ACB6PBKJZ4S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLfIw37IdH3gtn6YbqYv+Qcz99lQz+9k2oRHdIQPfS9PByCC4fDehRsHyvFSzkTKsFFvAtrPuDvcv0jsoHOdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:49:07.131732Z"},"content_sha256":"b1cac3f3591e929ee8026030ca7dcae2e765d1407fb8e702cb48283ed4478bca","schema_version":"1.0","event_id":"sha256:b1cac3f3591e929ee8026030ca7dcae2e765d1407fb8e702cb48283ed4478bca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/bundle.json","state_url":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:49:07Z","links":{"resolver":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S","bundle":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/bundle.json","state":"https://pith.science/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUFJGMUDQFMPSF5ACB6PBKJZ4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AUFJGMUDQFMPSF5ACB6PBKJZ4S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dba47281b629194e9ab2a806433ad4fafc7956646a72eb6750630cbdc456836c","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-08-10T18:32:12Z","title_canon_sha256":"3d30954df31925f8714a4eba65cb9d4ce6f643b4a72a076d15dc17be360c5c9e"},"schema_version":"1.0","source":{"id":"1408.2260","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2260","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2260v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2260","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"AUFJGMUDQFMP","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUFJGMUDQFMPSF5A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUFJGMUD","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b1cac3f3591e929ee8026030ca7dcae2e765d1407fb8e702cb48283ed4478bca","target":"graph","created_at":"2026-05-18T02:18:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Dan Halperin, Kiril Solovey","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-08-10T18:32:12Z","title":"On the hardness of unlabeled multi-robot motion planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2260","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:593206edb5bc9f000f3f589fc007c81956786f8e3820b26308ed6972fc48dce6","target":"record","created_at":"2026-05-18T02:18:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dba47281b629194e9ab2a806433ad4fafc7956646a72eb6750630cbdc456836c","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-08-10T18:32:12Z","title_canon_sha256":"3d30954df31925f8714a4eba65cb9d4ce6f643b4a72a076d15dc17be360c5c9e"},"schema_version":"1.0","source":{"id":"1408.2260","kind":"arxiv","version":2}},"canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"050a9332838158f917a0107cf0a939e4a6e33ae9bea05135143738dcb0db4a33","first_computed_at":"2026-05-18T02:18:23.730261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:23.730261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j7QIAPYhbX5phkDiI5nYCzeJaZ/qkXncdbu9DKemjEr+nlIITeIpUrCCTlFSdkN2nKGbnax3Jcc4eWmoGKitAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:23.730806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2260","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:593206edb5bc9f000f3f589fc007c81956786f8e3820b26308ed6972fc48dce6","sha256:b1cac3f3591e929ee8026030ca7dcae2e765d1407fb8e702cb48283ed4478bca"],"state_sha256":"f66fe91a3568faac4cf45e740ef8ab21bfb0bf7bcf1ad96a6ee1209084aa4949"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QK7NrfB3qkA203qnsQmFOza3vyrQbPHXyxeetOArCvYJ5HroJme/qVx98z0ysdUOi3PwqGI92k6LyGCygW6rDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:49:07.134129Z","bundle_sha256":"704756cbd821d8f304a33350236e5368e0a9d72954176690d3947b923cc6eccc"}}