{"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/rank","entry":"rank","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":18,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":19,"n_places_pointer_only":13,"n_places_pointer_only_link_open":5,"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":4,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":1},"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":"2606.03465","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03465","title":"Rethinking the Role of Tensor Decompositions in Post-Training LLM Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"brain-lab-research/TT-LLM","path":"src/tucker_llm/laser/matrix_utils.py","file_url":"https://github.com/brain-lab-research/TT-LLM/blob/HEAD/src/tucker_llm/laser/matrix_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, brain-lab-research/TT-LLM when it was checked","code_sha256":"15557c4657639788","code_sha256_prefix":"15557c4657639788","mcp_get_code":{"code_sha256":"15557c4657639788"}},{"arxiv_id":"2502.17771","arxiv_id_is_arxiv":true,"paper":"/paper/sample-selection-via-contrastive","title":"Sample Selection via Contrastive Fragmentation for Noisy Label Regression","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cdjkim/ConFrag","path":"utils/regularizer_util.py","file_url":"https://github.com/cdjkim/ConFrag/blob/HEAD/utils/regularizer_util.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 BorealisAI/ranksim-imbalanced-regression, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2e1e2e8c543195f7","code_sha256_prefix":"2e1e2e8c543195f7","mcp_get_code":{"code_sha256":"2e1e2e8c543195f7"}},{"arxiv_id":"2411.19946","arxiv_id_is_arxiv":true,"paper":"/paper/delt-a-simple-diversity-driven-earlylate","title":"DELT: A Simple Diversity-driven EarlyLate Training for Dataset Distillation","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vila-lab/delt","path":"data_selection.py","file_url":"https://github.com/vila-lab/delt/blob/HEAD/data_selection.py","status":"ran","verification_level":1,"contract_check":null,"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, vila-lab/delt when it was checked","code_sha256":"c80674a8056b7f9e","code_sha256_prefix":"c80674a8056b7f9e","mcp_get_code":{"code_sha256":"c80674a8056b7f9e"}},{"arxiv_id":"2411.04097","arxiv_id_is_arxiv":true,"paper":"/paper/ravl-discovering-and-mitigating-spurious","title":"RaVL: Discovering and Mitigating Spurious Correlations in Fine-Tuned Vision-Language Models","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-aimi/ravl","path":"ravl/discover.py","file_url":"https://github.com/stanford-aimi/ravl/blob/HEAD/ravl/discover.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":"9c004fa3c8c06897","code_sha256_prefix":"9c004fa3c8c06897","mcp_get_code":{"code_sha256":"9c004fa3c8c06897"}},{"arxiv_id":"2411.03670","arxiv_id_is_arxiv":true,"paper":"/paper/touchstone-benchmark-are-we-on-the-right-way","title":"Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation?","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrgiovanni/touchstone","path":"plot/SignificanceMaps.py","file_url":"https://github.com/mrgiovanni/touchstone/blob/HEAD/plot/SignificanceMaps.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, mrgiovanni/touchstone (NOASSERTION)","code_sha256":"347edcad909a71e8","code_sha256_prefix":"347edcad909a71e8","mcp_get_code":{"code_sha256":"347edcad909a71e8"}},{"arxiv_id":"2410.22124","arxiv_id_is_arxiv":true,"paper":"/paper/rankup-boosting-semi-supervised-regression","title":"RankUp: Boosting Semi-Supervised Regression with an Auxiliary Ranking Classifier","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pm25/semi-supervised-regression","path":"semilearn/algorithms/clss/ulb_rank.py","file_url":"https://github.com/pm25/semi-supervised-regression/blob/HEAD/semilearn/algorithms/clss/ulb_rank.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 BorealisAI/ranksim-imbalanced-regression, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2e1e2e8c543195f7","code_sha256_prefix":"2e1e2e8c543195f7","mcp_get_code":{"code_sha256":"2e1e2e8c543195f7"}},{"arxiv_id":"2401.10474","arxiv_id_is_arxiv":true,"paper":"/paper/ldreg-local-dimensionality-regularized-self","title":"LDReg: Local Dimensionality Regularized Self-Supervised Learning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoJoNing25/DDAug","path":"losses/ntxent_lidaug.py","file_url":"https://github.com/JoJoNing25/DDAug/blob/HEAD/losses/ntxent_lidaug.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a38b33a0219b2651","code_sha256_prefix":"a38b33a0219b2651","mcp_get_code":{"code_sha256":"a38b33a0219b2651"}},{"arxiv_id":"2312.13558","arxiv_id_is_arxiv":true,"paper":"/paper/the-truth-is-in-there-improving-reasoning-in","title":"The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reduction","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pratyushasharma/laser","path":"src/laser/matrix_utils.py","file_url":"https://github.com/pratyushasharma/laser/blob/HEAD/src/laser/matrix_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 brain-lab-research/TT-LLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"15557c4657639788","code_sha256_prefix":"15557c4657639788","mcp_get_code":{"code_sha256":"15557c4657639788"}},{"arxiv_id":"2307.05109","arxiv_id_is_arxiv":true,"paper":"/paper/conformalization-of-sparse-generalized-linear","title":"Conformalization of Sparse Generalized Linear Models","date":"2023-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etashguha/sparse_conformal","path":"rootCP/rootcp/rootCP.py","file_url":"https://github.com/etashguha/sparse_conformal/blob/HEAD/rootCP/rootcp/rootCP.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb3b2353d3baa939","code_sha256_prefix":"eb3b2353d3baa939","mcp_get_code":{"code_sha256":"eb3b2353d3baa939"}},{"arxiv_id":"2307.05109","arxiv_id_is_arxiv":true,"paper":"/paper/conformalization-of-sparse-generalized-linear","title":"Conformalization of Sparse Generalized Linear Models","date":"2023-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"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":"749ee319396aaa01","code_sha256_prefix":"749ee319396aaa01","mcp_get_code":{"code_sha256":"749ee319396aaa01"}},{"arxiv_id":"2303.16133","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-and-addressing-cross-task","title":"Exposing and Addressing Cross-Task Inconsistency in Unified Vision-Language Models","date":"2023-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adymaharana/cococon","path":"unified-io/evaluate_contrast_all_tasks.py","file_url":"https://github.com/adymaharana/cococon/blob/HEAD/unified-io/evaluate_contrast_all_tasks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"08a5061ff824fcc4","code_sha256_prefix":"08a5061ff824fcc4","mcp_get_code":{"code_sha256":"08a5061ff824fcc4"}},{"arxiv_id":"2207.04873","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-average-precision-training-for","title":"Hierarchical Average Precision Training for Pertinent Image Retrieval","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elias-ramzi/HAPPIER","path":"happier/losses/hap_loss.py","file_url":"https://github.com/elias-ramzi/HAPPIER/blob/HEAD/happier/losses/hap_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85bac81fb967d1ed","code_sha256_prefix":"85bac81fb967d1ed","mcp_get_code":{"code_sha256":"85bac81fb967d1ed"}},{"arxiv_id":"2205.15236","arxiv_id_is_arxiv":true,"paper":"/paper/ranksim-ranking-similarity-regularization-for","title":"RankSim: Ranking Similarity Regularization for Deep Imbalanced Regression","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BorealisAI/ranksim-imbalanced-regression","path":"agedb-dir/ranksim.py","file_url":"https://github.com/BorealisAI/ranksim-imbalanced-regression/blob/HEAD/agedb-dir/ranksim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, BorealisAI/ranksim-imbalanced-regression (NOASSERTION)","code_sha256":"2e1e2e8c543195f7","code_sha256_prefix":"2e1e2e8c543195f7","mcp_get_code":{"code_sha256":"2e1e2e8c543195f7"}},{"arxiv_id":"2112.10224","arxiv_id_is_arxiv":true,"paper":"/paper/stable-conformal-prediction-sets","title":"Stable Conformal Prediction Sets","date":"2021-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenendiaye/stable_conformal_prediction","path":"bench_stabCP/stabCP.py","file_url":"https://github.com/eugenendiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/stabCP.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"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, eugenendiaye/stable_conformal_prediction (NOASSERTION)","code_sha256":"749ee319396aaa01","code_sha256_prefix":"749ee319396aaa01","mcp_get_code":{"code_sha256":"749ee319396aaa01"}},{"arxiv_id":"2110.01445","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-decomposable-average-precision-for","title":"Robust and Decomposable Average Precision for Image Retrieval","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elias-ramzi/roadmap","path":"roadmap/losses/blackbox_ap.py","file_url":"https://github.com/elias-ramzi/roadmap/blob/HEAD/roadmap/losses/blackbox_ap.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 BorealisAI/ranksim-imbalanced-regression, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2e1e2e8c543195f7","code_sha256_prefix":"2e1e2e8c543195f7","mcp_get_code":{"code_sha256":"2e1e2e8c543195f7"}},{"arxiv_id":"2104.06648","arxiv_id_is_arxiv":true,"paper":"/paper/root-finding-approaches-for-computing","title":"Root-finding Approaches for Computing Conformal Prediction Set","date":"2021-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EugeneNdiaye/rootCP","path":"rootcp/interpolationCP.py","file_url":"https://github.com/EugeneNdiaye/rootCP/blob/HEAD/rootcp/interpolationCP.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EugeneNdiaye/rootCP when it was checked","code_sha256":"eb3b2353d3baa939","code_sha256_prefix":"eb3b2353d3baa939","mcp_get_code":{"code_sha256":"eb3b2353d3baa939"}},{"arxiv_id":"2006.06466","arxiv_id_is_arxiv":true,"paper":"/paper/how-interpretable-and-trustworthy-are-gams","title":"How Interpretable and Trustworthy are GAMs?","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzzace2000/GAMs","path":"vis_utils.py","file_url":"https://github.com/zzzace2000/GAMs/blob/HEAD/vis_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zzzace2000/GAMs when it was checked","code_sha256":"23b7c40d98b569d8","code_sha256_prefix":"23b7c40d98b569d8","mcp_get_code":{"code_sha256":"23b7c40d98b569d8"}},{"arxiv_id":"2003.11657","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-matching-via-blackbox","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martius-lab/blackbox-backprop","path":"blackbox_backprop/ranking.py","file_url":"https://github.com/martius-lab/blackbox-backprop/blob/HEAD/blackbox_backprop/ranking.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 BorealisAI/ranksim-imbalanced-regression, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2e1e2e8c543195f7","code_sha256_prefix":"2e1e2e8c543195f7","mcp_get_code":{"code_sha256":"2e1e2e8c543195f7"}},{"arxiv_id":"1907.12763","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-localization-of-moments-in-video","title":"Finding Moments in Video Collections Using Natural Language","date":"2019-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"escorciav/moments-retrieval-page","path":"evaluation.py","file_url":"https://github.com/escorciav/moments-retrieval-page/blob/HEAD/evaluation.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":"c1da49f7d5c70e4e","code_sha256_prefix":"c1da49f7d5c70e4e","mcp_get_code":{"code_sha256":"c1da49f7d5c70e4e"}}],"record_sha256":"f7912c0e8afd818624792705189a842d1b1f22fc5786f266ff1cff6fc9035ebd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}