{"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/create-dictionary","entry":"create_dictionary","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":8,"n_papers_ran":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":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":2},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"292a7349c4da48f7","mcp_get_code":{"code_sha256":"292a7349c4da48f7"}},{"arxiv_id":"2007.10637","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f142ba266f46ddc","mcp_get_code":{"code_sha256":"0f142ba266f46ddc"}},{"arxiv_id":"1905.07790","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":true,"code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1905.07790","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"292a7349c4da48f7","mcp_get_code":{"code_sha256":"292a7349c4da48f7"}},{"arxiv_id":"1805.01070","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,"code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1804.00079","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,"code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1803.05449","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,"code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1705.02364","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,"code_sha256_prefix":"af7388308de7ccb4","mcp_get_code":{"code_sha256":"af7388308de7ccb4"}},{"arxiv_id":"1705.02364","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,"code_sha256_prefix":"6ebd3e9ce17919eb","mcp_get_code":{"code_sha256":"6ebd3e9ce17919eb"}},{"arxiv_id":"2021.findings-emnlp.332","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"618fbb2737709fa8","mcp_get_code":{"code_sha256":"618fbb2737709fa8"}}]}