{"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-only-chars","entry":"get_only_chars","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":9,"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":5,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"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":1,"ran_fixture":0,"ran":0,"unverified":4},"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":"2405.16747","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-linear-probing-then-fine-tuning","title":"Understanding Linear Probing then Fine-tuning Language Models from NTK Perspective","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tom4649/lp-ft_ntk","path":"tasks/ood/OOD_NLP/src/evaluations/methods.py","file_url":"https://github.com/tom4649/lp-ft_ntk/blob/HEAD/tasks/ood/OOD_NLP/src/evaluations/methods.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"2208.08110","arxiv_id_is_arxiv":true,"paper":"/paper/pcc-paraphrasing-with-bottom-k-sampling-and","title":"PCC: Paraphrasing with Bottom-k Sampling and Cyclic Learning for Curriculum Data Augmentation","date":"2022-08-17","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":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"2205.01308","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-for-prompt-based-few","title":"Contrastive Learning for Prompt-Based Few-Shot Language Learners","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiren-jian/LM-SupCon","path":"src/eda.py","file_url":"https://github.com/yiren-jian/LM-SupCon/blob/HEAD/src/eda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"2204.11205","arxiv_id_is_arxiv":true,"paper":"/paper/epida-an-easy-plug-in-data-augmentation","title":"EPiDA: An Easy Plug-in Data Augmentation Framework for High Performance Text Classification","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaominyiz/EPiDA","path":"eda.py","file_url":"https://github.com/zhaominyiz/EPiDA/blob/HEAD/eda.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":"2ebd35ce58fdc414","code_sha256_prefix":"2ebd35ce58fdc414","mcp_get_code":{"code_sha256":"2ebd35ce58fdc414"}},{"arxiv_id":"2204.11205","arxiv_id_is_arxiv":true,"paper":"/paper/epida-an-easy-plug-in-data-augmentation","title":"EPiDA: An Easy Plug-in Data Augmentation Framework for High Performance Text Classification","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaominyiz/EPiDA","path":"nlp_aug.py","file_url":"https://github.com/zhaominyiz/EPiDA/blob/HEAD/nlp_aug.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":"317446c69f198e49","code_sha256_prefix":"317446c69f198e49","mcp_get_code":{"code_sha256":"317446c69f198e49"}},{"arxiv_id":"2204.01959","arxiv_id_is_arxiv":true,"paper":"/paper/data-augmentation-for-intent-classification-1","title":"Data Augmentation for Intent Classification with Off-the-shelf Large Language Models","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elementai/data-augmentation-with-llms","path":"utils/data_utils/eda_utils.py","file_url":"https://github.com/elementai/data-augmentation-with-llms/blob/HEAD/utils/data_utils/eda_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"2109.05941","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-contrastive-learning-via-novel-data","title":"Efficient Contrastive Learning via Novel Data Augmentation and Curriculum Learning","date":"2021-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vano1205/efficientcl","path":"efficientcl/common/augmentation.py","file_url":"https://github.com/vano1205/efficientcl/blob/HEAD/efficientcl/common/augmentation.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, vano1205/efficientcl when it was checked","code_sha256":"6d5faa1643cd229d","code_sha256_prefix":"6d5faa1643cd229d","mcp_get_code":{"code_sha256":"6d5faa1643cd229d"}},{"arxiv_id":"2103.07552","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-text-classification-with-triplet","title":"Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning","date":"2021-03-12","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":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"1901.11196","arxiv_id_is_arxiv":true,"paper":"/paper/eda-easy-data-augmentation-techniques-for","title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","date":"2019-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WengLab-InformaticsResearch/UMLS-EDA","path":"src/eda4ner.py","file_url":"https://github.com/WengLab-InformaticsResearch/UMLS-EDA/blob/HEAD/src/eda4ner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}},{"arxiv_id":"1901.11196","arxiv_id_is_arxiv":true,"paper":"/paper/eda-easy-data-augmentation-techniques-for","title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","date":"2019-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WengLab-InformaticsResearch/UMLS-EDA","path":"src/eda.py","file_url":"https://github.com/WengLab-InformaticsResearch/UMLS-EDA/blob/HEAD/src/eda.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":"2dacb6d9d554e193","code_sha256_prefix":"2dacb6d9d554e193","mcp_get_code":{"code_sha256":"2dacb6d9d554e193"}},{"arxiv_id":"Yang_Beyond_Walking_A_Large-Scale_Image-Text_Benchmark_for_Text-based_Person_Anomaly_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yang_Beyond_Walking_A_Large-Scale_Image-Text_Benchmark_for_Text-based_Person_Anomaly_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Shuyu-XJTU/CMP","path":"dataset/eda.py","file_url":"https://github.com/Shuyu-XJTU/CMP/blob/HEAD/dataset/eda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f15117422b72cf43","code_sha256_prefix":"f15117422b72cf43","mcp_get_code":{"code_sha256":"f15117422b72cf43"}}],"record_sha256":"2a6c74cf2786fa51fe520dbb3c4a7e270a77e87ebfd4c743a9d691632e7ea45e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}