{"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/generate-prompts","entry":"generate_prompts","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":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":12,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":8,"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":7,"ran_fixture":0,"ran":2,"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":"2502.20332","arxiv_id_is_arxiv":true,"paper":"/paper/emergent-symbolic-mechanisms-support-abstract","title":"Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukang123/LLMSymbMech","path":"tasks/identity_rules/cma.py","file_url":"https://github.com/yukang123/LLMSymbMech/blob/HEAD/tasks/identity_rules/cma.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yukang123/LLMSymbMech when it was checked","code_sha256":"656876ecdbda8a01","code_sha256_prefix":"656876ecdbda8a01","mcp_get_code":{"code_sha256":"656876ecdbda8a01"}},{"arxiv_id":"2502.20332","arxiv_id_is_arxiv":true,"paper":"/paper/emergent-symbolic-mechanisms-support-abstract","title":"Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukang123/LLMSymbMech","path":"tasks/identity_rules/rsa.py","file_url":"https://github.com/yukang123/LLMSymbMech/blob/HEAD/tasks/identity_rules/rsa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yukang123/LLMSymbMech when it was checked","code_sha256":"272afe9f573bef03","code_sha256_prefix":"272afe9f573bef03","mcp_get_code":{"code_sha256":"272afe9f573bef03"}},{"arxiv_id":"2407.05700","arxiv_id_is_arxiv":true,"paper":"/paper/inversecoder-unleashing-the-power-of","title":"InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyt2000/InverseCoder","path":"src/InstGen/sample_vllm.py","file_url":"https://github.com/wyt2000/InverseCoder/blob/HEAD/src/InstGen/sample_vllm.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, wyt2000/InverseCoder when it was checked","code_sha256":"b5bde94f66a46787","code_sha256_prefix":"b5bde94f66a46787","mcp_get_code":{"code_sha256":"b5bde94f66a46787"}},{"arxiv_id":"2407.05700","arxiv_id_is_arxiv":true,"paper":"/paper/inversecoder-unleashing-the-power-of","title":"InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyt2000/InverseCoder","path":"src/InstGen/sample_vllm_parallel.py","file_url":"https://github.com/wyt2000/InverseCoder/blob/HEAD/src/InstGen/sample_vllm_parallel.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, wyt2000/InverseCoder when it was checked","code_sha256":"bcd581a56aa8495e","code_sha256_prefix":"bcd581a56aa8495e","mcp_get_code":{"code_sha256":"bcd581a56aa8495e"}},{"arxiv_id":"2407.05700","arxiv_id_is_arxiv":true,"paper":"/paper/inversecoder-unleashing-the-power-of","title":"InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyt2000/InverseCoder","path":"src/InstGen/sample_vllm_parallel_description_prompt.py","file_url":"https://github.com/wyt2000/InverseCoder/blob/HEAD/src/InstGen/sample_vllm_parallel_description_prompt.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, wyt2000/InverseCoder when it was checked","code_sha256":"dd2e6518d155b0b2","code_sha256_prefix":"dd2e6518d155b0b2","mcp_get_code":{"code_sha256":"dd2e6518d155b0b2"}},{"arxiv_id":"2407.02099","arxiv_id_is_arxiv":true,"paper":"/paper/helpful-assistant-or-fruitful-facilitator","title":"Helpful assistant or fruitful facilitator? Investigating how personas affect language model behavior","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peluz/persona-behavior","path":"dataloaders/loaders.py","file_url":"https://github.com/peluz/persona-behavior/blob/HEAD/dataloaders/loaders.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":"62f9ebf49705f32b","code_sha256_prefix":"62f9ebf49705f32b","mcp_get_code":{"code_sha256":"62f9ebf49705f32b"}},{"arxiv_id":"2404.19097","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-capability-of-llms-in","title":"Exploring the Capability of LLMs in Performing Low-Level Visual Analytic Tasks on SVG Data Visualizations","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"lebretou/svg_taxonomy","path":"llm/gen_prompt.py","file_url":"https://github.com/lebretou/svg_taxonomy/blob/HEAD/llm/gen_prompt.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, lebretou/svg_taxonomy when it was checked","code_sha256":"c3c10b4c0cfdaf38","code_sha256_prefix":"c3c10b4c0cfdaf38","mcp_get_code":{"code_sha256":"c3c10b4c0cfdaf38"}},{"arxiv_id":"2403.17830","arxiv_id_is_arxiv":true,"paper":"/paper/assessment-of-multimodal-large-language","title":"Assessment of Multimodal Large Language Models in Alignment with Human Values","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openlamm/lamm","path":"src/cli_demo.py","file_url":"https://github.com/openlamm/lamm/blob/HEAD/src/cli_demo.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, openlamm/lamm when it was checked","code_sha256":"71cd975643cb84c4","code_sha256_prefix":"71cd975643cb84c4","mcp_get_code":{"code_sha256":"71cd975643cb84c4"}},{"arxiv_id":"2312.04350","arxiv_id_is_arxiv":true,"paper":"/paper/cladder-a-benchmark-to-assess-causal-1","title":"CLadder: Assessing Causal Reasoning in Language Models","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causalNLP/cladder","path":"causalbenchmark/eval/generate_data_llama.py","file_url":"https://github.com/causalNLP/cladder/blob/HEAD/causalbenchmark/eval/generate_data_llama.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a82e2d14a589b26","code_sha256_prefix":"9a82e2d14a589b26","mcp_get_code":{"code_sha256":"9a82e2d14a589b26"}},{"arxiv_id":"2310.20410","arxiv_id_is_arxiv":true,"paper":"/paper/followbench-a-multi-level-fine-grained","title":"FollowBench: A Multi-level Fine-grained Constraints Following Benchmark for Large Language Models","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjiangcm/followbench","path":"code/model_inference_vllm.py","file_url":"https://github.com/yjiangcm/followbench/blob/HEAD/code/model_inference_vllm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"64ccb272d8fc116a","code_sha256_prefix":"64ccb272d8fc116a","mcp_get_code":{"code_sha256":"64ccb272d8fc116a"}},{"arxiv_id":"2306.03082","arxiv_id_is_arxiv":true,"paper":"/paper/instructzero-efficient-instruction","title":"InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lichang-chen/instructzero","path":"InstructZero/experiments/automatic_prompt_engineer/generate.py","file_url":"https://github.com/lichang-chen/instructzero/blob/HEAD/InstructZero/experiments/automatic_prompt_engineer/generate.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, lichang-chen/instructzero when it was checked","code_sha256":"3da4ab7760bb2fb6","code_sha256_prefix":"3da4ab7760bb2fb6","mcp_get_code":{"code_sha256":"3da4ab7760bb2fb6"}},{"arxiv_id":"2305.10764","arxiv_id_is_arxiv":true,"paper":"/paper/openshape-scaling-up-3d-shape-representation-1","title":"OpenShape: Scaling Up 3D Shape Representation Towards Open-World Understanding","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Colin97/OpenShape_code","path":"src/extract_lvis_feat_ulip.py","file_url":"https://github.com/Colin97/OpenShape_code/blob/HEAD/src/extract_lvis_feat_ulip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"179cbecb2cbf9048","code_sha256_prefix":"179cbecb2cbf9048","mcp_get_code":{"code_sha256":"179cbecb2cbf9048"}}],"record_sha256":"45d0379cc5fde0530aeba398b22eb69ad58394c6995516eec063151edcea44a8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}