{"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/get-ranks","entry":"get_ranks","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2411.07404","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-context-sensitivity-and-the-knob","title":"Controllable Context Sensitivity and the Knob Behind It","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdu4108/context-vs-prior-finetuning","path":"analysis/circuit_utils/decoding.py","file_url":"https://github.com/kdu4108/context-vs-prior-finetuning/blob/HEAD/analysis/circuit_utils/decoding.py","status":"unverified","verification_level":0,"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, kdu4108/context-vs-prior-finetuning when it was checked","code_sha256":"e23d3bc3d1d61814","code_sha256_prefix":"e23d3bc3d1d61814","mcp_get_code":{"code_sha256":"e23d3bc3d1d61814"}},{"arxiv_id":"2405.19547","arxiv_id_is_arxiv":true,"paper":"/paper/cliploss-and-norm-based-data-selection","title":"CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learning","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"f889070e0cb98b2f","code_sha256_prefix":"f889070e0cb98b2f","mcp_get_code":{"code_sha256":"f889070e0cb98b2f"}},{"arxiv_id":"2405.16854","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-what-not-to-do-leverage-language","title":"Knowing What Not to Do: Leverage Language Model Insights for Action Space Pruning in Multi-agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"liuzhihao2022/espark","path":"Baseline/OR_algorithm/search_different_profit.py","file_url":"https://github.com/liuzhihao2022/espark/blob/HEAD/Baseline/OR_algorithm/search_different_profit.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e2aef5f1efa0988","code_sha256_prefix":"1e2aef5f1efa0988","mcp_get_code":{"code_sha256":"1e2aef5f1efa0988"}},{"arxiv_id":"2405.16854","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-what-not-to-do-leverage-language","title":"Knowing What Not to Do: Leverage Language Model Insights for Action Space Pruning in Multi-agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"liuzhihao2022/espark","path":"Baseline/OR_algorithm/random_actions.py","file_url":"https://github.com/liuzhihao2022/espark/blob/HEAD/Baseline/OR_algorithm/random_actions.py","status":"unverified","verification_level":0,"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":"bac932c18ae61250","code_sha256_prefix":"bac932c18ae61250","mcp_get_code":{"code_sha256":"bac932c18ae61250"}},{"arxiv_id":"2404.03539","arxiv_id_is_arxiv":true,"paper":"/paper/is-clip-the-main-roadblock-for-fine-grained","title":"Is CLIP the main roadblock for fine-grained open-world perception?","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/fg-clip","path":"src/eval_util.py","file_url":"https://github.com/lorebianchi98/fg-clip/blob/HEAD/src/eval_util.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, lorebianchi98/fg-clip when it was checked","code_sha256":"8709e2ae58e458e2","code_sha256_prefix":"8709e2ae58e458e2","mcp_get_code":{"code_sha256":"8709e2ae58e458e2"}},{"arxiv_id":"2402.02055","arxiv_id_is_arxiv":true,"paper":"/paper/variance-alignment-score-a-simple-but-tough","title":"Variance Alignment Score: A Simple But Tough-to-Beat Data Selection Method for Multimodal Contrastive Learning","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypwang61/negcliploss_normsim","path":"baselines/vas2.py","file_url":"https://github.com/ypwang61/negcliploss_normsim/blob/HEAD/baselines/vas2.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, ypwang61/negcliploss_normsim when it was checked","code_sha256":"f889070e0cb98b2f","code_sha256_prefix":"f889070e0cb98b2f","mcp_get_code":{"code_sha256":"f889070e0cb98b2f"}}],"record_sha256":"9dfd2d892ba17f56c0eedac2fcb9eb8b3637bd4c5b08314f3f6d8dfca31acf11","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}