{"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":"/code/masked-mae","entry":"masked_mae","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":13,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":10,"n_places":15,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":3,"ran":7,"unverified":2},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.20656","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-20656","title":"RiskTraf: Risk-Extrapolated Residual Learning for Multi-Variate Traffic Flow Prediction","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Guangyu4/RiskTraf","path":"risktraf/risk.py","file_url":"https://github.com/Guangyu4/RiskTraf/blob/HEAD/risktraf/risk.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1726c5408ff85960","code_sha256_prefix":"1726c5408ff85960","mcp_get_code":{"code_sha256":"1726c5408ff85960"}},{"arxiv_id":"2602.05286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05286","title":"HealthMamba: An Uncertainty-aware Spatiotemporal Graph State Space Model for Effective and Reliable Healthcare Facility Visit Prediction","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"UFOdestiny/HealthMamba","path":"base/metrics.py","file_url":"https://github.com/UFOdestiny/HealthMamba/blob/HEAD/base/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57c2470631d2c4d2","code_sha256_prefix":"57c2470631d2c4d2","mcp_get_code":{"code_sha256":"57c2470631d2c4d2"}},{"arxiv_id":"2601.12083","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12083","title":"Learning to Factorize and Adapt: A Versatile Approach Toward Universal Spatio-Temporal Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"GestaltCogTeam/BasicTS","path":"src/basicts/metrics/mae.py","file_url":"https://github.com/GestaltCogTeam/BasicTS/blob/HEAD/src/basicts/metrics/mae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"930f004619ca0a81","code_sha256_prefix":"930f004619ca0a81","mcp_get_code":{"code_sha256":"930f004619ca0a81"}},{"arxiv_id":"2412.09972","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-large-scale-traffic-forecasting","title":"Efficient Large-Scale Traffic Forecasting with Transformers: A Spatial Data Management Perspective","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmissher/patchstg","path":"lib/utils.py","file_url":"https://github.com/lmissher/patchstg/blob/HEAD/lib/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7098c6cfe715469","code_sha256_prefix":"f7098c6cfe715469","mcp_get_code":{"code_sha256":"f7098c6cfe715469"}},{"arxiv_id":"2410.10524","arxiv_id_is_arxiv":true,"paper":"/paper/get-rid-of-task-isolation-a-continuous-multi","title":"Get Rid of Isolation: A Continuous Multi-task Spatio-Temporal Learning Framework","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DILab-USTCSZ/CMuST","path":"utils/metrics.py","file_url":"https://github.com/DILab-USTCSZ/CMuST/blob/HEAD/utils/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1208d48cf19f87d0","code_sha256_prefix":"1208d48cf19f87d0","mcp_get_code":{"code_sha256":"1208d48cf19f87d0"}},{"arxiv_id":"2410.00373","arxiv_id_is_arxiv":true,"paper":"/paper/robust-traffic-forecasting-against-spatial","title":"Robust Traffic Forecasting against Spatial Shift over Years","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreamzz5/st-expert","path":"src/utils/metrics.py","file_url":"https://github.com/dreamzz5/st-expert/blob/HEAD/src/utils/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e57b87f956e8b5a","code_sha256_prefix":"5e57b87f956e8b5a","mcp_get_code":{"code_sha256":"5e57b87f956e8b5a"}},{"arxiv_id":"2405.11333","arxiv_id_is_arxiv":true,"paper":"/paper/ginar-an-end-to-end-multivariate-time-series","title":"GinAR: An End-To-End Multivariate Time Series Forecasting Model Suitable for Variable Missing","date":"2024-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chengqingyu/ginar","path":"metric/mask_metric.py","file_url":"https://github.com/chengqingyu/ginar/blob/HEAD/metric/mask_metric.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chengqingyu/ginar when it was checked","code_sha256":"5f1722e5414793ce","code_sha256_prefix":"5f1722e5414793ce","mcp_get_code":{"code_sha256":"5f1722e5414793ce"}},{"arxiv_id":"2312.00516","arxiv_id_is_arxiv":true,"paper":"/paper/spatio-temporal-decoupled-masked-pre-training","title":"Spatial-Temporal-Decoupled Masked Pre-training for Spatiotemporal Forecasting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmy-7664/std-mae","path":"basicts/metrics/mae.py","file_url":"https://github.com/jimmy-7664/std-mae/blob/HEAD/basicts/metrics/mae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jimmy-7664/std-mae when it was checked","code_sha256":"3492570f7c53230f","code_sha256_prefix":"3492570f7c53230f","mcp_get_code":{"code_sha256":"3492570f7c53230f"}},{"arxiv_id":"2310.06119","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-progress-in-multivariate-time","title":"Exploring Progress in Multivariate Time Series Forecasting: Comprehensive Benchmarking and Heterogeneity Analysis","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zezhishao/basicts","path":"src/basicts/metrics/mae.py","file_url":"https://github.com/zezhishao/basicts/blob/HEAD/src/basicts/metrics/mae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"930f004619ca0a81","code_sha256_prefix":"930f004619ca0a81","mcp_get_code":{"code_sha256":"930f004619ca0a81"}},{"arxiv_id":"2310.06119","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-progress-in-multivariate-time","title":"Exploring Progress in Multivariate Time Series Forecasting: Comprehensive Benchmarking and Heterogeneity Analysis","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitplz/dstrformer","path":"basicts/losses/losses.py","file_url":"https://github.com/hitplz/dstrformer/blob/HEAD/basicts/losses/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0706b9df9b6a5e94","code_sha256_prefix":"0706b9df9b6a5e94","mcp_get_code":{"code_sha256":"0706b9df9b6a5e94"}},{"arxiv_id":"2106.15802","arxiv_id_is_arxiv":true,"paper":"/paper/citynet-a-multi-city-multi-modal-dataset-for","title":"CityNet: A Comprehensive Multi-Modal Urban Dataset for Advanced Research in Urban Computing","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"citynet-at-git/Citynet-phase1","path":"code2/run_traffic.py","file_url":"https://github.com/citynet-at-git/Citynet-phase1/blob/HEAD/code2/run_traffic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, citynet-at-git/Citynet-phase1 when it was checked","code_sha256":"a03e1966d53ebaa4","code_sha256_prefix":"a03e1966d53ebaa4","mcp_get_code":{"code_sha256":"a03e1966d53ebaa4"}},{"arxiv_id":"1909.12255","arxiv_id_is_arxiv":true,"paper":"/paper/harnessing-structures-for-value-based","title":"Harnessing Structures for Value-Based Planning and Reinforcement Learning","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YyzHarry/SV-RL","path":"sv_rl/fancyimpute/common.py","file_url":"https://github.com/YyzHarry/SV-RL/blob/HEAD/sv_rl/fancyimpute/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3972c653e57ad9cb","code_sha256_prefix":"3972c653e57ad9cb","mcp_get_code":{"code_sha256":"3972c653e57ad9cb"}},{"arxiv_id":"1410.2596","arxiv_id_is_arxiv":true,"paper":"/paper/matrix-completion-and-low-rank-svd-via-fast","title":"Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares","date":"2014-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iskandr/fancyimpute","path":"fancyimpute/common.py","file_url":"https://github.com/iskandr/fancyimpute/blob/HEAD/fancyimpute/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3972c653e57ad9cb","code_sha256_prefix":"3972c653e57ad9cb","mcp_get_code":{"code_sha256":"3972c653e57ad9cb"}},{"arxiv_id":"ijcai2025_0372","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0372","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cwang-nus/DOL","path":"utils/criterion.py","file_url":"https://github.com/cwang-nus/DOL/blob/HEAD/utils/criterion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c33d9733dd5ae92","code_sha256_prefix":"0c33d9733dd5ae92","mcp_get_code":{"code_sha256":"0c33d9733dd5ae92"}},{"arxiv_id":"aaai_25976","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25976","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"deepkashiwa20/MegaCRN","path":"model_EXPYTKY/utils.py","file_url":"https://github.com/deepkashiwa20/MegaCRN/blob/HEAD/model_EXPYTKY/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90dd312dfe854032","code_sha256_prefix":"90dd312dfe854032","mcp_get_code":{"code_sha256":"90dd312dfe854032"}}],"record_sha256":"d51cafcff531f28ded05194a52aabac9e08e6b94bfdf8c4834fb49d495f04726","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}