{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JVDXCTKH3W6KHEGQA3Q5QDUDXQ","short_pith_number":"pith:JVDXCTKH","canonical_record":{"source":{"id":"1709.10082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-28T17:44:09Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"title_canon_sha256":"7f11396c31567fff9f9237c84f4e8ab636d62f2600ed2c42ace2716da954106f","abstract_canon_sha256":"8c609de59b6d721b67282d0f2fc9aa47efa738dd3e2e066c3025738b21b19731"},"schema_version":"1.0"},"canonical_sha256":"4d47714d47ddbca390d006e1d80e83bc2166c24561e0d827399fe4e10beb8eb3","source":{"kind":"arxiv","id":"1709.10082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10082","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10082v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10082","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"JVDXCTKH3W6K","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JVDXCTKH3W6KHEGQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JVDXCTKH","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JVDXCTKH3W6KHEGQA3Q5QDUDXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-28T17:44:09Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"title_canon_sha256":"7f11396c31567fff9f9237c84f4e8ab636d62f2600ed2c42ace2716da954106f","abstract_canon_sha256":"8c609de59b6d721b67282d0f2fc9aa47efa738dd3e2e066c3025738b21b19731"},"schema_version":"1.0"},"canonical_sha256":"4d47714d47ddbca390d006e1d80e83bc2166c24561e0d827399fe4e10beb8eb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.318702Z","signature_b64":"gtlSSoJ2ObrMiHtGyu278NxCcBMZfRH3j4fSfrS3IKtfeuKR62MmLEaHIwVlPCJWYGXNH/VQ/23j99+F9zxCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d47714d47ddbca390d006e1d80e83bc2166c24561e0d827399fe4e10beb8eb3","last_reissued_at":"2026-05-18T00:15:37.318068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.318068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10082","source_version":3,"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZZjOgjBBYP32+6Y8yMZHJK4DwFpPT64Eli5MTAvodqWCUN1fsedcyQAv+Bd1Teuv6eX+OR+8RIFBfTX6/bdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:23:19.748041Z"},"content_sha256":"47ce759603481d3da9df097f06e2b74fa337787c8bfd601776caef6d3fdac459","schema_version":"1.0","event_id":"sha256:47ce759603481d3da9df097f06e2b74fa337787c8bfd601776caef6d3fdac459"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JVDXCTKH3W6KHEGQA3Q5QDUDXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Optimally Decentralized Multi-Robot Collision Avoidance via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA"],"primary_cat":"cs.RO","authors_text":"Hao Zhang, Jia Pan, Pinxin Long, Tingxiang Fan, Wenxi Liu, Xinyi Liao","submitted_at":"2017-09-28T17:44:09Z","abstract_excerpt":"Developing a safe and efficient collision avoidance policy for multiple robots is challenging in the decentralized scenarios where each robot generate its paths without observing other robots' states and intents. While other distributed multi-robot collision avoidance systems exist, they often require extracting agent-level features to plan a local collision-free action, which can be computationally prohibitive and not robust. More importantly, in practice the performance of these methods are much lower than their centralized counterparts.\n  We present a decentralized sensor-level collision av"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10082","kind":"arxiv","version":3},"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeq3XxxkVcr2R6z7WbxDjUDjPJIys7QAnbicNiqNbhXKI3Co48GJiM2M0rI0QkdODjXM56uS3PUTe7IEs3A/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:23:19.748686Z"},"content_sha256":"eb38cdab169c50214a85945e4f6705c5ffea4a502e3505822bbf75c635c63c0f","schema_version":"1.0","event_id":"sha256:eb38cdab169c50214a85945e4f6705c5ffea4a502e3505822bbf75c635c63c0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/bundle.json","state_url":"https://pith.science/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/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-28T16:23:19Z","links":{"resolver":"https://pith.science/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ","bundle":"https://pith.science/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/bundle.json","state":"https://pith.science/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVDXCTKH3W6KHEGQA3Q5QDUDXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JVDXCTKH3W6KHEGQA3Q5QDUDXQ","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":"8c609de59b6d721b67282d0f2fc9aa47efa738dd3e2e066c3025738b21b19731","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-28T17:44:09Z","title_canon_sha256":"7f11396c31567fff9f9237c84f4e8ab636d62f2600ed2c42ace2716da954106f"},"schema_version":"1.0","source":{"id":"1709.10082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10082","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10082v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10082","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"JVDXCTKH3W6K","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JVDXCTKH3W6KHEGQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JVDXCTKH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:eb38cdab169c50214a85945e4f6705c5ffea4a502e3505822bbf75c635c63c0f","target":"graph","created_at":"2026-05-18T00:15: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":"Developing a safe and efficient collision avoidance policy for multiple robots is challenging in the decentralized scenarios where each robot generate its paths without observing other robots' states and intents. While other distributed multi-robot collision avoidance systems exist, they often require extracting agent-level features to plan a local collision-free action, which can be computationally prohibitive and not robust. More importantly, in practice the performance of these methods are much lower than their centralized counterparts.\n  We present a decentralized sensor-level collision av","authors_text":"Hao Zhang, Jia Pan, Pinxin Long, Tingxiang Fan, Wenxi Liu, Xinyi Liao","cross_cats":["cs.AI","cs.LG","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-28T17:44:09Z","title":"Towards Optimally Decentralized Multi-Robot Collision Avoidance via Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10082","kind":"arxiv","version":3},"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:47ce759603481d3da9df097f06e2b74fa337787c8bfd601776caef6d3fdac459","target":"record","created_at":"2026-05-18T00:15: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":"8c609de59b6d721b67282d0f2fc9aa47efa738dd3e2e066c3025738b21b19731","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-28T17:44:09Z","title_canon_sha256":"7f11396c31567fff9f9237c84f4e8ab636d62f2600ed2c42ace2716da954106f"},"schema_version":"1.0","source":{"id":"1709.10082","kind":"arxiv","version":3}},"canonical_sha256":"4d47714d47ddbca390d006e1d80e83bc2166c24561e0d827399fe4e10beb8eb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d47714d47ddbca390d006e1d80e83bc2166c24561e0d827399fe4e10beb8eb3","first_computed_at":"2026-05-18T00:15:37.318068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.318068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtlSSoJ2ObrMiHtGyu278NxCcBMZfRH3j4fSfrS3IKtfeuKR62MmLEaHIwVlPCJWYGXNH/VQ/23j99+F9zxCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.318702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47ce759603481d3da9df097f06e2b74fa337787c8bfd601776caef6d3fdac459","sha256:eb38cdab169c50214a85945e4f6705c5ffea4a502e3505822bbf75c635c63c0f"],"state_sha256":"2968cdfc44b7612e2edd5f0b651891cd9c8a60a21e0b1c69e7749b4b9cad3221"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcATIxCuSmHJyVN/VPf7ge8zQpUZAoXR0oaoZO9Kf3T9RhZYhluCR7rp5YgFpsFtV/r/01E3Ri6YQqp8YZmqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:23:19.751851Z","bundle_sha256":"b77dcf599f90464fc096703f66114febad38fb8647a3b33c18fe44f0d9a09839"}}