{"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-candidates","entry":"get_candidates","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":12,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":12,"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":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":5,"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":"2506.04360","arxiv_id_is_arxiv":true,"paper":"/paper/even-faster-hyperbolic-random-forests-a","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","date":"2025-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pchlenski/hyperdt","path":"hyperdt/legacy/hyperbolic_trig.py","file_url":"https://github.com/pchlenski/hyperdt/blob/HEAD/hyperdt/legacy/hyperbolic_trig.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":"4a1ac198e8523050","code_sha256_prefix":"4a1ac198e8523050","mcp_get_code":{"code_sha256":"4a1ac198e8523050"}},{"arxiv_id":"2503.03519","arxiv_id_is_arxiv":true,"paper":"/paper/do-imagenet-trained-models-learn-shortcuts","title":"Do ImageNet-trained models learn shortcuts? The impact of frequency shortcuts on generalization","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/hfss","path":"hfss/LSI.py","file_url":"https://github.com/nis-research/hfss/blob/HEAD/hfss/LSI.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f23b96953d0f71ed","code_sha256_prefix":"f23b96953d0f71ed","mcp_get_code":{"code_sha256":"f23b96953d0f71ed"}},{"arxiv_id":"2405.10311","arxiv_id_is_arxiv":true,"paper":"/paper/unirag-universal-retrieval-augmentation-for","title":"UniRAG: Universal Retrieval Augmentation for Large Vision Language Models","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/unirag","path":"src/unirag/incontext_example_provider.py","file_url":"https://github.com/castorini/unirag/blob/HEAD/src/unirag/incontext_example_provider.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, castorini/unirag when it was checked","code_sha256":"df3c779782a41086","code_sha256_prefix":"df3c779782a41086","mcp_get_code":{"code_sha256":"df3c779782a41086"}},{"arxiv_id":"2310.17914","arxiv_id_is_arxiv":true,"paper":"/paper/3d-aware-visual-question-answering-about-1","title":"3D-Aware Visual Question Answering about Parts, Poses and Occlusions","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingruiWang/superclevr-3D-question","path":"question_generation/align_removed.py","file_url":"https://github.com/XingruiWang/superclevr-3D-question/blob/HEAD/question_generation/align_removed.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":"c576aa00026275ff","code_sha256_prefix":"c576aa00026275ff","mcp_get_code":{"code_sha256":"c576aa00026275ff"}},{"arxiv_id":"2306.01930","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-converge-on-brain-like","title":"Structural Similarities Between Language Models and Neural Response Measurements","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coastalcph/brain2llm","path":"MUSE/src/dico_builder.py","file_url":"https://github.com/coastalcph/brain2llm/blob/HEAD/MUSE/src/dico_builder.py","status":"ran","verification_level":1,"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":"069588d6ca04276f","code_sha256_prefix":"069588d6ca04276f","mcp_get_code":{"code_sha256":"069588d6ca04276f"}},{"arxiv_id":"2305.14189","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-shared-vocabulary-increasing","title":"Beyond Shared Vocabulary: Increasing Representational Word Similarities across Languages for Multilingual Machine Translation","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/MUSE","path":"src/dico_builder.py","file_url":"https://github.com/facebookresearch/MUSE/blob/HEAD/src/dico_builder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, facebookresearch/MUSE (NOASSERTION)","code_sha256":"a7ca228b60019bdd","code_sha256_prefix":"a7ca228b60019bdd","mcp_get_code":{"code_sha256":"a7ca228b60019bdd"}},{"arxiv_id":"2106.03084","arxiv_id_is_arxiv":true,"paper":"/paper/combining-static-word-embeddings-and","title":"Combining Static Word Embeddings and Contextual Representations for Bilingual Lexicon Induction","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taasnim/unsup-word-translation","path":"src/dico_builder.py","file_url":"https://github.com/taasnim/unsup-word-translation/blob/HEAD/src/dico_builder.py","status":"unverified","verification_level":0,"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, taasnim/unsup-word-translation (NOASSERTION)","code_sha256":"cb12f7f5c5155ec2","code_sha256_prefix":"cb12f7f5c5155ec2","mcp_get_code":{"code_sha256":"cb12f7f5c5155ec2"}},{"arxiv_id":"2003.02365","arxiv_id_is_arxiv":true,"paper":"/paper/creating-high-resolution-images-with-a-latent","title":"Creating High Resolution Images with a Latent Adversarial Generator","date":"2020-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/lag","path":"scripts/lag_generate_candidates.py","file_url":"https://github.com/google-research/lag/blob/HEAD/scripts/lag_generate_candidates.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d16cb8b4ebc6978","code_sha256_prefix":"4d16cb8b4ebc6978","mcp_get_code":{"code_sha256":"4d16cb8b4ebc6978"}},{"arxiv_id":"1711.00043","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-machine-translation-using","title":"Unsupervised Machine Translation Using Monolingual Corpora Only","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/MultilingualFactorAnalysis","path":"src/dico_builder.py","file_url":"https://github.com/Babylonpartners/MultilingualFactorAnalysis/blob/HEAD/src/dico_builder.py","status":"ran","verification_level":1,"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":"069588d6ca04276f","code_sha256_prefix":"069588d6ca04276f","mcp_get_code":{"code_sha256":"069588d6ca04276f"}},{"arxiv_id":"1710.04087","arxiv_id_is_arxiv":true,"paper":"/paper/word-translation-without-parallel-data","title":"Word Translation Without Parallel Data","date":"2017-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunsukim86/wbw-lm","path":"src/dico_builder.py","file_url":"https://github.com/yunsukim86/wbw-lm/blob/HEAD/src/dico_builder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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, yunsukim86/wbw-lm (NOASSERTION)","code_sha256":"43adfe189ff205a7","code_sha256_prefix":"43adfe189ff205a7","mcp_get_code":{"code_sha256":"43adfe189ff205a7"}},{"arxiv_id":"1611.09268","arxiv_id_is_arxiv":true,"paper":"/paper/ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amenra/ranx","path":"ranx/fusion/bordafuse.py","file_url":"https://github.com/amenra/ranx/blob/HEAD/ranx/fusion/bordafuse.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":"ccb4d73aaca976aa","code_sha256_prefix":"ccb4d73aaca976aa","mcp_get_code":{"code_sha256":"ccb4d73aaca976aa"}},{"arxiv_id":"2023.findings-emnlp.957","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.957","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nju-websoft/AHDR-KnowledgeEnhanced","path":"src/explicit/util.py","file_url":"https://github.com/nju-websoft/AHDR-KnowledgeEnhanced/blob/HEAD/src/explicit/util.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":"e3a24f47813b52a0","code_sha256_prefix":"e3a24f47813b52a0","mcp_get_code":{"code_sha256":"e3a24f47813b52a0"}}],"record_sha256":"65e0f6c3a10d1026b7dda442b6968f591dc1a79d5e255f9ced167af8f0264283","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}