{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FFZ3PD5NHNPYY57WZNKC5CQ6R5","short_pith_number":"pith:FFZ3PD5N","canonical_record":{"source":{"id":"2209.06622","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-14T13:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"13f053044505c8103685471e34699b48d30ef165c90394e3b13c974e2ac5c710","abstract_canon_sha256":"145b28087fb03d7db5c328012046b73a0f18067b0f66b237551870fc7607f5cb"},"schema_version":"1.0"},"canonical_sha256":"2973b78fad3b5f8c77f6cb542e8a1e8f6e93fe83f620821604f8f6871704e355","source":{"kind":"arxiv","id":"2209.06622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.06622","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2209.06622v1","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.06622","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"FFZ3PD5NHNPY","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"FFZ3PD5NHNPYY57W","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"FFZ3PD5N","created_at":"2026-07-05T04:57:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FFZ3PD5NHNPYY57WZNKC5CQ6R5","target":"record","payload":{"canonical_record":{"source":{"id":"2209.06622","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-14T13:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"13f053044505c8103685471e34699b48d30ef165c90394e3b13c974e2ac5c710","abstract_canon_sha256":"145b28087fb03d7db5c328012046b73a0f18067b0f66b237551870fc7607f5cb"},"schema_version":"1.0"},"canonical_sha256":"2973b78fad3b5f8c77f6cb542e8a1e8f6e93fe83f620821604f8f6871704e355","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:32.896607Z","signature_b64":"0RGpVnXXyXQ5IkPVSMSgXNp8VrMLxgSyEWb7m3THKepISQuCVGMwOjXZGN5EAcUaUvOgkP09gZjuXFBwh3H/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2973b78fad3b5f8c77f6cb542e8a1e8f6e93fe83f620821604f8f6871704e355","last_reissued_at":"2026-07-05T04:57:32.896240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:32.896240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.06622","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-07-05T04:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ft5EE794Ir3JIoVve8Ru7gZf3soJbl7CgWgvNxwclu1++ZIh3Sq6cN/iaq5r7tXtHewiANPxnJdQLWzHcckUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:27:53.210009Z"},"content_sha256":"af4eba3c45675ab29d501538cef67ad9c6b9b31ef024a06d4cadd0a9aa72aabe","schema_version":"1.0","event_id":"sha256:af4eba3c45675ab29d501538cef67ad9c6b9b31ef024a06d4cadd0a9aa72aabe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FFZ3PD5NHNPYY57WZNKC5CQ6R5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Multi-Robot Obstacle Avoidance via Logarithmic Map-based Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Changjie Fan, Guangda Chen, Jiafeng Ma, Jianming Zhang, Yingfeng Chen, Yujing Hu","submitted_at":"2022-09-14T13:19:55Z","abstract_excerpt":"Developing a safe, stable, and efficient obstacle avoidance policy in crowded and narrow scenarios for multiple robots is challenging. Most existing studies either use centralized control or need communication with other robots. In this paper, we propose a novel logarithmic map-based deep reinforcement learning method for obstacle avoidance in complex and communication-free multi-robot scenarios. In particular, our method converts laser information into a logarithmic map. As a step toward improving training speed and generalization performance, our policies will be trained in two specially des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.06622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.06622/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDWFXphb8do8emxvd80Qy9oZehuqpCIl8aXyJNGwoJZn/pRB4Y/M4UwZrxoRLZMqJewQlh66rlqR2sRG4CnkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:27:53.210393Z"},"content_sha256":"32b8a5b18e8fe298ba1b009195213da488505c166cc430a5bfa1dda16204f9a1","schema_version":"1.0","event_id":"sha256:32b8a5b18e8fe298ba1b009195213da488505c166cc430a5bfa1dda16204f9a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/bundle.json","state_url":"https://pith.science/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/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-07-06T23:27:53Z","links":{"resolver":"https://pith.science/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5","bundle":"https://pith.science/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/bundle.json","state":"https://pith.science/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFZ3PD5NHNPYY57WZNKC5CQ6R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FFZ3PD5NHNPYY57WZNKC5CQ6R5","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":"145b28087fb03d7db5c328012046b73a0f18067b0f66b237551870fc7607f5cb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-14T13:19:55Z","title_canon_sha256":"13f053044505c8103685471e34699b48d30ef165c90394e3b13c974e2ac5c710"},"schema_version":"1.0","source":{"id":"2209.06622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.06622","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2209.06622v1","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.06622","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"FFZ3PD5NHNPY","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"FFZ3PD5NHNPYY57W","created_at":"2026-07-05T04:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"FFZ3PD5N","created_at":"2026-07-05T04:57:32Z"}],"graph_snapshots":[{"event_id":"sha256:32b8a5b18e8fe298ba1b009195213da488505c166cc430a5bfa1dda16204f9a1","target":"graph","created_at":"2026-07-05T04:57:32Z","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/2209.06622/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Developing a safe, stable, and efficient obstacle avoidance policy in crowded and narrow scenarios for multiple robots is challenging. Most existing studies either use centralized control or need communication with other robots. In this paper, we propose a novel logarithmic map-based deep reinforcement learning method for obstacle avoidance in complex and communication-free multi-robot scenarios. In particular, our method converts laser information into a logarithmic map. As a step toward improving training speed and generalization performance, our policies will be trained in two specially des","authors_text":"Changjie Fan, Guangda Chen, Jiafeng Ma, Jianming Zhang, Yingfeng Chen, Yujing Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-14T13:19:55Z","title":"Distributed Multi-Robot Obstacle Avoidance via Logarithmic Map-based Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.06622","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:af4eba3c45675ab29d501538cef67ad9c6b9b31ef024a06d4cadd0a9aa72aabe","target":"record","created_at":"2026-07-05T04:57:32Z","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":"145b28087fb03d7db5c328012046b73a0f18067b0f66b237551870fc7607f5cb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-14T13:19:55Z","title_canon_sha256":"13f053044505c8103685471e34699b48d30ef165c90394e3b13c974e2ac5c710"},"schema_version":"1.0","source":{"id":"2209.06622","kind":"arxiv","version":1}},"canonical_sha256":"2973b78fad3b5f8c77f6cb542e8a1e8f6e93fe83f620821604f8f6871704e355","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2973b78fad3b5f8c77f6cb542e8a1e8f6e93fe83f620821604f8f6871704e355","first_computed_at":"2026-07-05T04:57:32.896240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:57:32.896240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0RGpVnXXyXQ5IkPVSMSgXNp8VrMLxgSyEWb7m3THKepISQuCVGMwOjXZGN5EAcUaUvOgkP09gZjuXFBwh3H/Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:57:32.896607Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.06622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af4eba3c45675ab29d501538cef67ad9c6b9b31ef024a06d4cadd0a9aa72aabe","sha256:32b8a5b18e8fe298ba1b009195213da488505c166cc430a5bfa1dda16204f9a1"],"state_sha256":"b0a5c2ff976941094006dbaf292a0568d8c88c6f2bd5c1e7748133cb2780b3fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mymWmfFxxbUIgG+48w7M1AeH4n8u0acDArgNIx/VLfMtI/01FyqT7nwV4qxpYo8Uyq4LcOphiYT8Wk7xyhsGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:27:53.212345Z","bundle_sha256":"e2dc52f092715923093e163169270ff3ecc237264587073abcd66ad6367b96fa"}}