{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HVE6CITKV6QPRD2MEKIH46PTZT","short_pith_number":"pith:HVE6CITK","schema_version":"1.0","canonical_sha256":"3d49e1226aafa0f88f4c22907e79f3cce2da3d6efc62a8e2b164b2b21696156e","source":{"kind":"arxiv","id":"1903.01254","version":2},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Modelling Traffic Participant Interaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alois Knoll, Frederik Diehl, Michael Truong Le, Thomas Brunner","submitted_at":"2019-03-04T14:15:07Z","abstract_excerpt":"By interpreting a traffic scene as a graph of interacting vehicles, we gain a flexible abstract representation which allows us to apply Graph Neural Network (GNN) models for traffic prediction. These naturally take interaction between traffic participants into account while being computationally efficient and providing large model capacity. We evaluate two state-of-the art GNN architectures and introduce several adaptations for our specific scenario. We show that prediction error in scenarios with much interaction decreases by 30% compared to a model that does not take interactions into accoun"},"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":"1903.01254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T14:15:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ae676ccc54e6afa0ece1513146c46ae64ce29e32f8cd68fd9be968c9fb0db2c","abstract_canon_sha256":"d813c6e670cb39524938e3afe5891a592bcb3b5e2c0eb15ece5f81a3a0c42c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:52.775175Z","signature_b64":"zFoCCl4M8eF1jUGboiT9OU/KpIQ28JFUPeIHHwdttUnXEqsVHmqnXdzb26BCEn6Md//axLq/10WFA6YF/qG0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d49e1226aafa0f88f4c22907e79f3cce2da3d6efc62a8e2b164b2b21696156e","last_reissued_at":"2026-05-17T23:46:52.774617Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:52.774617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Modelling Traffic Participant Interaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alois Knoll, Frederik Diehl, Michael Truong Le, Thomas Brunner","submitted_at":"2019-03-04T14:15:07Z","abstract_excerpt":"By interpreting a traffic scene as a graph of interacting vehicles, we gain a flexible abstract representation which allows us to apply Graph Neural Network (GNN) models for traffic prediction. These naturally take interaction between traffic participants into account while being computationally efficient and providing large model capacity. We evaluate two state-of-the art GNN architectures and introduce several adaptations for our specific scenario. We show that prediction error in scenarios with much interaction decreases by 30% compared to a model that does not take interactions into accoun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01254","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":""},"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":"1903.01254","created_at":"2026-05-17T23:46:52.774705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01254v2","created_at":"2026-05-17T23:46:52.774705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01254","created_at":"2026-05-17T23:46:52.774705+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVE6CITKV6QP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVE6CITKV6QPRD2M","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVE6CITK","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT","json":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT.json","graph_json":"https://pith.science/api/pith-number/HVE6CITKV6QPRD2MEKIH46PTZT/graph.json","events_json":"https://pith.science/api/pith-number/HVE6CITKV6QPRD2MEKIH46PTZT/events.json","paper":"https://pith.science/paper/HVE6CITK"},"agent_actions":{"view_html":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT","download_json":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT.json","view_paper":"https://pith.science/paper/HVE6CITK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01254&json=true","fetch_graph":"https://pith.science/api/pith-number/HVE6CITKV6QPRD2MEKIH46PTZT/graph.json","fetch_events":"https://pith.science/api/pith-number/HVE6CITKV6QPRD2MEKIH46PTZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT/action/storage_attestation","attest_author":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT/action/author_attestation","sign_citation":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT/action/citation_signature","submit_replication":"https://pith.science/pith/HVE6CITKV6QPRD2MEKIH46PTZT/action/replication_record"}},"created_at":"2026-05-17T23:46:52.774705+00:00","updated_at":"2026-05-17T23:46:52.774705+00:00"}