{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D43SJDRNPT4YR5BP2I5PJVL25G","short_pith_number":"pith:D43SJDRN","canonical_record":{"source":{"id":"1704.07538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T04:52:09Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ea6469ee973145fccf45e23603d56417c9fcb291f63725e962205b6a682824c3","abstract_canon_sha256":"c58e4a00a7a88ccdce72ef4163cd706d0734177d776c4fb893a269e7373962be"},"schema_version":"1.0"},"canonical_sha256":"1f37248e2d7cf988f42fd23af4d57ae98a4985adbd2bca251a6dce0e0dd2b9b8","source":{"kind":"arxiv","id":"1704.07538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07538","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07538v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07538","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"D43SJDRNPT4Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D43SJDRNPT4YR5BP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D43SJDRN","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D43SJDRNPT4YR5BP2I5PJVL25G","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T04:52:09Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ea6469ee973145fccf45e23603d56417c9fcb291f63725e962205b6a682824c3","abstract_canon_sha256":"c58e4a00a7a88ccdce72ef4163cd706d0734177d776c4fb893a269e7373962be"},"schema_version":"1.0"},"canonical_sha256":"1f37248e2d7cf988f42fd23af4d57ae98a4985adbd2bca251a6dce0e0dd2b9b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:37.760995Z","signature_b64":"YOwJkCbUeGCxUohLn+YJ8oh1f5LJokTSdKih/8XgHi7y8GuOE3XmZfoRqSoCouVQjGywJTTeHtU+FgMcPUM+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f37248e2d7cf988f42fd23af4d57ae98a4985adbd2bca251a6dce0e0dd2b9b8","last_reissued_at":"2026-05-18T00:45:37.759965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:37.759965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07538","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-18T00:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEz4zC2nqWXAA8Y+4MXfYhwOHTMrLObvr7tarj7UpwkQP0qFf66so/CTMwJi9VLzl3+W/4APVG5dmXnB2d7XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:09.930201Z"},"content_sha256":"6f4de004337e77a053ae4915d8f88c201818bd6840b10227d79c16513bee5643","schema_version":"1.0","event_id":"sha256:6f4de004337e77a053ae4915d8f88c201818bd6840b10227d79c16513bee5643"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D43SJDRNPT4YR5BP2I5PJVL25G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path Planning with Kinematic Constraints for Robot Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Hang Ma, Liron Cohen, Nora Ayanian, Sven Koenig, T. K. Satish Kumar, Wolfgang H\\\"onig","submitted_at":"2017-04-25T04:52:09Z","abstract_excerpt":"Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of specified goal locations. Robots can be fully anonymous, non-anonymous, or organized in groups. Although powerful solvers for this abstract problem exist, they make simplifying assumptions by ignoring kinematic constraints, making it difficult to use the resulting plans on actual robots. In this paper, we present a solution which takes kinematic constraints, such as maximum velocities, into account, while guaranteeing a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07538","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-18T00:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqlBBkHhwRQYlDSTvdKx8uiC0elrQRXK13EoSzvajCxYM+I3lQRLIl6QqAdQO9EbuHdlc7bEvnAUszm5VAJqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:09.930574Z"},"content_sha256":"6ddba3191e8e57e2546622d340f7ea22e4f25de97f16f144791a7ed20a7fc4de","schema_version":"1.0","event_id":"sha256:6ddba3191e8e57e2546622d340f7ea22e4f25de97f16f144791a7ed20a7fc4de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D43SJDRNPT4YR5BP2I5PJVL25G/bundle.json","state_url":"https://pith.science/pith/D43SJDRNPT4YR5BP2I5PJVL25G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D43SJDRNPT4YR5BP2I5PJVL25G/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-05-28T12:57:09Z","links":{"resolver":"https://pith.science/pith/D43SJDRNPT4YR5BP2I5PJVL25G","bundle":"https://pith.science/pith/D43SJDRNPT4YR5BP2I5PJVL25G/bundle.json","state":"https://pith.science/pith/D43SJDRNPT4YR5BP2I5PJVL25G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D43SJDRNPT4YR5BP2I5PJVL25G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D43SJDRNPT4YR5BP2I5PJVL25G","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":"c58e4a00a7a88ccdce72ef4163cd706d0734177d776c4fb893a269e7373962be","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T04:52:09Z","title_canon_sha256":"ea6469ee973145fccf45e23603d56417c9fcb291f63725e962205b6a682824c3"},"schema_version":"1.0","source":{"id":"1704.07538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07538","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07538v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07538","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"D43SJDRNPT4Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D43SJDRNPT4YR5BP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D43SJDRN","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6ddba3191e8e57e2546622d340f7ea22e4f25de97f16f144791a7ed20a7fc4de","target":"graph","created_at":"2026-05-18T00:45:37Z","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":"Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of specified goal locations. Robots can be fully anonymous, non-anonymous, or organized in groups. Although powerful solvers for this abstract problem exist, they make simplifying assumptions by ignoring kinematic constraints, making it difficult to use the resulting plans on actual robots. In this paper, we present a solution which takes kinematic constraints, such as maximum velocities, into account, while guaranteeing a ","authors_text":"Hang Ma, Liron Cohen, Nora Ayanian, Sven Koenig, T. K. Satish Kumar, Wolfgang H\\\"onig","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T04:52:09Z","title":"Path Planning with Kinematic Constraints for Robot Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07538","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:6f4de004337e77a053ae4915d8f88c201818bd6840b10227d79c16513bee5643","target":"record","created_at":"2026-05-18T00:45:37Z","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":"c58e4a00a7a88ccdce72ef4163cd706d0734177d776c4fb893a269e7373962be","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T04:52:09Z","title_canon_sha256":"ea6469ee973145fccf45e23603d56417c9fcb291f63725e962205b6a682824c3"},"schema_version":"1.0","source":{"id":"1704.07538","kind":"arxiv","version":1}},"canonical_sha256":"1f37248e2d7cf988f42fd23af4d57ae98a4985adbd2bca251a6dce0e0dd2b9b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f37248e2d7cf988f42fd23af4d57ae98a4985adbd2bca251a6dce0e0dd2b9b8","first_computed_at":"2026-05-18T00:45:37.759965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:37.759965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOwJkCbUeGCxUohLn+YJ8oh1f5LJokTSdKih/8XgHi7y8GuOE3XmZfoRqSoCouVQjGywJTTeHtU+FgMcPUM+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:37.760995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f4de004337e77a053ae4915d8f88c201818bd6840b10227d79c16513bee5643","sha256:6ddba3191e8e57e2546622d340f7ea22e4f25de97f16f144791a7ed20a7fc4de"],"state_sha256":"c0810a8b131c0366a5517a35e53b5e529d492394df7f89903373ca2faa4fe1be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHrl/VIUYjOjbCH1iyT8NqURR+He4d9j7cWxIQbchIf0lcG4vRHpMkxwNAidOM/unjEYRXoYX6U6ccw2HudMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:57:09.932519Z","bundle_sha256":"05e390696dbabd9d8746d59f45ce12e773f4c54892044beb30d1a87b1dba28a8"}}