{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UXBXVIRKX3CIGHLE7N4CSXI6UB","short_pith_number":"pith:UXBXVIRK","schema_version":"1.0","canonical_sha256":"a5c37aa22abec4831d64fb78295d1ea0571b9db7a30b3446f506229bfc976fa5","source":{"kind":"arxiv","id":"2504.16734","version":3},"attestation_state":"computed","paper":{"title":"DYNUS: Uncertainty-aware Trajectory Planner in Dynamic Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Harvey Merton, Jialin Chen, Jonathan P. How, Juan Rached Viso, Kota Kondo, Lucas Jia, Mason Peterson, Nicholas Rober","submitted_at":"2025-04-23T14:05:04Z","abstract_excerpt":"This paper introduces DYNUS, an uncertainty-aware trajectory planner designed for dynamic unknown environments. Operating in such settings presents many challenges -- most notably, because the agent cannot predict the ground-truth future paths of obstacles, a previously planned trajectory can become unsafe at any moment, requiring rapid replanning to avoid collisions.\n  Recently developed planners have used soft-constraint approaches to achieve the necessary fast computation times; however, these methods do not guarantee collision-free paths even with static obstacles. In contrast, hard-constr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.16734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-23T14:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"ea79796c205487cb9f66abcf237d4d370aa47e6433f05568043a858d21b6e1cc","abstract_canon_sha256":"39a816b7f76b1855c3ffcbab4107358c5fecd7a74eb29deef61b952e739fb035"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:49.791204Z","signature_b64":"E9X4a+l96yDp3x3DlofgHMLW8BKHW3zbOi/kdFn83KjwB3QrM1enKD7pAwCMfRXKac1TamrcIlKYWnJCnRNHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c37aa22abec4831d64fb78295d1ea0571b9db7a30b3446f506229bfc976fa5","last_reissued_at":"2026-07-05T11:04:49.790687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:49.790687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DYNUS: Uncertainty-aware Trajectory Planner in Dynamic Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Harvey Merton, Jialin Chen, Jonathan P. How, Juan Rached Viso, Kota Kondo, Lucas Jia, Mason Peterson, Nicholas Rober","submitted_at":"2025-04-23T14:05:04Z","abstract_excerpt":"This paper introduces DYNUS, an uncertainty-aware trajectory planner designed for dynamic unknown environments. Operating in such settings presents many challenges -- most notably, because the agent cannot predict the ground-truth future paths of obstacles, a previously planned trajectory can become unsafe at any moment, requiring rapid replanning to avoid collisions.\n  Recently developed planners have used soft-constraint approaches to achieve the necessary fast computation times; however, these methods do not guarantee collision-free paths even with static obstacles. In contrast, hard-constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16734","kind":"arxiv","version":3},"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/2504.16734/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.16734","created_at":"2026-07-05T11:04:49.790752+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16734v3","created_at":"2026-07-05T11:04:49.790752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16734","created_at":"2026-07-05T11:04:49.790752+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXBXVIRKX3CI","created_at":"2026-07-05T11:04:49.790752+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXBXVIRKX3CIGHLE","created_at":"2026-07-05T11:04:49.790752+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXBXVIRK","created_at":"2026-07-05T11:04:49.790752+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20755","citing_title":"UNSEEN: Uncertainty-aware Navigation via Sparse Estimation in Unknown Environments","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB","json":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB.json","graph_json":"https://pith.science/api/pith-number/UXBXVIRKX3CIGHLE7N4CSXI6UB/graph.json","events_json":"https://pith.science/api/pith-number/UXBXVIRKX3CIGHLE7N4CSXI6UB/events.json","paper":"https://pith.science/paper/UXBXVIRK"},"agent_actions":{"view_html":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB","download_json":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB.json","view_paper":"https://pith.science/paper/UXBXVIRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16734&json=true","fetch_graph":"https://pith.science/api/pith-number/UXBXVIRKX3CIGHLE7N4CSXI6UB/graph.json","fetch_events":"https://pith.science/api/pith-number/UXBXVIRKX3CIGHLE7N4CSXI6UB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB/action/storage_attestation","attest_author":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB/action/author_attestation","sign_citation":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB/action/citation_signature","submit_replication":"https://pith.science/pith/UXBXVIRKX3CIGHLE7N4CSXI6UB/action/replication_record"}},"created_at":"2026-07-05T11:04:49.790752+00:00","updated_at":"2026-07-05T11:04:49.790752+00:00"}