{"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/list-of-strings","entry":"list_of_strings","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":7,"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":2,"ran_fixture":0,"ran":0,"unverified":0},"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":"2412.16577","arxiv_id_is_arxiv":true,"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,"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":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2412.09353","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aimagelab/COGT when it was checked","code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2412.01572","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2408.09078","arxiv_id_is_arxiv":true,"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,"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":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2403.13027","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhongzecai/dualga when it was checked","code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2403.13027","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhongzecai/dualga when it was checked","code_sha256":"571045e954da6d27","code_sha256_prefix":"571045e954da6d27","mcp_get_code":{"code_sha256":"571045e954da6d27"}},{"arxiv_id":"2402.15570","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vinusankars/beast when it was checked","code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2310.19046","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cschen1205/lmea when it was checked","code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2308.13320","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}},{"arxiv_id":"2112.05745","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19ee4683eda506c6","code_sha256_prefix":"19ee4683eda506c6","mcp_get_code":{"code_sha256":"19ee4683eda506c6"}}],"record_sha256":"5e2a30e9a889aa8425e7561f7be41984829819aa0621f89e117ad96ac152e166","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}