{"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-label-list","entry":"get_label_list","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":0},"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":"2502.13917","arxiv_id_is_arxiv":true,"paper":"/paper/tess-2-a-large-scale-generalist-diffusion","title":"TESS 2: A Large-Scale Generalist Diffusion Language Model","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamishivi/tess-2","path":"sdlm/train_sentiment_model.py","file_url":"https://github.com/hamishivi/tess-2/blob/HEAD/sdlm/train_sentiment_model.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":"adb7541f2edf078e","code_sha256_prefix":"adb7541f2edf078e","mcp_get_code":{"code_sha256":"adb7541f2edf078e"}},{"arxiv_id":"2410.13098","arxiv_id_is_arxiv":true,"paper":"/paper/a-little-human-data-goes-a-long-way","title":"A Little Human Data Goes A Long Way","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhananjayashok/littlehumandata","path":"llm-utils/classification.py","file_url":"https://github.com/dhananjayashok/littlehumandata/blob/HEAD/llm-utils/classification.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":"adb7541f2edf078e","code_sha256_prefix":"adb7541f2edf078e","mcp_get_code":{"code_sha256":"adb7541f2edf078e"}},{"arxiv_id":"2410.00927","arxiv_id_is_arxiv":true,"paper":"/paper/text-clustering-as-classification-with-llms","title":"Text Clustering as Classification with LLMs","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecnu-text-computing/text-clustering-via-llm","path":"label_generation.py","file_url":"https://github.com/ecnu-text-computing/text-clustering-via-llm/blob/HEAD/label_generation.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, ecnu-text-computing/text-clustering-via-llm when it was checked","code_sha256":"662323909b288697","code_sha256_prefix":"662323909b288697","mcp_get_code":{"code_sha256":"662323909b288697"}},{"arxiv_id":"2407.11770","arxiv_id_is_arxiv":true,"paper":"/paper/robust-utility-preserving-text-anonymization","title":"Robust Utility-Preserving Text Anonymization Based on Large Language Models","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2024-rupta","path":"run_classification.py","file_url":"https://github.com/ukplab/arxiv2024-rupta/blob/HEAD/run_classification.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":"adb7541f2edf078e","code_sha256_prefix":"adb7541f2edf078e","mcp_get_code":{"code_sha256":"adb7541f2edf078e"}},{"arxiv_id":"2405.00467","arxiv_id_is_arxiv":true,"paper":"/paper/harnessing-the-power-of-multiple-minds","title":"Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routing","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvadityasrivatsa/llm-routing","path":"routing_classifiers/multi_label_classifier/llm_multiclassifier.py","file_url":"https://github.com/kvadityasrivatsa/llm-routing/blob/HEAD/routing_classifiers/multi_label_classifier/llm_multiclassifier.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":"9b8ff1213c52173e","code_sha256_prefix":"9b8ff1213c52173e","mcp_get_code":{"code_sha256":"9b8ff1213c52173e"}},{"arxiv_id":"2403.11009","arxiv_id_is_arxiv":true,"paper":"/paper/dialectbench-a-nlp-benchmark-for-dialects","title":"DIALECTBENCH: A NLP Benchmark for Dialects, Varieties, and Closely-Related Languages","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ffaisal93/dialectbench","path":"scripts/dialect_identification/text-classification_transformers.py","file_url":"https://github.com/ffaisal93/dialectbench/blob/HEAD/scripts/dialect_identification/text-classification_transformers.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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b8ff1213c52173e","code_sha256_prefix":"9b8ff1213c52173e","mcp_get_code":{"code_sha256":"9b8ff1213c52173e"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenlicodebank/lora_on_analog_hardware","path":"lora_training_glue/run_classification.py","file_url":"https://github.com/chenlicodebank/lora_on_analog_hardware/blob/HEAD/lora_training_glue/run_classification.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":"adb7541f2edf078e","code_sha256_prefix":"adb7541f2edf078e","mcp_get_code":{"code_sha256":"adb7541f2edf078e"}}],"record_sha256":"3f56ab7f19448b45767a818d5b2c3a891f61956c914f1e4c9b24d00277053622","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}