{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JPHH3A6JQ6YIWBQH6YJ3BIKSJS","short_pith_number":"pith:JPHH3A6J","schema_version":"1.0","canonical_sha256":"4bce7d83c987b08b0607f613b0a1524c8c52e1d9b0442d78c739fa65367fbb53","source":{"kind":"arxiv","id":"2007.14558","version":2},"attestation_state":"computed","paper":{"title":"BiTraP: Bi-directional Pedestrian Trajectory Prediction with Multi-modal Goal Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Ella Atkins, Matthew Johnson-Roberson, Ram Vasudevan, Xiaoxiao Du, Yu Yao","submitted_at":"2020-07-29T02:40:17Z","abstract_excerpt":"Pedestrian trajectory prediction is an essential task in robotic applications such as autonomous driving and robot navigation. State-of-the-art trajectory predictors use a conditional variational autoencoder (CVAE) with recurrent neural networks (RNNs) to encode observed trajectories and decode multi-modal future trajectories. This process can suffer from accumulated errors over long prediction horizons (>=2 seconds). This paper presents BiTraP, a goal-conditioned bi-directional multi-modal trajectory prediction method based on the CVAE. BiTraP estimates the goal (end-point) of trajectories an"},"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":"2007.14558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-07-29T02:40:17Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2f33525df4b3ad168f5a4750081df41f81d9c21c4d51fd6fcb99483f992e82ad","abstract_canon_sha256":"e606c5d48935fa3b0380d0e4d7d5af2678e311fe6495b9d64f5ec57092aa1b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:43.822498Z","signature_b64":"qrUsqJFBBNtGIlOBspPFqwevJrxomVkLyJs26Ag6YnEzlTHYyKDSUHTKqeZmsRPfaPAETPUOl+ULNfhd90RZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bce7d83c987b08b0607f613b0a1524c8c52e1d9b0442d78c739fa65367fbb53","last_reissued_at":"2026-07-05T01:51:43.822075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:43.822075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BiTraP: Bi-directional Pedestrian Trajectory Prediction with Multi-modal Goal Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Ella Atkins, Matthew Johnson-Roberson, Ram Vasudevan, Xiaoxiao Du, Yu Yao","submitted_at":"2020-07-29T02:40:17Z","abstract_excerpt":"Pedestrian trajectory prediction is an essential task in robotic applications such as autonomous driving and robot navigation. State-of-the-art trajectory predictors use a conditional variational autoencoder (CVAE) with recurrent neural networks (RNNs) to encode observed trajectories and decode multi-modal future trajectories. This process can suffer from accumulated errors over long prediction horizons (>=2 seconds). This paper presents BiTraP, a goal-conditioned bi-directional multi-modal trajectory prediction method based on the CVAE. BiTraP estimates the goal (end-point) of trajectories an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14558","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/2007.14558/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":"2007.14558","created_at":"2026-07-05T01:51:43.822141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.14558v2","created_at":"2026-07-05T01:51:43.822141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14558","created_at":"2026-07-05T01:51:43.822141+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPHH3A6JQ6YI","created_at":"2026-07-05T01:51:43.822141+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPHH3A6JQ6YIWBQH","created_at":"2026-07-05T01:51:43.822141+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPHH3A6J","created_at":"2026-07-05T01:51:43.822141+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18647","citing_title":"STFlow: Data-Coupled Flow Matching for Geometric Trajectory Simulation","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS","json":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS.json","graph_json":"https://pith.science/api/pith-number/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/graph.json","events_json":"https://pith.science/api/pith-number/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/events.json","paper":"https://pith.science/paper/JPHH3A6J"},"agent_actions":{"view_html":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS","download_json":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS.json","view_paper":"https://pith.science/paper/JPHH3A6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.14558&json=true","fetch_graph":"https://pith.science/api/pith-number/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/graph.json","fetch_events":"https://pith.science/api/pith-number/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/action/storage_attestation","attest_author":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/action/author_attestation","sign_citation":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/action/citation_signature","submit_replication":"https://pith.science/pith/JPHH3A6JQ6YIWBQH6YJ3BIKSJS/action/replication_record"}},"created_at":"2026-07-05T01:51:43.822141+00:00","updated_at":"2026-07-05T01:51:43.822141+00:00"}