{"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/query-gpt","entry":"query_gpt","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":5,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2406.13356","arxiv_id_is_arxiv":true,"paper":"/paper/jogging-the-memory-of-unlearned-model-through","title":"Jogging the Memory of Unlearned LLMs Through Targeted Relearning Attacks","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-huu/jog_llm_memory","path":"wmdp/src/gpt4_eval.py","file_url":"https://github.com/s-huu/jog_llm_memory/blob/HEAD/wmdp/src/gpt4_eval.py","status":"unverified","verification_level":0,"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":"87698f5388a86342","code_sha256_prefix":"87698f5388a86342","mcp_get_code":{"code_sha256":"87698f5388a86342"}},{"arxiv_id":"2402.12501","arxiv_id_is_arxiv":true,"paper":"/paper/your-vision-language-model-itself-is-a-strong","title":"Your Vision-Language Model Itself Is a Strong Filter: Towards High-Quality Instruction Tuning with Data Selection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rayruibochen/self-filter","path":"data_process/query_gpt_text_models.py","file_url":"https://github.com/rayruibochen/self-filter/blob/HEAD/data_process/query_gpt_text_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, rayruibochen/self-filter, is not in the permissive set Syntology serves inline","code_sha256":"841b22f7ec0e92b2","code_sha256_prefix":"841b22f7ec0e92b2","mcp_get_code":{"code_sha256":"841b22f7ec0e92b2"}},{"arxiv_id":"2402.07867","arxiv_id_is_arxiv":true,"paper":"/paper/poisonedrag-knowledge-poisoning-attacks-to","title":"PoisonedRAG: Knowledge Corruption Attacks to Retrieval-Augmented Generation of Large Language Models","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sleeepeer/poisonedrag","path":"gen_adv.py","file_url":"https://github.com/sleeepeer/poisonedrag/blob/HEAD/gen_adv.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":"e238bddbf3216308","code_sha256_prefix":"e238bddbf3216308","mcp_get_code":{"code_sha256":"e238bddbf3216308"}},{"arxiv_id":"2402.05110","arxiv_id_is_arxiv":true,"paper":"/paper/opening-the-ai-black-box-program-synthesis","title":"Opening the AI black box: program synthesis via mechanistic interpretability","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/neural-verification","path":"gpt4/prompt.py","file_url":"https://github.com/ejmichaud/neural-verification/blob/HEAD/gpt4/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, ejmichaud/neural-verification when it was checked","code_sha256":"e4e4bb276d873fd8","code_sha256_prefix":"e4e4bb276d873fd8","mcp_get_code":{"code_sha256":"e4e4bb276d873fd8"}},{"arxiv_id":"2308.04948","arxiv_id_is_arxiv":true,"paper":"/paper/extrapolating-large-language-models-to-non","title":"Extrapolating Large Language Models to Non-English by Aligning Languages","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NJUNLP/x-LLM","path":"eval/mieval.eval.py","file_url":"https://github.com/NJUNLP/x-LLM/blob/HEAD/eval/mieval.eval.py","status":"unverified","verification_level":0,"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":"6e52ceed817396ba","code_sha256_prefix":"6e52ceed817396ba","mcp_get_code":{"code_sha256":"6e52ceed817396ba"}}],"record_sha256":"c0438b7f23910ec0ba50ce2c1df552da8b205812262cb28bd2f41a5f096aa97f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}