{"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/padding-mask","entry":"padding_mask","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":2,"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":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"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":"2502.06910","arxiv_id_is_arxiv":true,"paper":"/paper/timekan-kan-based-frequency-decomposition","title":"TimeKAN: KAN-based Frequency Decomposition Learning Architecture for Long-term Time Series Forecasting","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangst21/timekan","path":"data_provider/uea.py","file_url":"https://github.com/huangst21/timekan/blob/HEAD/data_provider/uea.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbf2cb45dcc978f2","code_sha256_prefix":"fbf2cb45dcc978f2","mcp_get_code":{"code_sha256":"fbf2cb45dcc978f2"}},{"arxiv_id":"2412.09328","arxiv_id_is_arxiv":true,"paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Utils/masking_utils.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/masking_utils.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":"fbf2cb45dcc978f2","code_sha256_prefix":"fbf2cb45dcc978f2","mcp_get_code":{"code_sha256":"fbf2cb45dcc978f2"}},{"arxiv_id":"2411.07506","arxiv_id_is_arxiv":true,"paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Utils/masking_utils.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Utils/masking_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, unites-lab/fmts when it was checked","code_sha256":"fbf2cb45dcc978f2","code_sha256_prefix":"fbf2cb45dcc978f2","mcp_get_code":{"code_sha256":"fbf2cb45dcc978f2"}},{"arxiv_id":"2403.07300","arxiv_id_is_arxiv":true,"paper":"/paper/taming-pre-trained-llms-for-generalised-time","title":"CALF: Aligning LLMs for Time Series Forecasting via Cross-modal Fine-Tuning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hank0626/calf","path":"data_provider/uea.py","file_url":"https://github.com/hank0626/calf/blob/HEAD/data_provider/uea.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbf2cb45dcc978f2","code_sha256_prefix":"fbf2cb45dcc978f2","mcp_get_code":{"code_sha256":"fbf2cb45dcc978f2"}},{"arxiv_id":"2205.14895","arxiv_id_is_arxiv":true,"paper":"/paper/from-representation-to-reasoning-towards-both","title":"From Representation to Reasoning: Towards both Evidence and Commonsense Reasoning for Video Question-Answering","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcmi/Causal-VidQA","path":"networks/Transformer.py","file_url":"https://github.com/bcmi/Causal-VidQA/blob/HEAD/networks/Transformer.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":"5e25b5dfb19e34d9","code_sha256_prefix":"5e25b5dfb19e34d9","mcp_get_code":{"code_sha256":"5e25b5dfb19e34d9"}},{"arxiv_id":"2105.08276","arxiv_id_is_arxiv":true,"paper":"/paper/next-qa-next-phase-of-question-answering-to","title":"NExT-QA:Next Phase of Question-Answering to Explaining Temporal Actions","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"doc-doc/NExT-QA","path":"networks/q_v_transformer.py","file_url":"https://github.com/doc-doc/NExT-QA/blob/HEAD/networks/q_v_transformer.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":"5e25b5dfb19e34d9","code_sha256_prefix":"5e25b5dfb19e34d9","mcp_get_code":{"code_sha256":"5e25b5dfb19e34d9"}},{"arxiv_id":"2006.16236","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-rnns-fast-autoregressive","title":"Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyle-gao/TF_Transformer","path":"helperfunctions.py","file_url":"https://github.com/kyle-gao/TF_Transformer/blob/HEAD/helperfunctions.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":"d15b7f7e2a78f686","code_sha256_prefix":"d15b7f7e2a78f686","mcp_get_code":{"code_sha256":"d15b7f7e2a78f686"}},{"arxiv_id":"1811.07234","arxiv_id_is_arxiv":true,"paper":"/paper/improving-automatic-source-code-summarization","title":"Improving Automatic Source Code Summarization via Deep Reinforcement Learning","date":"2018-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mf1832146/tree-transformer","path":"tree_transformer.py","file_url":"https://github.com/mf1832146/tree-transformer/blob/HEAD/tree_transformer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, mf1832146/tree-transformer when it was checked","code_sha256":"e0fac7161842b06c","code_sha256_prefix":"e0fac7161842b06c","mcp_get_code":{"code_sha256":"e0fac7161842b06c"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enhuiz/torchnmt","path":"torchnmt/networks/transformer.py","file_url":"https://github.com/enhuiz/torchnmt/blob/HEAD/torchnmt/networks/transformer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"989daa6968c8a553","code_sha256_prefix":"989daa6968c8a553","mcp_get_code":{"code_sha256":"989daa6968c8a553"}}],"record_sha256":"fdc2f0c83b824dd97443c2b5232d642fc8bb07f3c1ab35ca4b5e6991d1b4b6b8","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}