{"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/list-of-ints","entry":"list_of_ints","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":5,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2506.15698","paper":null,"title":"arXiv:2506.15698","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yunhak0/Spotscape","path":"utils/utils.py","file_url":"https://github.com/yunhak0/Spotscape/blob/HEAD/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d1ac1a66da5f14c","mcp_get_code":{"code_sha256":"7d1ac1a66da5f14c"}},{"arxiv_id":"2410.09671","paper":"/paper/openr-an-open-source-framework-for-advanced","title":"OpenR: An Open Source Framework for Advanced Reasoning with Large Language Models","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openreasoner/openr","path":"config/config_utils.py","file_url":"https://github.com/openreasoner/openr/blob/HEAD/config/config_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d1ac1a66da5f14c","mcp_get_code":{"code_sha256":"7d1ac1a66da5f14c"}},{"arxiv_id":"2407.15913","paper":"/paper/test-time-low-rank-adaptation-via-confidence","title":"Test-Time Low Rank Adaptation via Confidence Maximization for Zero-Shot Generalization of Vision-Language Models","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"razaimam45/ttl-test-time-low-rank-adaptation","path":"ttl.py","file_url":"https://github.com/razaimam45/ttl-test-time-low-rank-adaptation/blob/HEAD/ttl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d1ac1a66da5f14c","mcp_get_code":{"code_sha256":"7d1ac1a66da5f14c"}},{"arxiv_id":"2310.19046","paper":"/paper/large-language-models-as-evolutionary","title":"Large Language Models as Evolutionary Optimizers","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cschen1205/lmea","path":"src/executor.py","file_url":"https://github.com/cschen1205/lmea/blob/HEAD/src/executor.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d1ac1a66da5f14c","mcp_get_code":{"code_sha256":"7d1ac1a66da5f14c"}},{"arxiv_id":"2309.17179","paper":"/paper/alphazero-like-tree-search-can-guide-large","title":"Alphazero-like Tree-Search can Guide Large Language Model Decoding and Training","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waterhorse1/llm_tree_search","path":"tsllm/argparse_utils.py","file_url":"https://github.com/waterhorse1/llm_tree_search/blob/HEAD/tsllm/argparse_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d1ac1a66da5f14c","mcp_get_code":{"code_sha256":"7d1ac1a66da5f14c"}}]}