{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P2Q45MWOZYIZZXX5FVVP5I7F6I","short_pith_number":"pith:P2Q45MWO","canonical_record":{"source":{"id":"1906.12082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-28T08:11:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f893705d321340705b22f49ed40e5a5dfdc8f374f193a2579d22edcc1f265713","abstract_canon_sha256":"3147e5649bc134419e5f0643e5285e7eff5fdc447ecb845069f188a237d0d51c"},"schema_version":"1.0"},"canonical_sha256":"7ea1ceb2cece119cdefd2d6afea3e5f209a63831e944ec478cf5294b36bca1ce","source":{"kind":"arxiv","id":"1906.12082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.12082","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1906.12082v1","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12082","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"P2Q45MWOZYIZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2Q45MWOZYIZZXX5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2Q45MWO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P2Q45MWOZYIZZXX5FVVP5I7F6I","target":"record","payload":{"canonical_record":{"source":{"id":"1906.12082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-28T08:11:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f893705d321340705b22f49ed40e5a5dfdc8f374f193a2579d22edcc1f265713","abstract_canon_sha256":"3147e5649bc134419e5f0643e5285e7eff5fdc447ecb845069f188a237d0d51c"},"schema_version":"1.0"},"canonical_sha256":"7ea1ceb2cece119cdefd2d6afea3e5f209a63831e944ec478cf5294b36bca1ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:59.321112Z","signature_b64":"BzUr+QbhfDgubPDBfKhVk7RChxQzFfn7j4T95wgR3QHICKY0+ke9W+jnz8FXafT53oMnfl1OIBd6Da1LatXwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ea1ceb2cece119cdefd2d6afea3e5f209a63831e944ec478cf5294b36bca1ce","last_reissued_at":"2026-05-17T23:41:59.320545Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:59.320545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.12082","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-17T23:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ks3VA6FWfEhMsQBxJzjc00f+kZ6I+B2P0D66sEmnoRwUEKiLkMwdEjFWoOt8K7KV9JBAYrUtdgJnwWR3HB97BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:29:52.176763Z"},"content_sha256":"61642881ba693035d7ba9c7ede6d3cc8b38223f8eb2a2b573f2b8bbfd50bea71","schema_version":"1.0","event_id":"sha256:61642881ba693035d7ba9c7ede6d3cc8b38223f8eb2a2b573f2b8bbfd50bea71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P2Q45MWOZYIZZXX5FVVP5I7F6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Efficient Learning of Path Following and Obstacle Avoidance Behavior for Quadrotors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Javier Alonso-Mora, Otmar Hilliges, Stefan Stevsic, Tobias Naegeli","submitted_at":"2019-06-28T08:11:27Z","abstract_excerpt":"In this paper we propose an algorithm for the training of neural network control policies for quadrotors. The learned control policy computes control commands directly from sensor inputs and is hence computationally efficient. An imitation learning algorithm produces a policy that reproduces the behavior of a path following control algorithm with collision avoidance. Due to the generalization ability of neural networks, the resulting policy performs local collision avoidance of unseen obstacles while following a global reference path. The algorithm uses a time-free model predictive path-follow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12082","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-17T23:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XhvhaY3Ilc3VVDNsSrjwVXq+2C1HywHFiaVo4cXKFkwJjdjW8cVJgdNg+/qRg5kwvMNvGfSPZYrXPc3hUz/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:29:52.177106Z"},"content_sha256":"ff71f695642b2de83a20b378f5564c2b97fed43d8f4cf0918a45dc2fe4af25fd","schema_version":"1.0","event_id":"sha256:ff71f695642b2de83a20b378f5564c2b97fed43d8f4cf0918a45dc2fe4af25fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/bundle.json","state_url":"https://pith.science/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/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-05T11:29:52Z","links":{"resolver":"https://pith.science/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I","bundle":"https://pith.science/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/bundle.json","state":"https://pith.science/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2Q45MWOZYIZZXX5FVVP5I7F6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P2Q45MWOZYIZZXX5FVVP5I7F6I","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":"3147e5649bc134419e5f0643e5285e7eff5fdc447ecb845069f188a237d0d51c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-28T08:11:27Z","title_canon_sha256":"f893705d321340705b22f49ed40e5a5dfdc8f374f193a2579d22edcc1f265713"},"schema_version":"1.0","source":{"id":"1906.12082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.12082","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1906.12082v1","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12082","created_at":"2026-05-17T23:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"P2Q45MWOZYIZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2Q45MWOZYIZZXX5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2Q45MWO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ff71f695642b2de83a20b378f5564c2b97fed43d8f4cf0918a45dc2fe4af25fd","target":"graph","created_at":"2026-05-17T23:41:59Z","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 an algorithm for the training of neural network control policies for quadrotors. The learned control policy computes control commands directly from sensor inputs and is hence computationally efficient. An imitation learning algorithm produces a policy that reproduces the behavior of a path following control algorithm with collision avoidance. Due to the generalization ability of neural networks, the resulting policy performs local collision avoidance of unseen obstacles while following a global reference path. The algorithm uses a time-free model predictive path-follow","authors_text":"Javier Alonso-Mora, Otmar Hilliges, Stefan Stevsic, Tobias Naegeli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-28T08:11:27Z","title":"Sample Efficient Learning of Path Following and Obstacle Avoidance Behavior for Quadrotors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12082","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:61642881ba693035d7ba9c7ede6d3cc8b38223f8eb2a2b573f2b8bbfd50bea71","target":"record","created_at":"2026-05-17T23:41:59Z","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":"3147e5649bc134419e5f0643e5285e7eff5fdc447ecb845069f188a237d0d51c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-28T08:11:27Z","title_canon_sha256":"f893705d321340705b22f49ed40e5a5dfdc8f374f193a2579d22edcc1f265713"},"schema_version":"1.0","source":{"id":"1906.12082","kind":"arxiv","version":1}},"canonical_sha256":"7ea1ceb2cece119cdefd2d6afea3e5f209a63831e944ec478cf5294b36bca1ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ea1ceb2cece119cdefd2d6afea3e5f209a63831e944ec478cf5294b36bca1ce","first_computed_at":"2026-05-17T23:41:59.320545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:59.320545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BzUr+QbhfDgubPDBfKhVk7RChxQzFfn7j4T95wgR3QHICKY0+ke9W+jnz8FXafT53oMnfl1OIBd6Da1LatXwCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:59.321112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.12082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61642881ba693035d7ba9c7ede6d3cc8b38223f8eb2a2b573f2b8bbfd50bea71","sha256:ff71f695642b2de83a20b378f5564c2b97fed43d8f4cf0918a45dc2fe4af25fd"],"state_sha256":"c5882cf06bfe3996d1f41213f3fdf3696929efbbb98b99fef705b091c8612922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"px81uRo5CH5Zs1mglrFaRwCYZgw9fGel0ccOdYw6VpmUuaQDRo0j26l11v5k8W7i4/m+E5DDt+7nBtu8Bx49Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:29:52.179081Z","bundle_sha256":"ae2541ca8ef595117861c5593796eb8456a36921a1b0d7c5dda3b4501a1a6fb9"}}