{"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/pearson-and-spearman","entry":"pearson_and_spearman","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":1,"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":"2605.30022","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LequeuISIR/DSTG-encoder when it was checked","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2406.16282","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from LequeuISIR/DSTG-encoder, and GitHub detected no licence in that repository when it was checked","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2312.11875","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, song-wx/SIFT when it was checked","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2311.11696","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tsinghuac3i/sora when it was checked","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2308.16475","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hyx1999/sp3 when it was checked","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2301.12132","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, cambridgeltl/autopeft, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e3e13638a674e4b1","code_sha256_prefix":"e3e13638a674e4b1","mcp_get_code":{"code_sha256":"e3e13638a674e4b1"}},{"arxiv_id":"2109.05687","arxiv_id_is_arxiv":true,"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":"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":"04926b8f59ec8600","code_sha256_prefix":"04926b8f59ec8600","mcp_get_code":{"code_sha256":"04926b8f59ec8600"}},{"arxiv_id":"2005.02439","arxiv_id_is_arxiv":true,"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":"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":"0e2ab003fa4ca542","code_sha256_prefix":"0e2ab003fa4ca542","mcp_get_code":{"code_sha256":"0e2ab003fa4ca542"}},{"arxiv_id":"2023.acl-long.182","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"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":"04926b8f59ec8600","code_sha256_prefix":"04926b8f59ec8600","mcp_get_code":{"code_sha256":"04926b8f59ec8600"}}],"record_sha256":"661f4b625264fac43f268501157bcefc457a2158d1d95a2512310050a68b4c02","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}