{"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/rank-normalised","entry":"rank_normalised","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":6,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":0},"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":"2502.17771","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":true,"code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"arxiv_id":"2410.22124","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":true,"code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"arxiv_id":"2403.04943","paper":"/paper/afreeca-annotation-free-counting-for-all","title":"AFreeCA: Annotation-Free Counting for All","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrian-dalessandro/AFreeCA","path":"src/layers/diffrank.py","file_url":"https://github.com/adrian-dalessandro/AFreeCA/blob/HEAD/src/layers/diffrank.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a94f7d08ed2b28b0","mcp_get_code":{"code_sha256":"a94f7d08ed2b28b0"}},{"arxiv_id":"2205.15236","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,"code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"arxiv_id":"2110.01445","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":true,"code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"arxiv_id":"2003.11657","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":true,"code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}}]}