{"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/get-length","entry":"get_length","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":9,"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":7,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"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.14007","paper":"/paper/can-watermarks-survive-translation-on-the","title":"Can Watermarks Survive Translation? On the Cross-lingual Consistency of Text Watermark for Large Language Models","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhe99/x-sir","path":"detect.py","file_url":"https://github.com/zwhe99/x-sir/blob/HEAD/detect.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eb89e25daf2eed19","mcp_get_code":{"code_sha256":"eb89e25daf2eed19"}},{"arxiv_id":"2402.10738","paper":"/paper/let-s-learn-step-by-step-enhancing-in-context","title":"Let's Learn Step by Step: Enhancing In-Context Learning Ability with Curriculum Learning","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"61peng/curri_learning","path":"src/dataset_readers/inference_dsr.py","file_url":"https://github.com/61peng/curri_learning/blob/HEAD/src/dataset_readers/inference_dsr.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"790c0d445bff422d","mcp_get_code":{"code_sha256":"790c0d445bff422d"}},{"arxiv_id":"2308.10299","paper":"/paper/boosting-adversarial-transferability-by-block","title":"Boosting Adversarial Transferability by Block Shuffle and Rotation","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustworthy-ai-group/bsr","path":"mi_bsr.py","file_url":"https://github.com/trustworthy-ai-group/bsr/blob/HEAD/mi_bsr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c77f1cf806ad8a8","mcp_get_code":{"code_sha256":"4c77f1cf806ad8a8"}},{"arxiv_id":"2212.10375","paper":"/paper/self-adaptive-in-context-learning","title":"Self-Adaptive In-Context Learning: An Information Compression Perspective for In-Context Example Selection and Ordering","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shark-nlp/self-adaptive-icl","path":"src/dataset_readers/inference_dsr.py","file_url":"https://github.com/shark-nlp/self-adaptive-icl/blob/HEAD/src/dataset_readers/inference_dsr.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"790c0d445bff422d","mcp_get_code":{"code_sha256":"790c0d445bff422d"}},{"arxiv_id":"2211.03818","paper":"/paper/cells-a-parallel-corpus-for-biomedical-lay","title":"Retrieval augmentation of large language models for lay language generation","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linguisticanomalies/pls_retrieval","path":"evaluation/eval_difficulty.py","file_url":"https://github.com/linguisticanomalies/pls_retrieval/blob/HEAD/evaluation/eval_difficulty.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74896f54cb33ffed","mcp_get_code":{"code_sha256":"74896f54cb33ffed"}},{"arxiv_id":"2107.06592","paper":"/paper/is-someone-speaking-exploring-long-term","title":"Is Someone Speaking? Exploring Long-term Temporal Features for Audio-visual Active Speaker Detection","date":"2021-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TaoRuijie/TalkNet_ASD","path":"TalkSet/generate_TalkSet.py","file_url":"https://github.com/TaoRuijie/TalkNet_ASD/blob/HEAD/TalkSet/generate_TalkSet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f460ba227a983282","mcp_get_code":{"code_sha256":"f460ba227a983282"}},{"arxiv_id":"2006.04292","paper":"/paper/achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yromano/fair_dummies","path":"fair_dummies/cf_classification.py","file_url":"https://github.com/yromano/fair_dummies/blob/HEAD/fair_dummies/cf_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ffe424106b5b1c8","mcp_get_code":{"code_sha256":"2ffe424106b5b1c8"}},{"arxiv_id":"1810.05739","paper":"/paper/meansum-a-neural-model-for-unsupervised-multi","title":"MeanSum: A Neural Model for Unsupervised Multi-document Abstractive Summarization","date":"2018-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megagonlabs/coop","path":"coop/reader.py","file_url":"https://github.com/megagonlabs/coop/blob/HEAD/coop/reader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"a26a21444616cd3d","mcp_get_code":{"code_sha256":"a26a21444616cd3d"}},{"arxiv_id":"Wang_Boosting_Adversarial_Transferability_by_Block_Shuffle_and_Rotation_CVPR_2024_paper","paper":null,"title":"arXiv:Wang_Boosting_Adversarial_Transferability_by_Block_Shuffle_and_Rotation_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Trustworthy-AI-Group/BSR","path":"mi_bsr.py","file_url":"https://github.com/Trustworthy-AI-Group/BSR/blob/HEAD/mi_bsr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c77f1cf806ad8a8","mcp_get_code":{"code_sha256":"4c77f1cf806ad8a8"}}]}