{"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/normalize-score","entry":"normalize_score","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":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":3,"n_places":6,"n_places_pointer_only":4,"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":4,"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":"2606.02800","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02800","title":"Cosmos 3: Omnimodal World Models for Physical AI NVIDIA","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nvidia/cosmos","path":"evaluation/cosmos3/reasoner/vlmevalkit/cosmos_eval/parse_score.py","file_url":"https://github.com/nvidia/cosmos/blob/HEAD/evaluation/cosmos3/reasoner/vlmevalkit/cosmos_eval/parse_score.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nvidia/cosmos (NOASSERTION)","code_sha256":"31b64a89bbcc58d7","code_sha256_prefix":"31b64a89bbcc58d7","mcp_get_code":{"code_sha256":"31b64a89bbcc58d7"}},{"arxiv_id":"2603.18363","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18363","title":"PowerFlow: Unlocking the Dual Nature of LLMs via Principled Distribution Matching","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Chenruishuo/PowerFlow","path":"powerflow/reward_score_cw/joke_reward.py","file_url":"https://github.com/Chenruishuo/PowerFlow/blob/HEAD/powerflow/reward_score_cw/joke_reward.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Chenruishuo/PowerFlow when it was checked","code_sha256":"b0e684eb3611367e","code_sha256_prefix":"b0e684eb3611367e","mcp_get_code":{"code_sha256":"b0e684eb3611367e"}},{"arxiv_id":"2506.07972","arxiv_id_is_arxiv":true,"paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"egraph_extraction/program/metric.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/egraph_extraction/program/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d1082ba17362e02","code_sha256_prefix":"0d1082ba17362e02","mcp_get_code":{"code_sha256":"0d1082ba17362e02"}},{"arxiv_id":"2411.00056","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2411.00056","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":null,"repo":"DarianRodriguez/NegVerse","path":"negator/Evaluation/perplex_filter.py","file_url":"https://github.com/DarianRodriguez/NegVerse/blob/HEAD/negator/Evaluation/perplex_filter.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, DarianRodriguez/NegVerse when it was checked","code_sha256":"e531191aa453eafa","code_sha256_prefix":"e531191aa453eafa","mcp_get_code":{"code_sha256":"e531191aa453eafa"}},{"arxiv_id":"2404.16019","arxiv_id_is_arxiv":true,"paper":"/paper/the-prism-alignment-project-what","title":"The PRISM Alignment Dataset: What Participatory, Representative and Individualised Human Feedback Reveals About the Subjective and Multicultural Alignment of Large Language Models","date":"2024-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannahkirk/prism-alignment","path":"src/data_analysis/ranking.py","file_url":"https://github.com/hannahkirk/prism-alignment/blob/HEAD/src/data_analysis/ranking.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, hannahkirk/prism-alignment when it was checked","code_sha256":"e194f3f5f97031fd","code_sha256_prefix":"e194f3f5f97031fd","mcp_get_code":{"code_sha256":"e194f3f5f97031fd"}},{"arxiv_id":"2304.10466","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-deep-reinforcement-learning","title":"Efficient Deep Reinforcement Learning Requires Regulating Overfitting","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evgenii-nikishin/rl_with_resets","path":"discrete_control/eval_run_experiment.py","file_url":"https://github.com/evgenii-nikishin/rl_with_resets/blob/HEAD/discrete_control/eval_run_experiment.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":"71d1b50edc65f329","code_sha256_prefix":"71d1b50edc65f329","mcp_get_code":{"code_sha256":"71d1b50edc65f329"}}],"record_sha256":"4a181f53d2bc64f8c746a1a9e179790c8ca2248743b36f74267009ca06ab0ec3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}