{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5L6EYQGJHUU5OW7VGLLXJDZPPY","short_pith_number":"pith:5L6EYQGJ","schema_version":"1.0","canonical_sha256":"eafc4c40c93d29d75bf532d7748f2f7e353fcc7173822ee68bd81f7d309a55ec","source":{"kind":"arxiv","id":"2301.12603","version":1},"attestation_state":"computed","paper":{"title":"Do We Really Need Graph 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":"Bryan Hooi, Chao Huang, Hengchang Hu, Roger Zimmermann, Xu Liu, Yushi Cao, Yuxuan Liang","submitted_at":"2023-01-30T01:30:04Z","abstract_excerpt":"Spatio-temporal graph neural networks (STGNN) have become the most popular solution to traffic forecasting. While successful, they rely on the message passing scheme of GNNs to establish spatial dependencies between nodes, and thus inevitably inherit GNNs' notorious inefficiency. Given these facts, in this paper, we propose an embarrassingly simple yet remarkably effective spatio-temporal learning approach, entitled SimST. Specifically, SimST approximates the efficacies of GNNs by two spatial learning techniques, which respectively model local and global spatial correlations. Moreover, SimST c"},"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":"2301.12603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-30T01:30:04Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a00c2d9df92f28bdf8932cd272aec4048452e1909a9f6c899d4b78614400ef94","abstract_canon_sha256":"c7cbcaf813ff105d7d15cd565f6760f6a88cfc7f7a9d5b0758cd7dae179af765"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:55.657492Z","signature_b64":"11CMzEdpG+DP6nZrHTC4Smwt+dBx9xJfulnXw2nerTwgQSqgSp+J0m9iQsXqHx75m92B8i018ArtKyuan2cGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eafc4c40c93d29d75bf532d7748f2f7e353fcc7173822ee68bd81f7d309a55ec","last_reissued_at":"2026-07-05T05:36:55.656954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:55.656954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Do We Really Need Graph 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":"Bryan Hooi, Chao Huang, Hengchang Hu, Roger Zimmermann, Xu Liu, Yushi Cao, Yuxuan Liang","submitted_at":"2023-01-30T01:30:04Z","abstract_excerpt":"Spatio-temporal graph neural networks (STGNN) have become the most popular solution to traffic forecasting. While successful, they rely on the message passing scheme of GNNs to establish spatial dependencies between nodes, and thus inevitably inherit GNNs' notorious inefficiency. Given these facts, in this paper, we propose an embarrassingly simple yet remarkably effective spatio-temporal learning approach, entitled SimST. Specifically, SimST approximates the efficacies of GNNs by two spatial learning techniques, which respectively model local and global spatial correlations. Moreover, SimST c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12603","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/2301.12603/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":"2301.12603","created_at":"2026-07-05T05:36:55.657014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12603v1","created_at":"2026-07-05T05:36:55.657014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12603","created_at":"2026-07-05T05:36:55.657014+00:00"},{"alias_kind":"pith_short_12","alias_value":"5L6EYQGJHUU5","created_at":"2026-07-05T05:36:55.657014+00:00"},{"alias_kind":"pith_short_16","alias_value":"5L6EYQGJHUU5OW7V","created_at":"2026-07-05T05:36:55.657014+00:00"},{"alias_kind":"pith_short_8","alias_value":"5L6EYQGJ","created_at":"2026-07-05T05:36:55.657014+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09539","citing_title":"Efficient Traffic Prediction at Scale: A Systematic Study of STGCN Architectural Depth","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY","json":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY.json","graph_json":"https://pith.science/api/pith-number/5L6EYQGJHUU5OW7VGLLXJDZPPY/graph.json","events_json":"https://pith.science/api/pith-number/5L6EYQGJHUU5OW7VGLLXJDZPPY/events.json","paper":"https://pith.science/paper/5L6EYQGJ"},"agent_actions":{"view_html":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY","download_json":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY.json","view_paper":"https://pith.science/paper/5L6EYQGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12603&json=true","fetch_graph":"https://pith.science/api/pith-number/5L6EYQGJHUU5OW7VGLLXJDZPPY/graph.json","fetch_events":"https://pith.science/api/pith-number/5L6EYQGJHUU5OW7VGLLXJDZPPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY/action/storage_attestation","attest_author":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY/action/author_attestation","sign_citation":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY/action/citation_signature","submit_replication":"https://pith.science/pith/5L6EYQGJHUU5OW7VGLLXJDZPPY/action/replication_record"}},"created_at":"2026-07-05T05:36:55.657014+00:00","updated_at":"2026-07-05T05:36:55.657014+00:00"}