{"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/get-all-data","entry":"get_all_data","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":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":4,"ran_fixture":0,"ran":1,"unverified":1},"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":"2510.03904","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03904","title":"LLM as an Algorithmist: Enhancing Anomaly Detectors via Programmatic Synthesis","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"HangtingYe/LLM_DAS","path":"main_baseline_pyod.py","file_url":"https://github.com/HangtingYe/LLM_DAS/blob/HEAD/main_baseline_pyod.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, HangtingYe/LLM_DAS when it was checked","code_sha256":"10ea8df344ae6102","code_sha256_prefix":"10ea8df344ae6102","mcp_get_code":{"code_sha256":"10ea8df344ae6102"}},{"arxiv_id":"2407.19845","arxiv_id_is_arxiv":true,"paper":"/paper/backdoorbench-a-comprehensive-benchmark-and-1","title":"BackdoorBench: A Comprehensive Benchmark and Analysis of Backdoor Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sclbd/backdoorbench","path":"backdoorbench_nlp/attack/hiddenkiller/attack_hiddenkiller.py","file_url":"https://github.com/sclbd/backdoorbench/blob/HEAD/backdoorbench_nlp/attack/hiddenkiller/attack_hiddenkiller.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sclbd/backdoorbench (NOASSERTION)","code_sha256":"70493a0d9a933777","code_sha256_prefix":"70493a0d9a933777","mcp_get_code":{"code_sha256":"70493a0d9a933777"}},{"arxiv_id":"2407.19845","arxiv_id_is_arxiv":true,"paper":"/paper/backdoorbench-a-comprehensive-benchmark-and-1","title":"BackdoorBench: A Comprehensive Benchmark and Analysis of Backdoor Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sclbd/backdoorbench","path":"backdoorbench_nlp/attack/hiddenkiller/generate_by_openattack.py","file_url":"https://github.com/sclbd/backdoorbench/blob/HEAD/backdoorbench_nlp/attack/hiddenkiller/generate_by_openattack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sclbd/backdoorbench (NOASSERTION)","code_sha256":"68d3f51b067a8c7c","code_sha256_prefix":"68d3f51b067a8c7c","mcp_get_code":{"code_sha256":"68d3f51b067a8c7c"}},{"arxiv_id":"2401.00741","arxiv_id_is_arxiv":true,"paper":"/paper/tooleyes-fine-grained-evaluation-for-tool","title":"ToolEyes: Fine-Grained Evaluation for Tool Learning Capabilities of Large Language Models in Real-world Scenarios","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjie-ye/tooleyes","path":"Code/Evaluation/eval_pipeline.py","file_url":"https://github.com/junjie-ye/tooleyes/blob/HEAD/Code/Evaluation/eval_pipeline.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":"c6d88ff0b3830f82","code_sha256_prefix":"c6d88ff0b3830f82","mcp_get_code":{"code_sha256":"c6d88ff0b3830f82"}},{"arxiv_id":"2011.10369","arxiv_id_is_arxiv":true,"paper":"/paper/onion-a-simple-and-effective-defense-against","title":"ONION: A Simple and Effective Defense Against Textual Backdoor Attacks","date":"2020-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/ONION","path":"experiments/run_poison_bert.py","file_url":"https://github.com/thunlp/ONION/blob/HEAD/experiments/run_poison_bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0762630368cd3261","code_sha256_prefix":"0762630368cd3261","mcp_get_code":{"code_sha256":"0762630368cd3261"}},{"arxiv_id":"1812.01601","arxiv_id_is_arxiv":true,"paper":"/paper/learning-3d-human-dynamics-from-video","title":"Learning 3D Human Dynamics from Video","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akanazawa/human_dynamics","path":"src/datasets/h36_to_tfrecords_video.py","file_url":"https://github.com/akanazawa/human_dynamics/blob/HEAD/src/datasets/h36_to_tfrecords_video.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0575ea0e8e017a77","code_sha256_prefix":"0575ea0e8e017a77","mcp_get_code":{"code_sha256":"0575ea0e8e017a77"}}],"record_sha256":"a3295c64f6b9697a4e80285311eb5c4dbc8b2c6c255e41e608e9b5d3ee038795","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}