{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6OJOEYZ2GDYSBORF5KAQHCA5QI","short_pith_number":"pith:6OJOEYZ2","canonical_record":{"source":{"id":"1504.05218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-04-20T20:24:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"549ddd97d2cecdfcc4590d04d4fc66a479dd200a7fa688a05b8d39b1c49582a8","abstract_canon_sha256":"362532d9fca5245ec59435010244c61b3b0751488c43755155fc66c3e72f0301"},"schema_version":"1.0"},"canonical_sha256":"f392e2633a30f120ba25ea8103881d820f91ff3f3818dedb46206937f78d016c","source":{"kind":"arxiv","id":"1504.05218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05218","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05218v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05218","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"6OJOEYZ2GDYS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6OJOEYZ2GDYSBORF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6OJOEYZ2","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6OJOEYZ2GDYSBORF5KAQHCA5QI","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-04-20T20:24:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"549ddd97d2cecdfcc4590d04d4fc66a479dd200a7fa688a05b8d39b1c49582a8","abstract_canon_sha256":"362532d9fca5245ec59435010244c61b3b0751488c43755155fc66c3e72f0301"},"schema_version":"1.0"},"canonical_sha256":"f392e2633a30f120ba25ea8103881d820f91ff3f3818dedb46206937f78d016c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.816205Z","signature_b64":"qc/U9PcHk3yxEYhjAUphcn4qUGSwC4Mui2JPQHmPNWgh+Mp6XU7cu3UBWU6evz4PSb4QcXdDy4Boe1HPUXGMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f392e2633a30f120ba25ea8103881d820f91ff3f3818dedb46206937f78d016c","last_reissued_at":"2026-05-18T02:18:14.815563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.815563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05218","source_version":1,"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:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiuevheY+mUjiTQS5Bboy52ZdgJOB/chy9+ri/wu8g2x4AcnYgRNRlNC7ybZlFhqqzpemfpQoMWs3QxRDn0xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:32:54.599908Z"},"content_sha256":"94d1eb53b63a1be84ad287de805032b71fddb8a17fccd5b6ae1bbdd23d255853","schema_version":"1.0","event_id":"sha256:94d1eb53b63a1be84ad287de805032b71fddb8a17fccd5b6ae1bbdd23d255853"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6OJOEYZ2GDYSBORF5KAQHCA5QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Planning for Unlabeled Discs with Optimality Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Jingjin Yu, Kiril Solovey, Or Zamir","submitted_at":"2015-04-20T20:24:13Z","abstract_excerpt":"We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths of the individual paths. Our algorithm is guaranteed to find a solution if one exists, or report that none exists otherwise. It runs in time $\\tilde{O}(m^4+m^2n^2)$, where $m$ is the number of robots and $n$ is the total complexity of the workspace. Moreover, the total length of the returned solution is at most $\\text{OPT}+4m$, where OPT is the optimal soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05218","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":""},"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:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxacnn9cwgZTD4LkrXymApjO9Gm8dJP01O9HIt5w/OD9A/MdGvwwEKL8jNKfUQX4wFZyj8O3WU8UUYCJypEiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:32:54.600257Z"},"content_sha256":"bffe39e73355b415251523751171c3db43acb76c8ddad010f42219ad506eef0d","schema_version":"1.0","event_id":"sha256:bffe39e73355b415251523751171c3db43acb76c8ddad010f42219ad506eef0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/bundle.json","state_url":"https://pith.science/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/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-04T02:32:54Z","links":{"resolver":"https://pith.science/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI","bundle":"https://pith.science/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/bundle.json","state":"https://pith.science/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OJOEYZ2GDYSBORF5KAQHCA5QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6OJOEYZ2GDYSBORF5KAQHCA5QI","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":"362532d9fca5245ec59435010244c61b3b0751488c43755155fc66c3e72f0301","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-04-20T20:24:13Z","title_canon_sha256":"549ddd97d2cecdfcc4590d04d4fc66a479dd200a7fa688a05b8d39b1c49582a8"},"schema_version":"1.0","source":{"id":"1504.05218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05218","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05218v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05218","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"6OJOEYZ2GDYS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6OJOEYZ2GDYSBORF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6OJOEYZ2","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:bffe39e73355b415251523751171c3db43acb76c8ddad010f42219ad506eef0d","target":"graph","created_at":"2026-05-18T02:18:14Z","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":"We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths of the individual paths. Our algorithm is guaranteed to find a solution if one exists, or report that none exists otherwise. It runs in time $\\tilde{O}(m^4+m^2n^2)$, where $m$ is the number of robots and $n$ is the total complexity of the workspace. Moreover, the total length of the returned solution is at most $\\text{OPT}+4m$, where OPT is the optimal soluti","authors_text":"Dan Halperin, Jingjin Yu, Kiril Solovey, Or Zamir","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-04-20T20:24:13Z","title":"Motion Planning for Unlabeled Discs with Optimality Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05218","kind":"arxiv","version":1},"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:94d1eb53b63a1be84ad287de805032b71fddb8a17fccd5b6ae1bbdd23d255853","target":"record","created_at":"2026-05-18T02:18:14Z","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":"362532d9fca5245ec59435010244c61b3b0751488c43755155fc66c3e72f0301","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-04-20T20:24:13Z","title_canon_sha256":"549ddd97d2cecdfcc4590d04d4fc66a479dd200a7fa688a05b8d39b1c49582a8"},"schema_version":"1.0","source":{"id":"1504.05218","kind":"arxiv","version":1}},"canonical_sha256":"f392e2633a30f120ba25ea8103881d820f91ff3f3818dedb46206937f78d016c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f392e2633a30f120ba25ea8103881d820f91ff3f3818dedb46206937f78d016c","first_computed_at":"2026-05-18T02:18:14.815563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.815563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qc/U9PcHk3yxEYhjAUphcn4qUGSwC4Mui2JPQHmPNWgh+Mp6XU7cu3UBWU6evz4PSb4QcXdDy4Boe1HPUXGMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.816205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94d1eb53b63a1be84ad287de805032b71fddb8a17fccd5b6ae1bbdd23d255853","sha256:bffe39e73355b415251523751171c3db43acb76c8ddad010f42219ad506eef0d"],"state_sha256":"19d0121076fac0abaafd6c8c24557284e16346aa18732d1618f5d7cbe75f2089"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuiXhwCfHB2nvBwnjW+Lon4ns4v93GecUYaQ6kqfzV9tpGOpPaFzVaugSCYBjl/eu8ExOiMn9Aku/cZC+nTxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:32:54.602236Z","bundle_sha256":"db6d848e2bd5263feb47daae1664183caafd2724500c43212cf5c491492a11ca"}}