{"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/extract-label","entry":"extract_label","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":12,"n_places_pointer_only":9,"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":2,"ran_violates":1,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"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":"2606.15307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15307","title":"Adapting Reinforcement Learning with Chain-of-Thought Supervision for Explainable Detection of Hateful and Propagandistic Memes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"MohamedBayan/MemeReason","path":"data_prep/build_unlabeled_training_set.py","file_url":"https://github.com/MohamedBayan/MemeReason/blob/HEAD/data_prep/build_unlabeled_training_set.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, MohamedBayan/MemeReason when it was checked","code_sha256":"f85c65c949b629e1","code_sha256_prefix":"f85c65c949b629e1","mcp_get_code":{"code_sha256":"f85c65c949b629e1"}},{"arxiv_id":"2603.08286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08286","title":"LAMUS: A Large-Scale Corpus for Legal Argument Mining from U.S. Caselaw using LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"LavanyaPobbathi/LAMUS","path":"code/experiment/A_run_4_models_1st.py","file_url":"https://github.com/LavanyaPobbathi/LAMUS/blob/HEAD/code/experiment/A_run_4_models_1st.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, LavanyaPobbathi/LAMUS when it was checked","code_sha256":"33a56252e8d12114","code_sha256_prefix":"33a56252e8d12114","mcp_get_code":{"code_sha256":"33a56252e8d12114"}},{"arxiv_id":"2603.00696","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00696","title":"DRIV-EX: Counterfactual Explanations for Driving LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Amaia-CARDIEL/DRIV_EX","path":"driv_ex/dataset/generate_input_only_highD_data.py","file_url":"https://github.com/Amaia-CARDIEL/DRIV_EX/blob/HEAD/driv_ex/dataset/generate_input_only_highD_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48ce3f13567e8ce8","code_sha256_prefix":"48ce3f13567e8ce8","mcp_get_code":{"code_sha256":"48ce3f13567e8ce8"}},{"arxiv_id":"2510.20369","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20369","title":"Ask a Strong LLM Judge when Your Reward Model is Uncertain","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"zhenghaoxu-gatech/uncertainty-router","path":"ppo/src/eval_pm_router/eval_rewardbench.py","file_url":"https://github.com/zhenghaoxu-gatech/uncertainty-router/blob/HEAD/ppo/src/eval_pm_router/eval_rewardbench.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zhenghaoxu-gatech/uncertainty-router when it was checked","code_sha256":"1acad12079a57e2a","code_sha256_prefix":"1acad12079a57e2a","mcp_get_code":{"code_sha256":"1acad12079a57e2a"}},{"arxiv_id":"2410.20651","arxiv_id_is_arxiv":true,"paper":"/paper/subjective-qa-measuring-subjectivity-in","title":"SubjECTive-QA: Measuring Subjectivity in Earnings Call Transcripts' QA Through Six-Dimensional Feature Analysis","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtfintechlab/SubjECTive-QA","path":"scripts/openai_benchmarking.py","file_url":"https://github.com/gtfintechlab/SubjECTive-QA/blob/HEAD/scripts/openai_benchmarking.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, gtfintechlab/SubjECTive-QA (NOASSERTION)","code_sha256":"828a7266ccb957bb","code_sha256_prefix":"828a7266ccb957bb","mcp_get_code":{"code_sha256":"828a7266ccb957bb"}},{"arxiv_id":"2410.02884","arxiv_id_is_arxiv":true,"paper":"/paper/llama-berry-pairwise-optimization-for-o1-like","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trotsky1997/mathblackbox","path":"gen_mcts_dpo.py","file_url":"https://github.com/trotsky1997/mathblackbox/blob/HEAD/gen_mcts_dpo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trotsky1997/mathblackbox when it was checked","code_sha256":"f4e59a05a34d24d9","code_sha256_prefix":"f4e59a05a34d24d9","mcp_get_code":{"code_sha256":"f4e59a05a34d24d9"}},{"arxiv_id":"2407.02855","arxiv_id_is_arxiv":true,"paper":"/paper/safe-unlearning-a-surprisingly-effective-and","title":"From Theft to Bomb-Making: The Ripple Effect of Unlearning in Defending Against Jailbreak Attacks","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/safeunlearning","path":"evaluation/score_shieldlm.py","file_url":"https://github.com/thu-coai/safeunlearning/blob/HEAD/evaluation/score_shieldlm.py","status":"ran","verification_level":1,"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, thu-coai/safeunlearning when it was checked","code_sha256":"470eb9f49a78b466","code_sha256_prefix":"470eb9f49a78b466","mcp_get_code":{"code_sha256":"470eb9f49a78b466"}},{"arxiv_id":"2406.19146","arxiv_id_is_arxiv":true,"paper":"/paper/resolving-discrepancies-in-compute-optimal","title":"Resolving Discrepancies in Compute-Optimal Scaling of Language Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"formll/resolving-scaling-law-discrepencies","path":"paper_tables.py","file_url":"https://github.com/formll/resolving-scaling-law-discrepencies/blob/HEAD/paper_tables.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":"9370894d3db38de0","code_sha256_prefix":"9370894d3db38de0","mcp_get_code":{"code_sha256":"9370894d3db38de0"}},{"arxiv_id":"2311.18702","arxiv_id_is_arxiv":true,"paper":"/paper/critiquellm-scaling-llm-as-critic-for","title":"CritiqueLLM: Towards an Informative Critique Generation Model for Evaluation of Large Language Model Generation","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/critiquellm","path":"evaluation/eval_pairwise.py","file_url":"https://github.com/thu-coai/critiquellm/blob/HEAD/evaluation/eval_pairwise.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thu-coai/critiquellm when it was checked","code_sha256":"0164dbe04ac52b71","code_sha256_prefix":"0164dbe04ac52b71","mcp_get_code":{"code_sha256":"0164dbe04ac52b71"}},{"arxiv_id":"2305.15005","arxiv_id_is_arxiv":true,"paper":"/paper/sentiment-analysis-in-the-era-of-large","title":"Sentiment Analysis in the Era of Large Language Models: A Reality Check","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-nlp-sg/llm-sentiment","path":"evaluate.py","file_url":"https://github.com/damo-nlp-sg/llm-sentiment/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, damo-nlp-sg/llm-sentiment, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"10ef73cfeb03a631","code_sha256_prefix":"10ef73cfeb03a631","mcp_get_code":{"code_sha256":"10ef73cfeb03a631"}},{"arxiv_id":"2204.09435","arxiv_id_is_arxiv":true,"paper":"/paper/hephaestus-a-large-scale-multitask-dataset","title":"Hephaestus: A large scale multitask dataset towards InSAR understanding","date":"2022-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orion-ai-lab/hephaestus","path":"utilities/annotation_utils.py","file_url":"https://github.com/orion-ai-lab/hephaestus/blob/HEAD/utilities/annotation_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d64c1408c1ae7f8d","code_sha256_prefix":"d64c1408c1ae7f8d","mcp_get_code":{"code_sha256":"d64c1408c1ae7f8d"}},{"arxiv_id":"2024.findings-naacl.246","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-naacl.246","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DAMO-NLP-SG/LLM-Sentiment","path":"evaluate.py","file_url":"https://github.com/DAMO-NLP-SG/LLM-Sentiment/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, DAMO-NLP-SG/LLM-Sentiment, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"10ef73cfeb03a631","code_sha256_prefix":"10ef73cfeb03a631","mcp_get_code":{"code_sha256":"10ef73cfeb03a631"}}],"record_sha256":"3de3cedf0b3f70df74ac546da20e7a3f640dcb01c8b125f5f5654d03b1c0a2bf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}