{"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/mean-reciprocal-rank","entry":"mean_reciprocal_rank","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":0,"ran_fixture":1,"ran":6,"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":"2311.03998","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-jiu-jitsu-argumentation-for-writing","title":"Exploring Jiu-Jitsu Argumentation for Writing Peer Review Rebuttals","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/emnlp2023_jiu_jitsu_argumentation_for_rebuttals","path":"codes/rebuttal_scoring/rank_metrics.py","file_url":"https://github.com/ukplab/emnlp2023_jiu_jitsu_argumentation_for_rebuttals/blob/HEAD/codes/rebuttal_scoring/rank_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ukplab/emnlp2023_jiu_jitsu_argumentation_for_rebuttals (NOASSERTION)","code_sha256":"65bd69884cbfbdc9","code_sha256_prefix":"65bd69884cbfbdc9","mcp_get_code":{"code_sha256":"65bd69884cbfbdc9"}},{"arxiv_id":"2310.14481","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CrawlScript/RpHGNN","path":"rphgnn/utils/metrics_utils.py","file_url":"https://github.com/CrawlScript/RpHGNN/blob/HEAD/rphgnn/utils/metrics_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, CrawlScript/RpHGNN, is not in the permissive set Syntology serves inline","code_sha256":"27df8c68cb97d51c","code_sha256_prefix":"27df8c68cb97d51c","mcp_get_code":{"code_sha256":"27df8c68cb97d51c"}},{"arxiv_id":"2208.11083","arxiv_id_is_arxiv":true,"paper":"/paper/learn-basic-skills-and-reuse-modularized","title":"Learn Basic Skills and Reuse: Modularized Adaptive Neural Architecture Search (MANAS)","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taloncb/manas","path":"src/utils/metrics.py","file_url":"https://github.com/taloncb/manas/blob/HEAD/src/utils/metrics.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":"aaa1a4eded561de0","code_sha256_prefix":"aaa1a4eded561de0","mcp_get_code":{"code_sha256":"aaa1a4eded561de0"}},{"arxiv_id":"2104.08769","arxiv_id_is_arxiv":true,"paper":"/paper/fair-representation-learning-for","title":"Fair Representation Learning for Heterogeneous Information Networks","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/Fair_HIN","path":"meta_path/eval_link_prediction_movie_balance_fair_constraint.py","file_url":"https://github.com/HKUST-KnowComp/Fair_HIN/blob/HEAD/meta_path/eval_link_prediction_movie_balance_fair_constraint.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, HKUST-KnowComp/Fair_HIN when it was checked","code_sha256":"88d6301d4fda91e5","code_sha256_prefix":"88d6301d4fda91e5","mcp_get_code":{"code_sha256":"88d6301d4fda91e5"}},{"arxiv_id":"2010.08269","arxiv_id_is_arxiv":true,"paper":"/paper/effective-distributed-representations-for","title":"Effective Distributed Representations for Academic Expert Search","date":"2020-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mabergerx/SDP500_expert_search","path":"Utility/Evaluation.py","file_url":"https://github.com/mabergerx/SDP500_expert_search/blob/HEAD/Utility/Evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mabergerx/SDP500_expert_search when it was checked","code_sha256":"b561d509dd7ee112","code_sha256_prefix":"b561d509dd7ee112","mcp_get_code":{"code_sha256":"b561d509dd7ee112"}},{"arxiv_id":"2006.15437","arxiv_id_is_arxiv":true,"paper":"/paper/gpt-gnn-generative-pre-training-of-graph","title":"GPT-GNN: Generative Pre-Training of Graph Neural Networks","date":"2020-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acbull/GPT-GNN","path":"GPT_GNN/utils.py","file_url":"https://github.com/acbull/GPT-GNN/blob/HEAD/GPT_GNN/utils.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":"b7094768238a0bdb","code_sha256_prefix":"b7094768238a0bdb","mcp_get_code":{"code_sha256":"b7094768238a0bdb"}},{"arxiv_id":"2003.01332","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acbull/pyHGT","path":"pyHGT/utils.py","file_url":"https://github.com/acbull/pyHGT/blob/HEAD/pyHGT/utils.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":"b7094768238a0bdb","code_sha256_prefix":"b7094768238a0bdb","mcp_get_code":{"code_sha256":"b7094768238a0bdb"}},{"arxiv_id":"1911.08621","arxiv_id_is_arxiv":true,"paper":"/paper/open-cross-domain-visual-search","title":"Open Cross-Domain Visual Search","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twuilliam/open-search","path":"metrics.py","file_url":"https://github.com/twuilliam/open-search/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ukplab/emnlp2023_jiu_jitsu_argumentation_for_rebuttals, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"65bd69884cbfbdc9","code_sha256_prefix":"65bd69884cbfbdc9","mcp_get_code":{"code_sha256":"65bd69884cbfbdc9"}},{"arxiv_id":"1702.01417","arxiv_id_is_arxiv":true,"paper":"/paper/all-but-the-top-simple-and-effective","title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","date":"2017-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgalke/vec4ir","path":"vec4ir/rank_metrics.py","file_url":"https://github.com/lgalke/vec4ir/blob/HEAD/vec4ir/rank_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ukplab/emnlp2023_jiu_jitsu_argumentation_for_rebuttals, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"65bd69884cbfbdc9","code_sha256_prefix":"65bd69884cbfbdc9","mcp_get_code":{"code_sha256":"65bd69884cbfbdc9"}},{"arxiv_id":"2023.findings-emnlp.698","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.698","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tommytyc/RSVP","path":"util.py","file_url":"https://github.com/tommytyc/RSVP/blob/HEAD/util.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":"197b02f72d4f466c","code_sha256_prefix":"197b02f72d4f466c","mcp_get_code":{"code_sha256":"197b02f72d4f466c"}},{"arxiv_id":"2022.emnlp-main.727","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.emnlp-main.727","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gzerveas/CODER","path":"metrics.py","file_url":"https://github.com/gzerveas/CODER/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16304f76974b2e2","code_sha256_prefix":"c16304f76974b2e2","mcp_get_code":{"code_sha256":"c16304f76974b2e2"}}],"record_sha256":"e027cbf4997b5a3bd9a16a31d1d4c67bba24ec71888f71b5be875f76db890de8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}