{"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/mlpencoder","entry":"MLPEncoder","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":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":8,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":5,"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":0,"ran":8,"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":"2601.15333","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hxnhxn/ELILLM when it was checked","code_sha256":"24bed8e55b4c3985","code_sha256_prefix":"24bed8e55b4c3985","mcp_get_code":{"code_sha256":"24bed8e55b4c3985"}},{"arxiv_id":"2601.01966","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YinBo0927/RePro when it was checked","code_sha256":"1da9bbef0ddba734","code_sha256_prefix":"1da9bbef0ddba734","mcp_get_code":{"code_sha256":"1da9bbef0ddba734"}},{"arxiv_id":"2506.15448","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mala-lab/RHO when it was checked","code_sha256":"a9d7b581047dc037","code_sha256_prefix":"a9d7b581047dc037","mcp_get_code":{"code_sha256":"a9d7b581047dc037"}},{"arxiv_id":"2401.14535","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bfc5af9d3691e10d","code_sha256_prefix":"bfc5af9d3691e10d","mcp_get_code":{"code_sha256":"bfc5af9d3691e10d"}},{"arxiv_id":"2401.14113","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c72f23962bed8ecd","code_sha256_prefix":"c72f23962bed8ecd","mcp_get_code":{"code_sha256":"c72f23962bed8ecd"}},{"arxiv_id":"2304.03544","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a0707cb10ef0494","code_sha256_prefix":"3a0707cb10ef0494","mcp_get_code":{"code_sha256":"3a0707cb10ef0494"}},{"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":"06232d415e12a510","code_sha256_prefix":"06232d415e12a510","mcp_get_code":{"code_sha256":"06232d415e12a510"}},{"arxiv_id":"2203.01522","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhihou7/BatchFormer when it was checked","code_sha256":"f12ed8081defd51c","code_sha256_prefix":"f12ed8081defd51c","mcp_get_code":{"code_sha256":"f12ed8081defd51c"}}],"record_sha256":"a18182bb1f3f4e6fda735efdcadf10e664775e9cd064782461c090c222362c82","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}