{"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-batch","entry":"pad_batch","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":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":4,"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":2,"ran_fixture":2,"ran":4,"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":"2605.18903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18903","title":"Reasoning Portability: Guiding Continual Learning for MLLMs in the RLVR Era","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"lluosi/RDB-CL","path":"ETrain/Models/Qwen/qwen_generation_utils.py","file_url":"https://github.com/lluosi/RDB-CL/blob/HEAD/ETrain/Models/Qwen/qwen_generation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, lluosi/RDB-CL when it was checked","code_sha256":"a83d13d0950d1a06","code_sha256_prefix":"a83d13d0950d1a06","mcp_get_code":{"code_sha256":"a83d13d0950d1a06"}},{"arxiv_id":"2605.17109","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17109","title":"DynMuon: A Dynamic Spectral Shaping View of Muon","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fzwark/DynMuon","path":"dynmuon/opt_utils.py","file_url":"https://github.com/fzwark/DynMuon/blob/HEAD/dynmuon/opt_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c87588f218c6b548","code_sha256_prefix":"c87588f218c6b548","mcp_get_code":{"code_sha256":"c87588f218c6b548"}},{"arxiv_id":"2502.08958","arxiv_id_is_arxiv":true,"paper":"/paper/biologically-plausible-brain-graph","title":"Biologically Plausible Brain Graph Transformer","date":"2025-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcyyyy/BioBGT","path":"Model/models.py","file_url":"https://github.com/pcyyyy/BioBGT/blob/HEAD/Model/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, pcyyyy/BioBGT when it was checked","code_sha256":"9f9f0220f11827d2","code_sha256_prefix":"9f9f0220f11827d2","mcp_get_code":{"code_sha256":"9f9f0220f11827d2"}},{"arxiv_id":"2411.16085","arxiv_id_is_arxiv":true,"paper":"/paper/cautious-optimizers-improving-training-with","title":"Cautious Optimizers: Improving Training with One Line of Code","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyleliang919/c-optim","path":"opt_utils.py","file_url":"https://github.com/kyleliang919/c-optim/blob/HEAD/opt_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c87588f218c6b548","code_sha256_prefix":"c87588f218c6b548","mcp_get_code":{"code_sha256":"c87588f218c6b548"}},{"arxiv_id":"2402.00667","arxiv_id_is_arxiv":true,"paper":"/paper/improving-weak-to-strong-generalization-with","title":"Improving Weak-to-Strong Generalization with Scalable Oversight and Ensemble Learning","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adam-bjtu/w2sg","path":"src/icl-based-W2SG/qwen_generation_utils.py","file_url":"https://github.com/adam-bjtu/w2sg/blob/HEAD/src/icl-based-W2SG/qwen_generation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, adam-bjtu/w2sg when it was checked","code_sha256":"a83d13d0950d1a06","code_sha256_prefix":"a83d13d0950d1a06","mcp_get_code":{"code_sha256":"a83d13d0950d1a06"}},{"arxiv_id":"2311.16922","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-object-hallucinations-in-large","title":"Mitigating Object Hallucinations in Large Vision-Language Models through Visual Contrastive Decoding","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-nlp-sg/vcd","path":"experiments/Qwen_VL/qwen_generation_utils.py","file_url":"https://github.com/damo-nlp-sg/vcd/blob/HEAD/experiments/Qwen_VL/qwen_generation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from lluosi/RDB-CL, and GitHub detected no licence in that repository when it was checked","code_sha256":"a83d13d0950d1a06","code_sha256_prefix":"a83d13d0950d1a06","mcp_get_code":{"code_sha256":"a83d13d0950d1a06"}},{"arxiv_id":"2311.04934","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-cache-modular-attention-reuse-for-low","title":"Prompt Cache: Modular Attention Reuse for Low-Latency Inference","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-sys/prompt-cache","path":"promptcache/cache_engine.py","file_url":"https://github.com/yale-sys/prompt-cache/blob/HEAD/promptcache/cache_engine.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":"40430244e49148ca","code_sha256_prefix":"40430244e49148ca","mcp_get_code":{"code_sha256":"40430244e49148ca"}},{"arxiv_id":"2210.02414","arxiv_id_is_arxiv":true,"paper":"/paper/glm-130b-an-open-bilingual-pre-trained-model","title":"GLM-130B: An Open Bilingual Pre-trained Model","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/GLM-130B","path":"evaluation/dataset.py","file_url":"https://github.com/THUDM/GLM-130B/blob/HEAD/evaluation/dataset.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":"4cd519b7c609ddfa","code_sha256_prefix":"4cd519b7c609ddfa","mcp_get_code":{"code_sha256":"4cd519b7c609ddfa"}},{"arxiv_id":"2201.08821","arxiv_id_is_arxiv":true,"paper":"/paper/representing-long-range-context-for-graph-1","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","date":"2022-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucbrise/graphtrans","path":"models/gnn_transformer.py","file_url":"https://github.com/ucbrise/graphtrans/blob/HEAD/models/gnn_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cec619dc729ca927","code_sha256_prefix":"cec619dc729ca927","mcp_get_code":{"code_sha256":"cec619dc729ca927"}},{"arxiv_id":"1603.08983","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-computation-time-for-recurrent","title":"Adaptive Computation Time for Recurrent Neural Networks","date":"2016-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ceyzaguirre4/adaptive_computation","path":"act/utils.py","file_url":"https://github.com/ceyzaguirre4/adaptive_computation/blob/HEAD/act/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":"ad8b210c90bf993e","code_sha256_prefix":"ad8b210c90bf993e","mcp_get_code":{"code_sha256":"ad8b210c90bf993e"}},{"arxiv_id":"Nunes_Temporal_Consistent_3D_LiDAR_Representation_Learning_for_Semantic_Perception_in_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Nunes_Temporal_Consistent_3D_LiDAR_Representation_Learning_for_Semantic_Perception_in_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PRBonn/TARL","path":"tarl/utils/collations.py","file_url":"https://github.com/PRBonn/TARL/blob/HEAD/tarl/utils/collations.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":"af7fe2bfc654bda0","code_sha256_prefix":"af7fe2bfc654bda0","mcp_get_code":{"code_sha256":"af7fe2bfc654bda0"}},{"arxiv_id":"2023.findings-acl.876","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.876","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"szegedai/MLSM","path":"finetune_eval.py","file_url":"https://github.com/szegedai/MLSM/blob/HEAD/finetune_eval.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":"3c366dab5c7dee08","code_sha256_prefix":"3c366dab5c7dee08","mcp_get_code":{"code_sha256":"3c366dab5c7dee08"}}],"record_sha256":"0549eca642c15c13a02ebc926adea0cdb1b359ca7e7ec1220f8d522a8071a604","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}