{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F5PKB7FB6LBMGUUJK5ISRNGMIZ","short_pith_number":"pith:F5PKB7FB","schema_version":"1.0","canonical_sha256":"2f5ea0fca1f2c2c35289575128b4cc46402b6c1213023f3cbc770172c7bdd741","source":{"kind":"arxiv","id":"2210.08793","version":1},"attestation_state":"computed","paper":{"title":"Rethinking Trajectory Prediction via \"Team Game\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.CV","authors_text":"Bo Dai, Dahua Lin, Xinge Zhu, Zikai Wei","submitted_at":"2022-10-17T07:16:44Z","abstract_excerpt":"To accurately predict trajectories in multi-agent settings, e.g. team games, it is important to effectively model the interactions among agents. Whereas a number of methods have been developed for this purpose, existing methods implicitly model these interactions as part of the deep net architecture. However, in the real world, interactions often exist at multiple levels, e.g. individuals may form groups, where interactions among groups and those among the individuals in the same group often follow significantly different patterns. In this paper, we present a novel formulation for multi-agent "},"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":"2210.08793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-10-17T07:16:44Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"235b13826f712a0507445c3d83599bc984f51011ccec9d8b3b508dcb135d5c22","abstract_canon_sha256":"f2674fbde3382022c2f3a56ab17f370f76ef2a635f008fb9dd78586b779e6ecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:23.342159Z","signature_b64":"6EuCMSq7AkLQjwl4f9O/GFcEITB9JoKIUfMdudMkOYYvoeRUMf4/Chu323e2Rj9pwhodXRXRs9XRloMD8KZjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5ea0fca1f2c2c35289575128b4cc46402b6c1213023f3cbc770172c7bdd741","last_reissued_at":"2026-07-05T05:09:23.341615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:23.341615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Trajectory Prediction via \"Team Game\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.CV","authors_text":"Bo Dai, Dahua Lin, Xinge Zhu, Zikai Wei","submitted_at":"2022-10-17T07:16:44Z","abstract_excerpt":"To accurately predict trajectories in multi-agent settings, e.g. team games, it is important to effectively model the interactions among agents. Whereas a number of methods have been developed for this purpose, existing methods implicitly model these interactions as part of the deep net architecture. However, in the real world, interactions often exist at multiple levels, e.g. individuals may form groups, where interactions among groups and those among the individuals in the same group often follow significantly different patterns. In this paper, we present a novel formulation for multi-agent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08793","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/2210.08793/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":"2210.08793","created_at":"2026-07-05T05:09:23.341679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08793v1","created_at":"2026-07-05T05:09:23.341679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08793","created_at":"2026-07-05T05:09:23.341679+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5PKB7FB6LBM","created_at":"2026-07-05T05:09:23.341679+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5PKB7FB6LBMGUUJ","created_at":"2026-07-05T05:09:23.341679+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5PKB7FB","created_at":"2026-07-05T05:09:23.341679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14855","citing_title":"Exploitation of Hidden Context in Dynamic Movement Forecasting: A Neural Network Journey from Recurrent to Graph Neural Networks and General Purpose Transformers","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ","json":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ.json","graph_json":"https://pith.science/api/pith-number/F5PKB7FB6LBMGUUJK5ISRNGMIZ/graph.json","events_json":"https://pith.science/api/pith-number/F5PKB7FB6LBMGUUJK5ISRNGMIZ/events.json","paper":"https://pith.science/paper/F5PKB7FB"},"agent_actions":{"view_html":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ","download_json":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ.json","view_paper":"https://pith.science/paper/F5PKB7FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08793&json=true","fetch_graph":"https://pith.science/api/pith-number/F5PKB7FB6LBMGUUJK5ISRNGMIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F5PKB7FB6LBMGUUJK5ISRNGMIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ/action/storage_attestation","attest_author":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ/action/author_attestation","sign_citation":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ/action/citation_signature","submit_replication":"https://pith.science/pith/F5PKB7FB6LBMGUUJK5ISRNGMIZ/action/replication_record"}},"created_at":"2026-07-05T05:09:23.341679+00:00","updated_at":"2026-07-05T05:09:23.341679+00:00"}