{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6OZHW4NEUG25DVKB7MGN422ZYS","short_pith_number":"pith:6OZHW4NE","schema_version":"1.0","canonical_sha256":"f3b27b71a4a1b5d1d541fb0cde6b59c492787155aeef7e6676051cc31c163008","source":{"kind":"arxiv","id":"2502.15043","version":2},"attestation_state":"computed","paper":{"title":"DDAT: Diffusion Policies Enforcing Dynamically Admissible Robot Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jean-Baptiste Bouvier, Kanghyun Ryu, Kartik Nagpal, Koushil Sreenath, Negar Mehr, Qiayuan Liao","submitted_at":"2025-02-20T21:00:21Z","abstract_excerpt":"Diffusion models excel at creating images and videos thanks to their multimodal generative capabilities. These same capabilities have made diffusion models increasingly popular in robotics research, where they are used for generating robot motion. However, the stochastic nature of diffusion models is fundamentally at odds with the precise dynamical equations describing the feasible motion of robots. Hence, generating dynamically admissible robot trajectories is a challenge for diffusion models. To alleviate this issue, we introduce DDAT: Diffusion policies for Dynamically Admissible Trajectori"},"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":"2502.15043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-20T21:00:21Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c506166fcf7656740be7826301c7a502cca51eb3c6a37fc1b890eda6b987f089","abstract_canon_sha256":"9f5395649f7e14f99d138d20adfd5b43894365ce8474552bd6ad168441da3ef1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:43.721203Z","signature_b64":"eiSgWiI9NjzeutNp63xmkUCMGe1tFifqL02eRVxOVJFSCnO7FUHs7BabPAVTWuZi5o7O0LDvtv/vnb0MRft6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b27b71a4a1b5d1d541fb0cde6b59c492787155aeef7e6676051cc31c163008","last_reissued_at":"2026-07-05T10:54:43.720675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:43.720675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DDAT: Diffusion Policies Enforcing Dynamically Admissible Robot Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jean-Baptiste Bouvier, Kanghyun Ryu, Kartik Nagpal, Koushil Sreenath, Negar Mehr, Qiayuan Liao","submitted_at":"2025-02-20T21:00:21Z","abstract_excerpt":"Diffusion models excel at creating images and videos thanks to their multimodal generative capabilities. These same capabilities have made diffusion models increasingly popular in robotics research, where they are used for generating robot motion. However, the stochastic nature of diffusion models is fundamentally at odds with the precise dynamical equations describing the feasible motion of robots. Hence, generating dynamically admissible robot trajectories is a challenge for diffusion models. To alleviate this issue, we introduce DDAT: Diffusion policies for Dynamically Admissible Trajectori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15043","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.15043/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":"2502.15043","created_at":"2026-07-05T10:54:43.720738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15043v2","created_at":"2026-07-05T10:54:43.720738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15043","created_at":"2026-07-05T10:54:43.720738+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OZHW4NEUG25","created_at":"2026-07-05T10:54:43.720738+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OZHW4NEUG25DVKB","created_at":"2026-07-05T10:54:43.720738+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OZHW4NE","created_at":"2026-07-05T10:54:43.720738+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25754","citing_title":"Stage-Aware and Roughness-Constrained Diffusion Policy for Multi-Stage Robotic Polishing","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22278","citing_title":"Any-Body Guard: Universal Safeguarding for Manipulation Policies via Action Masking","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31321","citing_title":"Surface Constraint Policy for Learning Surface-Constrained and Dynamically Feasible Robot Skills","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18253","citing_title":"Machine Unlearning for Masked Diffusion Language Models","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS","json":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS.json","graph_json":"https://pith.science/api/pith-number/6OZHW4NEUG25DVKB7MGN422ZYS/graph.json","events_json":"https://pith.science/api/pith-number/6OZHW4NEUG25DVKB7MGN422ZYS/events.json","paper":"https://pith.science/paper/6OZHW4NE"},"agent_actions":{"view_html":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS","download_json":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS.json","view_paper":"https://pith.science/paper/6OZHW4NE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15043&json=true","fetch_graph":"https://pith.science/api/pith-number/6OZHW4NEUG25DVKB7MGN422ZYS/graph.json","fetch_events":"https://pith.science/api/pith-number/6OZHW4NEUG25DVKB7MGN422ZYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS/action/storage_attestation","attest_author":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS/action/author_attestation","sign_citation":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS/action/citation_signature","submit_replication":"https://pith.science/pith/6OZHW4NEUG25DVKB7MGN422ZYS/action/replication_record"}},"created_at":"2026-07-05T10:54:43.720738+00:00","updated_at":"2026-07-05T10:54:43.720738+00:00"}