{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/mlpencoder","entry":"MLPEncoder","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":8,"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_fingerprinted":2,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"unverified":0},"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":"2601.15333","paper":"/paper/arxiv-2601-15333","title":"Empowering LLMs for Structure-Based Drug Design via Exploration-Augmented Latent Inference","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hxnhxn/ELILLM","path":"Bayesian/bayesianLLM.py","file_url":"https://github.com/hxnhxn/ELILLM/blob/HEAD/Bayesian/bayesianLLM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24bed8e55b4c3985","mcp_get_code":{"code_sha256":"24bed8e55b4c3985"}},{"arxiv_id":"2601.01966","paper":"/paper/arxiv-2601-01966","title":"Refinement Provenance Inference: Detecting LLM-Refined Training Prompts from Model Behavior","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"YinBo0927/RePro","path":"repro/attacker.py","file_url":"https://github.com/YinBo0927/RePro/blob/HEAD/repro/attacker.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1da9bbef0ddba734","mcp_get_code":{"code_sha256":"1da9bbef0ddba734"}},{"arxiv_id":"2506.15448","paper":null,"title":"arXiv:2506.15448","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"mala-lab/RHO","path":"model.py","file_url":"https://github.com/mala-lab/RHO/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9d7b581047dc037","mcp_get_code":{"code_sha256":"a9d7b581047dc037"}},{"arxiv_id":"2401.14535","paper":"/paper/caring-learning-temporal-causal","title":"CaRiNG: Learning Temporal Causal Representation under Non-Invertible Generation Process","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanshuiii/caring","path":"caring/modules/stationary.py","file_url":"https://github.com/sanshuiii/caring/blob/HEAD/caring/modules/stationary.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfc5af9d3691e10d","mcp_get_code":{"code_sha256":"bfc5af9d3691e10d"}},{"arxiv_id":"2401.14113","paper":"/paper/on-the-affinity-rationality-and-diversity-of","title":"On the Affinity, Rationality, and Diversity of Hierarchical Topic Modeling","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bobxwu/topmost","path":"topmost/models/hierarchical/TraCo/TraCo.py","file_url":"https://github.com/bobxwu/topmost/blob/HEAD/topmost/models/hierarchical/TraCo/TraCo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c72f23962bed8ecd","mcp_get_code":{"code_sha256":"c72f23962bed8ecd"}},{"arxiv_id":"2304.03544","paper":"/paper/infoctm-a-mutual-information-maximization","title":"InfoCTM: A Mutual Information Maximization Perspective of Cross-Lingual Topic Modeling","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bobxwu/topmost","path":"topmost/models/crosslingual/InfoCTM/InfoCTM.py","file_url":"https://github.com/bobxwu/topmost/blob/HEAD/topmost/models/crosslingual/InfoCTM/InfoCTM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3a0707cb10ef0494","mcp_get_code":{"code_sha256":"3a0707cb10ef0494"}},{"arxiv_id":"2205.03665","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,"code_sha256_prefix":"06232d415e12a510","mcp_get_code":{"code_sha256":"06232d415e12a510"}},{"arxiv_id":"2203.01522","paper":"/paper/batchformer-learning-to-explore-sample","title":"BatchFormer: Learning to Explore Sample Relationships for Robust Representation Learning","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhihou7/BatchFormer","path":"batchformer-v2/deit_share/bt.py","file_url":"https://github.com/zhihou7/BatchFormer/blob/HEAD/batchformer-v2/deit_share/bt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f12ed8081defd51c","mcp_get_code":{"code_sha256":"f12ed8081defd51c"}}]}