{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T53RTPMMXAI7EFR3VO4KNTGQZL","short_pith_number":"pith:T53RTPMM","schema_version":"1.0","canonical_sha256":"9f7719bd8cb811f2163babb8a6ccd0caee47c73c61988be47b86ae1865c5d014","source":{"kind":"arxiv","id":"2511.05355","version":3},"attestation_state":"computed","paper":{"title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Armin Lederer, Dai-Jie Wu, Hsiu-Chin Lin, Sandra Hirche, Shao-Hua Sun, Sihua Zhang, Stefan Sosnowski, Tzu-Yuan Huang, Xiaobing Dai","submitted_at":"2025-11-07T15:46:44Z","abstract_excerpt":"Flow matching (FM) has shown promising results in data-driven planning. However, it inherently lacks formal guarantees for ensuring state and action constraints, whose satisfaction is a fundamental and crucial requirement for the safety and admissibility of planned trajectories on various systems. Moreover, existing FM planners do not ensure the dynamical consistency, which potentially renders trajectories inexecutable. We address these shortcomings by proposing SAD-Flower, a novel framework for generating Safe, Admissible, and Dynamically consistent trajectories. Our approach relies on an aug"},"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":"2511.05355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-07T15:46:44Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"d4ebe1770c80318212fea35baabde5d86fd2a7e133ad7bd503a93df8b72fa252","abstract_canon_sha256":"b709e9138ddf3f25ecd69def404e8f0b71da89c1f6598177251832c29da744ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:12.434776Z","signature_b64":"iXVgcCjhJ5tuk6VHO0stCv3lfgZHmwdzHSyQv+PaZFkoxWX9wJClFXlTrBr2Y1gfhXAlMvyxMOyoYdvTEMwdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7719bd8cb811f2163babb8a6ccd0caee47c73c61988be47b86ae1865c5d014","last_reissued_at":"2026-06-09T02:07:12.433812Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:12.433812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Armin Lederer, Dai-Jie Wu, Hsiu-Chin Lin, Sandra Hirche, Shao-Hua Sun, Sihua Zhang, Stefan Sosnowski, Tzu-Yuan Huang, Xiaobing Dai","submitted_at":"2025-11-07T15:46:44Z","abstract_excerpt":"Flow matching (FM) has shown promising results in data-driven planning. However, it inherently lacks formal guarantees for ensuring state and action constraints, whose satisfaction is a fundamental and crucial requirement for the safety and admissibility of planned trajectories on various systems. Moreover, existing FM planners do not ensure the dynamical consistency, which potentially renders trajectories inexecutable. We address these shortcomings by proposing SAD-Flower, a novel framework for generating Safe, Admissible, and Dynamically consistent trajectories. Our approach relies on an aug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.05355","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/2511.05355/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":"2511.05355","created_at":"2026-06-09T02:07:12.433938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.05355v3","created_at":"2026-06-09T02:07:12.433938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.05355","created_at":"2026-06-09T02:07:12.433938+00:00"},{"alias_kind":"pith_short_12","alias_value":"T53RTPMMXAI7","created_at":"2026-06-09T02:07:12.433938+00:00"},{"alias_kind":"pith_short_16","alias_value":"T53RTPMMXAI7EFR3","created_at":"2026-06-09T02:07:12.433938+00:00"},{"alias_kind":"pith_short_8","alias_value":"T53RTPMM","created_at":"2026-06-09T02:07:12.433938+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12053","citing_title":"Closing the Motion Execution Gap: From Semantic Motion Task Constraints to Kinematic Control","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL","json":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL.json","graph_json":"https://pith.science/api/pith-number/T53RTPMMXAI7EFR3VO4KNTGQZL/graph.json","events_json":"https://pith.science/api/pith-number/T53RTPMMXAI7EFR3VO4KNTGQZL/events.json","paper":"https://pith.science/paper/T53RTPMM"},"agent_actions":{"view_html":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL","download_json":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL.json","view_paper":"https://pith.science/paper/T53RTPMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.05355&json=true","fetch_graph":"https://pith.science/api/pith-number/T53RTPMMXAI7EFR3VO4KNTGQZL/graph.json","fetch_events":"https://pith.science/api/pith-number/T53RTPMMXAI7EFR3VO4KNTGQZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL/action/storage_attestation","attest_author":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL/action/author_attestation","sign_citation":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL/action/citation_signature","submit_replication":"https://pith.science/pith/T53RTPMMXAI7EFR3VO4KNTGQZL/action/replication_record"}},"created_at":"2026-06-09T02:07:12.433938+00:00","updated_at":"2026-06-09T02:07:12.433938+00:00"}