{"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/format-input","entry":"format_input","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":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":6,"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":2,"ran_fixture":0,"ran":2,"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.03915","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03915","title":"Rethinking Role-Playing Evaluation: Anonymous Benchmarking and A Systematic Study of Personality Effects","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"MiuLab/RolePlayBench","path":"CharacterEval/run_char_rm.py","file_url":"https://github.com/MiuLab/RolePlayBench/blob/HEAD/CharacterEval/run_char_rm.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, MiuLab/RolePlayBench when it was checked","code_sha256":"8f301aa7c29f9221","code_sha256_prefix":"8f301aa7c29f9221","mcp_get_code":{"code_sha256":"8f301aa7c29f9221"}},{"arxiv_id":"2403.01304","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-validity-of-automatically","title":"Improving the Validity of Automatically Generated Feedback via Reinforcement Learning","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umass-ml4ed/feedback-gen-dpo","path":"reward_model_dataset.py","file_url":"https://github.com/umass-ml4ed/feedback-gen-dpo/blob/HEAD/reward_model_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, umass-ml4ed/feedback-gen-dpo when it was checked","code_sha256":"fca5d04c2f6ba6c9","code_sha256_prefix":"fca5d04c2f6ba6c9","mcp_get_code":{"code_sha256":"fca5d04c2f6ba6c9"}},{"arxiv_id":"2402.11863","arxiv_id_is_arxiv":true,"paper":"/paper/how-interpretable-are-reasoning-explanations","title":"How Interpretable are Reasoning Explanations from Prompting Large Language Models?","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wj210/cot_interpretability","path":"utils/data_collator_pinto.py","file_url":"https://github.com/wj210/cot_interpretability/blob/HEAD/utils/data_collator_pinto.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, wj210/cot_interpretability when it was checked","code_sha256":"9bac83066a04172a","code_sha256_prefix":"9bac83066a04172a","mcp_get_code":{"code_sha256":"9bac83066a04172a"}},{"arxiv_id":"2402.03293","arxiv_id_is_arxiv":true,"paper":"/paper/flora-low-rank-adapters-are-secretly-gradient","title":"Flora: Low-Rank Adapters Are Secretly Gradient Compressors","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borealisai/flora-opt","path":"examples/flax/decoder_seq2seq.py","file_url":"https://github.com/borealisai/flora-opt/blob/HEAD/examples/flax/decoder_seq2seq.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"LGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-3.0, as GitHub detects it on this paper's repository, borealisai/flora-opt, is not in the permissive set Syntology serves inline","code_sha256":"79df288fccf351fa","code_sha256_prefix":"79df288fccf351fa","mcp_get_code":{"code_sha256":"79df288fccf351fa"}},{"arxiv_id":"2401.01275","arxiv_id_is_arxiv":true,"paper":"/paper/charactereval-a-chinese-benchmark-for-role","title":"CharacterEval: A Chinese Benchmark for Role-Playing Conversational Agent Evaluation","date":"2024-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morecry/charactereval","path":"run_char_rm.py","file_url":"https://github.com/morecry/charactereval/blob/HEAD/run_char_rm.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":"8f301aa7c29f9221","code_sha256_prefix":"8f301aa7c29f9221","mcp_get_code":{"code_sha256":"8f301aa7c29f9221"}},{"arxiv_id":"2311.17154","arxiv_id_is_arxiv":true,"paper":"/paper/pragmatic-radiology-report-generation","title":"Pragmatic Radiology Report Generation","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chicagohai/llm_radiology","path":"format_llama_input.py","file_url":"https://github.com/chicagohai/llm_radiology/blob/HEAD/format_llama_input.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, chicagohai/llm_radiology when it was checked","code_sha256":"94711428e0791fe9","code_sha256_prefix":"94711428e0791fe9","mcp_get_code":{"code_sha256":"94711428e0791fe9"}},{"arxiv_id":"2010.15750","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-process-bandit-optimization-of","title":"Gaussian Process Bandit Optimization of the Thermodynamic Variational Objective","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntienvu/tvo_gp_bandit","path":"src/gp_bandit.py","file_url":"https://github.com/ntienvu/tvo_gp_bandit/blob/HEAD/src/gp_bandit.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, ntienvu/tvo_gp_bandit when it was checked","code_sha256":"64c88c97da2c1b4f","code_sha256_prefix":"64c88c97da2c1b4f","mcp_get_code":{"code_sha256":"64c88c97da2c1b4f"}},{"arxiv_id":"1910.14424","arxiv_id_is_arxiv":true,"paper":"/paper/multi-stage-document-ranking-with-bert","title":"Multi-Stage Document Ranking with BERT","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipphager/baidu-bert-model","path":"src/data.py","file_url":"https://github.com/philipphager/baidu-bert-model/blob/HEAD/src/data.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":"e3d14a4472327aa7","code_sha256_prefix":"e3d14a4472327aa7","mcp_get_code":{"code_sha256":"e3d14a4472327aa7"}}],"record_sha256":"922e8366abc51c45b62d5c5ef0a10ba2465b8045bd4356c99b84e40d02ac3b19","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}