{"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/compute-ranks","entry":"compute_ranks","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":8,"n_papers_ran":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":2,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":3},"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","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,"code_sha256_prefix":"9704017d6a608db7","mcp_get_code":{"code_sha256":"9704017d6a608db7"}},{"arxiv_id":"2002.06914","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb175edadd075161","mcp_get_code":{"code_sha256":"fb175edadd075161"}},{"arxiv_id":"1811.00145","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb0179d8567680a5","mcp_get_code":{"code_sha256":"eb0179d8567680a5"}},{"arxiv_id":"1803.10122","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb0179d8567680a5","mcp_get_code":{"code_sha256":"eb0179d8567680a5"}},{"arxiv_id":"1712.06567","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,"code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"1712.06560","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,"code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"1703.03864","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,"code_sha256_prefix":"e2d29b359d6b9487","mcp_get_code":{"code_sha256":"e2d29b359d6b9487"}},{"arxiv_id":"aaai_21392","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a8ae0794075a224","mcp_get_code":{"code_sha256":"4a8ae0794075a224"}}]}