{"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/evaluator-2","entry":"evaluator","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"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":3,"ran_fixture":1,"ran":1,"unverified":4},"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":"2603.02176","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02176","title":"Organizing, Orchestrating, and Benchmarking Agent Skills at Ecosystem Scale","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ynulihao/AgentSkillOS","path":"benchmark/AgentSkillOS_bench/registry.py","file_url":"https://github.com/ynulihao/AgentSkillOS/blob/HEAD/benchmark/AgentSkillOS_bench/registry.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ynulihao/AgentSkillOS when it was checked","code_sha256":"bf1d70b73019164a","code_sha256_prefix":"bf1d70b73019164a","mcp_get_code":{"code_sha256":"bf1d70b73019164a"}},{"arxiv_id":"2510.16292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16292","title":"QSVD: Efficient Low-rank Approximation for Unified Query-Key-Value Weight Compression in Low-Precision Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"SAI-Lab-NYU/QSVD","path":"fake_quant/eval_utilsdistllava.py","file_url":"https://github.com/SAI-Lab-NYU/QSVD/blob/HEAD/fake_quant/eval_utilsdistllava.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":"c768089cdb0d6d61","code_sha256_prefix":"c768089cdb0d6d61","mcp_get_code":{"code_sha256":"c768089cdb0d6d61"}},{"arxiv_id":"2510.16292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16292","title":"QSVD: Efficient Low-rank Approximation for Unified Query-Key-Value Weight Compression in Low-Precision Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"SAI-Lab-NYU/QSVD","path":"fake_quant/eval_utilsdistseed.py","file_url":"https://github.com/SAI-Lab-NYU/QSVD/blob/HEAD/fake_quant/eval_utilsdistseed.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":"8854b3767fe1bd32","code_sha256_prefix":"8854b3767fe1bd32","mcp_get_code":{"code_sha256":"8854b3767fe1bd32"}},{"arxiv_id":"2510.16292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16292","title":"QSVD: Efficient Low-rank Approximation for Unified Query-Key-Value Weight Compression in Low-Precision Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"SAI-Lab-NYU/QSVD","path":"fake_quant/eval_utilsdistsmolvlm.py","file_url":"https://github.com/SAI-Lab-NYU/QSVD/blob/HEAD/fake_quant/eval_utilsdistsmolvlm.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":"0ce6edaafba5a1ca","code_sha256_prefix":"0ce6edaafba5a1ca","mcp_get_code":{"code_sha256":"0ce6edaafba5a1ca"}},{"arxiv_id":"2509.04202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-04202","title":"Explicit and Implicit Data Augmentation for Social Event Detection","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"congboma/SED-Aug","path":"code/utils.py","file_url":"https://github.com/congboma/SED-Aug/blob/HEAD/code/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, congboma/SED-Aug when it was checked","code_sha256":"0c947eca966fd8a3","code_sha256_prefix":"0c947eca966fd8a3","mcp_get_code":{"code_sha256":"0c947eca966fd8a3"}},{"arxiv_id":"2410.12865","arxiv_id_is_arxiv":true,"paper":"/paper/elf-gym-evaluating-large-language-models","title":"ELF-Gym: Evaluating Large Language Models Generated Features for Tabular Prediction","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lilyzhangyanlin/ELF-Gym","path":"evaluator/base.py","file_url":"https://github.com/Lilyzhangyanlin/ELF-Gym/blob/HEAD/evaluator/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Lilyzhangyanlin/ELF-Gym when it was checked","code_sha256":"0754af0fa72eaf46","code_sha256_prefix":"0754af0fa72eaf46","mcp_get_code":{"code_sha256":"0754af0fa72eaf46"}},{"arxiv_id":"2307.08430","arxiv_id_is_arxiv":true,"paper":"/paper/long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhl-hust/ldmlp","path":"hgb/utils.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/utils.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, jhl-hust/ldmlp when it was checked","code_sha256":"bdd10a0559cd9f67","code_sha256_prefix":"bdd10a0559cd9f67","mcp_get_code":{"code_sha256":"bdd10a0559cd9f67"}},{"arxiv_id":"2203.14291","arxiv_id_is_arxiv":true,"paper":"/paper/video-polyp-segmentation-a-deep-learning","title":"Video Polyp Segmentation: A Deep Learning Perspective","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gewelsji/vps","path":"eval/vps_evaluator.py","file_url":"https://github.com/gewelsji/vps/blob/HEAD/eval/vps_evaluator.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":"88d6754357faca2d","code_sha256_prefix":"88d6754357faca2d","mcp_get_code":{"code_sha256":"88d6754357faca2d"}},{"arxiv_id":"2106.04530","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-multiple-noisy-partial-labelers","title":"Learning from Multiple Noisy Partial Labelers","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"batsresearch/nplm","path":"nplm/plf/exec.py","file_url":"https://github.com/batsresearch/nplm/blob/HEAD/nplm/plf/exec.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e0222f1fd6d4471","code_sha256_prefix":"2e0222f1fd6d4471","mcp_get_code":{"code_sha256":"2e0222f1fd6d4471"}}],"record_sha256":"fced670e6d074985fe8077effde23ac9566de91923c6331ccd352936fcf4a0f3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}