{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:L2C7HA35IVCPFKAH3ZWDFE73CC","short_pith_number":"pith:L2C7HA35","schema_version":"1.0","canonical_sha256":"5e85f3837d4544f2a807de6c3293fb10b96f0a4a238ded2a023cd2acfc2c234d","source":{"kind":"arxiv","id":"2106.07161","version":1},"attestation_state":"computed","paper":{"title":"Heterogeneous Edge-Enhanced Graph Attention Network For Multi-Agent Trajectory Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chen Lv, Xiaoyu Mo, Yang Xing","submitted_at":"2021-06-14T04:51:22Z","abstract_excerpt":"Simultaneous trajectory prediction for multiple heterogeneous traffic participants is essential for the safe and efficient operation of connected automated vehicles under complex driving situations in the real world. The multi-agent prediction task is challenging, as the motions of traffic participants are affected by many factors, including their individual dynamics, their interactions with surrounding agents, the traffic infrastructures, and the number and modalities of the target agents. To further advance the trajectory prediction techniques, in this work we propose a three-channel framewo"},"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":"2106.07161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-14T04:51:22Z","cross_cats_sorted":[],"title_canon_sha256":"a6f662127a164050d17e133a7fc139be115589deade396a612a28baac9223b40","abstract_canon_sha256":"479ac2d86649aac6c6da84530f6b90ccca89d605417cf52fbb8e166133435d1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:02.713904Z","signature_b64":"JevV2uBtS+pYLvNdx/OjbokvcjWYitIRyX9qAZdODQq6/igug2oXMUTiqqDpOzHEG9FZtRgt8te7KyEL1AWuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e85f3837d4544f2a807de6c3293fb10b96f0a4a238ded2a023cd2acfc2c234d","last_reissued_at":"2026-07-05T02:49:02.713457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:02.713457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterogeneous Edge-Enhanced Graph Attention Network For Multi-Agent Trajectory Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chen Lv, Xiaoyu Mo, Yang Xing","submitted_at":"2021-06-14T04:51:22Z","abstract_excerpt":"Simultaneous trajectory prediction for multiple heterogeneous traffic participants is essential for the safe and efficient operation of connected automated vehicles under complex driving situations in the real world. The multi-agent prediction task is challenging, as the motions of traffic participants are affected by many factors, including their individual dynamics, their interactions with surrounding agents, the traffic infrastructures, and the number and modalities of the target agents. To further advance the trajectory prediction techniques, in this work we propose a three-channel framewo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07161","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/2106.07161/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":"2106.07161","created_at":"2026-07-05T02:49:02.713511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07161v1","created_at":"2026-07-05T02:49:02.713511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07161","created_at":"2026-07-05T02:49:02.713511+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2C7HA35IVCP","created_at":"2026-07-05T02:49:02.713511+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2C7HA35IVCPFKAH","created_at":"2026-07-05T02:49:02.713511+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2C7HA35","created_at":"2026-07-05T02:49:02.713511+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27577","citing_title":"hia-gat: A Heterogeneous Interaction-Aware Graph Attention Network For Frame-Level Traffic Conflict Risk Prediction On Freeways","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23194","citing_title":"Scalable Heterogeneous Graph Foundation Models for Data-Driven Optimal Power Flow in Smart Grids","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC","json":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC.json","graph_json":"https://pith.science/api/pith-number/L2C7HA35IVCPFKAH3ZWDFE73CC/graph.json","events_json":"https://pith.science/api/pith-number/L2C7HA35IVCPFKAH3ZWDFE73CC/events.json","paper":"https://pith.science/paper/L2C7HA35"},"agent_actions":{"view_html":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC","download_json":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC.json","view_paper":"https://pith.science/paper/L2C7HA35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07161&json=true","fetch_graph":"https://pith.science/api/pith-number/L2C7HA35IVCPFKAH3ZWDFE73CC/graph.json","fetch_events":"https://pith.science/api/pith-number/L2C7HA35IVCPFKAH3ZWDFE73CC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC/action/storage_attestation","attest_author":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC/action/author_attestation","sign_citation":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC/action/citation_signature","submit_replication":"https://pith.science/pith/L2C7HA35IVCPFKAH3ZWDFE73CC/action/replication_record"}},"created_at":"2026-07-05T02:49:02.713511+00:00","updated_at":"2026-07-05T02:49:02.713511+00:00"}