{"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/pearson-and-spearman","entry":"pearson_and_spearman","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":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":3,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"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":"2605.30022","paper":"/paper/arxiv-2605-30022","title":"Give it Space! Explicit Disentangling of Positional and Semantic Representations in Encoders","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LequeuISIR/DSTG-encoder","path":"src/neobert/glue/evaluate_glue.py","file_url":"https://github.com/LequeuISIR/DSTG-encoder/blob/HEAD/src/neobert/glue/evaluate_glue.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2406.16282","paper":"/paper/reducing-fine-tuning-memory-overhead-by","title":"Reducing Fine-Tuning Memory Overhead by Approximate and Memory-Sharing Backpropagation","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyyyychen/LowMemoryBP","path":"experiments/roberta_exp/metric.py","file_url":"https://github.com/yyyyychen/LowMemoryBP/blob/HEAD/experiments/roberta_exp/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2312.11875","paper":"/paper/sparse-is-enough-in-fine-tuning-pre-trained","title":"Sparse is Enough in Fine-tuning Pre-trained Large Language Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"song-wx/SIFT","path":"exp/glue_benchmark/glue_metric.py","file_url":"https://github.com/song-wx/SIFT/blob/HEAD/exp/glue_benchmark/glue_metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2311.11696","paper":"/paper/sparse-low-rank-adaptation-of-pre-trained","title":"Sparse Low-rank Adaptation of Pre-trained Language Models","date":"2023-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghuac3i/sora","path":"glue.py","file_url":"https://github.com/tsinghuac3i/sora/blob/HEAD/glue.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2308.16475","paper":"/paper/transformer-compression-via-subspace","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyx1999/sp3","path":"bert/metric/glue.py","file_url":"https://github.com/hyx1999/sp3/blob/HEAD/bert/metric/glue.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2301.12132","paper":"/paper/autopeft-automatic-configuration-search-for","title":"AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuning","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/autopeft","path":"glue_metrics.py","file_url":"https://github.com/cambridgeltl/autopeft/blob/HEAD/glue_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2109.05687","paper":"/paper/raise-a-child-in-large-language-model-towards","title":"Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkunlp-icler/childtuning","path":"metric.py","file_url":"https://github.com/pkunlp-icler/childtuning/blob/HEAD/metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04926b8f59ec8600","mcp_get_code":{"code_sha256":"04926b8f59ec8600"}},{"arxiv_id":"2005.02439","paper":"/paper/contextualizing-hate-speech-classifiers-with","title":"Contextualizing Hate Speech Classifiers with Post-hoc Explanation","date":"2020-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"owaisCS/TestHateSpeech","path":"run_model.py","file_url":"https://github.com/owaisCS/TestHateSpeech/blob/HEAD/run_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e2ab003fa4ca542","mcp_get_code":{"code_sha256":"0e2ab003fa4ca542"}},{"arxiv_id":"2023.acl-long.182","paper":null,"title":"arXiv:2023.acl-long.182","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yuanhy1997/HyPe","path":"metric.py","file_url":"https://github.com/Yuanhy1997/HyPe/blob/HEAD/metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04926b8f59ec8600","mcp_get_code":{"code_sha256":"04926b8f59ec8600"}}]}