{"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/repeat","entry":"repeat","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":22,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":17,"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":20,"n_samples_ran":19,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":22,"n_places_pointer_only":1,"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":3,"ran_fixture":1,"ran":15,"unverified":1},"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":"2411.01842","arxiv_id_is_arxiv":true,"paper":"/paper/elastst-towards-robust-varied-horizon","title":"ElasTST: Towards Robust Varied-Horizon Forecasting with Elastic Time-Series Transformer","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProbTS","path":"probts/utils/utils.py","file_url":"https://github.com/microsoft/ProbTS/blob/HEAD/probts/utils/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":"d6932de4de105184","code_sha256_prefix":"d6932de4de105184","mcp_get_code":{"code_sha256":"d6932de4de105184"}},{"arxiv_id":"2405.16419","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-feature-diversity-boosts-channel","title":"Enhancing Feature Diversity Boosts Channel-Adaptive Vision Transformers","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaudatascience/diverse_channel_vit","path":"models/dichavit.py","file_url":"https://github.com/chaudatascience/diverse_channel_vit/blob/HEAD/models/dichavit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a1004bd6c0e8713","code_sha256_prefix":"6a1004bd6c0e8713","mcp_get_code":{"code_sha256":"6a1004bd6c0e8713"}},{"arxiv_id":"2403.05527","arxiv_id_is_arxiv":true,"paper":"/paper/gear-an-efficient-kv-cache-compression","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haokang-timmy/gear","path":"cuda_supported_gear/quant/timeit_v2.py","file_url":"https://github.com/haokang-timmy/gear/blob/HEAD/cuda_supported_gear/quant/timeit_v2.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":"b9bb89598a35cb87","code_sha256_prefix":"b9bb89598a35cb87","mcp_get_code":{"code_sha256":"b9bb89598a35cb87"}},{"arxiv_id":"2304.12233","arxiv_id_is_arxiv":true,"paper":"/paper/a-2d-graph-based-generative-approach-for","title":"Diffusion-based Generative AI for Exploring Transition States from 2D Molecular Graphs","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seonghann/tsdiff","path":"sampling.py","file_url":"https://github.com/seonghann/tsdiff/blob/HEAD/sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"139fbfabeed42eb5","code_sha256_prefix":"139fbfabeed42eb5","mcp_get_code":{"code_sha256":"139fbfabeed42eb5"}},{"arxiv_id":"2303.09040","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-spectral-denoising-transformer-with","title":"Hybrid Spectral Denoising Transformer with Guided Attention","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zeqiang-Lai/HSDT","path":"hsdt/sepconv.py","file_url":"https://github.com/Zeqiang-Lai/HSDT/blob/HEAD/hsdt/sepconv.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":"81ceb1c537a2009a","code_sha256_prefix":"81ceb1c537a2009a","mcp_get_code":{"code_sha256":"81ceb1c537a2009a"}},{"arxiv_id":"2205.01490","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-diffusion-generative-models","title":"Subspace Diffusion Generative Models","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjing2016/subspace-diffusion","path":"models/subspace_model.py","file_url":"https://github.com/bjing2016/subspace-diffusion/blob/HEAD/models/subspace_model.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":"c91b06c6042d38a2","code_sha256_prefix":"c91b06c6042d38a2","mcp_get_code":{"code_sha256":"c91b06c6042d38a2"}},{"arxiv_id":"2106.05194","arxiv_id_is_arxiv":true,"paper":"/paper/digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sherylhyx/digrac_directed_clustering","path":"src/eval_digcl.py","file_url":"https://github.com/sherylhyx/digrac_directed_clustering/blob/HEAD/src/eval_digcl.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":"684b8ea4814fa952","code_sha256_prefix":"684b8ea4814fa952","mcp_get_code":{"code_sha256":"684b8ea4814fa952"}},{"arxiv_id":"2104.09864","arxiv_id_is_arxiv":true,"paper":"/paper/roformer-enhanced-transformer-with-rotary","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AryaAftab/rotary-embedding-tensorflow","path":"rotary_embedding_tensorflow/rotary_embedding_tensorflow.py","file_url":"https://github.com/AryaAftab/rotary-embedding-tensorflow/blob/HEAD/rotary_embedding_tensorflow/rotary_embedding_tensorflow.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c8c38feed7983ab","code_sha256_prefix":"4c8c38feed7983ab","mcp_get_code":{"code_sha256":"4c8c38feed7983ab"}},{"arxiv_id":"2104.09715","arxiv_id_is_arxiv":true,"paper":"/paper/adaspeech-2-adaptive-text-to-speech-with","title":"AdaSpeech 2: Adaptive Text to Speech with Untranscribed Data","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/AdaSpeech2","path":"core/modules.py","file_url":"https://github.com/rishikksh20/AdaSpeech2/blob/HEAD/core/modules.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":"c6691c20de5ab4d1","code_sha256_prefix":"c6691c20de5ab4d1","mcp_get_code":{"code_sha256":"c6691c20de5ab4d1"}},{"arxiv_id":"2009.07839","arxiv_id_is_arxiv":true,"paper":"/paper/text-generation-by-learning-from-off-policy","title":"Text Generation by Learning from Demonstrations","date":"2020-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/FocusSeq2Seq","path":"models.py","file_url":"https://github.com/clovaai/FocusSeq2Seq/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0d5ad048814d336","code_sha256_prefix":"f0d5ad048814d336","mcp_get_code":{"code_sha256":"f0d5ad048814d336"}},{"arxiv_id":"2006.04558","arxiv_id_is_arxiv":true,"paper":"/paper/fastspeech-2-fast-and-high-quality-end-to-end","title":"FastSpeech 2: Fast and High-Quality End-to-End Text to Speech","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/FastSpeech2","path":"core/modules.py","file_url":"https://github.com/rishikksh20/FastSpeech2/blob/HEAD/core/modules.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":"c6691c20de5ab4d1","code_sha256_prefix":"c6691c20de5ab4d1","mcp_get_code":{"code_sha256":"c6691c20de5ab4d1"}},{"arxiv_id":"2005.14001","arxiv_id_is_arxiv":true,"paper":"/paper/joint-stochastic-approximation-and-its","title":"Joint Stochastic Approximation and Its Application to Learning Discrete Latent Variable Models","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-spmi/JSA","path":"bernoulli_MNIST/linear_model.py","file_url":"https://github.com/thu-spmi/JSA/blob/HEAD/bernoulli_MNIST/linear_model.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":"8deea25eec5485cb","code_sha256_prefix":"8deea25eec5485cb","mcp_get_code":{"code_sha256":"8deea25eec5485cb"}},{"arxiv_id":"2005.09394","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-monotonic-multihead-attention-for","title":"Enhancing Monotonic Multihead Attention for Streaming ASR","date":"2020-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hirofumi0810/neural_sp","path":"neural_sp/models/torch_utils.py","file_url":"https://github.com/hirofumi0810/neural_sp/blob/HEAD/neural_sp/models/torch_utils.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":"e5b2027edba3cd80","code_sha256_prefix":"e5b2027edba3cd80","mcp_get_code":{"code_sha256":"e5b2027edba3cd80"}},{"arxiv_id":"2005.00803","arxiv_id_is_arxiv":true,"paper":"/paper/lagrangian-neural-style-transfer-for-fluids","title":"Lagrangian Neural Style Transfer for Fluids","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byungsook/neural-flow-style","path":"vgg.py","file_url":"https://github.com/byungsook/neural-flow-style/blob/HEAD/vgg.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":"66ce8a101ba12962","code_sha256_prefix":"66ce8a101ba12962","mcp_get_code":{"code_sha256":"66ce8a101ba12962"}},{"arxiv_id":"2002.03079","arxiv_id_is_arxiv":true,"paper":"/paper/blank-language-models","title":"Blank Language Models","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Varal7/blank_language_model","path":"utils.py","file_url":"https://github.com/Varal7/blank_language_model/blob/HEAD/utils.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":"fa5495dc0fc297ef","code_sha256_prefix":"fa5495dc0fc297ef","mcp_get_code":{"code_sha256":"fa5495dc0fc297ef"}},{"arxiv_id":"1909.05316","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-a-good-story-designing-composite","title":"What Makes A Good Story? Designing Composite Rewards for Visual Storytelling","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunjieHu/ReCo-RL","path":"src/decoder.py","file_url":"https://github.com/JunjieHu/ReCo-RL/blob/HEAD/src/decoder.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":"f071e369bfdc4ba8","code_sha256_prefix":"f071e369bfdc4ba8","mcp_get_code":{"code_sha256":"f071e369bfdc4ba8"}},{"arxiv_id":"1903.00875","arxiv_id_is_arxiv":true,"paper":"/paper/meta-sr-a-magnification-arbitrary-network-for","title":"Meta-SR: A Magnification-Arbitrary Network for Super-Resolution","date":"2019-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/Meta_RDN-PyTorch","path":"model.py","file_url":"https://github.com/Lornatang/Meta_RDN-PyTorch/blob/HEAD/model.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":"93855dc9b02963c7","code_sha256_prefix":"93855dc9b02963c7","mcp_get_code":{"code_sha256":"93855dc9b02963c7"}},{"arxiv_id":"1901.09005","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-self-supervised-visual","title":"Revisiting Self-Supervised Visual Representation Learning","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/revisiting-self-supervised","path":"self_supervision/exemplar.py","file_url":"https://github.com/google/revisiting-self-supervised/blob/HEAD/self_supervision/exemplar.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":"0e9af15ef7691776","code_sha256_prefix":"0e9af15ef7691776","mcp_get_code":{"code_sha256":"0e9af15ef7691776"}},{"arxiv_id":"1710.07300","arxiv_id_is_arxiv":true,"paper":"/paper/figureqa-an-annotated-figure-dataset-for","title":"FigureQA: An Annotated Figure Dataset for Visual Reasoning","date":"2017-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vmichals/FigureQA-baseline","path":"util/array_tools.py","file_url":"https://github.com/vmichals/FigureQA-baseline/blob/HEAD/util/array_tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, vmichals/FigureQA-baseline, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c916ae6835b3f722","code_sha256_prefix":"c916ae6835b3f722","mcp_get_code":{"code_sha256":"c916ae6835b3f722"}},{"arxiv_id":"1611.09571","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-human-eye-fixations-via-an-lstm","title":"Predicting Human Eye Fixations via an LSTM-based Saliency Attentive Model","date":"2016-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcellacornia/sam","path":"models.py","file_url":"https://github.com/marcellacornia/sam/blob/HEAD/models.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":"df2a675b7aae0379","code_sha256_prefix":"df2a675b7aae0379","mcp_get_code":{"code_sha256":"df2a675b7aae0379"}},{"arxiv_id":"1506.08909","arxiv_id_is_arxiv":true,"paper":"/paper/the-ubuntu-dialogue-corpus-a-large-dataset-1","title":"The Ubuntu Dialogue Corpus: A Large Dataset for Research in Unstructured Multi-Turn Dialogue Systems","date":"2015-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangliuy/HybridNCM","path":"generation/decoder.py","file_url":"https://github.com/yangliuy/HybridNCM/blob/HEAD/generation/decoder.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":"f071e369bfdc4ba8","code_sha256_prefix":"f071e369bfdc4ba8","mcp_get_code":{"code_sha256":"f071e369bfdc4ba8"}},{"arxiv_id":"aaai_21320","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21320","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"siat-nlp/GALAXY","path":"galaxy/models/generator.py","file_url":"https://github.com/siat-nlp/GALAXY/blob/HEAD/galaxy/models/generator.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":"568b89f0a8232334","code_sha256_prefix":"568b89f0a8232334","mcp_get_code":{"code_sha256":"568b89f0a8232334"}}],"record_sha256":"6a39803944af8cf99b2208c02d5e1fc93bb425df5203acb79e5d85bb197b99ab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}