{"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/is-stopword","entry":"is_stopword","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2408.07930","arxiv_id_is_arxiv":true,"paper":"/paper/mag-sql-multi-agent-generative-approach-with","title":"MAG-SQL: Multi-Agent Generative Approach with Soft Schema Linking and Iterative Sub-SQL Refinement for Text-to-SQL","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LancelotXWX/MAG-SQL","path":"main_scripts/bridge_content_encoder.py","file_url":"https://github.com/LancelotXWX/MAG-SQL/blob/HEAD/main_scripts/bridge_content_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2406.12288","arxiv_id_is_arxiv":true,"paper":"/paper/an-investigation-of-neuron-activation-as-a","title":"An Investigation of Neuron Activation as a Unified Lens to Explain Chain-of-Thought Eliciting Arithmetic Reasoning of LLMs","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dakingrai/ood-generalization-semantic-boundary-techniques","path":"evaluations/src/bridge_content_encoder.py","file_url":"https://github.com/dakingrai/ood-generalization-semantic-boundary-techniques/blob/HEAD/evaluations/src/bridge_content_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2310.13659","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-and-improving-text-to-sql","title":"Benchmarking and Improving Text-to-SQL Generation under Ambiguity","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"testzer0/AmbiQT","path":"src/utils/content.py","file_url":"https://github.com/testzer0/AmbiQT/blob/HEAD/src/utils/content.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2306.08891","arxiv_id_is_arxiv":true,"paper":"/paper/interleaving-pre-trained-language-models-and","title":"Interleaving Pre-Trained Language Models and Large Language Models for Zero-Shot NL2SQL Generation","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruc-datalab/zeronl2sql","path":"src/utils/bridge_content_encoder.py","file_url":"https://github.com/ruc-datalab/zeronl2sql/blob/HEAD/src/utils/bridge_content_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2212.09741","arxiv_id_is_arxiv":true,"paper":"/paper/one-embedder-any-task-instruction-finetuned","title":"One Embedder, Any Task: Instruction-Finetuned Text Embeddings","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/instructor-embedding","path":"evaluation/prompt_retrieval/bridge_content_encoder.py","file_url":"https://github.com/HKUNLP/instructor-embedding/blob/HEAD/evaluation/prompt_retrieval/bridge_content_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2109.05093","arxiv_id_is_arxiv":true,"paper":"/paper/picard-parsing-incrementally-for-constrained","title":"PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models","date":"2021-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/picard","path":"seq2seq/utils/bridge_content_encoder.py","file_url":"https://github.com/ElementAI/picard/blob/HEAD/seq2seq/utils/bridge_content_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d56a1f9221823a48","code_sha256_prefix":"d56a1f9221823a48","mcp_get_code":{"code_sha256":"d56a1f9221823a48"}},{"arxiv_id":"2104.08737","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-subspaces-for-unsupervised-entity","title":"Low-Rank Subspaces for Unsupervised Entity Linking","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lephong/dl4el","path":"jrk/utils.py","file_url":"https://github.com/lephong/dl4el/blob/HEAD/jrk/utils.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":"beab35cd876a3032","code_sha256_prefix":"beab35cd876a3032","mcp_get_code":{"code_sha256":"beab35cd876a3032"}},{"arxiv_id":"1804.10637","arxiv_id_is_arxiv":true,"paper":"/paper/improving-entity-linking-by-modeling-latent","title":"Improving Entity Linking by Modeling Latent Relations between Mentions","date":"2018-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lephong/mulrel-nel","path":"nel/utils.py","file_url":"https://github.com/lephong/mulrel-nel/blob/HEAD/nel/utils.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":"32cd53076f5c1277","code_sha256_prefix":"32cd53076f5c1277","mcp_get_code":{"code_sha256":"32cd53076f5c1277"}}],"record_sha256":"e62c53cda64c6a3386ecdff8802a129fa10d2e93615aa6cfe6a7554d5e4a863e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}