{"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-normalised","entry":"rank_normalised","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":6,"n_places_pointer_only_link_open":4,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"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":"ed49cae4f66fd45c","code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"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":"ed49cae4f66fd45c","code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"arxiv_id":"2403.04943","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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, adrian-dalessandro/AFreeCA (NOASSERTION)","code_sha256":"a94f7d08ed2b28b0","code_sha256_prefix":"a94f7d08ed2b28b0","mcp_get_code":{"code_sha256":"a94f7d08ed2b28b0"}},{"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":"ed49cae4f66fd45c","code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"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":"ed49cae4f66fd45c","code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}},{"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":"ed49cae4f66fd45c","code_sha256_prefix":"ed49cae4f66fd45c","mcp_get_code":{"code_sha256":"ed49cae4f66fd45c"}}],"record_sha256":"ae5dc19127caa71c97b73676de3d462ee720eccfd32dd3bfff008785d67c26c7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}