{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4IWTELRN5Q4HLJ3MGPIKIZRWEL","short_pith_number":"pith:4IWTELRN","schema_version":"1.0","canonical_sha256":"e22d322e2dec3875a76c33d0a4663622c28853adcab4519940919a0d00044f91","source":{"kind":"arxiv","id":"2003.13924","version":4},"attestation_state":"computed","paper":{"title":"EvolveGraph: Multi-Agent Trajectory Prediction with Dynamic Relational Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.CV","authors_text":"Chiho Choi, Fan Yang, Jiachen Li, Masayoshi Tomizuka","submitted_at":"2020-03-31T02:49:23Z","abstract_excerpt":"Multi-agent interacting systems are prevalent in the world, from pure physical systems to complicated social dynamic systems. In many applications, effective understanding of the situation and accurate trajectory prediction of interactive agents play a significant role in downstream tasks, such as decision making and planning. In this paper, we propose a generic trajectory forecasting framework (named EvolveGraph) with explicit relational structure recognition and prediction via latent interaction graphs among multiple heterogeneous, interactive agents. Considering the uncertainty of future be"},"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":"2003.13924","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-31T02:49:23Z","cross_cats_sorted":["cs.LG","cs.MA","cs.RO"],"title_canon_sha256":"7f73be15d32bb5363754b426e33b66d70a9871dcb8ad556baa5e097d17273b6d","abstract_canon_sha256":"68f93a2d019f90c50af0142be2bbf1cba1be933db7b25e8855b24f846b0d6d41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:19.468019Z","signature_b64":"GrXYA6H/Lb9rMXtRZsWGIBvnnxReh2bFOcWOysjHmin6GIjvA/Z1fj/ke5XIE4+yx4/2ZtCuvchKWwooqFOWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22d322e2dec3875a76c33d0a4663622c28853adcab4519940919a0d00044f91","last_reissued_at":"2026-07-05T01:45:19.467597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:19.467597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EvolveGraph: Multi-Agent Trajectory Prediction with Dynamic Relational Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.CV","authors_text":"Chiho Choi, Fan Yang, Jiachen Li, Masayoshi Tomizuka","submitted_at":"2020-03-31T02:49:23Z","abstract_excerpt":"Multi-agent interacting systems are prevalent in the world, from pure physical systems to complicated social dynamic systems. In many applications, effective understanding of the situation and accurate trajectory prediction of interactive agents play a significant role in downstream tasks, such as decision making and planning. In this paper, we propose a generic trajectory forecasting framework (named EvolveGraph) with explicit relational structure recognition and prediction via latent interaction graphs among multiple heterogeneous, interactive agents. Considering the uncertainty of future be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13924","kind":"arxiv","version":4},"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/2003.13924/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":"2003.13924","created_at":"2026-07-05T01:45:19.467660+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.13924v4","created_at":"2026-07-05T01:45:19.467660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13924","created_at":"2026-07-05T01:45:19.467660+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IWTELRN5Q4H","created_at":"2026-07-05T01:45:19.467660+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IWTELRN5Q4HLJ3M","created_at":"2026-07-05T01:45:19.467660+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IWTELRN","created_at":"2026-07-05T01:45:19.467660+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17897","citing_title":"Learn to Quantify Social Interaction with Constraints for Pedestrian Walking","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL","json":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL.json","graph_json":"https://pith.science/api/pith-number/4IWTELRN5Q4HLJ3MGPIKIZRWEL/graph.json","events_json":"https://pith.science/api/pith-number/4IWTELRN5Q4HLJ3MGPIKIZRWEL/events.json","paper":"https://pith.science/paper/4IWTELRN"},"agent_actions":{"view_html":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL","download_json":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL.json","view_paper":"https://pith.science/paper/4IWTELRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.13924&json=true","fetch_graph":"https://pith.science/api/pith-number/4IWTELRN5Q4HLJ3MGPIKIZRWEL/graph.json","fetch_events":"https://pith.science/api/pith-number/4IWTELRN5Q4HLJ3MGPIKIZRWEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL/action/storage_attestation","attest_author":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL/action/author_attestation","sign_citation":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL/action/citation_signature","submit_replication":"https://pith.science/pith/4IWTELRN5Q4HLJ3MGPIKIZRWEL/action/replication_record"}},"created_at":"2026-07-05T01:45:19.467660+00:00","updated_at":"2026-07-05T01:45:19.467660+00:00"}