{"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/compute-ranks","entry":"compute_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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":3,"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":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"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":"2309.17133","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-late-interaction-multi-modal-1","title":"Fine-grained Late-interaction Multi-modal Retrieval for Retrieval Augmented Visual Question Answering","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linweizhedragon/retrieval-augmented-visual-question-answering","path":"materials/Oscar/oscar/run_retrieval.py","file_url":"https://github.com/linweizhedragon/retrieval-augmented-visual-question-answering/blob/HEAD/materials/Oscar/oscar/run_retrieval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, linweizhedragon/retrieval-augmented-visual-question-answering, is not in the permissive set Syntology serves inline","code_sha256":"9704017d6a608db7","code_sha256_prefix":"9704017d6a608db7","mcp_get_code":{"code_sha256":"9704017d6a608db7"}},{"arxiv_id":"2002.06914","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-and-fair-comparison-of-link","title":"On the Ambiguity of Rank-Based Evaluation of Entity Alignment or Link Prediction Methods","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mberr/rank-based-evaluation","path":"src/kgm/eval/common.py","file_url":"https://github.com/mberr/rank-based-evaluation/blob/HEAD/src/kgm/eval/common.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":"fb175edadd075161","code_sha256_prefix":"fb175edadd075161","mcp_get_code":{"code_sha256":"fb175edadd075161"}},{"arxiv_id":"1811.00145","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-end-to-end-autonomous-vehicle","title":"Scalable End-to-End Autonomous Vehicle Testing via Rare-event Simulation","date":"2018-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amansinha/neural-bridge","path":"envs/car_racing/WorldModel/es.py","file_url":"https://github.com/amansinha/neural-bridge/blob/HEAD/envs/car_racing/WorldModel/es.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":"eb0179d8567680a5","code_sha256_prefix":"eb0179d8567680a5","mcp_get_code":{"code_sha256":"eb0179d8567680a5"}},{"arxiv_id":"1803.10122","arxiv_id_is_arxiv":true,"paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arunavkonwar/world-models","path":"es.py","file_url":"https://github.com/arunavkonwar/world-models/blob/HEAD/es.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":"eb0179d8567680a5","code_sha256_prefix":"eb0179d8567680a5","mcp_get_code":{"code_sha256":"eb0179d8567680a5"}},{"arxiv_id":"1712.06567","arxiv_id_is_arxiv":true,"paper":"/paper/deep-neuroevolution-genetic-algorithms-are-a","title":"Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning","date":"2017-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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":"e2d29b359d6b9487","code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"1712.06560","arxiv_id_is_arxiv":true,"paper":"/paper/improving-exploration-in-evolution-strategies","title":"Improving Exploration in Evolution Strategies for Deep Reinforcement Learning via a Population of Novelty-Seeking Agents","date":"2017-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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":"e2d29b359d6b9487","code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"1703.03864","arxiv_id_is_arxiv":true,"paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/evolution-strategies-starter","path":"es_distributed/es.py","file_url":"https://github.com/openai/evolution-strategies-starter/blob/HEAD/es_distributed/es.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2d29b359d6b9487","code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"aaai_21392","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21392","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"umanlp/tg2019task","path":"evaluate.py","file_url":"https://github.com/umanlp/tg2019task/blob/HEAD/evaluate.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":"4a8ae0794075a224","code_sha256_prefix":"4a8ae0794075a224","mcp_get_code":{"code_sha256":"4a8ae0794075a224"}}],"record_sha256":"8c9a2394a47f8b93f83b8d1402e7daa2246de6be9348cb0f633551593b2ad7ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}