{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R67QQY5N54NRCBOJP7MQMAH2XV","short_pith_number":"pith:R67QQY5N","schema_version":"1.0","canonical_sha256":"8fbf0863adef1b1105c97fd90600fabd7bf4e177a861c314d4c29d677e5e2e9e","source":{"kind":"arxiv","id":"2403.10809","version":2},"attestation_state":"computed","paper":{"title":"Efficient Trajectory Forecasting and Generation with Conditional Flow Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Matthew Gombolay, Sean Ye","submitted_at":"2024-03-16T04:57:23Z","abstract_excerpt":"Trajectory prediction and generation are crucial for autonomous robots in dynamic environments. While prior research has typically focused on either prediction or generation, our approach unifies these tasks to provide a versatile framework and achieve state-of-the-art performance. While diffusion models excel in trajectory generation, their iterative sampling process is computationally intensive, hindering robotic systems' dynamic capabilities. We introduce Trajectory Conditional Flow Matching (T-CFM), a novel approach using flow matching techniques to learn a solver time-varying vector field"},"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":"2403.10809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-16T04:57:23Z","cross_cats_sorted":[],"title_canon_sha256":"5937eb246c8c74f07da4f544d42152525b1d8811f1d6676e336736a821f50c2c","abstract_canon_sha256":"cfb346c8b6cd9ad3d6e6e794e317d85072d5eca843775e991a184eabdd8d8235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:06.181659Z","signature_b64":"XTMgft0nGUFPz3b8Yr4c0E7F3y5dunkSJfk27RTCa7IhAcn3R6fUven17vwponlbqP6XpSwRd1GrIf0VIVQTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fbf0863adef1b1105c97fd90600fabd7bf4e177a861c314d4c29d677e5e2e9e","last_reissued_at":"2026-07-05T09:32:06.181175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:06.181175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Trajectory Forecasting and Generation with Conditional Flow Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Matthew Gombolay, Sean Ye","submitted_at":"2024-03-16T04:57:23Z","abstract_excerpt":"Trajectory prediction and generation are crucial for autonomous robots in dynamic environments. While prior research has typically focused on either prediction or generation, our approach unifies these tasks to provide a versatile framework and achieve state-of-the-art performance. While diffusion models excel in trajectory generation, their iterative sampling process is computationally intensive, hindering robotic systems' dynamic capabilities. We introduce Trajectory Conditional Flow Matching (T-CFM), a novel approach using flow matching techniques to learn a solver time-varying vector field"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10809","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/2403.10809/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":"2403.10809","created_at":"2026-07-05T09:32:06.181235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10809v2","created_at":"2026-07-05T09:32:06.181235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10809","created_at":"2026-07-05T09:32:06.181235+00:00"},{"alias_kind":"pith_short_12","alias_value":"R67QQY5N54NR","created_at":"2026-07-05T09:32:06.181235+00:00"},{"alias_kind":"pith_short_16","alias_value":"R67QQY5N54NRCBOJ","created_at":"2026-07-05T09:32:06.181235+00:00"},{"alias_kind":"pith_short_8","alias_value":"R67QQY5N","created_at":"2026-07-05T09:32:06.181235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20686","citing_title":"JPPD: Joint Prediction_Planning Diffusion with Differentiable Safety Guidance for Dynamic Obstacle Avoidance in Intelligent Transportation Systems","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV","json":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV.json","graph_json":"https://pith.science/api/pith-number/R67QQY5N54NRCBOJP7MQMAH2XV/graph.json","events_json":"https://pith.science/api/pith-number/R67QQY5N54NRCBOJP7MQMAH2XV/events.json","paper":"https://pith.science/paper/R67QQY5N"},"agent_actions":{"view_html":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV","download_json":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV.json","view_paper":"https://pith.science/paper/R67QQY5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10809&json=true","fetch_graph":"https://pith.science/api/pith-number/R67QQY5N54NRCBOJP7MQMAH2XV/graph.json","fetch_events":"https://pith.science/api/pith-number/R67QQY5N54NRCBOJP7MQMAH2XV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV/action/storage_attestation","attest_author":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV/action/author_attestation","sign_citation":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV/action/citation_signature","submit_replication":"https://pith.science/pith/R67QQY5N54NRCBOJP7MQMAH2XV/action/replication_record"}},"created_at":"2026-07-05T09:32:06.181235+00:00","updated_at":"2026-07-05T09:32:06.181235+00:00"}