{"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/parse-pred-ans","entry":"parse_pred_ans","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":2,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":2,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":7,"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":3,"ran_fixture":0,"ran":0,"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":"2411.05282","arxiv_id_is_arxiv":true,"paper":"/paper/microscopiq-accelerating-foundational-models","title":"MicroScopiQ: Accelerating Foundational Models through Outlier-Aware Microscaling Quantization","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgia-tech-synergy-lab/microscopiq-llm-quantization","path":"kv_quant/evaluation_gsm8k.py","file_url":"https://github.com/georgia-tech-synergy-lab/microscopiq-llm-quantization/blob/HEAD/kv_quant/evaluation_gsm8k.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":"d93eb10d932ff2c8","code_sha256_prefix":"d93eb10d932ff2c8","mcp_get_code":{"code_sha256":"d93eb10d932ff2c8"}},{"arxiv_id":"2411.03554","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-vision-language-model-unlearning","title":"Benchmarking Vision Language Model Unlearning via Fictitious Facial Identity Dataset","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"safolab-wisc/fiubench","path":"utils.py","file_url":"https://github.com/safolab-wisc/fiubench/blob/HEAD/utils.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, safolab-wisc/fiubench when it was checked","code_sha256":"df30b18c6796c513","code_sha256_prefix":"df30b18c6796c513","mcp_get_code":{"code_sha256":"df30b18c6796c513"}},{"arxiv_id":"2410.04199","arxiv_id_is_arxiv":true,"paper":"/paper/longgenbench-long-context-generation","title":"LongGenBench: Long-context Generation Benchmark","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dominic789654/longgenbench","path":"longgenbench_GSM8K_openai.py","file_url":"https://github.com/dominic789654/longgenbench/blob/HEAD/longgenbench_GSM8K_openai.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, dominic789654/longgenbench when it was checked","code_sha256":"18cd596af05d6cef","code_sha256_prefix":"18cd596af05d6cef","mcp_get_code":{"code_sha256":"18cd596af05d6cef"}},{"arxiv_id":"2410.04199","arxiv_id_is_arxiv":true,"paper":"/paper/longgenbench-long-context-generation","title":"LongGenBench: Long-context Generation Benchmark","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dominic789654/longgenbench","path":"longgenbench_MMLU_openai.py","file_url":"https://github.com/dominic789654/longgenbench/blob/HEAD/longgenbench_MMLU_openai.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, dominic789654/longgenbench when it was checked","code_sha256":"f8323cff84047eca","code_sha256_prefix":"f8323cff84047eca","mcp_get_code":{"code_sha256":"f8323cff84047eca"}},{"arxiv_id":"2403.05527","arxiv_id_is_arxiv":true,"paper":"/paper/gear-an-efficient-kv-cache-compression","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haokang-timmy/gear","path":"GenerationBench/GenerationTest/evaluation_gsm8k.py","file_url":"https://github.com/haokang-timmy/gear/blob/HEAD/GenerationBench/GenerationTest/evaluation_gsm8k.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":"d93eb10d932ff2c8","code_sha256_prefix":"d93eb10d932ff2c8","mcp_get_code":{"code_sha256":"d93eb10d932ff2c8"}},{"arxiv_id":"2401.12242","arxiv_id_is_arxiv":true,"paper":"/paper/badchain-backdoor-chain-of-thought-prompting","title":"BadChain: Backdoor Chain-of-Thought Prompting for Large Language Models","date":"2024-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"django-jiang/badchain","path":"ans_eval/letter.py","file_url":"https://github.com/django-jiang/badchain/blob/HEAD/ans_eval/letter.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":"4d8f67ee98a17674","code_sha256_prefix":"4d8f67ee98a17674","mcp_get_code":{"code_sha256":"4d8f67ee98a17674"}},{"arxiv_id":"2401.12242","arxiv_id_is_arxiv":true,"paper":"/paper/badchain-backdoor-chain-of-thought-prompting","title":"BadChain: Backdoor Chain-of-Thought Prompting for Large Language Models","date":"2024-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"django-jiang/badchain","path":"ans_eval/strategyqa.py","file_url":"https://github.com/django-jiang/badchain/blob/HEAD/ans_eval/strategyqa.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":"f03e3e5ae911035c","code_sha256_prefix":"f03e3e5ae911035c","mcp_get_code":{"code_sha256":"f03e3e5ae911035c"}}],"record_sha256":"bd7668779908f3657e3950d71412bda403cc4da3303d8e15fc147dbc2655a25a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}