{"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/pick-most-similar-words-batch","entry":"pick_most_similar_words_batch","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":5,"n_papers_ran":5,"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_fingerprinted":0,"n_places":5,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"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":"2210.09421","paper":"/paper/deepfake-text-detection-limitations-and","title":"Deepfake Text Detection: Limitations and Opportunities","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmpu/deepfaketextdetection","path":"DFTFooler/DFTFooler_attack.py","file_url":"https://github.com/jmpu/deepfaketextdetection/blob/HEAD/DFTFooler/DFTFooler_attack.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"578fa5cd8b02930c","mcp_get_code":{"code_sha256":"578fa5cd8b02930c"}},{"arxiv_id":"2012.14956","paper":"/paper/generating-natural-language-attacks-in-a-hard","title":"Generating Natural Language Attacks in a Hard Label Black Box Setting","date":"2020-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RishabhMaheshwary/hard-label-attack","path":"classification_attack.py","file_url":"https://github.com/RishabhMaheshwary/hard-label-attack/blob/HEAD/classification_attack.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"87b2750a51e1c3e9","mcp_get_code":{"code_sha256":"87b2750a51e1c3e9"}},{"arxiv_id":"2010.06812","paper":"/paper/transfer2attack-text-adversarial-attack-with","title":"Explain2Attack: Text Adversarial Attacks via Cross-Domain Interpretability","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahossam/Explain2Attack","path":"attack_classification.py","file_url":"https://github.com/mahossam/Explain2Attack/blob/HEAD/attack_classification.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1202335eddd609c4","mcp_get_code":{"code_sha256":"1202335eddd609c4"}},{"arxiv_id":"2004.09984","paper":"/paper/bert-attack-adversarial-attack-against-bert","title":"BERT-ATTACK: Adversarial Attack Against BERT Using BERT","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"87b2750a51e1c3e9","mcp_get_code":{"code_sha256":"87b2750a51e1c3e9"}},{"arxiv_id":"1907.11932","paper":"/paper/is-bert-really-robust-natural-language-attack","title":"Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailment","date":"2019-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"87b2750a51e1c3e9","mcp_get_code":{"code_sha256":"87b2750a51e1c3e9"}}]}