{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DLUKXOX326ISW4TWVJXHJCSAA4","short_pith_number":"pith:DLUKXOX3","canonical_record":{"source":{"id":"1609.07845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-26T04:49:41Z","cross_cats_sorted":[],"title_canon_sha256":"6f75474445c2db78a596b623d50f20e04c3cc474fcae48aaa637134c629dca46","abstract_canon_sha256":"1846aca228be1a87cf71b52ba6d3b4c120b13e28b9312c9249d4d2c2088954c3"},"schema_version":"1.0"},"canonical_sha256":"1ae8abbafbd7912b7276aa6e748a400714f16cb3e7eac36f6829fe5125c80183","source":{"kind":"arxiv","id":"1609.07845","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07845","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07845v2","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07845","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"DLUKXOX326IS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLUKXOX326ISW4TW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLUKXOX3","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DLUKXOX326ISW4TWVJXHJCSAA4","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-26T04:49:41Z","cross_cats_sorted":[],"title_canon_sha256":"6f75474445c2db78a596b623d50f20e04c3cc474fcae48aaa637134c629dca46","abstract_canon_sha256":"1846aca228be1a87cf71b52ba6d3b4c120b13e28b9312c9249d4d2c2088954c3"},"schema_version":"1.0"},"canonical_sha256":"1ae8abbafbd7912b7276aa6e748a400714f16cb3e7eac36f6829fe5125c80183","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:42.424852Z","signature_b64":"P9b+ZHapOBxbcGfT4ZdgSLaNiFZ66yJd8zkw3v+SBi/psOS4ZmB5tMu9OuEI4J+N8nphrE/yu7YSKo/psgLnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae8abbafbd7912b7276aa6e748a400714f16cb3e7eac36f6829fe5125c80183","last_reissued_at":"2026-05-18T01:03:42.424426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:42.424426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07845","source_version":2,"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-18T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukVvVKa69ydJFNQfKpwuL6TXbuoSOlbsaIxe2nzfEsvHUmVwW83Aepe7OCoP7nUtm5kQVVAP52EjfbmS25veAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:37.113467Z"},"content_sha256":"96f7a837001fa7dd1be2fc369bcc780eb1c6d950523856852c09b78540667095","schema_version":"1.0","event_id":"sha256:96f7a837001fa7dd1be2fc369bcc780eb1c6d950523856852c09b78540667095"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DLUKXOX326ISW4TWVJXHJCSAA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Non-communicating Multiagent Collision Avoidance with Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Jonathan P. How, Miao Liu, Michael Everett, Yu Fan Chen","submitted_at":"2016-09-26T04:49:41Z","abstract_excerpt":"Finding feasible, collision-free paths for multiagent systems can be challenging, particularly in non-communicating scenarios where each agent's intent (e.g. goal) is unobservable to the others. In particular, finding time efficient paths often requires anticipating interaction with neighboring agents, the process of which can be computationally prohibitive. This work presents a decentralized multiagent collision avoidance algorithm based on a novel application of deep reinforcement learning, which effectively offloads the online computation (for predicting interaction patterns) to an offline "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07845","kind":"arxiv","version":2},"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-18T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2tB+fafRpLHx9ybqMILRGGHhhj/w51q1GaSQ1TZ3m95PdUBhL05vwIYmamrkhbxiJiffbBu2/WFlYV4k//YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:37.113814Z"},"content_sha256":"e5f83133c94a7a459e538d4d5b136ed87113c3e6d79f6242ee1d0624f519899f","schema_version":"1.0","event_id":"sha256:e5f83133c94a7a459e538d4d5b136ed87113c3e6d79f6242ee1d0624f519899f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLUKXOX326ISW4TWVJXHJCSAA4/bundle.json","state_url":"https://pith.science/pith/DLUKXOX326ISW4TWVJXHJCSAA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLUKXOX326ISW4TWVJXHJCSAA4/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-28T07:32:37Z","links":{"resolver":"https://pith.science/pith/DLUKXOX326ISW4TWVJXHJCSAA4","bundle":"https://pith.science/pith/DLUKXOX326ISW4TWVJXHJCSAA4/bundle.json","state":"https://pith.science/pith/DLUKXOX326ISW4TWVJXHJCSAA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLUKXOX326ISW4TWVJXHJCSAA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DLUKXOX326ISW4TWVJXHJCSAA4","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":"1846aca228be1a87cf71b52ba6d3b4c120b13e28b9312c9249d4d2c2088954c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-26T04:49:41Z","title_canon_sha256":"6f75474445c2db78a596b623d50f20e04c3cc474fcae48aaa637134c629dca46"},"schema_version":"1.0","source":{"id":"1609.07845","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07845","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07845v2","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07845","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"DLUKXOX326IS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLUKXOX326ISW4TW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLUKXOX3","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:e5f83133c94a7a459e538d4d5b136ed87113c3e6d79f6242ee1d0624f519899f","target":"graph","created_at":"2026-05-18T01:03:42Z","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":"Finding feasible, collision-free paths for multiagent systems can be challenging, particularly in non-communicating scenarios where each agent's intent (e.g. goal) is unobservable to the others. In particular, finding time efficient paths often requires anticipating interaction with neighboring agents, the process of which can be computationally prohibitive. This work presents a decentralized multiagent collision avoidance algorithm based on a novel application of deep reinforcement learning, which effectively offloads the online computation (for predicting interaction patterns) to an offline ","authors_text":"Jonathan P. How, Miao Liu, Michael Everett, Yu Fan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-26T04:49:41Z","title":"Decentralized Non-communicating Multiagent Collision Avoidance with Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07845","kind":"arxiv","version":2},"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:96f7a837001fa7dd1be2fc369bcc780eb1c6d950523856852c09b78540667095","target":"record","created_at":"2026-05-18T01:03:42Z","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":"1846aca228be1a87cf71b52ba6d3b4c120b13e28b9312c9249d4d2c2088954c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-26T04:49:41Z","title_canon_sha256":"6f75474445c2db78a596b623d50f20e04c3cc474fcae48aaa637134c629dca46"},"schema_version":"1.0","source":{"id":"1609.07845","kind":"arxiv","version":2}},"canonical_sha256":"1ae8abbafbd7912b7276aa6e748a400714f16cb3e7eac36f6829fe5125c80183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ae8abbafbd7912b7276aa6e748a400714f16cb3e7eac36f6829fe5125c80183","first_computed_at":"2026-05-18T01:03:42.424426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:42.424426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P9b+ZHapOBxbcGfT4ZdgSLaNiFZ66yJd8zkw3v+SBi/psOS4ZmB5tMu9OuEI4J+N8nphrE/yu7YSKo/psgLnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:42.424852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07845","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96f7a837001fa7dd1be2fc369bcc780eb1c6d950523856852c09b78540667095","sha256:e5f83133c94a7a459e538d4d5b136ed87113c3e6d79f6242ee1d0624f519899f"],"state_sha256":"a68cd2577854e07f97064041cd9e3beac408921e4f378d4f29ffc5e88716ea97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQwjQ928AuejZt0s/iRhGlIcAiIzdg9qIHu7Vyibg1Ltc/evLHyLQ/A7jtcGNzjqGyfLTBiy+TvP3tZgCLuxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:32:37.115759Z","bundle_sha256":"818f20e196e30c44527ca96c21571dd1a8a132f4af22929bb7f4ac23ca441a8f"}}