{"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/moving-avg","entry":"moving_avg","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":8,"n_samples_constructed":4,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":8,"n_places_pointer_only":4,"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":0,"ran_fixture":1,"ran":7,"unverified":0},"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.10145","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10145","title":"The Evaluation Protocol Determines the Result: An Independent Reproduction of LeWorldModel on TwoRoom","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"joyjeet-singh/tinylab","path":"analyze_rl.py","file_url":"https://github.com/joyjeet-singh/tinylab/blob/HEAD/analyze_rl.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, joyjeet-singh/tinylab when it was checked","code_sha256":"53fa761eae0bf783","code_sha256_prefix":"53fa761eae0bf783","mcp_get_code":{"code_sha256":"53fa761eae0bf783"}},{"arxiv_id":"2505.13896","arxiv_id_is_arxiv":true,"paper":"/paper/craft-time-series-forecasting-with-cross","title":"CRAFT: Time Series Forecasting with Cross-Future Behavior Awareness","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRAFTinTSF/CRAFT","path":"craft.py","file_url":"https://github.com/CRAFTinTSF/CRAFT/blob/HEAD/craft.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CRAFTinTSF/CRAFT when it was checked","code_sha256":"4837115ada19bc89","code_sha256_prefix":"4837115ada19bc89","mcp_get_code":{"code_sha256":"4837115ada19bc89"}},{"arxiv_id":"2406.14399","arxiv_id_is_arxiv":true,"paper":"/paper/weather-5k-a-large-scale-global-station","title":"How far are today's time-series models from real-world weather forecasting applications?","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taohan10200/weather-5k","path":"models/Corrformer.py","file_url":"https://github.com/taohan10200/weather-5k/blob/HEAD/models/Corrformer.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":"627811d6e342bdbf","code_sha256_prefix":"627811d6e342bdbf","mcp_get_code":{"code_sha256":"627811d6e342bdbf"}},{"arxiv_id":"2212.08151","arxiv_id_is_arxiv":true,"paper":"/paper/first-de-trend-then-attend-rethinking","title":"First De-Trend then Attend: Rethinking Attention for Time-Series Forecasting","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BeBeYourLove/TDformer","path":"model/TDformer.py","file_url":"https://github.com/BeBeYourLove/TDformer/blob/HEAD/model/TDformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BeBeYourLove/TDformer when it was checked","code_sha256":"94ce7d58219032b2","code_sha256_prefix":"94ce7d58219032b2","mcp_get_code":{"code_sha256":"94ce7d58219032b2"}},{"arxiv_id":"2206.04038","arxiv_id_is_arxiv":true,"paper":"/paper/scaleformer-iterative-multi-scale-refining","title":"Scaleformer: Iterative Multi-scale Refining Transformers for Time Series Forecasting","date":"2022-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borealisai/scaleformer","path":"models/AutoformerMS.py","file_url":"https://github.com/borealisai/scaleformer/blob/HEAD/models/AutoformerMS.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, borealisai/scaleformer (NOASSERTION)","code_sha256":"dafd454219d21bd8","code_sha256_prefix":"dafd454219d21bd8","mcp_get_code":{"code_sha256":"dafd454219d21bd8"}},{"arxiv_id":"2205.13504","arxiv_id_is_arxiv":true,"paper":"/paper/are-transformers-effective-for-time-series","title":"Are Transformers Effective for Time Series Forecasting?","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taohan10200/weather-5k","path":"models/DLinear.py","file_url":"https://github.com/taohan10200/weather-5k/blob/HEAD/models/DLinear.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"262d9b037b804057","code_sha256_prefix":"262d9b037b804057","mcp_get_code":{"code_sha256":"262d9b037b804057"}},{"arxiv_id":"2201.12740","arxiv_id_is_arxiv":true,"paper":"/paper/fedformer-frequency-enhanced-decomposed","title":"FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-di-ml/icml2022-fedformer","path":"models/FEDformer.py","file_url":"https://github.com/damo-di-ml/icml2022-fedformer/blob/HEAD/models/FEDformer.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":"9b305cbd3bf0b841","code_sha256_prefix":"9b305cbd3bf0b841","mcp_get_code":{"code_sha256":"9b305cbd3bf0b841"}},{"arxiv_id":"1911.00068","arxiv_id_is_arxiv":true,"paper":"/paper/confident-learning-estimating-uncertainty-in","title":"Confident Learning: Estimating Uncertainty in Dataset Labels","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chang-yue/ctrl","path":"clustering.py","file_url":"https://github.com/chang-yue/ctrl/blob/HEAD/clustering.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":"b7de9a2eab9a6e44","code_sha256_prefix":"b7de9a2eab9a6e44","mcp_get_code":{"code_sha256":"b7de9a2eab9a6e44"}}],"record_sha256":"b5eba382bc41afc2065a418b0d1a60de19ca2d2dbfd00cd06b144a31fb8728d4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}