{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RVBP7RVTXZOAK6DGUMHONQGRYB","short_pith_number":"pith:RVBP7RVT","canonical_record":{"source":{"id":"2506.13915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-16T18:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"9fb7b4c14d3b9fea50a930cfb8425e7490929dd8faab90cb48841642492176c3","abstract_canon_sha256":"3a4786c7ee07c94f222e724cd54f21e31ed0b712873ccc149ec6d68441c24b05"},"schema_version":"1.0"},"canonical_sha256":"8d42ffc6b3be5c057866a30ee6c0d1c07ff1ca05a21afa298b49aca36642878c","source":{"kind":"arxiv","id":"2506.13915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13915","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13915v1","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13915","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"RVBP7RVTXZOA","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_16","alias_value":"RVBP7RVTXZOAK6DG","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_8","alias_value":"RVBP7RVT","created_at":"2026-07-05T11:22:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RVBP7RVTXZOAK6DGUMHONQGRYB","target":"record","payload":{"canonical_record":{"source":{"id":"2506.13915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-16T18:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"9fb7b4c14d3b9fea50a930cfb8425e7490929dd8faab90cb48841642492176c3","abstract_canon_sha256":"3a4786c7ee07c94f222e724cd54f21e31ed0b712873ccc149ec6d68441c24b05"},"schema_version":"1.0"},"canonical_sha256":"8d42ffc6b3be5c057866a30ee6c0d1c07ff1ca05a21afa298b49aca36642878c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:45.717003Z","signature_b64":"IfDKT7Kb3P3qaoNs1ZCYng11SFuQSJZLdGl4mYp2P30F6YDTdhz2JxrYEsJCwtEUyzANc34+UyCnoDDet8YbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d42ffc6b3be5c057866a30ee6c0d1c07ff1ca05a21afa298b49aca36642878c","last_reissued_at":"2026-07-05T11:22:45.716495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:45.716495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.13915","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-05T11:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFS1Z86XnV82IGaE/UUMQexZE02PYTr4sZxfmZ3dFYW1W4y/JWkoaxIz9ShPNMcOrsT1/81qoptrMr3KChk/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:51:23.368612Z"},"content_sha256":"108e2471de414ebda440d34f34b7041457f628d830312cc7aebc46d379ee27a9","schema_version":"1.0","event_id":"sha256:108e2471de414ebda440d34f34b7041457f628d830312cc7aebc46d379ee27a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RVBP7RVTXZOAK6DGUMHONQGRYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequence Modeling for Time-Optimal Quadrotor Trajectory Optimization with Sampling-based Robustness Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hongzhan Yu, Igor Spasojevic, Katherine Mao, M Ani Hsieh, Ruipeng Zhang, Sicun Gao, Vijay Kumar","submitted_at":"2025-06-16T18:51:12Z","abstract_excerpt":"Time-optimal trajectories drive quadrotors to their dynamic limits, but computing such trajectories involves solving non-convex problems via iterative nonlinear optimization, making them prohibitively costly for real-time applications. In this work, we investigate learning-based models that imitate a model-based time-optimal trajectory planner to accelerate trajectory generation. Given a dataset of collision-free geometric paths, we show that modeling architectures can effectively learn the patterns underlying time-optimal trajectories. We introduce a quantitative framework to analyze local an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13915","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/2506.13915/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-05T11:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+ElKkHvovPtCJxzCnld2jYDLxSWG/p1nv8HfRqvnX+4c45dihiNgQK1X7QXAh4Ic54EPjXWr/NynMgXCPtfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:51:23.369161Z"},"content_sha256":"a95f617ed7a9e6f8ccc01067fca47f4f8dc7c1d62fb52ae0dd9202363119c935","schema_version":"1.0","event_id":"sha256:a95f617ed7a9e6f8ccc01067fca47f4f8dc7c1d62fb52ae0dd9202363119c935"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/bundle.json","state_url":"https://pith.science/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/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-20T12:51:23Z","links":{"resolver":"https://pith.science/pith/RVBP7RVTXZOAK6DGUMHONQGRYB","bundle":"https://pith.science/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/bundle.json","state":"https://pith.science/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVBP7RVTXZOAK6DGUMHONQGRYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RVBP7RVTXZOAK6DGUMHONQGRYB","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":"3a4786c7ee07c94f222e724cd54f21e31ed0b712873ccc149ec6d68441c24b05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-16T18:51:12Z","title_canon_sha256":"9fb7b4c14d3b9fea50a930cfb8425e7490929dd8faab90cb48841642492176c3"},"schema_version":"1.0","source":{"id":"2506.13915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13915","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13915v1","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13915","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"RVBP7RVTXZOA","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_16","alias_value":"RVBP7RVTXZOAK6DG","created_at":"2026-07-05T11:22:45Z"},{"alias_kind":"pith_short_8","alias_value":"RVBP7RVT","created_at":"2026-07-05T11:22:45Z"}],"graph_snapshots":[{"event_id":"sha256:a95f617ed7a9e6f8ccc01067fca47f4f8dc7c1d62fb52ae0dd9202363119c935","target":"graph","created_at":"2026-07-05T11:22:45Z","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/2506.13915/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Time-optimal trajectories drive quadrotors to their dynamic limits, but computing such trajectories involves solving non-convex problems via iterative nonlinear optimization, making them prohibitively costly for real-time applications. In this work, we investigate learning-based models that imitate a model-based time-optimal trajectory planner to accelerate trajectory generation. Given a dataset of collision-free geometric paths, we show that modeling architectures can effectively learn the patterns underlying time-optimal trajectories. We introduce a quantitative framework to analyze local an","authors_text":"Hongzhan Yu, Igor Spasojevic, Katherine Mao, M Ani Hsieh, Ruipeng Zhang, Sicun Gao, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-16T18:51:12Z","title":"Sequence Modeling for Time-Optimal Quadrotor Trajectory Optimization with Sampling-based Robustness Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13915","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:108e2471de414ebda440d34f34b7041457f628d830312cc7aebc46d379ee27a9","target":"record","created_at":"2026-07-05T11:22:45Z","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":"3a4786c7ee07c94f222e724cd54f21e31ed0b712873ccc149ec6d68441c24b05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-16T18:51:12Z","title_canon_sha256":"9fb7b4c14d3b9fea50a930cfb8425e7490929dd8faab90cb48841642492176c3"},"schema_version":"1.0","source":{"id":"2506.13915","kind":"arxiv","version":1}},"canonical_sha256":"8d42ffc6b3be5c057866a30ee6c0d1c07ff1ca05a21afa298b49aca36642878c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d42ffc6b3be5c057866a30ee6c0d1c07ff1ca05a21afa298b49aca36642878c","first_computed_at":"2026-07-05T11:22:45.716495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:45.716495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IfDKT7Kb3P3qaoNs1ZCYng11SFuQSJZLdGl4mYp2P30F6YDTdhz2JxrYEsJCwtEUyzANc34+UyCnoDDet8YbBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:45.717003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.13915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:108e2471de414ebda440d34f34b7041457f628d830312cc7aebc46d379ee27a9","sha256:a95f617ed7a9e6f8ccc01067fca47f4f8dc7c1d62fb52ae0dd9202363119c935"],"state_sha256":"40138cff04f719bb23c25071438826f7d89366262fefb826eeef44cad87884b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/UuXvmC1FnWn3kQGfjObH08uNeYmsD+ibEDqb7W1xNM8CT3OJoFV2zbvQceRzgbrf6xG4C6NiclaaYSzWJEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T12:51:23.373309Z","bundle_sha256":"5eb8ff02cac82680c0d926a3294be08a0da7484bc91e7293988a25fd1e6f4743"}}