{"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/compare","entry":"compare","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":20,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":17,"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":16,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":20,"n_places_pointer_only":2,"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":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":11,"unverified":3},"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":"2609.02350","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02350","title":"LookStep: Efficient Vision-Language Navigation with Linguistic Foresight and Event Driven Memory","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"kunyang-YU/LookStep","path":"simulation/verify_paper_results.py","file_url":"https://github.com/kunyang-YU/LookStep/blob/HEAD/simulation/verify_paper_results.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, kunyang-YU/LookStep when it was checked","code_sha256":"190a0b7e88b964c3","code_sha256_prefix":"190a0b7e88b964c3","mcp_get_code":{"code_sha256":"190a0b7e88b964c3"}},{"arxiv_id":"2607.04429","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-04429","title":"evalci: A Python Library for Statistically Rigorous Comparison of Language Model Evaluations","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Shreyaskc/evalci","path":"src/evalci/stats.py","file_url":"https://github.com/Shreyaskc/evalci/blob/HEAD/src/evalci/stats.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50c0c4ad02a4c7b8","code_sha256_prefix":"50c0c4ad02a4c7b8","mcp_get_code":{"code_sha256":"50c0c4ad02a4c7b8"}},{"arxiv_id":"2602.11948","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11948","title":"Insights on Muon from Simple Quadratics","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"agonon/muon-on-quadratics","path":"muon/runner.py","file_url":"https://github.com/agonon/muon-on-quadratics/blob/HEAD/muon/runner.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":"1af94b2c0fe0f0bf","code_sha256_prefix":"1af94b2c0fe0f0bf","mcp_get_code":{"code_sha256":"1af94b2c0fe0f0bf"}},{"arxiv_id":"2602.00190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00190","title":"From Gameplay Traces to Game Mechanics: Causal Induction with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jiwatode-mohit/SCM_4_GVGAI","path":"GVGAI_GYM/gym_gvgai/envs/gvgai/check_build.py","file_url":"https://github.com/jiwatode-mohit/SCM_4_GVGAI/blob/HEAD/GVGAI_GYM/gym_gvgai/envs/gvgai/check_build.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":"606ee3293f860d2f","code_sha256_prefix":"606ee3293f860d2f","mcp_get_code":{"code_sha256":"606ee3293f860d2f"}},{"arxiv_id":"2410.15153","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-deep-unlearning-in-large-language","title":"Evaluating Deep Unlearning in Large Language Models","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wrh14/deep_unlearning","path":"task_vector.py","file_url":"https://github.com/wrh14/deep_unlearning/blob/HEAD/task_vector.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f80682d13e9784c8","code_sha256_prefix":"f80682d13e9784c8","mcp_get_code":{"code_sha256":"f80682d13e9784c8"}},{"arxiv_id":"2310.11237","arxiv_id_is_arxiv":true,"paper":"/paper/watermarking-llms-with-weight-quantization","title":"Watermarking LLMs with Weight Quantization","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twilight92z/quantize-watermark","path":"code/param_shift.py","file_url":"https://github.com/twilight92z/quantize-watermark/blob/HEAD/code/param_shift.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, twilight92z/quantize-watermark when it was checked","code_sha256":"2db132a7046c33f2","code_sha256_prefix":"2db132a7046c33f2","mcp_get_code":{"code_sha256":"2db132a7046c33f2"}},{"arxiv_id":"2210.07185","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-utility-of-self-supervised-models-for","title":"On the Utility of Self-supervised Models for Prosody-related Tasks","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jsalt-2022-ssl/superb-prosody","path":"s3prl/utility/get_best_score.py","file_url":"https://github.com/jsalt-2022-ssl/superb-prosody/blob/HEAD/s3prl/utility/get_best_score.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":"017e86bd00a963bc","code_sha256_prefix":"017e86bd00a963bc","mcp_get_code":{"code_sha256":"017e86bd00a963bc"}},{"arxiv_id":"2208.11761","arxiv_id_is_arxiv":true,"paper":"/paper/indicsuperb-a-speech-processing-universal","title":"IndicSUPERB: A Speech Processing Universal Performance Benchmark for Indian languages","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Bharat/indicSUPERB","path":"s3prl/utility/get_best_score.py","file_url":"https://github.com/AI4Bharat/indicSUPERB/blob/HEAD/s3prl/utility/get_best_score.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":"017e86bd00a963bc","code_sha256_prefix":"017e86bd00a963bc","mcp_get_code":{"code_sha256":"017e86bd00a963bc"}},{"arxiv_id":"2105.01051","arxiv_id_is_arxiv":true,"paper":"/paper/superb-speech-processing-universal","title":"SUPERB: Speech processing Universal PERformance Benchmark","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joselyn-rodriguez/s3prl","path":"s3prl/utility/get_best_score.py","file_url":"https://github.com/joselyn-rodriguez/s3prl/blob/HEAD/s3prl/utility/get_best_score.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":"017e86bd00a963bc","code_sha256_prefix":"017e86bd00a963bc","mcp_get_code":{"code_sha256":"017e86bd00a963bc"}},{"arxiv_id":"2011.01837","arxiv_id_is_arxiv":true,"paper":"/paper/the-gap-on-gap-tackling-the-problem-of","title":"The Gap on GAP: Tackling the Problem of Differing Data Distributions in Bias-Measuring Datasets","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vid-koci/weightingGAP","path":"compute_weights.py","file_url":"https://github.com/vid-koci/weightingGAP/blob/HEAD/compute_weights.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":"b224cb4b769df69d","code_sha256_prefix":"b224cb4b769df69d","mcp_get_code":{"code_sha256":"b224cb4b769df69d"}},{"arxiv_id":"2007.06028","arxiv_id_is_arxiv":true,"paper":"/paper/tera-self-supervised-learning-of-transformer","title":"TERA: Self-Supervised Learning of Transformer Encoder Representation for Speech","date":"2020-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vernacular-ai/Multimodal-Slu","path":"utility/get_best_score.py","file_url":"https://github.com/Vernacular-ai/Multimodal-Slu/blob/HEAD/utility/get_best_score.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":"017e86bd00a963bc","code_sha256_prefix":"017e86bd00a963bc","mcp_get_code":{"code_sha256":"017e86bd00a963bc"}},{"arxiv_id":"2006.08852","arxiv_id_is_arxiv":true,"paper":"/paper/counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AishwaryaSivaraman/COMET","path":"src/Analysis.py","file_url":"https://github.com/AishwaryaSivaraman/COMET/blob/HEAD/src/Analysis.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":"c72724f074b2fbcd","code_sha256_prefix":"c72724f074b2fbcd","mcp_get_code":{"code_sha256":"c72724f074b2fbcd"}},{"arxiv_id":"2005.05298","arxiv_id_is_arxiv":true,"paper":"/paper/soloist-few-shot-task-oriented-dialog-with-a","title":"SOLOIST: Building Task Bots at Scale with Transfer Learning and Machine Teaching","date":"2020-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pengbaolin/soloist","path":"examples/reminderbot/reminderbot_server.py","file_url":"https://github.com/pengbaolin/soloist/blob/HEAD/examples/reminderbot/reminderbot_server.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26eb391f20701bb3","code_sha256_prefix":"26eb391f20701bb3","mcp_get_code":{"code_sha256":"26eb391f20701bb3"}},{"arxiv_id":"1904.01082","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-shortest-path-algorithms-via","title":"Parametric shortest-path algorithms via tropical geometry","date":null,"month_inferred_from_arxiv_id":"2019-04","title_source":"archive","repo":"MrCopprHead/joswig","path":"src/t_joswig.py","file_url":"https://github.com/MrCopprHead/joswig/blob/HEAD/src/t_joswig.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":"ccc3100e878f28d1","code_sha256_prefix":"ccc3100e878f28d1","mcp_get_code":{"code_sha256":"ccc3100e878f28d1"}},{"arxiv_id":"1806.02448","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-general-video","title":"Deep Reinforcement Learning for General Video Game AI","date":"2018-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rubenrtorrado/GVGAI_GYM","path":"gym_gvgai/envs/gvgai/check_build.py","file_url":"https://github.com/rubenrtorrado/GVGAI_GYM/blob/HEAD/gym_gvgai/envs/gvgai/check_build.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":"606ee3293f860d2f","code_sha256_prefix":"606ee3293f860d2f","mcp_get_code":{"code_sha256":"606ee3293f860d2f"}},{"arxiv_id":"1805.10712","arxiv_id_is_arxiv":true,"paper":"/paper/netlsd-hearing-the-shape-of-a-graph","title":"NetLSD: Hearing the Shape of a Graph","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"xgfs/NetLSD","path":"netlsd/kernels.py","file_url":"https://github.com/xgfs/NetLSD/blob/HEAD/netlsd/kernels.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":"d95924b5cf7969a7","code_sha256_prefix":"d95924b5cf7969a7","mcp_get_code":{"code_sha256":"d95924b5cf7969a7"}},{"arxiv_id":"1603.09320","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakao/n2","path":"benchmarks/compare.py","file_url":"https://github.com/kakao/n2/blob/HEAD/benchmarks/compare.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":"7f2e786868a36028","code_sha256_prefix":"7f2e786868a36028","mcp_get_code":{"code_sha256":"7f2e786868a36028"}},{"arxiv_id":"ijcai2025_1187","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_1187","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"eltonlaw/impyute","path":"impyute/contrib/compare.py","file_url":"https://github.com/eltonlaw/impyute/blob/HEAD/impyute/contrib/compare.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":"e2a8e825033f724f","code_sha256_prefix":"e2a8e825033f724f","mcp_get_code":{"code_sha256":"e2a8e825033f724f"}},{"arxiv_id":"aaai_29915","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29915","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jjyunlp/GenerationRE","path":"post-process.py","file_url":"https://github.com/jjyunlp/GenerationRE/blob/HEAD/post-process.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":"98fcf8703c5e71b1","code_sha256_prefix":"98fcf8703c5e71b1","mcp_get_code":{"code_sha256":"98fcf8703c5e71b1"}},{"arxiv_id":"2025.findings-acl.141","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.141","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mahesh-ak/SktQA","path":"SktQA/nlu_eval.py","file_url":"https://github.com/mahesh-ak/SktQA/blob/HEAD/SktQA/nlu_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32fa2aa56e85a7a1","code_sha256_prefix":"32fa2aa56e85a7a1","mcp_get_code":{"code_sha256":"32fa2aa56e85a7a1"}}],"record_sha256":"f78e579d171e62bc4d85f5be106fd3f0ca68c1c30b1dd27e2fa2701fdcec4a4b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}