{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GA2XB4ZOJOEQR3OMFCBBFQBD6Z","short_pith_number":"pith:GA2XB4ZO","canonical_record":{"source":{"id":"1805.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-04T22:45:08Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"98fc662ac94e38cb1d5e6e16ea381f8c8fa0aaef328e1b8874c761f65e203904","abstract_canon_sha256":"22d04992fe502d9e113f318308ada7eaefd572f433771428185df8f4b0c8a828"},"schema_version":"1.0"},"canonical_sha256":"303570f32e4b8908edcc288212c023f64c9da4955d0c24c9cf4c83fcf44898b6","source":{"kind":"arxiv","id":"1805.01956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01956","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01956v1","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01956","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"GA2XB4ZOJOEQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GA2XB4ZOJOEQR3OM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GA2XB4ZO","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GA2XB4ZOJOEQR3OMFCBBFQBD6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-04T22:45:08Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"98fc662ac94e38cb1d5e6e16ea381f8c8fa0aaef328e1b8874c761f65e203904","abstract_canon_sha256":"22d04992fe502d9e113f318308ada7eaefd572f433771428185df8f4b0c8a828"},"schema_version":"1.0"},"canonical_sha256":"303570f32e4b8908edcc288212c023f64c9da4955d0c24c9cf4c83fcf44898b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:41.478670Z","signature_b64":"2BdamVpgW7vr4tOpq/tE3OhRcJEjayA8VnJpCvpNN7sgXiyE2fKUA8F8JY9hdtd9HXJG9l/tFy1REZQDNiP0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303570f32e4b8908edcc288212c023f64c9da4955d0c24c9cf4c83fcf44898b6","last_reissued_at":"2026-05-18T00:16:41.477989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:41.477989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01956","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:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COIWgz8Lq3FFuVmYYZNlMh7CazqXjOnnym+wgKcytGn9telYUeoe4PqQ9AIokwszJwtMt9ZVBoRSOHGyYf4kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:36:05.978075Z"},"content_sha256":"ef9b6b42c6b0543f847fe79bd0544edf023fb11d93fcca3193353bffaf13cae2","schema_version":"1.0","event_id":"sha256:ef9b6b42c6b0543f847fe79bd0544edf023fb11d93fcca3193353bffaf13cae2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GA2XB4ZOJOEQR3OMFCBBFQBD6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Jonathan P. How, Michael Everett, Yu Fan Chen","submitted_at":"2018-05-04T22:45:08Z","abstract_excerpt":"Robots that navigate among pedestrians use collision avoidance algorithms to enable safe and efficient operation. Recent works present deep reinforcement learning as a framework to model the complex interactions and cooperation. However, they are implemented using key assumptions about other agents' behavior that deviate from reality as the number of agents in the environment increases. This work extends our previous approach to develop an algorithm that learns collision avoidance among a variety of types of dynamic agents without assuming they follow any particular behavior rules. This work a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01956","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:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScNeGVP+t5ye4mPOOeh2X6rgdcPfbJ2rbAHsjvdY/45gjCgTg8d40rhVvAlOXPiH+NPIjJX87n7mnF1PL8JZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:36:05.978723Z"},"content_sha256":"72c924547b2cf913304f6e2d076aef76d9109145ae206563a87da215aff5e5d3","schema_version":"1.0","event_id":"sha256:72c924547b2cf913304f6e2d076aef76d9109145ae206563a87da215aff5e5d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/bundle.json","state_url":"https://pith.science/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/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-28T13:36:05Z","links":{"resolver":"https://pith.science/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z","bundle":"https://pith.science/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/bundle.json","state":"https://pith.science/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GA2XB4ZOJOEQR3OMFCBBFQBD6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GA2XB4ZOJOEQR3OMFCBBFQBD6Z","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":"22d04992fe502d9e113f318308ada7eaefd572f433771428185df8f4b0c8a828","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-04T22:45:08Z","title_canon_sha256":"98fc662ac94e38cb1d5e6e16ea381f8c8fa0aaef328e1b8874c761f65e203904"},"schema_version":"1.0","source":{"id":"1805.01956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01956","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01956v1","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01956","created_at":"2026-05-18T00:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"GA2XB4ZOJOEQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GA2XB4ZOJOEQR3OM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GA2XB4ZO","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:72c924547b2cf913304f6e2d076aef76d9109145ae206563a87da215aff5e5d3","target":"graph","created_at":"2026-05-18T00:16:41Z","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":"Robots that navigate among pedestrians use collision avoidance algorithms to enable safe and efficient operation. Recent works present deep reinforcement learning as a framework to model the complex interactions and cooperation. However, they are implemented using key assumptions about other agents' behavior that deviate from reality as the number of agents in the environment increases. This work extends our previous approach to develop an algorithm that learns collision avoidance among a variety of types of dynamic agents without assuming they follow any particular behavior rules. This work a","authors_text":"Jonathan P. How, Michael Everett, Yu Fan Chen","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-04T22:45:08Z","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01956","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:ef9b6b42c6b0543f847fe79bd0544edf023fb11d93fcca3193353bffaf13cae2","target":"record","created_at":"2026-05-18T00:16:41Z","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":"22d04992fe502d9e113f318308ada7eaefd572f433771428185df8f4b0c8a828","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-04T22:45:08Z","title_canon_sha256":"98fc662ac94e38cb1d5e6e16ea381f8c8fa0aaef328e1b8874c761f65e203904"},"schema_version":"1.0","source":{"id":"1805.01956","kind":"arxiv","version":1}},"canonical_sha256":"303570f32e4b8908edcc288212c023f64c9da4955d0c24c9cf4c83fcf44898b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"303570f32e4b8908edcc288212c023f64c9da4955d0c24c9cf4c83fcf44898b6","first_computed_at":"2026-05-18T00:16:41.477989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:41.477989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2BdamVpgW7vr4tOpq/tE3OhRcJEjayA8VnJpCvpNN7sgXiyE2fKUA8F8JY9hdtd9HXJG9l/tFy1REZQDNiP0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:41.478670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9b6b42c6b0543f847fe79bd0544edf023fb11d93fcca3193353bffaf13cae2","sha256:72c924547b2cf913304f6e2d076aef76d9109145ae206563a87da215aff5e5d3"],"state_sha256":"10c508d86ba1b696e47046ecdf650bcb6a443124a83738f7d17f774c8defd57e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR4vkHkuq+77dJUgAoOkBmLza3hxRCtpRJ5rTvF5x4g5nWP79+ystA+FpDngA0C+NqppcYu26x/DE50jOwE4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:36:05.982401Z","bundle_sha256":"8ac2e7638adae295533a623c46e0bdc9fe43254ccb9925a26f7fc2e6c55a59a2"}}