{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OBKO5HVMGR4MESHH74V6NPOYJY","short_pith_number":"pith:OBKO5HVM","canonical_record":{"source":{"id":"1904.04223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T17:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"f5dfbe4532f19d0adceeb8fd7f421491a82f9bdb5890bf8fd4b9bd2295dce4ae","abstract_canon_sha256":"3da03f6193e44651d402ddf7b1827f6d79a57d503734c97179f88792504b44cd"},"schema_version":"1.0"},"canonical_sha256":"7054ee9eac3478c248e7ff2be6bdd84e25cc482e994c0e57f3e77a20aa272cf1","source":{"kind":"arxiv","id":"1904.04223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04223","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04223v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04223","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"OBKO5HVMGR4M","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OBKO5HVMGR4MESHH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OBKO5HVM","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OBKO5HVMGR4MESHH74V6NPOYJY","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T17:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"f5dfbe4532f19d0adceeb8fd7f421491a82f9bdb5890bf8fd4b9bd2295dce4ae","abstract_canon_sha256":"3da03f6193e44651d402ddf7b1827f6d79a57d503734c97179f88792504b44cd"},"schema_version":"1.0"},"canonical_sha256":"7054ee9eac3478c248e7ff2be6bdd84e25cc482e994c0e57f3e77a20aa272cf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.987155Z","signature_b64":"qO91uPEFhSlU4WBp5EDvj6ZP+fzupUlpT+uBK1sC9jHKnMb4gtzFBBvwqEBHu2z4RWepxfrCja+lIU2anN5sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7054ee9eac3478c248e7ff2be6bdd84e25cc482e994c0e57f3e77a20aa272cf1","last_reissued_at":"2026-05-17T23:40:10.986450Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.986450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04223","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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Yd24quXP5BzvkWHkcjMTHECkFimPFP0z/VVABZSuusCkvTxTjsIKohHAYSuJgjk5bePK3on5c7ecdAVQvKHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T12:22:18.408803Z"},"content_sha256":"a574173f3516aeae3f618420b361e376a5ce22ece166b855d732ec46a492c091","schema_version":"1.0","event_id":"sha256:a574173f3516aeae3f618420b361e376a5ce22ece166b855d732ec46a492c091"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OBKO5HVMGR4MESHH74V6NPOYJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapid Collision Detection for Multicopter Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Mark W. Mueller, Nathan Bucki","submitted_at":"2019-04-08T17:45:54Z","abstract_excerpt":"We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory generation method to achieve rapid, obstacle-aware motion planning in environments with both static convex obstacles and dynamic convex obstacles whose boundaries do not rotate. In general, this problem is difficult because the presence of convex obstacles makes the feasible space of trajectories nonconvex. The performance of the algorithm is benchmarked usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04223","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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDpvTogie8G7kOcDBrSlxLBDU0SS/O69IZ2keFYPanw3yIDvaRMeIpwoeh8hX/MHjuEHjGN+/KuubJtjKTu+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T12:22:18.409327Z"},"content_sha256":"f33701fb49a853efb1b7847a91befa1e36d336f30639307df3f2ae594c17bb0a","schema_version":"1.0","event_id":"sha256:f33701fb49a853efb1b7847a91befa1e36d336f30639307df3f2ae594c17bb0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBKO5HVMGR4MESHH74V6NPOYJY/bundle.json","state_url":"https://pith.science/pith/OBKO5HVMGR4MESHH74V6NPOYJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBKO5HVMGR4MESHH74V6NPOYJY/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-22T12:22:18Z","links":{"resolver":"https://pith.science/pith/OBKO5HVMGR4MESHH74V6NPOYJY","bundle":"https://pith.science/pith/OBKO5HVMGR4MESHH74V6NPOYJY/bundle.json","state":"https://pith.science/pith/OBKO5HVMGR4MESHH74V6NPOYJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBKO5HVMGR4MESHH74V6NPOYJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OBKO5HVMGR4MESHH74V6NPOYJY","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":"3da03f6193e44651d402ddf7b1827f6d79a57d503734c97179f88792504b44cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T17:45:54Z","title_canon_sha256":"f5dfbe4532f19d0adceeb8fd7f421491a82f9bdb5890bf8fd4b9bd2295dce4ae"},"schema_version":"1.0","source":{"id":"1904.04223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04223","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04223v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04223","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"OBKO5HVMGR4M","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OBKO5HVMGR4MESHH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OBKO5HVM","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:f33701fb49a853efb1b7847a91befa1e36d336f30639307df3f2ae594c17bb0a","target":"graph","created_at":"2026-05-17T23:40:10Z","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":"We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory generation method to achieve rapid, obstacle-aware motion planning in environments with both static convex obstacles and dynamic convex obstacles whose boundaries do not rotate. In general, this problem is difficult because the presence of convex obstacles makes the feasible space of trajectories nonconvex. The performance of the algorithm is benchmarked usin","authors_text":"Mark W. Mueller, Nathan Bucki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T17:45:54Z","title":"Rapid Collision Detection for Multicopter Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04223","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:a574173f3516aeae3f618420b361e376a5ce22ece166b855d732ec46a492c091","target":"record","created_at":"2026-05-17T23:40:10Z","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":"3da03f6193e44651d402ddf7b1827f6d79a57d503734c97179f88792504b44cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T17:45:54Z","title_canon_sha256":"f5dfbe4532f19d0adceeb8fd7f421491a82f9bdb5890bf8fd4b9bd2295dce4ae"},"schema_version":"1.0","source":{"id":"1904.04223","kind":"arxiv","version":2}},"canonical_sha256":"7054ee9eac3478c248e7ff2be6bdd84e25cc482e994c0e57f3e77a20aa272cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7054ee9eac3478c248e7ff2be6bdd84e25cc482e994c0e57f3e77a20aa272cf1","first_computed_at":"2026-05-17T23:40:10.986450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.986450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qO91uPEFhSlU4WBp5EDvj6ZP+fzupUlpT+uBK1sC9jHKnMb4gtzFBBvwqEBHu2z4RWepxfrCja+lIU2anN5sAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.987155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a574173f3516aeae3f618420b361e376a5ce22ece166b855d732ec46a492c091","sha256:f33701fb49a853efb1b7847a91befa1e36d336f30639307df3f2ae594c17bb0a"],"state_sha256":"e6031b15603d7d59d95581f66df9102450df5906d5cdca38d4d1bd0bceeaa9d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwXNfUYfGM1cBjg5NvChyJBbL5OGI3bKE5v+V0JIgSVjQA8Uv2LVIrsrDGKOKWo9Si45Jvz4hvGCGQZtN9RXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T12:22:18.415037Z","bundle_sha256":"28f05f18f922cf71f27ac4d5ce25561623e04c7bfab955edde39a077cdbb96e6"}}