{"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/pad-sequences","entry":"pad_sequences","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":19,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":19,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":9,"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":"2609.12584","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12584","title":"Clustering-Based Balanced Sampling and Allocation with Data Parallelism for High-Performance Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"kaist-dmlab/CluSTER","path":"src/CluSTER/llm_wrapper.py","file_url":"https://github.com/kaist-dmlab/CluSTER/blob/HEAD/src/CluSTER/llm_wrapper.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":"7b178c461482e3f6","code_sha256_prefix":"7b178c461482e3f6","mcp_get_code":{"code_sha256":"7b178c461482e3f6"}},{"arxiv_id":"2602.09987","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-09987","title":"Infusion: Shaping Model Behavior by Editing Training Data via Influence Functions","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jrosseruk/infusion","path":"caesar_prime/run_infusion_experiment.py","file_url":"https://github.com/jrosseruk/infusion/blob/HEAD/caesar_prime/run_infusion_experiment.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, jrosseruk/infusion when it was checked","code_sha256":"b0b3a15939c84309","code_sha256_prefix":"b0b3a15939c84309","mcp_get_code":{"code_sha256":"b0b3a15939c84309"}},{"arxiv_id":"2601.05073","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05073","title":"Milestones over Outcome: Unlocking Geometric Reasoning with Sub-Goal Verifiable Reward","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"FrontierX-Lab/SGVR","path":"MM-EUREKA/openrlhf/models/ring_attn_utils.py","file_url":"https://github.com/FrontierX-Lab/SGVR/blob/HEAD/MM-EUREKA/openrlhf/models/ring_attn_utils.py","status":"unverified","verification_level":0,"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":"b26627fa753393a8","code_sha256_prefix":"b26627fa753393a8","mcp_get_code":{"code_sha256":"b26627fa753393a8"}},{"arxiv_id":"2506.08011","arxiv_id_is_arxiv":true,"paper":"/paper/play-to-generalize-learning-to-reason-through","title":"Play to Generalize: Learning to Reason Through Game Play","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunfeixie233/vigal","path":"openrlhf/models/ring_attn_utils.py","file_url":"https://github.com/yunfeixie233/vigal/blob/HEAD/openrlhf/models/ring_attn_utils.py","status":"unverified","verification_level":0,"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":"b26627fa753393a8","code_sha256_prefix":"b26627fa753393a8","mcp_get_code":{"code_sha256":"b26627fa753393a8"}},{"arxiv_id":"2505.15456","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-language-models-to-evolve-with-users","title":"Teaching Language Models to Evolve with Users: Dynamic Profile Modeling for Personalized Alignment","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingYuSSS/RLPA","path":"openrlhf/models/ring_attn_utils.py","file_url":"https://github.com/XingYuSSS/RLPA/blob/HEAD/openrlhf/models/ring_attn_utils.py","status":"unverified","verification_level":0,"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":"b26627fa753393a8","code_sha256_prefix":"b26627fa753393a8","mcp_get_code":{"code_sha256":"b26627fa753393a8"}},{"arxiv_id":"2504.07912","arxiv_id_is_arxiv":true,"paper":"/paper/echo-chamber-rl-post-training-amplifies","title":"Echo Chamber: RL Post-training Amplifies Behaviors Learned in Pretraining","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosieyzh/openrlhf-pretrain","path":"openrlhf/models/ring_attn_utils.py","file_url":"https://github.com/rosieyzh/openrlhf-pretrain/blob/HEAD/openrlhf/models/ring_attn_utils.py","status":"unverified","verification_level":0,"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":"b26627fa753393a8","code_sha256_prefix":"b26627fa753393a8","mcp_get_code":{"code_sha256":"b26627fa753393a8"}},{"arxiv_id":"2410.24198","arxiv_id_is_arxiv":true,"paper":"/paper/selfcodealign-self-alignment-for-code","title":"SelfCodeAlign: Self-Alignment for Code Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/starcoder2-self-align","path":"src/star_align/llm_wrapper.py","file_url":"https://github.com/bigcode-project/starcoder2-self-align/blob/HEAD/src/star_align/llm_wrapper.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":"7b178c461482e3f6","code_sha256_prefix":"7b178c461482e3f6","mcp_get_code":{"code_sha256":"7b178c461482e3f6"}},{"arxiv_id":"2406.01006","arxiv_id_is_arxiv":true,"paper":"/paper/semcoder-training-code-language-models-with","title":"SemCoder: Training Code Language Models with Comprehensive Semantics Reasoning","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ARiSE-Lab/SemCoder","path":"src/wrapper.py","file_url":"https://github.com/ARiSE-Lab/SemCoder/blob/HEAD/src/wrapper.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":"7b178c461482e3f6","code_sha256_prefix":"7b178c461482e3f6","mcp_get_code":{"code_sha256":"7b178c461482e3f6"}},{"arxiv_id":"2402.09345","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-reward-hacking-via-information","title":"InfoRM: Mitigating Reward Hacking in RLHF via Information-Theoretic Reward Modeling","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miaoyuchun/InfoRM","path":"openrlhf/models/ring_attn_utils.py","file_url":"https://github.com/miaoyuchun/InfoRM/blob/HEAD/openrlhf/models/ring_attn_utils.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, miaoyuchun/InfoRM when it was checked","code_sha256":"b26627fa753393a8","code_sha256_prefix":"b26627fa753393a8","mcp_get_code":{"code_sha256":"b26627fa753393a8"}},{"arxiv_id":"2205.13760","arxiv_id_is_arxiv":true,"paper":"/paper/tranception-protein-fitness-prediction-with","title":"Tranception: protein fitness prediction with autoregressive transformers and inference-time retrieval","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephen2526/structure-informed_plm","path":"model_scripts/datasets.py","file_url":"https://github.com/stephen2526/structure-informed_plm/blob/HEAD/model_scripts/datasets.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":"f46196e824839598","code_sha256_prefix":"f46196e824839598","mcp_get_code":{"code_sha256":"f46196e824839598"}},{"arxiv_id":"2107.02968","arxiv_id_is_arxiv":true,"paper":"/paper/deep-extrapolation-for-attribute-enhanced","title":"Deep Extrapolation for Attribute-Enhanced Generation","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/genhance","path":"SST5/generate_SST5_mh_mcmc.py","file_url":"https://github.com/salesforce/genhance/blob/HEAD/SST5/generate_SST5_mh_mcmc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54ba16efa22d311b","code_sha256_prefix":"54ba16efa22d311b","mcp_get_code":{"code_sha256":"54ba16efa22d311b"}},{"arxiv_id":"2010.12777","arxiv_id_is_arxiv":true,"paper":"/paper/improving-multilingual-models-with-language","title":"Improving Multilingual Models with Language-Clustered Vocabularies","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afshinrahimi/mmner","path":"models.py","file_url":"https://github.com/afshinrahimi/mmner/blob/HEAD/models.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":"ef651ba41fdc6cad","code_sha256_prefix":"ef651ba41fdc6cad","mcp_get_code":{"code_sha256":"ef651ba41fdc6cad"}},{"arxiv_id":"2006.07409","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-avoid-being-eaten-by-a-grue-structured","title":"How to Avoid Being Eaten by a Grue: Structured Exploration Strategies for Textual Worlds","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajammanabrolu/Q-BERT","path":"qbert/representations.py","file_url":"https://github.com/rajammanabrolu/Q-BERT/blob/HEAD/qbert/representations.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":"7557a77faca89da4","code_sha256_prefix":"7557a77faca89da4","mcp_get_code":{"code_sha256":"7557a77faca89da4"}},{"arxiv_id":"1909.05398","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-fiction-games-a-colossal","title":"Interactive Fiction Games: A Colossal Adventure","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/tdqn","path":"tdqn/tdqn.py","file_url":"https://github.com/microsoft/tdqn/blob/HEAD/tdqn/tdqn.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":"7557a77faca89da4","code_sha256_prefix":"7557a77faca89da4","mcp_get_code":{"code_sha256":"7557a77faca89da4"}},{"arxiv_id":"1907.00505","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-representation-learning-for-out-of","title":"Few-Shot Representation Learning for Out-Of-Vocabulary Words","date":"2019-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acbull/HiCE","path":"util.py","file_url":"https://github.com/acbull/HiCE/blob/HEAD/util.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":"3b66cda38a46f639","code_sha256_prefix":"3b66cda38a46f639","mcp_get_code":{"code_sha256":"3b66cda38a46f639"}},{"arxiv_id":"1906.08230","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-protein-transfer-learning-with","title":"Evaluating Protein Transfer Learning with TAPE","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songlab-cal/tape","path":"tape/datasets.py","file_url":"https://github.com/songlab-cal/tape/blob/HEAD/tape/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8062e9b3b5efa7dd","code_sha256_prefix":"8062e9b3b5efa7dd","mcp_get_code":{"code_sha256":"8062e9b3b5efa7dd"}},{"arxiv_id":"1606.07442","arxiv_id_is_arxiv":true,"paper":"/paper/deep-recurrent-neural-networks-for-supernovae","title":"Deep Recurrent Neural Networks for Supernovae Classification","date":"2016-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adammoss/supernovae","path":"dataset.py","file_url":"https://github.com/adammoss/supernovae/blob/HEAD/dataset.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":"5f7bedfa9a69fd57","code_sha256_prefix":"5f7bedfa9a69fd57","mcp_get_code":{"code_sha256":"5f7bedfa9a69fd57"}},{"arxiv_id":"1603.01360","arxiv_id_is_arxiv":true,"paper":"/paper/neural-architectures-for-named-entity","title":"Neural Architectures for Named Entity Recognition","date":"2016-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/MAX-Named-Entity-Tagger","path":"core/utils.py","file_url":"https://github.com/IBM/MAX-Named-Entity-Tagger/blob/HEAD/core/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":"57efe0447a3a3ab6","code_sha256_prefix":"57efe0447a3a3ab6","mcp_get_code":{"code_sha256":"57efe0447a3a3ab6"}},{"arxiv_id":"aaai_28047","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28047","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ksandeshk/LENS","path":"Flower/data_utils.py","file_url":"https://github.com/ksandeshk/LENS/blob/HEAD/Flower/data_utils.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":"8d57ffc220b82a2b","code_sha256_prefix":"8d57ffc220b82a2b","mcp_get_code":{"code_sha256":"8d57ffc220b82a2b"}}],"record_sha256":"b2158a8d4f71be299779a12640d50c3c906a4838ea09b17d401a060b1ff83533","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}