{"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/create-dictionary","entry":"create_dictionary","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":2,"n_papers_ran_instrument_only":6,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":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":"2402.18458","arxiv_id_is_arxiv":true,"paper":"/paper/meta-task-prompting-elicits-embedding-from","title":"Meta-Task Prompting Elicits Embeddings from Large Language Models","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibin-lei/metaeol","path":"SentEval/senteval/utils.py","file_url":"https://github.com/yibin-lei/metaeol/blob/HEAD/SentEval/senteval/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, yibin-lei/metaeol when it was checked","code_sha256":"292a7349c4da48f7","code_sha256_prefix":"292a7349c4da48f7","mcp_get_code":{"code_sha256":"292a7349c4da48f7"}},{"arxiv_id":"2007.10637","arxiv_id_is_arxiv":true,"paper":"/paper/distributed-memory-based-self-supervised","title":"Distributed Associative Memory Network with Memory Refreshing Loss","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taewonpark/DAM","path":"preprocess.py","file_url":"https://github.com/taewonpark/DAM/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0f142ba266f46ddc","code_sha256_prefix":"0f142ba266f46ddc","mcp_get_code":{"code_sha256":"0f142ba266f46ddc"}},{"arxiv_id":"1905.07790","arxiv_id_is_arxiv":true,"paper":"/paper/correlation-coefficients-and-semantic-textual","title":"Correlation Coefficients and Semantic Textual Similarity","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/corrsim","path":"evaluation/utils.py","file_url":"https://github.com/Babylonpartners/corrsim/blob/HEAD/evaluation/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from facebookresearch/SentEval, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"af7388308de7ccb4","code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1905.07790","arxiv_id_is_arxiv":true,"paper":"/paper/correlation-coefficients-and-semantic-textual","title":"Correlation Coefficients and Semantic Textual Similarity","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/corrsim","path":"senteval/utils.py","file_url":"https://github.com/Babylonpartners/corrsim/blob/HEAD/senteval/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from yibin-lei/metaeol, and GitHub detected no licence in that repository when it was checked","code_sha256":"292a7349c4da48f7","code_sha256_prefix":"292a7349c4da48f7","mcp_get_code":{"code_sha256":"292a7349c4da48f7"}},{"arxiv_id":"1805.01070","arxiv_id_is_arxiv":true,"paper":"/paper/what-you-can-cram-into-a-single-vector","title":"What you can cram into a single vector: Probing sentence embeddings for linguistic properties","date":"2018-05-03","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":false,"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":"af7388308de7ccb4","code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1804.00079","arxiv_id_is_arxiv":true,"paper":"/paper/learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","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":false,"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":"af7388308de7ccb4","code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1803.05449","arxiv_id_is_arxiv":true,"paper":"/paper/senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","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":false,"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":"af7388308de7ccb4","code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1705.02364","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-of-universal-sentence","title":"Supervised Learning of Universal Sentence Representations from Natural Language Inference Data","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/SentEval","path":"examples/bow.py","file_url":"https://github.com/facebookresearch/SentEval/blob/HEAD/examples/bow.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, facebookresearch/SentEval (NOASSERTION)","code_sha256":"af7388308de7ccb4","code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1705.02364","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-of-universal-sentence","title":"Supervised Learning of Universal Sentence Representations from Natural Language Inference Data","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaanchandra/InferSent","path":"code/senteval.py","file_url":"https://github.com/shaanchandra/InferSent/blob/HEAD/code/senteval.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, shaanchandra/InferSent when it was checked","code_sha256":"6ebd3e9ce17919eb","code_sha256_prefix":"6ebd3e9ce17919eb","mcp_get_code":{"code_sha256":"6ebd3e9ce17919eb"}},{"arxiv_id":"2021.findings-emnlp.332","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.332","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RiTUAL-UH/Predicting-Severity-in-Movie-Scripts","path":"Code/TextRCNN_S-MT.py","file_url":"https://github.com/RiTUAL-UH/Predicting-Severity-in-Movie-Scripts/blob/HEAD/Code/TextRCNN_S-MT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"618fbb2737709fa8","code_sha256_prefix":"618fbb2737709fa8","mcp_get_code":{"code_sha256":"618fbb2737709fa8"}}],"record_sha256":"dc95f720b4a700af6333de58fc5e5045876651754bced6dcec39b4353b1f48f9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}