{"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/filter-words","entry":"filter_words","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"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":1,"ran_fixture":0,"ran":4,"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":"2411.07336","arxiv_id_is_arxiv":true,"paper":"/paper/setlexsem-challenge-using-set-operations-to","title":"SetLexSem Challenge: Using Set Operations to Evaluate the Lexical and Semantic Robustness of Language Models","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/setlexsem-challenge","path":"setlexsem/generate/sample.py","file_url":"https://github.com/amazon-science/setlexsem-challenge/blob/HEAD/setlexsem/generate/sample.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":"8431ddf5ad802651","code_sha256_prefix":"8431ddf5ad802651","mcp_get_code":{"code_sha256":"8431ddf5ad802651"}},{"arxiv_id":"2310.04678","arxiv_id_is_arxiv":true,"paper":"/paper/doris-mae-scientific-document-retrieval-using","title":"DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Real-Doris-Mae/Doris-Mae-Dataset","path":"create_candidate_pool/create_candidate_pool.py","file_url":"https://github.com/Real-Doris-Mae/Doris-Mae-Dataset/blob/HEAD/create_candidate_pool/create_candidate_pool.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Real-Doris-Mae/Doris-Mae-Dataset (NOASSERTION)","code_sha256":"8bc1dcf8359aad73","code_sha256_prefix":"8bc1dcf8359aad73","mcp_get_code":{"code_sha256":"8bc1dcf8359aad73"}},{"arxiv_id":"2110.01256","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-self-training-for-few-shot","title":"Revisiting Self-Training for Few-Shot Learning of Language Model","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timoschick/pet","path":"petal.py","file_url":"https://github.com/timoschick/pet/blob/HEAD/petal.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":"a40f233e44e61f6e","code_sha256_prefix":"a40f233e44e61f6e","mcp_get_code":{"code_sha256":"a40f233e44e61f6e"}},{"arxiv_id":"2109.01135","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-sequence-learning-with-latent","title":"Sequence-to-Sequence Learning with Latent Neural Grammars","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yli1/CGPS","path":"attention_visualization.py","file_url":"https://github.com/yli1/CGPS/blob/HEAD/attention_visualization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efe28f7dd3f19e7f","code_sha256_prefix":"efe28f7dd3f19e7f","mcp_get_code":{"code_sha256":"efe28f7dd3f19e7f"}},{"arxiv_id":"1809.03599","arxiv_id_is_arxiv":true,"paper":"/paper/learning-named-entity-tagger-using-domain","title":"Learning Named Entity Tagger using Domain-Specific Dictionary","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shangjingbo1226/AutoNER","path":"preprocess_partial_ner/encode_mixed_dataset.py","file_url":"https://github.com/shangjingbo1226/AutoNER/blob/HEAD/preprocess_partial_ner/encode_mixed_dataset.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":"0bdd8090a26c0251","code_sha256_prefix":"0bdd8090a26c0251","mcp_get_code":{"code_sha256":"0bdd8090a26c0251"}},{"arxiv_id":"1809.03599","arxiv_id_is_arxiv":true,"paper":"/paper/learning-named-entity-tagger-using-domain","title":"Learning Named Entity Tagger using Domain-Specific Dictionary","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shangjingbo1226/AutoNER","path":"preprocess_partial_ner/encode_folder.py","file_url":"https://github.com/shangjingbo1226/AutoNER/blob/HEAD/preprocess_partial_ner/encode_folder.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":"312894e2aabb76ca","code_sha256_prefix":"312894e2aabb76ca","mcp_get_code":{"code_sha256":"312894e2aabb76ca"}}],"record_sha256":"c99db3fc5f46c891689dac49f5f06e9b30d3da55f325676f50d9c71a84f69a50","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}