{"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-text","entry":"get_text","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":18,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":8,"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":17,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":7,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":18,"n_places_pointer_only":5,"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":7,"ran_fixture":0,"ran":7,"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":"2609.04094","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-04094","title":"DRACO: Fine-Grained Credit Assignment with Dynamic Rubrics for Long-Horizon Agent Training","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"IBM/draco","path":"evals/appworld/scoring/score_runs.py","file_url":"https://github.com/IBM/draco/blob/HEAD/evals/appworld/scoring/score_runs.py","status":"ran","verification_level":1,"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":"13dedb566b256f1d","code_sha256_prefix":"13dedb566b256f1d","mcp_get_code":{"code_sha256":"13dedb566b256f1d"}},{"arxiv_id":"2605.25816","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25816","title":"Fine-Tuning Over Architectural Complexity: Broad-Coverage PII Detection on PIIBench with DeBERTa","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pritesh-2711/pii-bench","path":"src/consolidate_pii_datasets.py","file_url":"https://github.com/pritesh-2711/pii-bench/blob/HEAD/src/consolidate_pii_datasets.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":"1ef20576b3d61dc6","code_sha256_prefix":"1ef20576b3d61dc6","mcp_get_code":{"code_sha256":"1ef20576b3d61dc6"}},{"arxiv_id":"2506.08316","arxiv_id_is_arxiv":true,"paper":"/paper/why-masking-diffusion-works-condition-on-the","title":"Why Masking Diffusion Works: Condition on the Jump Schedule for Improved Discrete Diffusion","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alannawzadamin/scud","path":"scud/scud.py","file_url":"https://github.com/alannawzadamin/scud/blob/HEAD/scud/scud.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"171b7d239afea3df","code_sha256_prefix":"171b7d239afea3df","mcp_get_code":{"code_sha256":"171b7d239afea3df"}},{"arxiv_id":"2501.04694","arxiv_id_is_arxiv":true,"paper":"/paper/epicoder-encompassing-diversity-and","title":"EpiCoder: Encompassing Diversity and Complexity in Code Generation","date":"2025-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepLearnXMU/EpiCoder","path":"evol/feature_evol.py","file_url":"https://github.com/DeepLearnXMU/EpiCoder/blob/HEAD/evol/feature_evol.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, DeepLearnXMU/EpiCoder, 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":"6e1c2fcd1329e0bc","code_sha256_prefix":"6e1c2fcd1329e0bc","mcp_get_code":{"code_sha256":"6e1c2fcd1329e0bc"}},{"arxiv_id":"2408.09647","arxiv_id_is_arxiv":true,"paper":"/paper/c2p-clip-injecting-category-common-prompt-in","title":"C2P-CLIP: Injecting Category Common Prompt in CLIP to Enhance Generalization in Deepfake Detection","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuangchuangtan/c2p-clip-deepfakedetection","path":"networks/decode_clipfeature_image.py","file_url":"https://github.com/chuangchuangtan/c2p-clip-deepfakedetection/blob/HEAD/networks/decode_clipfeature_image.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, chuangchuangtan/c2p-clip-deepfakedetection when it was checked","code_sha256":"8ce1a73d6b1c51e4","code_sha256_prefix":"8ce1a73d6b1c51e4","mcp_get_code":{"code_sha256":"8ce1a73d6b1c51e4"}},{"arxiv_id":"2407.20906","arxiv_id_is_arxiv":true,"paper":"/paper/automated-review-generation-method-based-on","title":"Automated Review Generation Method Based on Large Language Models","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tju-ecat-ai/automaticreviewgeneration","path":"DataMining/MainContributeCatalystDetailStatisticsNew.py","file_url":"https://github.com/tju-ecat-ai/automaticreviewgeneration/blob/HEAD/DataMining/MainContributeCatalystDetailStatisticsNew.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e525116fe4648434","code_sha256_prefix":"e525116fe4648434","mcp_get_code":{"code_sha256":"e525116fe4648434"}},{"arxiv_id":"2407.07457","arxiv_id_is_arxiv":true,"paper":"/paper/glbench-a-comprehensive-benchmark-for-graph","title":"GLBench: A Comprehensive Benchmark for Graph with Large Language Models","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nineabyss/glbench","path":"models/enhancer/OneForAll/get_wiki.py","file_url":"https://github.com/nineabyss/glbench/blob/HEAD/models/enhancer/OneForAll/get_wiki.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0f45e1ebcb81816","code_sha256_prefix":"e0f45e1ebcb81816","mcp_get_code":{"code_sha256":"e0f45e1ebcb81816"}},{"arxiv_id":"2406.14544","arxiv_id_is_arxiv":true,"paper":"/paper/prism-a-framework-for-decoupling-and","title":"Prism: A Framework for Decoupling and Assessing the Capabilities of VLMs","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sparksjoe/prism","path":"decouple/utils/custom_generate.py","file_url":"https://github.com/sparksjoe/prism/blob/HEAD/decouple/utils/custom_generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"096b5e8d53a413d3","code_sha256_prefix":"096b5e8d53a413d3","mcp_get_code":{"code_sha256":"096b5e8d53a413d3"}},{"arxiv_id":"2406.07971","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-on-the-seamlessness-between","title":"It Takes Two: On the Seamlessness between Reward and Policy Model in RLHF","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taiminglu/seamless","path":"code/SEAM/reward/get_reward.py","file_url":"https://github.com/taiminglu/seamless/blob/HEAD/code/SEAM/reward/get_reward.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, taiminglu/seamless when it was checked","code_sha256":"55737ec700776650","code_sha256_prefix":"55737ec700776650","mcp_get_code":{"code_sha256":"55737ec700776650"}},{"arxiv_id":"2405.20315","arxiv_id_is_arxiv":true,"paper":"/paper/anah-analytical-annotation-of-hallucinations","title":"ANAH: Analytical Annotation of Hallucinations in Large Language Models","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"InternLM/lmdeploy","path":"lmdeploy/model.py","file_url":"https://github.com/InternLM/lmdeploy/blob/HEAD/lmdeploy/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7004ae9213140ec9","code_sha256_prefix":"7004ae9213140ec9","mcp_get_code":{"code_sha256":"7004ae9213140ec9"}},{"arxiv_id":"2405.10260","arxiv_id_is_arxiv":true,"paper":"/paper/keep-it-private-unsupervised-privatization-of","title":"Keep It Private: Unsupervised Privatization of Online Text","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csbao/kip-privatization","path":"src/helper_functions.py","file_url":"https://github.com/csbao/kip-privatization/blob/HEAD/src/helper_functions.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, csbao/kip-privatization when it was checked","code_sha256":"89bc537f3c9703a1","code_sha256_prefix":"89bc537f3c9703a1","mcp_get_code":{"code_sha256":"89bc537f3c9703a1"}},{"arxiv_id":"2306.00978","arxiv_id_is_arxiv":true,"paper":"/paper/awq-activation-aware-weight-quantization-for","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"internlm/lmdeploy","path":"lmdeploy/model.py","file_url":"https://github.com/internlm/lmdeploy/blob/HEAD/lmdeploy/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7004ae9213140ec9","code_sha256_prefix":"7004ae9213140ec9","mcp_get_code":{"code_sha256":"7004ae9213140ec9"}},{"arxiv_id":"2302.11266","arxiv_id_is_arxiv":true,"paper":"/paper/one-shot-labeling-for-automatic-relevance","title":"One-Shot Labeling for Automatic Relevance Estimation","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seanmacavaney/autoqrels","path":"autoqrels/text.py","file_url":"https://github.com/seanmacavaney/autoqrels/blob/HEAD/autoqrels/text.py","status":"ran","verification_level":1,"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":"bcfc91914a1db5fb","code_sha256_prefix":"bcfc91914a1db5fb","mcp_get_code":{"code_sha256":"bcfc91914a1db5fb"}},{"arxiv_id":"2204.08582","arxiv_id_is_arxiv":true,"paper":"/paper/massive-a-1m-example-multilingual-natural","title":"MASSIVE: A 1M-Example Multilingual Natural Language Understanding Dataset with 51 Typologically-Diverse Languages","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rita-nlp/italic","path":"asr_inference.py","file_url":"https://github.com/rita-nlp/italic/blob/HEAD/asr_inference.py","status":"ran","verification_level":1,"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":"fef1c66dfeeb6664","code_sha256_prefix":"fef1c66dfeeb6664","mcp_get_code":{"code_sha256":"fef1c66dfeeb6664"}},{"arxiv_id":"2104.00487","arxiv_id_is_arxiv":true,"paper":"/paper/linear-semantics-in-generative-adversarial","title":"Linear Semantics in Generative Adversarial Networks","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtlantixJJ/LinearGAN","path":"figure/layer_plot.py","file_url":"https://github.com/AtlantixJJ/LinearGAN/blob/HEAD/figure/layer_plot.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":"a3f50a610e7c3cd8","code_sha256_prefix":"a3f50a610e7c3cd8","mcp_get_code":{"code_sha256":"a3f50a610e7c3cd8"}},{"arxiv_id":"1507.05717","arxiv_id_is_arxiv":true,"paper":"/paper/an-end-to-end-trainable-neural-network-for","title":"An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition","date":"2015-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackknife007/crnn","path":"generate.py","file_url":"https://github.com/jackknife007/crnn/blob/HEAD/generate.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, jackknife007/crnn when it was checked","code_sha256":"dd0c2e41c087ec45","code_sha256_prefix":"dd0c2e41c087ec45","mcp_get_code":{"code_sha256":"dd0c2e41c087ec45"}},{"arxiv_id":"2023.findings-eacl.123","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-eacl.123","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yuping-wu/EDU-VL","path":"preprocessing/prepare_candidate_summaries.py","file_url":"https://github.com/yuping-wu/EDU-VL/blob/HEAD/preprocessing/prepare_candidate_summaries.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":"48253ecd913eb2ba","code_sha256_prefix":"48253ecd913eb2ba","mcp_get_code":{"code_sha256":"48253ecd913eb2ba"}},{"arxiv_id":"2023.findings-acl.178","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.178","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NJUNLP/DMASTE","path":"BMRC/dataProcess.py","file_url":"https://github.com/NJUNLP/DMASTE/blob/HEAD/BMRC/dataProcess.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":"22f7df53fc31fedc","code_sha256_prefix":"22f7df53fc31fedc","mcp_get_code":{"code_sha256":"22f7df53fc31fedc"}}],"record_sha256":"7c9596eaaaa32cbe7d20d559815730ad5796154ddb9fc48a2408f1dba93d590f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}