{"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/first-true-indices","entry":"first_true_indices","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":0,"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":"2602.13551","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13551","title":"Small Reward Models via Backward Inference","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yikee/FLIP","path":"open-instruct/open_instruct/model_utils.py","file_url":"https://github.com/yikee/FLIP/blob/HEAD/open-instruct/open_instruct/model_utils.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, yikee/FLIP when it was checked","code_sha256":"b2c0bb9254a04a7d","code_sha256_prefix":"b2c0bb9254a04a7d","mcp_get_code":{"code_sha256":"b2c0bb9254a04a7d"}},{"arxiv_id":"2506.20629","arxiv_id_is_arxiv":true,"paper":"/paper/plop-precise-lora-placement-for-efficient","title":"PLoP: Precise LoRA Placement for Efficient Finetuning of Large Models","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soufiane001/plop","path":"sft/model_utils.py","file_url":"https://github.com/soufiane001/plop/blob/HEAD/sft/model_utils.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, soufiane001/plop when it was checked","code_sha256":"b2c0bb9254a04a7d","code_sha256_prefix":"b2c0bb9254a04a7d","mcp_get_code":{"code_sha256":"b2c0bb9254a04a7d"}},{"arxiv_id":"2503.13538","arxiv_id_is_arxiv":true,"paper":"/paper/from-demonstrations-to-rewards-alignment","title":"From Demonstrations to Rewards: Alignment Without Explicit Human Preferences","date":"2025-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hong-Lab-UMN-ECE/IRLAlignment","path":"summarize_from_feedback_details/IRL_reward.py","file_url":"https://github.com/Hong-Lab-UMN-ECE/IRLAlignment/blob/HEAD/summarize_from_feedback_details/IRL_reward.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579f0202bb30e003","code_sha256_prefix":"579f0202bb30e003","mcp_get_code":{"code_sha256":"579f0202bb30e003"}},{"arxiv_id":"2410.04612","arxiv_id_is_arxiv":true,"paper":"/paper/regressing-the-relative-future-efficient","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaolingao/refuel","path":"setting_two/anthropic_hh/refuel.py","file_url":"https://github.com/zhaolingao/refuel/blob/HEAD/setting_two/anthropic_hh/refuel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579f0202bb30e003","code_sha256_prefix":"579f0202bb30e003","mcp_get_code":{"code_sha256":"579f0202bb30e003"}},{"arxiv_id":"2404.16767","arxiv_id_is_arxiv":true,"paper":"/paper/rebel-reinforcement-learning-via-regressing","title":"REBEL: Reinforcement Learning via Regressing Relative Rewards","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaolingao/rebel","path":"src/nectar/rebel.py","file_url":"https://github.com/zhaolingao/rebel/blob/HEAD/src/nectar/rebel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579f0202bb30e003","code_sha256_prefix":"579f0202bb30e003","mcp_get_code":{"code_sha256":"579f0202bb30e003"}},{"arxiv_id":"2403.17031","arxiv_id_is_arxiv":true,"paper":"/paper/the-n-implementation-details-of-rlhf-with-ppo","title":"The N+ Implementation Details of RLHF with PPO: A Case Study on TL;DR Summarization","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vwxyzjn/summarize_from_feedback_details","path":"summarize_from_feedback_details/dpo.py","file_url":"https://github.com/vwxyzjn/summarize_from_feedback_details/blob/HEAD/summarize_from_feedback_details/dpo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579f0202bb30e003","code_sha256_prefix":"579f0202bb30e003","mcp_get_code":{"code_sha256":"579f0202bb30e003"}}],"record_sha256":"6e022db45b4d678a503f97b89b458ba98940cecec557108a27af84c7c5bdd3fe","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}