{"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/convencoder","entry":"ConvEncoder","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":9,"n_samples_constructed":6,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":0,"ran":9,"unverified":3},"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":"2603.18202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18202","title":"R2-Dreamer: Redundancy-Reduced World Models without Decoders or Augmentation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"NM512/r2dreamer","path":"dreamer.py","file_url":"https://github.com/NM512/r2dreamer/blob/HEAD/dreamer.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":"e577bedaeb6a10cf","code_sha256_prefix":"e577bedaeb6a10cf","mcp_get_code":{"code_sha256":"e577bedaeb6a10cf"}},{"arxiv_id":"2410.08877","arxiv_id_is_arxiv":true,"paper":"/paper/interdependency-matters-graph-alignment-for","title":"Interdependency Matters: Graph Alignment for Multivariate Time Series Anomaly Detection","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyy-code/MADGA","path":"models/GAN.py","file_url":"https://github.com/wyy-code/MADGA/blob/HEAD/models/GAN.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, wyy-code/MADGA when it was checked","code_sha256":"0a503f99c3cb7063","code_sha256_prefix":"0a503f99c3cb7063","mcp_get_code":{"code_sha256":"0a503f99c3cb7063"}},{"arxiv_id":"2405.16608","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-probabilistic-modeling-of","title":"Efficient Probabilistic Modeling of Crystallization at Mesoscopic Scale","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"poltimmer/CGNE","path":"CGNE/lightning_modules/cgne.py","file_url":"https://github.com/poltimmer/CGNE/blob/HEAD/CGNE/lightning_modules/cgne.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":"0c907c94d8dd9ffd","code_sha256_prefix":"0c907c94d8dd9ffd","mcp_get_code":{"code_sha256":"0c907c94d8dd9ffd"}},{"arxiv_id":"2305.15260","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-world-models-an-online-offline","title":"Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang067/CoWorld","path":"models.py","file_url":"https://github.com/qiwang067/CoWorld/blob/HEAD/models.py","status":"ran","verification_level":1,"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, qiwang067/CoWorld when it was checked","code_sha256":"7ca1f7001da75dd7","code_sha256_prefix":"7ca1f7001da75dd7","mcp_get_code":{"code_sha256":"7ca1f7001da75dd7"}},{"arxiv_id":"2301.04104","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-diverse-domains-through-world","title":"Mastering Diverse Domains through World Models","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nm512/dreamerv3-torch","path":"dreamer.py","file_url":"https://github.com/nm512/dreamerv3-torch/blob/HEAD/dreamer.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":"8097025bbaf735ac","code_sha256_prefix":"8097025bbaf735ac","mcp_get_code":{"code_sha256":"8097025bbaf735ac"}},{"arxiv_id":"2208.05244","arxiv_id_is_arxiv":true,"paper":"/paper/learning-degradation-representations-for","title":"Learning Degradation Representations for Image Deblurring","date":"2022-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dasongli1/learning_degradation","path":"basicsr/models/archs/msdi_arch.py","file_url":"https://github.com/dasongli1/learning_degradation/blob/HEAD/basicsr/models/archs/msdi_arch.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, dasongli1/learning_degradation when it was checked","code_sha256":"acda7604eab2458a","code_sha256_prefix":"acda7604eab2458a","mcp_get_code":{"code_sha256":"acda7604eab2458a"}},{"arxiv_id":"2205.03665","arxiv_id_is_arxiv":true,"paper":"/paper/variational-sparse-coding-with-learned","title":"Variational Sparse Coding with Learned Thresholding","date":"2022-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfallah/variational-sparse-coding","path":"model/lista.py","file_url":"https://github.com/kfallah/variational-sparse-coding/blob/HEAD/model/lista.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kfallah/variational-sparse-coding when it was checked","code_sha256":"903ea2efea36342b","code_sha256_prefix":"903ea2efea36342b","mcp_get_code":{"code_sha256":"903ea2efea36342b"}},{"arxiv_id":"2203.09388","arxiv_id_is_arxiv":true,"paper":"/paper/a-text-attention-network-for-spatial","title":"A Text Attention Network for Spatial Deformation Robust Scene Text Image Super-resolution","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mjq11302010044/TATT","path":"model/transformerSR.py","file_url":"https://github.com/mjq11302010044/TATT/blob/HEAD/model/transformerSR.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":"72bca38f7becc86d","code_sha256_prefix":"72bca38f7becc86d","mcp_get_code":{"code_sha256":"72bca38f7becc86d"}},{"arxiv_id":"2110.02178","arxiv_id_is_arxiv":true,"paper":"/paper/mobilevit-light-weight-general-purpose-and","title":"MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformer","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmaaz60/EdgeNeXt","path":"models/edgenext.py","file_url":"https://github.com/mmaaz60/EdgeNeXt/blob/HEAD/models/edgenext.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a75100d19286cb15","code_sha256_prefix":"a75100d19286cb15","mcp_get_code":{"code_sha256":"a75100d19286cb15"}},{"arxiv_id":"2108.00061","arxiv_id_is_arxiv":true,"paper":"/paper/mtvr-multilingual-moment-retrieval-in-videos","title":"MTVR: Multilingual Moment Retrieval in Videos","date":"2021-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayleicn/mTVRetrieval","path":"baselines/mxml/model_xml_shared.py","file_url":"https://github.com/jayleicn/mTVRetrieval/blob/HEAD/baselines/mxml/model_xml_shared.py","status":"ran","verification_level":1,"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, jayleicn/mTVRetrieval when it was checked","code_sha256":"38a1280d3a5d384f","code_sha256_prefix":"38a1280d3a5d384f","mcp_get_code":{"code_sha256":"38a1280d3a5d384f"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/dreamer-pytorch","path":"dreamer.py","file_url":"https://github.com/zhixuan-lin/dreamer-pytorch/blob/HEAD/dreamer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a3d541c43e302f3","code_sha256_prefix":"5a3d541c43e302f3","mcp_get_code":{"code_sha256":"5a3d541c43e302f3"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityabingi/Dreamer","path":"dreamer.py","file_url":"https://github.com/adityabingi/Dreamer/blob/HEAD/dreamer.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":"ea21fcd799d8f65e","code_sha256_prefix":"ea21fcd799d8f65e","mcp_get_code":{"code_sha256":"ea21fcd799d8f65e"}},{"arxiv_id":"aaai_25623","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25623","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zqhang/MTGFLOW","path":"models/GAN.py","file_url":"https://github.com/zqhang/MTGFLOW/blob/HEAD/models/GAN.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wyy-code/MADGA, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a503f99c3cb7063","code_sha256_prefix":"0a503f99c3cb7063","mcp_get_code":{"code_sha256":"0a503f99c3cb7063"}}],"record_sha256":"057f74da11fc668b64a4b95642630d76ee65a8483e6ef782bd62ca948d2bc023","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}