{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/pattern-match","entry":"pattern_match","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":7,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2409.08813","paper":"/paper/your-weak-llm-is-secretly-a-strong-teacher","title":"Your Weak LLM is Secretly a Strong Teacher for Alignment","date":"2024-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/weak_llm_teacher","path":"utils/lm_evaluator.py","file_url":"https://github.com/deeplearning-wisc/weak_llm_teacher/blob/HEAD/utils/lm_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2405.18380","paper":"/paper/owlore-outlier-weighed-layerwise-sampled-low","title":"OwLore: Outlier-weighed Layerwise Sampled Low-Rank Projection for Memory-Efficient LLM Fine-tuning","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pixeli99/owlore","path":"utils/lm_evaluator.py","file_url":"https://github.com/pixeli99/owlore/blob/HEAD/utils/lm_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2402.16880","paper":"/paper/besa-pruning-large-language-models-with","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linkanonymous/besa","path":"utils/tools.py","file_url":"https://github.com/linkanonymous/besa/blob/HEAD/utils/tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2402.11295","paper":"/paper/onebit-towards-extremely-low-bit-large","title":"OneBit: Towards Extremely Low-bit Large Language Models","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuyuzhuang11/OneBit","path":"evaluation/lm_eval/evaluator.py","file_url":"https://github.com/xuyuzhuang11/OneBit/blob/HEAD/evaluation/lm_eval/evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2401.12873","paper":"/paper/improving-machine-translation-with-human","title":"Improving Machine Translation with Human Feedback: An Exploration of Quality Estimation as a Reward Model","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhe99/FeedbackMT","path":"src/LMFlow/utils/lm_evaluator.py","file_url":"https://github.com/zwhe99/FeedbackMT/blob/HEAD/src/LMFlow/utils/lm_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2309.06256","paper":"/paper/2309-06256","title":"Mitigating the Alignment Tax of RLHF","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avalonstrel/mitigating-the-alignment-tax-of-rlhf","path":"utils/lm_evaluator.py","file_url":"https://github.com/avalonstrel/mitigating-the-alignment-tax-of-rlhf/blob/HEAD/utils/lm_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}},{"arxiv_id":"2306.03078","paper":"/paper/spqr-a-sparse-quantized-representation-for","title":"SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression","date":"2023-06-05","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":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"c12b55ef635e9947","mcp_get_code":{"code_sha256":"c12b55ef635e9947"}}]}