{"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/select-model","entry":"select_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":8,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"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":6},"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":"2605.25954","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25954","title":"Step-TP: A Grounded, Step-Level Dataset with Chain-of-Thought Reasoning for LLM-Guided Tensor Program Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LIUMENGFAN-gif/StepTP","path":"pytorch_model_to_IR.py","file_url":"https://github.com/LIUMENGFAN-gif/StepTP/blob/HEAD/pytorch_model_to_IR.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, LIUMENGFAN-gif/StepTP when it was checked","code_sha256":"c0f4530ea2420cea","code_sha256_prefix":"c0f4530ea2420cea","mcp_get_code":{"code_sha256":"c0f4530ea2420cea"}},{"arxiv_id":"2407.16893","arxiv_id_is_arxiv":true,"paper":"/paper/the-price-of-prompting-profiling-energy-use","title":"The Price of Prompting: Profiling Energy Use in Large Language Models Inference","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejhusom/melodi","path":"src/train_forecasting_model.py","file_url":"https://github.com/ejhusom/melodi/blob/HEAD/src/train_forecasting_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ejhusom/melodi when it was checked","code_sha256":"fe26277272cef0d4","code_sha256_prefix":"fe26277272cef0d4","mcp_get_code":{"code_sha256":"fe26277272cef0d4"}},{"arxiv_id":"2403.15744","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-fragility-of-active-learners","title":"On the Fragility of Active Learners for Text Classification","date":"2024-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThuongTNguyen/ALchemist","path":"core/model_selection.py","file_url":"https://github.com/ThuongTNguyen/ALchemist/blob/HEAD/core/model_selection.py","status":"unverified","verification_level":0,"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, ThuongTNguyen/ALchemist when it was checked","code_sha256":"142b553f00dd3941","code_sha256_prefix":"142b553f00dd3941","mcp_get_code":{"code_sha256":"142b553f00dd3941"}},{"arxiv_id":"2311.02061","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-based-species-range-1","title":"Active Learning-Based Species Range Estimation","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chris-lange/SDM_active_sampling","path":"backbone/models.py","file_url":"https://github.com/Chris-lange/SDM_active_sampling/blob/HEAD/backbone/models.py","status":"unverified","verification_level":0,"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, Chris-lange/SDM_active_sampling when it was checked","code_sha256":"95b6d404a196c5b9","code_sha256_prefix":"95b6d404a196c5b9","mcp_get_code":{"code_sha256":"95b6d404a196c5b9"}},{"arxiv_id":"2303.06818","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-defense-via-deconfounded","title":"Backdoor Defense via Deconfounded Representation Learning","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/cbd","path":"models/selector.py","file_url":"https://github.com/zaixizhang/cbd/blob/HEAD/models/selector.py","status":"unverified","verification_level":0,"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, zaixizhang/cbd when it was checked","code_sha256":"7206434d1565c3bf","code_sha256_prefix":"7206434d1565c3bf","mcp_get_code":{"code_sha256":"7206434d1565c3bf"}},{"arxiv_id":"2205.05675","arxiv_id_is_arxiv":true,"paper":"/paper/ntire-2022-challenge-on-efficient-super","title":"NTIRE 2022 Challenge on Efficient Super-Resolution: Methods and Results","date":"2022-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofsoundof/ntire2022_esr","path":"test_demo.py","file_url":"https://github.com/ofsoundof/ntire2022_esr/blob/HEAD/test_demo.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":"fa6d35e1f431f8a9","code_sha256_prefix":"fa6d35e1f431f8a9","mcp_get_code":{"code_sha256":"fa6d35e1f431f8a9"}},{"arxiv_id":"2006.07543","arxiv_id_is_arxiv":true,"paper":"/paper/gan-memory-with-no-forgetting","title":"GAN Memory with No Forgetting","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MiaoyunZhao/GANmemory_LifelongLearning","path":"Lifelong_classification.py","file_url":"https://github.com/MiaoyunZhao/GANmemory_LifelongLearning/blob/HEAD/Lifelong_classification.py","status":"unverified","verification_level":0,"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, MiaoyunZhao/GANmemory_LifelongLearning when it was checked","code_sha256":"68139f5e5b919e9b","code_sha256_prefix":"68139f5e5b919e9b","mcp_get_code":{"code_sha256":"68139f5e5b919e9b"}},{"arxiv_id":"1810.12715","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-effectiveness-of-interval-bound","title":"On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungyoon-lee/bcp","path":"utils.py","file_url":"https://github.com/sungyoon-lee/bcp/blob/HEAD/utils.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":"bb465636abefa4b4","code_sha256_prefix":"bb465636abefa4b4","mcp_get_code":{"code_sha256":"bb465636abefa4b4"}}],"record_sha256":"a741a2e2ff1cdc1b4ee583ac2bca5136e95ca8e2cab3103ac15d7ec5d5479565","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}