{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TWEKI633W5ZIXCKODH6FHVSVPU","short_pith_number":"pith:TWEKI633","canonical_record":{"source":{"id":"1803.01846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-05T03:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e327975aae6006167b4d89f1df158761ca2e208a03c8c1a6979ad352a7b8160","abstract_canon_sha256":"33ccc242535de7824314f151a5eed148e56699f07db649a7e45113875fa318b8"},"schema_version":"1.0"},"canonical_sha256":"9d88a47b7bb7728b894e19fc53d6557d0baa75dc0d6a08d03f01885e8c787e98","source":{"kind":"arxiv","id":"1803.01846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01846","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01846v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01846","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"TWEKI633W5ZI","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TWEKI633W5ZIXCKO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TWEKI633","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TWEKI633W5ZIXCKODH6FHVSVPU","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-05T03:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e327975aae6006167b4d89f1df158761ca2e208a03c8c1a6979ad352a7b8160","abstract_canon_sha256":"33ccc242535de7824314f151a5eed148e56699f07db649a7e45113875fa318b8"},"schema_version":"1.0"},"canonical_sha256":"9d88a47b7bb7728b894e19fc53d6557d0baa75dc0d6a08d03f01885e8c787e98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.465399Z","signature_b64":"jVUz59KTGqGJOmPM2Mf7Ut0Fx+rpCF5L5BNXwN89cI2wWJwFpmrt5D6M3IQOY5k2pWq5ccgyG67ewgI5SKQdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d88a47b7bb7728b894e19fc53d6557d0baa75dc0d6a08d03f01885e8c787e98","last_reissued_at":"2026-05-18T00:21:56.464862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.464862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01846","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:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zq+UX2Vv8OPEXHbkfF8lXMWpkcKNomaAKgFge3wq8XEeW4+Aaw02ZFRcELf7Kf9mYIqwP2tzvWaTYdbgX59Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:29:21.844019Z"},"content_sha256":"08af19b8d37dc31944bd5527be1192fcb0a82081480edd6af978589bf9fa1b5c","schema_version":"1.0","event_id":"sha256:08af19b8d37dc31944bd5527be1192fcb0a82081480edd6af978589bf9fa1b5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TWEKI633W5ZIXCKODH6FHVSVPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Sample-Efficient Target Reaching for Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Vijay Kumar","submitted_at":"2018-03-05T03:45:53Z","abstract_excerpt":"In this paper, we propose a novel architecture and a self-supervised policy gradient algorithm, which employs unsupervised auxiliary tasks to enable a mobile robot to learn how to navigate to a given goal. The dependency on the global information is eliminated by providing only sparse range-finder measurements to the robot. The partially observable planning problem is addressed by splitting it into a hierarchical process. We use convolutional networks to plan locally, and a differentiable memory to provide information about past time steps in the trajectory. These modules, combined in our netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01846","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:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBZMMNPr68nnQA/EsPgnsEnPKxwnklULNnyP3+kueKW215qIZHpaosKoGshs8HnwFTkdbPxj7kcn1pD86nTdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:29:21.844779Z"},"content_sha256":"72dce3decf35a68bcfd90e30467f1ed6b00d22decfb94a6579e581a4dce11fab","schema_version":"1.0","event_id":"sha256:72dce3decf35a68bcfd90e30467f1ed6b00d22decfb94a6579e581a4dce11fab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWEKI633W5ZIXCKODH6FHVSVPU/bundle.json","state_url":"https://pith.science/pith/TWEKI633W5ZIXCKODH6FHVSVPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWEKI633W5ZIXCKODH6FHVSVPU/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-25T21:29:21Z","links":{"resolver":"https://pith.science/pith/TWEKI633W5ZIXCKODH6FHVSVPU","bundle":"https://pith.science/pith/TWEKI633W5ZIXCKODH6FHVSVPU/bundle.json","state":"https://pith.science/pith/TWEKI633W5ZIXCKODH6FHVSVPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWEKI633W5ZIXCKODH6FHVSVPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TWEKI633W5ZIXCKODH6FHVSVPU","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":"33ccc242535de7824314f151a5eed148e56699f07db649a7e45113875fa318b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-05T03:45:53Z","title_canon_sha256":"1e327975aae6006167b4d89f1df158761ca2e208a03c8c1a6979ad352a7b8160"},"schema_version":"1.0","source":{"id":"1803.01846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01846","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01846v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01846","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"TWEKI633W5ZI","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TWEKI633W5ZIXCKO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TWEKI633","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:72dce3decf35a68bcfd90e30467f1ed6b00d22decfb94a6579e581a4dce11fab","target":"graph","created_at":"2026-05-18T00:21:56Z","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":"In this paper, we propose a novel architecture and a self-supervised policy gradient algorithm, which employs unsupervised auxiliary tasks to enable a mobile robot to learn how to navigate to a given goal. The dependency on the global information is eliminated by providing only sparse range-finder measurements to the robot. The partially observable planning problem is addressed by splitting it into a hierarchical process. We use convolutional networks to plan locally, and a differentiable memory to provide information about past time steps in the trajectory. These modules, combined in our netw","authors_text":"Alejandro Ribeiro, Arbaaz Khan, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-05T03:45:53Z","title":"Learning Sample-Efficient Target Reaching for Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01846","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:08af19b8d37dc31944bd5527be1192fcb0a82081480edd6af978589bf9fa1b5c","target":"record","created_at":"2026-05-18T00:21:56Z","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":"33ccc242535de7824314f151a5eed148e56699f07db649a7e45113875fa318b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-05T03:45:53Z","title_canon_sha256":"1e327975aae6006167b4d89f1df158761ca2e208a03c8c1a6979ad352a7b8160"},"schema_version":"1.0","source":{"id":"1803.01846","kind":"arxiv","version":1}},"canonical_sha256":"9d88a47b7bb7728b894e19fc53d6557d0baa75dc0d6a08d03f01885e8c787e98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d88a47b7bb7728b894e19fc53d6557d0baa75dc0d6a08d03f01885e8c787e98","first_computed_at":"2026-05-18T00:21:56.464862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:56.464862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVUz59KTGqGJOmPM2Mf7Ut0Fx+rpCF5L5BNXwN89cI2wWJwFpmrt5D6M3IQOY5k2pWq5ccgyG67ewgI5SKQdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:56.465399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08af19b8d37dc31944bd5527be1192fcb0a82081480edd6af978589bf9fa1b5c","sha256:72dce3decf35a68bcfd90e30467f1ed6b00d22decfb94a6579e581a4dce11fab"],"state_sha256":"47d5a51ac3af2d53a24018dcabf01e750649ae94f92b40b7ab2f2daa3cd6801e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umyXB4MXThLL9YGTqyu+PFPnTBqp0is55h/3ammq3tTn85s21FFMF8SgnBq3GBVItUk6Dbjr3GYrM+J4nPhyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:29:21.848791Z","bundle_sha256":"dda2800ca2a2e22a7f2f394a348b5a98ca884f15e601189cf0482eb5291f7f3f"}}