{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZWVQ7SQ3YNCAVEWITWIMJOPLMG","short_pith_number":"pith:ZWVQ7SQ3","canonical_record":{"source":{"id":"1908.02028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-06T09:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"46078310949a16560376981b7b85f931b9cd81dbfd1ba3fe17e359f0a76b71b7","abstract_canon_sha256":"80f1847bb5937baa9d0da9fcfe3db9c9a2c7f1e487dd459ac914747ab49bc701"},"schema_version":"1.0"},"canonical_sha256":"cdab0fca1bc3440a92c89d90c4b9eb61bfc02233bcbcefc48161a84523d5268e","source":{"kind":"arxiv","id":"1908.02028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02028","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02028v1","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02028","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZWVQ7SQ3YNCA","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWVQ7SQ3YNCAVEWI","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWVQ7SQ3","created_at":"2026-07-04T23:51:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZWVQ7SQ3YNCAVEWITWIMJOPLMG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-06T09:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"46078310949a16560376981b7b85f931b9cd81dbfd1ba3fe17e359f0a76b71b7","abstract_canon_sha256":"80f1847bb5937baa9d0da9fcfe3db9c9a2c7f1e487dd459ac914747ab49bc701"},"schema_version":"1.0"},"canonical_sha256":"cdab0fca1bc3440a92c89d90c4b9eb61bfc02233bcbcefc48161a84523d5268e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:50.220611Z","signature_b64":"GKu3l3QhmnG3daVFONmXpPz4lMFep58vF7vbrejzsSijia4ZqjpDcUrPN7Eo7xVf0/TDA2hZHsGCRx7dkQNTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdab0fca1bc3440a92c89d90c4b9eb61bfc02233bcbcefc48161a84523d5268e","last_reissued_at":"2026-07-04T23:51:50.220244Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:50.220244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02028","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-04T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vdWdvjieqIoo0sE264fdJ41RZV2YP5/s0/Fal5pLbSZYWGk5WP3/oTdp/mGZLAZ4FSz7zC0fWkidLCr7g9AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:08:41.005322Z"},"content_sha256":"e10327d49bcb94b373a426e3a10141118c6e61198d57bc530fc79ce35139f719","schema_version":"1.0","event_id":"sha256:e10327d49bcb94b373a426e3a10141118c6e61198d57bc530fc79ce35139f719"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZWVQ7SQ3YNCAVEWITWIMJOPLMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Time-optimal Avoidance of Moving Obstacles for High-Speed MAV Flight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Marius Beul, Sven Behnke","submitted_at":"2019-08-06T09:05:42Z","abstract_excerpt":"In this work, we propose a method to efficiently compute smooth, time-optimal trajectories for micro aerial vehicles (MAVs) evading a moving obstacle. Our approach first computes an n-dimensional trajectory from the start- to an arbitrary target state including position, velocity and acceleration. It respects input- and state-constraints and is thus dynamically feasible. The trajectory is then efficiently checked for collisions, exploiting the piecewise polynomial formulation. If collisions occur, viastates are inserted into the trajectory to circumvent the obstacle and still maintain time-opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02028","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/1908.02028/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-04T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCyG5/VaDZ70UPhgsuPDZe+VHQW/xzgPJ+NEXG8V353JIA80DBqzdOo/bqiHiJtML5FWZxlR0GviGM6JRvQuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:08:41.005712Z"},"content_sha256":"4799b53354539781012310f8c596e2b61e361b4615083437cb4bc19fb98ad545","schema_version":"1.0","event_id":"sha256:4799b53354539781012310f8c596e2b61e361b4615083437cb4bc19fb98ad545"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/bundle.json","state_url":"https://pith.science/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/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-08-17T08:08:41Z","links":{"resolver":"https://pith.science/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG","bundle":"https://pith.science/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/bundle.json","state":"https://pith.science/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWVQ7SQ3YNCAVEWITWIMJOPLMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZWVQ7SQ3YNCAVEWITWIMJOPLMG","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":"80f1847bb5937baa9d0da9fcfe3db9c9a2c7f1e487dd459ac914747ab49bc701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-06T09:05:42Z","title_canon_sha256":"46078310949a16560376981b7b85f931b9cd81dbfd1ba3fe17e359f0a76b71b7"},"schema_version":"1.0","source":{"id":"1908.02028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02028","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02028v1","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02028","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZWVQ7SQ3YNCA","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWVQ7SQ3YNCAVEWI","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWVQ7SQ3","created_at":"2026-07-04T23:51:50Z"}],"graph_snapshots":[{"event_id":"sha256:4799b53354539781012310f8c596e2b61e361b4615083437cb4bc19fb98ad545","target":"graph","created_at":"2026-07-04T23:51:50Z","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/1908.02028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose a method to efficiently compute smooth, time-optimal trajectories for micro aerial vehicles (MAVs) evading a moving obstacle. Our approach first computes an n-dimensional trajectory from the start- to an arbitrary target state including position, velocity and acceleration. It respects input- and state-constraints and is thus dynamically feasible. The trajectory is then efficiently checked for collisions, exploiting the piecewise polynomial formulation. If collisions occur, viastates are inserted into the trajectory to circumvent the obstacle and still maintain time-opt","authors_text":"Marius Beul, Sven Behnke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-06T09:05:42Z","title":"Fast Time-optimal Avoidance of Moving Obstacles for High-Speed MAV Flight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02028","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:e10327d49bcb94b373a426e3a10141118c6e61198d57bc530fc79ce35139f719","target":"record","created_at":"2026-07-04T23:51:50Z","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":"80f1847bb5937baa9d0da9fcfe3db9c9a2c7f1e487dd459ac914747ab49bc701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-06T09:05:42Z","title_canon_sha256":"46078310949a16560376981b7b85f931b9cd81dbfd1ba3fe17e359f0a76b71b7"},"schema_version":"1.0","source":{"id":"1908.02028","kind":"arxiv","version":1}},"canonical_sha256":"cdab0fca1bc3440a92c89d90c4b9eb61bfc02233bcbcefc48161a84523d5268e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdab0fca1bc3440a92c89d90c4b9eb61bfc02233bcbcefc48161a84523d5268e","first_computed_at":"2026-07-04T23:51:50.220244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:50.220244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKu3l3QhmnG3daVFONmXpPz4lMFep58vF7vbrejzsSijia4ZqjpDcUrPN7Eo7xVf0/TDA2hZHsGCRx7dkQNTBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:50.220611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e10327d49bcb94b373a426e3a10141118c6e61198d57bc530fc79ce35139f719","sha256:4799b53354539781012310f8c596e2b61e361b4615083437cb4bc19fb98ad545"],"state_sha256":"884af25dc471b21286c710b5ef9807c0057f0245d02818289b68597cab13641d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAPUJP0X7xqvcSKhmlFr18PltwvH+NkiiDd+vxu7ArP7dgb3hzbO87cwhSxV4cvdCKaClrfHBt2fVa8ST13EDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T08:08:41.008550Z","bundle_sha256":"380d3cd2da11897e53012335c4abd306eb5530e80cda430b26ba8301dcb0bda7"}}