{"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/formatter","entry":"formatter","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":6,"n_papers_ran":6,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"unverified":0},"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":"2608.06310","paper":"/paper/arxiv-2608-06310","title":"RRC: Unlocking Generative Reward Models in LLM Reinforcement Learning via Ranking-Based Reward Construction","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"allenai/WildBench","path":"leaderboard/data_utils.py","file_url":"https://github.com/allenai/WildBench/blob/HEAD/leaderboard/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e6e6e2172255fa63","mcp_get_code":{"code_sha256":"e6e6e2172255fa63"}},{"arxiv_id":"2501.17827","paper":"/paper/langevin-soft-actor-critic-efficient","title":"Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning","date":"2025-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmishfaq/lsac","path":"lsac.py","file_url":"https://github.com/hmishfaq/lsac/blob/HEAD/lsac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e059d3b24974ac1","mcp_get_code":{"code_sha256":"5e059d3b24974ac1"}},{"arxiv_id":"2406.04770","paper":"/paper/wildbench-benchmarking-llms-with-challenging","title":"WildBench: Benchmarking LLMs with Challenging Tasks from Real Users in the Wild","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/wildbench","path":"leaderboard/data_utils.py","file_url":"https://github.com/allenai/wildbench/blob/HEAD/leaderboard/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e6e6e2172255fa63","mcp_get_code":{"code_sha256":"e6e6e2172255fa63"}},{"arxiv_id":"1909.06161","paper":"/paper/brain-like-object-recognition-with-high","title":"Brain-Like Object Recognition with High-Performing Shallow Recurrent ANNs","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dicarlolab/neurips2019","path":"figures.py","file_url":"https://github.com/dicarlolab/neurips2019/blob/HEAD/figures.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d96e618007f3f5b","mcp_get_code":{"code_sha256":"7d96e618007f3f5b"}},{"arxiv_id":"1905.11286","paper":"/paper/stochastic-gradient-methods-with-layer-wise","title":"Stochastic Gradient Methods with Layer-wise Adaptive Moments for Training of Deep Networks","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Edresson/VoiceSplit","path":"generator_paper.py","file_url":"https://github.com/Edresson/VoiceSplit/blob/HEAD/generator_paper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9563ca1187f4def1","mcp_get_code":{"code_sha256":"9563ca1187f4def1"}},{"arxiv_id":"1810.04826","paper":"/paper/voicefilter-targeted-voice-separation-by","title":"VoiceFilter: Targeted Voice Separation by Speaker-Conditioned Spectrogram Masking","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maum-ai/voicefilter","path":"generator.py","file_url":"https://github.com/maum-ai/voicefilter/blob/HEAD/generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9563ca1187f4def1","mcp_get_code":{"code_sha256":"9563ca1187f4def1"}}]}