{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G5N7SG24E5VYGP534HPJI2Q3IA","short_pith_number":"pith:G5N7SG24","canonical_record":{"source":{"id":"1609.06838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-22T07:05:56Z","cross_cats_sorted":["cs.CV","cs.RO"],"title_canon_sha256":"acd029bd252127d74f05ed790b8be26507a266e5bbe8428e8b7e8c4298fd3ca3","abstract_canon_sha256":"c2ca214fcd6e187ce65d3cb9421e61e61eb38b646a82f710d1dc597bb4365d68"},"schema_version":"1.0"},"canonical_sha256":"375bf91b5c276b833fbbe1de946a1b401b79ff773da963d6f7368709639da1bc","source":{"kind":"arxiv","id":"1609.06838","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06838","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06838v2","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06838","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"G5N7SG24E5VY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5N7SG24E5VYGP53","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5N7SG24","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G5N7SG24E5VYGP534HPJI2Q3IA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-22T07:05:56Z","cross_cats_sorted":["cs.CV","cs.RO"],"title_canon_sha256":"acd029bd252127d74f05ed790b8be26507a266e5bbe8428e8b7e8c4298fd3ca3","abstract_canon_sha256":"c2ca214fcd6e187ce65d3cb9421e61e61eb38b646a82f710d1dc597bb4365d68"},"schema_version":"1.0"},"canonical_sha256":"375bf91b5c276b833fbbe1de946a1b401b79ff773da963d6f7368709639da1bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:51.567532Z","signature_b64":"nSjecooh0xhdvL3ag90ehiOrhLFNbIPwkjkXqBD2etDEAToviVclb8Udj1G6U9nLfNNNUyVa1T/8AQSVvogGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"375bf91b5c276b833fbbe1de946a1b401b79ff773da963d6f7368709639da1bc","last_reissued_at":"2026-05-18T00:40:51.566756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:51.566756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06838","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-18T00:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7TzFrSVU1yYD7uBf9f/fUdLN5dx4RiwrMb4JtceBQU083t6n4qVu2cp4JsVCsKN8unwXUrSpDr5Mv1LY0MxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:53:47.245635Z"},"content_sha256":"0556b9a21b4bb0c6389b3a15e22a742be029a20fede4630ee4c889c78bc7a842","schema_version":"1.0","event_id":"sha256:0556b9a21b4bb0c6389b3a15e22a742be029a20fede4630ee4c889c78bc7a842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G5N7SG24E5VYGP534HPJI2Q3IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep-Learned Collision Avoidance Policy for Distributed Multi-Agent Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.RO"],"primary_cat":"cs.AI","authors_text":"Jia Pan, Pinxin Long, Wenxi Liu","submitted_at":"2016-09-22T07:05:56Z","abstract_excerpt":"High-speed, low-latency obstacle avoidance that is insensitive to sensor noise is essential for enabling multiple decentralized robots to function reliably in cluttered and dynamic environments. While other distributed multi-agent collision avoidance systems exist, these systems require online geometric optimization where tedious parameter tuning and perfect sensing are necessary.\n  We present a novel end-to-end framework to generate reactive collision avoidance policy for efficient distributed multi-agent navigation. Our method formulates an agent's navigation strategy as a deep neural networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06838","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-18T00:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qu0+0HcGfgwvu2OlDhhMhAlRVJVmhwQKU9oTErrMRJ0pfAe4ZU5aPfTHlDhixeNT/PtXMz8DbfLFB6oyXoLRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:53:47.246303Z"},"content_sha256":"da005e4b6453c1277eb8a1c8989fd48bb62aaa97429c646bbca15d0810f04666","schema_version":"1.0","event_id":"sha256:da005e4b6453c1277eb8a1c8989fd48bb62aaa97429c646bbca15d0810f04666"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5N7SG24E5VYGP534HPJI2Q3IA/bundle.json","state_url":"https://pith.science/pith/G5N7SG24E5VYGP534HPJI2Q3IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5N7SG24E5VYGP534HPJI2Q3IA/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-06-05T20:53:47Z","links":{"resolver":"https://pith.science/pith/G5N7SG24E5VYGP534HPJI2Q3IA","bundle":"https://pith.science/pith/G5N7SG24E5VYGP534HPJI2Q3IA/bundle.json","state":"https://pith.science/pith/G5N7SG24E5VYGP534HPJI2Q3IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5N7SG24E5VYGP534HPJI2Q3IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G5N7SG24E5VYGP534HPJI2Q3IA","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":"c2ca214fcd6e187ce65d3cb9421e61e61eb38b646a82f710d1dc597bb4365d68","cross_cats_sorted":["cs.CV","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-22T07:05:56Z","title_canon_sha256":"acd029bd252127d74f05ed790b8be26507a266e5bbe8428e8b7e8c4298fd3ca3"},"schema_version":"1.0","source":{"id":"1609.06838","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06838","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06838v2","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06838","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"G5N7SG24E5VY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5N7SG24E5VYGP53","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5N7SG24","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:da005e4b6453c1277eb8a1c8989fd48bb62aaa97429c646bbca15d0810f04666","target":"graph","created_at":"2026-05-18T00:40:51Z","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":"High-speed, low-latency obstacle avoidance that is insensitive to sensor noise is essential for enabling multiple decentralized robots to function reliably in cluttered and dynamic environments. While other distributed multi-agent collision avoidance systems exist, these systems require online geometric optimization where tedious parameter tuning and perfect sensing are necessary.\n  We present a novel end-to-end framework to generate reactive collision avoidance policy for efficient distributed multi-agent navigation. Our method formulates an agent's navigation strategy as a deep neural networ","authors_text":"Jia Pan, Pinxin Long, Wenxi Liu","cross_cats":["cs.CV","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-22T07:05:56Z","title":"Deep-Learned Collision Avoidance Policy for Distributed Multi-Agent Navigation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06838","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:0556b9a21b4bb0c6389b3a15e22a742be029a20fede4630ee4c889c78bc7a842","target":"record","created_at":"2026-05-18T00:40:51Z","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":"c2ca214fcd6e187ce65d3cb9421e61e61eb38b646a82f710d1dc597bb4365d68","cross_cats_sorted":["cs.CV","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-22T07:05:56Z","title_canon_sha256":"acd029bd252127d74f05ed790b8be26507a266e5bbe8428e8b7e8c4298fd3ca3"},"schema_version":"1.0","source":{"id":"1609.06838","kind":"arxiv","version":2}},"canonical_sha256":"375bf91b5c276b833fbbe1de946a1b401b79ff773da963d6f7368709639da1bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"375bf91b5c276b833fbbe1de946a1b401b79ff773da963d6f7368709639da1bc","first_computed_at":"2026-05-18T00:40:51.566756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:51.566756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nSjecooh0xhdvL3ag90ehiOrhLFNbIPwkjkXqBD2etDEAToviVclb8Udj1G6U9nLfNNNUyVa1T/8AQSVvogGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:51.567532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06838","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0556b9a21b4bb0c6389b3a15e22a742be029a20fede4630ee4c889c78bc7a842","sha256:da005e4b6453c1277eb8a1c8989fd48bb62aaa97429c646bbca15d0810f04666"],"state_sha256":"b9ebd0ede9d5f223151aa3e0d65613b2e5bbf83a3ea6bd0fb340b71d190407af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22Qi6/oLxBj+kWh8e7tmYoXP66QLPeczU4rdtGmpF08TNeBlL0T/IClEjtu9817jfUeSGM/JhQuyxU1nW8oADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:53:47.249601Z","bundle_sha256":"d1c863eb16bba91dca335f7d569ea427e859c20e9e70eeea2f1bef8530c49c5c"}}