{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:46URNB3P3WYZN43LGG55DPSSW2","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":"1ebbb54dbfea408066afb27029a6e66ef9d9666d8c33a552d72941d71285604d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-24T04:26:22Z","title_canon_sha256":"e060242c97668a94dc3c2b8ae72df9a4c0ac677e42e28e7262acd24afbdf8227"},"schema_version":"1.0","source":{"id":"1909.10704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.10704","created_at":"2026-07-05T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1909.10704v1","created_at":"2026-07-05T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.10704","created_at":"2026-07-05T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"46URNB3P3WYZ","created_at":"2026-07-05T00:07:01Z"},{"alias_kind":"pith_short_16","alias_value":"46URNB3P3WYZN43L","created_at":"2026-07-05T00:07:01Z"},{"alias_kind":"pith_short_8","alias_value":"46URNB3P","created_at":"2026-07-05T00:07:01Z"}],"graph_snapshots":[{"event_id":"sha256:8ff29cdb470dae3245b8f96e2a77953493427beda4c1e57f78844a3dae2f59f7","target":"graph","created_at":"2026-07-05T00:07:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.10704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a learning method to solve the unlabelled motion problem with motion constraints and space constraints in 2D space for a large number of robots. To solve the problem of arbitrary dynamics and constraints we propose formulating the problem as a multi-agent problem. In contrast to previous works that propose using learning solutions for unlabelled motion planning with constraints, we are able to demonstrate the scalability of our methods for a large number of robots. The curse of dimensionality one encounters when working with a large number of robots is mitigated by em","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Vijay Kumar","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-24T04:26:22Z","title":"Graph Policy Gradients for Large Scale Unlabeled Motion Planning with Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.10704","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:61d8fb0bff3adf5c715bc2f447fd8a1deb656e769065d46bbf8d9e451e31eb87","target":"record","created_at":"2026-07-05T00:07:01Z","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":"1ebbb54dbfea408066afb27029a6e66ef9d9666d8c33a552d72941d71285604d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-24T04:26:22Z","title_canon_sha256":"e060242c97668a94dc3c2b8ae72df9a4c0ac677e42e28e7262acd24afbdf8227"},"schema_version":"1.0","source":{"id":"1909.10704","kind":"arxiv","version":1}},"canonical_sha256":"e7a916876fddb196f36b31bbd1be52b69d103d6b02a416af17c6e2286e6e6db6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7a916876fddb196f36b31bbd1be52b69d103d6b02a416af17c6e2286e6e6db6","first_computed_at":"2026-07-05T00:07:01.264230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:07:01.264230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HIVijAKNcGR41bC9KiZDm4TRiCRins2dcFlAXR0OluCCKGLUpbGy6YUHCsPi3U7wWBF+tKsh2HSBHoIBFaaAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:07:01.264726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.10704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61d8fb0bff3adf5c715bc2f447fd8a1deb656e769065d46bbf8d9e451e31eb87","sha256:8ff29cdb470dae3245b8f96e2a77953493427beda4c1e57f78844a3dae2f59f7"],"state_sha256":"d39c4e79756de3f051baa32df86261ff5dca4c0ab64aa70637f9b6f00dd79b63"}