{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DDY2N2YPKV24B4BNSHVL654BWI","short_pith_number":"pith:DDY2N2YP","schema_version":"1.0","canonical_sha256":"18f1a6eb0f5575c0f02d91eabf7781b23a8ab22e6390fce4a45623154077beae","source":{"kind":"arxiv","id":"2305.05740","version":1},"attestation_state":"computed","paper":{"title":"Message Passing Neural Networks for Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Arian Prabowo, Flora D. Salim, Hao Xue, Piotr Koniusz, Wei Shao","submitted_at":"2023-05-09T19:33:52Z","abstract_excerpt":"A road network, in the context of traffic forecasting, is typically modeled as a graph where the nodes are sensors that measure traffic metrics (such as speed) at that location. Traffic forecasting is interesting because it is complex as the future speed of a road is dependent on a number of different factors. Therefore, to properly forecast traffic, we need a model that is capable of capturing all these different factors. A factor that is missing from the existing works is the node interactions factor. Existing works fail to capture the inter-node interactions because none are using the messa"},"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":"2305.05740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-09T19:33:52Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dcbd72498660c7ffd492773783e74cbe800bae8b5ec1e34dc6bd0841cbb9e0f8","abstract_canon_sha256":"f68027beba40b52327f2c0a1362296a44a306950c18e2ed0765783eccf18e35e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:56.296938Z","signature_b64":"GApozn3UZfV7qS4DLvcMXS2RpBYcEUIA5yXguOK6zaz3KA7r3xlFyQlJ7UoeFV6JXeuN2fLhqHH5MUrg78r5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f1a6eb0f5575c0f02d91eabf7781b23a8ab22e6390fce4a45623154077beae","last_reissued_at":"2026-07-05T06:08:56.296571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:56.296571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message Passing Neural Networks for Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Arian Prabowo, Flora D. Salim, Hao Xue, Piotr Koniusz, Wei Shao","submitted_at":"2023-05-09T19:33:52Z","abstract_excerpt":"A road network, in the context of traffic forecasting, is typically modeled as a graph where the nodes are sensors that measure traffic metrics (such as speed) at that location. Traffic forecasting is interesting because it is complex as the future speed of a road is dependent on a number of different factors. Therefore, to properly forecast traffic, we need a model that is capable of capturing all these different factors. A factor that is missing from the existing works is the node interactions factor. Existing works fail to capture the inter-node interactions because none are using the messa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05740","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/2305.05740/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":"2305.05740","created_at":"2026-07-05T06:08:56.296628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.05740v1","created_at":"2026-07-05T06:08:56.296628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05740","created_at":"2026-07-05T06:08:56.296628+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDY2N2YPKV24","created_at":"2026-07-05T06:08:56.296628+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDY2N2YPKV24B4BN","created_at":"2026-07-05T06:08:56.296628+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDY2N2YP","created_at":"2026-07-05T06:08:56.296628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24318","citing_title":"Network Digital Twin for Congestion-Aware Predictive Traffic Routing using Graph MPNNs","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI","json":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI.json","graph_json":"https://pith.science/api/pith-number/DDY2N2YPKV24B4BNSHVL654BWI/graph.json","events_json":"https://pith.science/api/pith-number/DDY2N2YPKV24B4BNSHVL654BWI/events.json","paper":"https://pith.science/paper/DDY2N2YP"},"agent_actions":{"view_html":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI","download_json":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI.json","view_paper":"https://pith.science/paper/DDY2N2YP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.05740&json=true","fetch_graph":"https://pith.science/api/pith-number/DDY2N2YPKV24B4BNSHVL654BWI/graph.json","fetch_events":"https://pith.science/api/pith-number/DDY2N2YPKV24B4BNSHVL654BWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI/action/storage_attestation","attest_author":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI/action/author_attestation","sign_citation":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI/action/citation_signature","submit_replication":"https://pith.science/pith/DDY2N2YPKV24B4BNSHVL654BWI/action/replication_record"}},"created_at":"2026-07-05T06:08:56.296628+00:00","updated_at":"2026-07-05T06:08:56.296628+00:00"}