{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/pemsd4","name":"PeMSD4","full_name":null,"description_markdown":"The dataset refers to the traffic speed data in San Francisco Bay Area, containing 307 sensors on 29 roads. The time span of the dataset is January-February in 2018. It is a popular benchmark for traffic forecasting.","description_withheld":null,"homepage":"","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[{"name":"Traffic Prediction","url":"/task/traffic-prediction","datasets_with_task":"/datasets/task/traffic-prediction"}],"languages":[],"variants":["PeMSD4"],"data_loaders":[],"num_papers_in_archive":20,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/traffic-prediction-on-pemsd4","task":"Traffic Prediction","dataset_variant":"PeMSD4","rows":13,"metrics":["12 steps MAE","12 steps MAPE","12 steps RMSE"],"first_row_in_archive_order":{"model":"Hierarchical-Attention-LSTM (HierAttnLSTM)","paper":"/paper/big-data-application-for-network-level-travel","metrics":{"12 steps MAE":"9.168","12 steps RMSE":"22.844"},"code_links":[{"title":"TeRyZh/Network-Level-Travel-Prediction-Hierarchical-Attention-LSTM","url":"https://github.com/TeRyZh/Network-Level-Travel-Prediction-Hierarchical-Attention-LSTM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":12,"of":12,"counts":{"papers_with_a_benchmark_row":12,"with_a_code_link":10,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/fastersts-a-faster-spatio-temporal","slug":"fastersts-a-faster-spatio-temporal","title":"FasterSTS: A Faster Spatio-Temporal Synchronous Graph Convolutional Networks for Traffic flow Forecasting","date":"2025-01-01","arxiv_id":"2501.00756","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pdg2seq-periodic-dynamic-graph-to-sequence","slug":"pdg2seq-periodic-dynamic-graph-to-sequence","title":"PDG2Seq: Periodic Dynamic Graph to Sequence Model for Traffic Flow Prediction","date":"2024-12-05","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pattern-matching-dynamic-memory-network-for-1","slug":"pattern-matching-dynamic-memory-network-for-1","title":"Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction","date":"2024-08-12","arxiv_id":"2408.07100","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-novel-hybrid-time-varying-graph-neural","slug":"a-novel-hybrid-time-varying-graph-neural","title":"A novel hybrid time-varying graph neural network for traffic flow forecasting","date":"2024-01-17","arxiv_id":"2401.10155","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/spatio-temporal-decoupled-masked-pre-training","slug":"spatio-temporal-decoupled-masked-pre-training","title":"Spatial-Temporal-Decoupled Masked Pre-training for Spatiotemporal Forecasting","date":"2023-12-01","arxiv_id":"2312.00516","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["jimmy-7664/std-mae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spatio-temporal-decoupled-masked-pre-training#ran","syntology_url":"https://syntology.ai/paper/2312.00516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00516"}}}},{"paper":"/paper/when-spatio-temporal-meet-wavelets","slug":"when-spatio-temporal-meet-wavelets","title":"When Spatio-Temporal Meet Wavelets: Disentangled Traffic Forecasting via Efficient Spectral Graph Attention Networks","date":"2023-07-26","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-decomposition-dynamic-graph-convolutional","slug":"a-decomposition-dynamic-graph-convolutional","title":"A Decomposition Dynamic graph convolutional recurrent network for traffic forecasting","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-neural-rough-differential-equations-for","slug":"graph-neural-rough-differential-equations-for","title":"Graph Neural Rough Differential Equations for Traffic Forecasting","date":"2023-03-20","arxiv_id":"2303.10909","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/STG-NCDE","jeongwhanchoi/stg-nrde"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-neural-rough-differential-equations-for#ran","syntology_url":"https://syntology.ai/paper/2303.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10909"}}}},{"paper":"/paper/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":6,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}}}},{"paper":"/paper/hagcn-network-decentralization-attention","slug":"hagcn-network-decentralization-attention","title":"HAGCN : Network Decentralization Attention Based Heterogeneity-Aware Spatiotemporal Graph Convolution Network for Traffic Signal Forecasting","date":"2022-09-05","arxiv_id":"2209.01967","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/big-data-application-for-network-level-travel","slug":"big-data-application-for-network-level-travel","title":"Network Level Spatial Temporal Traffic State Forecasting with Hierarchical Attention LSTM (HierAttnLSTM)","date":"2022-01-15","arxiv_id":"2201.05760","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-neural-controlled-differential","slug":"graph-neural-controlled-differential","title":"Graph Neural Controlled Differential Equations for Traffic Forecasting","date":"2021-12-07","arxiv_id":"2112.03558","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/fastersts-a-faster-spatio-temporal","slug":"fastersts-a-faster-spatio-temporal","title":"FasterSTS: A Faster Spatio-Temporal Synchronous Graph Convolutional Networks for Traffic flow Forecasting","date":"2025-01-01","arxiv_id":"2501.00756","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pdg2seq-periodic-dynamic-graph-to-sequence","slug":"pdg2seq-periodic-dynamic-graph-to-sequence","title":"PDG2Seq: Periodic Dynamic Graph to Sequence Model for Traffic Flow Prediction","date":"2024-12-05","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pattern-matching-dynamic-memory-network-for-1","slug":"pattern-matching-dynamic-memory-network-for-1","title":"Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction","date":"2024-08-12","arxiv_id":"2408.07100","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-novel-hybrid-time-varying-graph-neural","slug":"a-novel-hybrid-time-varying-graph-neural","title":"A novel hybrid time-varying graph neural network for traffic flow forecasting","date":"2024-01-17","arxiv_id":"2401.10155","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/spatio-temporal-decoupled-masked-pre-training","slug":"spatio-temporal-decoupled-masked-pre-training","title":"Spatial-Temporal-Decoupled Masked Pre-training for Spatiotemporal Forecasting","date":"2023-12-01","arxiv_id":"2312.00516","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["jimmy-7664/std-mae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spatio-temporal-decoupled-masked-pre-training#ran","syntology_url":"https://syntology.ai/paper/2312.00516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00516"}}}},{"paper":"/paper/when-spatio-temporal-meet-wavelets","slug":"when-spatio-temporal-meet-wavelets","title":"When Spatio-Temporal Meet Wavelets: Disentangled Traffic Forecasting via Efficient Spectral Graph Attention Networks","date":"2023-07-26","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-decomposition-dynamic-graph-convolutional","slug":"a-decomposition-dynamic-graph-convolutional","title":"A Decomposition Dynamic graph convolutional recurrent network for traffic forecasting","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-neural-rough-differential-equations-for","slug":"graph-neural-rough-differential-equations-for","title":"Graph Neural Rough Differential Equations for Traffic Forecasting","date":"2023-03-20","arxiv_id":"2303.10909","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/STG-NCDE","jeongwhanchoi/stg-nrde"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-neural-rough-differential-equations-for#ran","syntology_url":"https://syntology.ai/paper/2303.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10909"}}}},{"paper":"/paper/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":6,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}}}},{"paper":"/paper/hagcn-network-decentralization-attention","slug":"hagcn-network-decentralization-attention","title":"HAGCN : Network Decentralization Attention Based Heterogeneity-Aware Spatiotemporal Graph Convolution Network for Traffic Signal Forecasting","date":"2022-09-05","arxiv_id":"2209.01967","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/big-data-application-for-network-level-travel","slug":"big-data-application-for-network-level-travel","title":"Network Level Spatial Temporal Traffic State Forecasting with Hierarchical Attention LSTM (HierAttnLSTM)","date":"2022-01-15","arxiv_id":"2201.05760","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-neural-controlled-differential","slug":"graph-neural-controlled-differential","title":"Graph Neural Controlled Differential Equations for Traffic Forecasting","date":"2021-12-07","arxiv_id":"2112.03558","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/dataset/pemsd4/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/pemsd4/papers/ran/1","json":"/dataset/pemsd4/papers/ran/1.json","rows":3}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":3,"samples_harvested":28,"samples_ran":21,"samples_constructed":6,"samples_ran_checked":18,"samples_ran_instrument_failed":3,"samples_unverified":7,"pointer_only_for_licence":3,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":3,"papers_with_a_run_with_no_instrument_failure":3,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"a79593cef388a8b929d0c1faa1d8a959fbae1c2b330027ef4eff3f9f7ae66211","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}