{"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-strings","entry":"list_of_strings","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":9,"n_papers_ran":9,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"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":"2412.16577","paper":"/paper/a-meta-learning-approach-to-bayesian-causal","title":"A Meta-Learning Approach to Bayesian Causal Discovery","date":"2024-12-21","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":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2412.09353","paper":"/paper/causal-graphical-models-for-vision-language","title":"Causal Graphical Models for Vision-Language Compositional Understanding","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aimagelab/COGT","path":"paths.py","file_url":"https://github.com/aimagelab/COGT/blob/HEAD/paths.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2412.01572","paper":"/paper/mba-rag-a-bandit-approach-for-adaptive","title":"MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futureeeeee/mba","path":"MAB/train_mab_mo_multiple.py","file_url":"https://github.com/futureeeeee/mba/blob/HEAD/MAB/train_mab_mo_multiple.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2408.09078","paper":"/paper/an-exploratory-study-on-fine-tuning-large","title":"An Exploratory Study on Fine-Tuning Large Language Models for Secure Code Generation","date":null,"month_inferred_from_arxiv_id":"2024-08","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":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2403.13027","paper":"/paper/towards-better-statistical-understanding-of","title":"Towards Better Statistical Understanding of Watermarking LLMs","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongzecai/dualga","path":"WatermarkAlgorithm/DualGD_generate.py","file_url":"https://github.com/zhongzecai/dualga/blob/HEAD/WatermarkAlgorithm/DualGD_generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2403.13027","paper":"/paper/towards-better-statistical-understanding-of","title":"Towards Better Statistical Understanding of Watermarking LLMs","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongzecai/dualga","path":"WatermarkAlgorithm/MinACF_eval.py","file_url":"https://github.com/zhongzecai/dualga/blob/HEAD/WatermarkAlgorithm/MinACF_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"571045e954da6d27","mcp_get_code":{"code_sha256":"571045e954da6d27"}},{"arxiv_id":"2402.15570","paper":"/paper/fast-adversarial-attacks-on-language-models","title":"Fast Adversarial Attacks on Language Models In One GPU Minute","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinusankars/beast","path":"ar_self_attack.py","file_url":"https://github.com/vinusankars/beast/blob/HEAD/ar_self_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2308.13320","paper":"/paper/fine-tuning-can-cripple-your-foundation-model","title":"Fine-tuning can cripple your foundation model; preserving features may be the solution","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omegafragger/ldifs_code","path":"args.py","file_url":"https://github.com/omegafragger/ldifs_code/blob/HEAD/args.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2112.05745","paper":"/paper/a-simple-and-efficient-sampling-based","title":"A Simple and Efficient Sampling-based Algorithm for General Reachability Analysis","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordasl/stochasticedl","path":"benchmark_main.py","file_url":"https://github.com/stanfordasl/stochasticedl/blob/HEAD/benchmark_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}}]}