{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VLJYFETPYXDRR64AJ57AMEVOAL","short_pith_number":"pith:VLJYFETP","schema_version":"1.0","canonical_sha256":"aad382926fc5c718fb804f7e0612ae02f3b39172d51c04965397d83bd3455a73","source":{"kind":"arxiv","id":"2012.10531","version":1},"attestation_state":"computed","paper":{"title":"A Graph Attention Based Approach for Trajectory Prediction in Multi-agent Sports Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ding Ding, H. Howie Huang","submitted_at":"2020-12-18T21:51:43Z","abstract_excerpt":"This work investigates the problem of multi-agents trajectory prediction. Prior approaches lack of capability of capturing fine-grained dependencies among coordinated agents. In this paper, we propose a spatial-temporal trajectory prediction approach that is able to learn the strategy of a team with multiple coordinated agents. In particular, we use graph-based attention model to learn the dependency of the agents. In addition, instead of utilizing the recurrent networks (e.g., VRNN, LSTM), our method uses a Temporal Convolutional Network (TCN) as the sequential model to support long effective"},"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":"2012.10531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-18T21:51:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"840c74773e0dfabbab166e84ff5b6ee479e996236806c467ff2f613d9259002d","abstract_canon_sha256":"b65d227e24741b47f4d79a31c50fde153b26bc69a8b9eb669ca230f62909ed51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:52.720203Z","signature_b64":"H+SQNPQ5E5TPJ2+YOngOBnFKPzRM1pMONGLdbuUbEMg49SwM6iTE2jW6sQFL3PkQC9ejCFupDX3GfuEt4ts6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aad382926fc5c718fb804f7e0612ae02f3b39172d51c04965397d83bd3455a73","last_reissued_at":"2026-07-05T02:00:52.719795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:52.719795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Attention Based Approach for Trajectory Prediction in Multi-agent Sports Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ding Ding, H. Howie Huang","submitted_at":"2020-12-18T21:51:43Z","abstract_excerpt":"This work investigates the problem of multi-agents trajectory prediction. Prior approaches lack of capability of capturing fine-grained dependencies among coordinated agents. In this paper, we propose a spatial-temporal trajectory prediction approach that is able to learn the strategy of a team with multiple coordinated agents. In particular, we use graph-based attention model to learn the dependency of the agents. In addition, instead of utilizing the recurrent networks (e.g., VRNN, LSTM), our method uses a Temporal Convolutional Network (TCN) as the sequential model to support long effective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.10531","kind":"arxiv","version":1},"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/2012.10531/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":"2012.10531","created_at":"2026-07-05T02:00:52.719850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.10531v1","created_at":"2026-07-05T02:00:52.719850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.10531","created_at":"2026-07-05T02:00:52.719850+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLJYFETPYXDR","created_at":"2026-07-05T02:00:52.719850+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLJYFETPYXDRR64A","created_at":"2026-07-05T02:00:52.719850+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLJYFETP","created_at":"2026-07-05T02:00:52.719850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.12606","citing_title":"Pixels or Positions? Benchmarking Modalities in Group Activity Recognition","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL","json":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL.json","graph_json":"https://pith.science/api/pith-number/VLJYFETPYXDRR64AJ57AMEVOAL/graph.json","events_json":"https://pith.science/api/pith-number/VLJYFETPYXDRR64AJ57AMEVOAL/events.json","paper":"https://pith.science/paper/VLJYFETP"},"agent_actions":{"view_html":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL","download_json":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL.json","view_paper":"https://pith.science/paper/VLJYFETP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.10531&json=true","fetch_graph":"https://pith.science/api/pith-number/VLJYFETPYXDRR64AJ57AMEVOAL/graph.json","fetch_events":"https://pith.science/api/pith-number/VLJYFETPYXDRR64AJ57AMEVOAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL/action/storage_attestation","attest_author":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL/action/author_attestation","sign_citation":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL/action/citation_signature","submit_replication":"https://pith.science/pith/VLJYFETPYXDRR64AJ57AMEVOAL/action/replication_record"}},"created_at":"2026-07-05T02:00:52.719850+00:00","updated_at":"2026-07-05T02:00:52.719850+00:00"}