{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CLX44FZQ7JAQCDTQXVM2OBPO73","short_pith_number":"pith:CLX44FZQ","canonical_record":{"source":{"id":"1907.05300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"066b8a91c65159088cd85863375bbd753582480e6821ee1115c8563a1a9b81df","abstract_canon_sha256":"5c66cfb66d421ad4bd3bfada5926512b4e3c4ec2bae091c2e20af8e807c07442"},"schema_version":"1.0"},"canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","source":{"kind":"arxiv","id":"1907.05300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05300","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05300v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05300","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"CLX44FZQ7JAQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CLX44FZQ7JAQCDTQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CLX44FZQ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CLX44FZQ7JAQCDTQXVM2OBPO73","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"066b8a91c65159088cd85863375bbd753582480e6821ee1115c8563a1a9b81df","abstract_canon_sha256":"5c66cfb66d421ad4bd3bfada5926512b4e3c4ec2bae091c2e20af8e807c07442"},"schema_version":"1.0"},"canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.844836Z","signature_b64":"ndmlyukdN2q1xwJ81U0Y2C07174airmE6xp+YjudF9FSoYI/O8fjk9kxu4go51znAL2ZzeGlm4ClttLWe6ljAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","last_reissued_at":"2026-05-17T23:40:50.844251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.844251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05300","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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOAb68rxZewWCp5O6zOvO5bIsXDdwVE2L7dfpoOVKkldL9njfNyak61lv/btWR6N2OsOGkLMin0HgNsRBjJQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:44.790222Z"},"content_sha256":"2010a726541a477224f505ae5575e55bb6ba73b487967a7ebde1693c1afe03f2","schema_version":"1.0","event_id":"sha256:2010a726541a477224f505ae5575e55bb6ba73b487967a7ebde1693c1afe03f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CLX44FZQ7JAQCDTQXVM2OBPO73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Brent Schlotfeldt, Chi Zhang, Jiayue Wu, Osbert Bastani, Sarah Y. Tang, Shuo Li, Vijay Kumar","submitted_at":"2019-07-11T15:20:50Z","abstract_excerpt":"In this paper, we present a learning approach to goal assignment and trajectory planning for unlabeled robots operating in 2D, obstacle-filled workspaces. More specifically, we tackle the unlabeled multi-robot motion planning problem with motion constraints as a multi-agent reinforcement learning problem with some sparse global reward. In contrast with previous works, which formulate an entirely new hand-crafted optimization cost or trajectory generation algorithm for a different robot dynamic model, our framework is a general approach that is applicable to arbitrary robot models. Further, by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05300","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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqRc99sgAZ45NHqHS3VqXEmpyAIhjZdC8tY2hD0Uzdoyx4nosKzChP4xkmhSe8uh3qCwcImuU00sWYv9GXvVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:44.790871Z"},"content_sha256":"b95747525b62bbbc5c8b4e2ce950304da715123892cff3d2932575b46a93d684","schema_version":"1.0","event_id":"sha256:b95747525b62bbbc5c8b4e2ce950304da715123892cff3d2932575b46a93d684"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/bundle.json","state_url":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/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-25T11:58:44Z","links":{"resolver":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73","bundle":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/bundle.json","state":"https://pith.science/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLX44FZQ7JAQCDTQXVM2OBPO73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CLX44FZQ7JAQCDTQXVM2OBPO73","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":"5c66cfb66d421ad4bd3bfada5926512b4e3c4ec2bae091c2e20af8e807c07442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","title_canon_sha256":"066b8a91c65159088cd85863375bbd753582480e6821ee1115c8563a1a9b81df"},"schema_version":"1.0","source":{"id":"1907.05300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05300","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05300v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05300","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"CLX44FZQ7JAQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CLX44FZQ7JAQCDTQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CLX44FZQ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:b95747525b62bbbc5c8b4e2ce950304da715123892cff3d2932575b46a93d684","target":"graph","created_at":"2026-05-17T23:40:50Z","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 this paper, we present a learning approach to goal assignment and trajectory planning for unlabeled robots operating in 2D, obstacle-filled workspaces. More specifically, we tackle the unlabeled multi-robot motion planning problem with motion constraints as a multi-agent reinforcement learning problem with some sparse global reward. In contrast with previous works, which formulate an entirely new hand-crafted optimization cost or trajectory generation algorithm for a different robot dynamic model, our framework is a general approach that is applicable to arbitrary robot models. Further, by ","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Brent Schlotfeldt, Chi Zhang, Jiayue Wu, Osbert Bastani, Sarah Y. Tang, Shuo Li, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","title":"Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05300","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:2010a726541a477224f505ae5575e55bb6ba73b487967a7ebde1693c1afe03f2","target":"record","created_at":"2026-05-17T23:40:50Z","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":"5c66cfb66d421ad4bd3bfada5926512b4e3c4ec2bae091c2e20af8e807c07442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-11T15:20:50Z","title_canon_sha256":"066b8a91c65159088cd85863375bbd753582480e6821ee1115c8563a1a9b81df"},"schema_version":"1.0","source":{"id":"1907.05300","kind":"arxiv","version":1}},"canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12efce1730fa41010e70bd59a705eefee53ec40988782485ebafdb5a89b5538b","first_computed_at":"2026-05-17T23:40:50.844251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:50.844251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ndmlyukdN2q1xwJ81U0Y2C07174airmE6xp+YjudF9FSoYI/O8fjk9kxu4go51znAL2ZzeGlm4ClttLWe6ljAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:50.844836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2010a726541a477224f505ae5575e55bb6ba73b487967a7ebde1693c1afe03f2","sha256:b95747525b62bbbc5c8b4e2ce950304da715123892cff3d2932575b46a93d684"],"state_sha256":"0ca9129cb84c666ff930bde1316097859263c311f719a3c82906660f0f5f9eda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05NCOygkeRLINp+CN3eo4WqYJwHp6yMduA/S43wcq40wv5BLZhjulN7Oz3dZvCsmtRky9usrsq6w/g9ESrSzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:58:44.794335Z","bundle_sha256":"ab80b4c63af191ec7a913d37723e12f3be9fae70e5958eb8ca8ed3367c7c1085"}}