{"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/load-trained-model","entry":"load_trained_model","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":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2505.20162","arxiv_id_is_arxiv":true,"paper":"/paper/capability-based-scaling-laws-for-llm-red","title":"Capability-Based Scaling Laws for LLM Red-Teaming","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kotekjedi/capability-based-scaling","path":"evaluation/harmbench_eval.py","file_url":"https://github.com/kotekjedi/capability-based-scaling/blob/HEAD/evaluation/harmbench_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"640ce73d00b1d475","code_sha256_prefix":"640ce73d00b1d475","mcp_get_code":{"code_sha256":"640ce73d00b1d475"}},{"arxiv_id":"2405.05347","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-educational-program-repair","title":"Benchmarking Educational Program Repair","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koutchemecharles/gaied_nips23","path":"src/repair/training.py","file_url":"https://github.com/koutchemecharles/gaied_nips23/blob/HEAD/src/repair/training.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, koutchemecharles/gaied_nips23 when it was checked","code_sha256":"1f16482bc7562fd2","code_sha256_prefix":"1f16482bc7562fd2","mcp_get_code":{"code_sha256":"1f16482bc7562fd2"}},{"arxiv_id":"2203.06768","arxiv_id_is_arxiv":true,"paper":"/paper/algorithmic-recourse-in-the-face-of-noisy","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","date":"2022-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MartinPawel/ProbabilisticallyRobustRecourse","path":"carla/models/catalog/load_model.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/models/catalog/load_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab78eace1f03136c","code_sha256_prefix":"ab78eace1f03136c","mcp_get_code":{"code_sha256":"ab78eace1f03136c"}},{"arxiv_id":"2108.00783","arxiv_id_is_arxiv":true,"paper":"/paper/carla-a-python-library-to-benchmark","title":"CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithms","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"indyfree/CARLA","path":"carla/models/catalog/load_model.py","file_url":"https://github.com/indyfree/CARLA/blob/HEAD/carla/models/catalog/load_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a86c4a61b987d962","code_sha256_prefix":"a86c4a61b987d962","mcp_get_code":{"code_sha256":"a86c4a61b987d962"}},{"arxiv_id":"1910.10288","arxiv_id_is_arxiv":true,"paper":"/paper/location-relative-attention-mechanisms-for","title":"Location-Relative Attention Mechanisms For Robust Long-Form Speech Synthesis","date":"2019-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anandaswarup/TTS","path":"tts_Synthesis.py","file_url":"https://github.com/anandaswarup/TTS/blob/HEAD/tts_Synthesis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"91be03213654f639","code_sha256_prefix":"91be03213654f639","mcp_get_code":{"code_sha256":"91be03213654f639"}},{"arxiv_id":"1712.05884","arxiv_id_is_arxiv":true,"paper":"/paper/natural-tts-synthesis-by-conditioning-wavenet","title":"Natural TTS Synthesis by Conditioning WaveNet on Mel Spectrogram Predictions","date":"2017-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anandaswarup/rnn-tts","path":"tts_Synthesis.py","file_url":"https://github.com/anandaswarup/rnn-tts/blob/HEAD/tts_Synthesis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"91be03213654f639","code_sha256_prefix":"91be03213654f639","mcp_get_code":{"code_sha256":"91be03213654f639"}},{"arxiv_id":"1703.10135","arxiv_id_is_arxiv":true,"paper":"/paper/tacotron-towards-end-to-end-speech-synthesis","title":"Tacotron: Towards End-to-End Speech Synthesis","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"91be03213654f639","code_sha256_prefix":"91be03213654f639","mcp_get_code":{"code_sha256":"91be03213654f639"}}],"record_sha256":"ca6e032d72775db92f5b8b524eb3bdfb8f54f7e62871364b435d251830199b1e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}