{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-max-saved-index","entry":"get_max_saved_index","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2604.00536","paper":"/paper/arxiv-2604-00536","title":"Optimsyn: Influence-Guided Rubrics Optimization for Synthetic Data Generation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"FanZT6/OptimSyn","path":"training/influence/collect_grad_reps.py","file_url":"https://github.com/FanZT6/OptimSyn/blob/HEAD/training/influence/collect_grad_reps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed43dd7816626e87","mcp_get_code":{"code_sha256":"ed43dd7816626e87"}},{"arxiv_id":"2602.08351","paper":"/paper/arxiv-2602-08351","title":"The Chicken and Egg Dilemma: Co-optimizing Data and Model Configurations for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"princeton-nlp/LESS","path":"less/data_selection/collect_grad_reps.py","file_url":"https://github.com/princeton-nlp/LESS/blob/HEAD/less/data_selection/collect_grad_reps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed43dd7816626e87","mcp_get_code":{"code_sha256":"ed43dd7816626e87"}},{"arxiv_id":"2411.12882","paper":"/paper/prosec-fortifying-code-llms-with-proactive","title":"ProSec: Fortifying Code LLMs with Proactive Security Alignment","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PurCL/ProSec","path":"influence_score/collect_grad_reps.py","file_url":"https://github.com/PurCL/ProSec/blob/HEAD/influence_score/collect_grad_reps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed43dd7816626e87","mcp_get_code":{"code_sha256":"ed43dd7816626e87"}},{"arxiv_id":"2407.15235","paper":"/paper/tagcos-task-agnostic-gradient-clustered","title":"TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Data","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2003pro/tagcos","path":"data_selection/collect_grad_reps.py","file_url":"https://github.com/2003pro/tagcos/blob/HEAD/data_selection/collect_grad_reps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed43dd7816626e87","mcp_get_code":{"code_sha256":"ed43dd7816626e87"}},{"arxiv_id":"2402.04333","paper":"/paper/less-selecting-influential-data-for-targeted","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/less","path":"less/data_selection/collect_grad_reps.py","file_url":"https://github.com/princeton-nlp/less/blob/HEAD/less/data_selection/collect_grad_reps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed43dd7816626e87","mcp_get_code":{"code_sha256":"ed43dd7816626e87"}}]}