{"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/get-all-parameters","entry":"get_all_parameters","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":6,"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":"2509.12521","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12521","title":"Phi: Preference Hijacking in Multi-modal Large Language Models at Inference Time","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Yifan-Lan/Phi","path":"trl/models/utils.py","file_url":"https://github.com/Yifan-Lan/Phi/blob/HEAD/trl/models/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":"2f5119732e8dbd63","code_sha256_prefix":"2f5119732e8dbd63","mcp_get_code":{"code_sha256":"2f5119732e8dbd63"}},{"arxiv_id":"2502.12853","arxiv_id_is_arxiv":true,"paper":"/paper/s-2-r-teaching-llms-to-self-verify-and-self","title":"S$^2$R: Teaching LLMs to Self-verify and Self-correct via Reinforcement Learning","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nineabyss/s2r","path":"code/src/offline_trainer.py","file_url":"https://github.com/nineabyss/s2r/blob/HEAD/code/src/offline_trainer.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":"2f5119732e8dbd63","code_sha256_prefix":"2f5119732e8dbd63","mcp_get_code":{"code_sha256":"2f5119732e8dbd63"}},{"arxiv_id":"2307.07664","arxiv_id_is_arxiv":true,"paper":"/paper/outlier-detection-in-the-desi-bright-galaxy","title":"Outlier Detection in the DESI Bright Galaxy Survey","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":"archive","repo":"pmelchior/spender","path":"train/fp16_train.py","file_url":"https://github.com/pmelchior/spender/blob/HEAD/train/fp16_train.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":"c1bd08736ffac1e4","code_sha256_prefix":"c1bd08736ffac1e4","mcp_get_code":{"code_sha256":"c1bd08736ffac1e4"}},{"arxiv_id":"2305.18290","arxiv_id_is_arxiv":true,"paper":"/paper/direct-preference-optimization-your-language","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"padlex/trl","path":"trl/models/utils.py","file_url":"https://github.com/padlex/trl/blob/HEAD/trl/models/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":"2f5119732e8dbd63","code_sha256_prefix":"2f5119732e8dbd63","mcp_get_code":{"code_sha256":"2f5119732e8dbd63"}},{"arxiv_id":"1911.13299","arxiv_id_is_arxiv":true,"paper":"/paper/whats-hidden-in-a-randomly-weighted-neural","title":"What's Hidden in a Randomly Weighted Neural Network?","date":"2019-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"julianscher/SLTN-GA","path":"utilities/net_utils.py","file_url":"https://github.com/julianscher/SLTN-GA/blob/HEAD/utilities/net_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":"e9801080cb0de319","code_sha256_prefix":"e9801080cb0de319","mcp_get_code":{"code_sha256":"e9801080cb0de319"}},{"arxiv_id":"1909.05357","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-domain-detection-for-low-resource-text","title":"Out-of-Domain Detection for Low-Resource Text Classification Tasks","date":"2019-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLAD-ml/few-shot-ood","path":"src/all_parameters.py","file_url":"https://github.com/SLAD-ml/few-shot-ood/blob/HEAD/src/all_parameters.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":"6768286c9533263b","code_sha256_prefix":"6768286c9533263b","mcp_get_code":{"code_sha256":"6768286c9533263b"}},{"arxiv_id":"2021.findings-emnlp.138","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.138","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"inimah/protoinfomax","path":"src/all_parameters_intent.py","file_url":"https://github.com/inimah/protoinfomax/blob/HEAD/src/all_parameters_intent.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":"09c744894380b841","code_sha256_prefix":"09c744894380b841","mcp_get_code":{"code_sha256":"09c744894380b841"}},{"arxiv_id":"2021.findings-emnlp.138","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.138","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"inimah/protoinfomax","path":"src/all_parameters_sentiment.py","file_url":"https://github.com/inimah/protoinfomax/blob/HEAD/src/all_parameters_sentiment.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":"ca41d63e0dcfb1ed","code_sha256_prefix":"ca41d63e0dcfb1ed","mcp_get_code":{"code_sha256":"ca41d63e0dcfb1ed"}}],"record_sha256":"1f8e853e88c09a09a14559e19583bcca185aeab1ce447ebc8485b7143030e78f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}