{"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/evaluate-classification","entry":"evaluate_classification","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":4,"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":"2505.10607","arxiv_id_is_arxiv":true,"paper":"/paper/2505-10607","title":"MONAQ: Multi-Objective Neural Architecture Querying for Time-Series Analysis on Resource-Constrained Devices","date":"2025-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-dmlab/monaq","path":"utils/evaluator.py","file_url":"https://github.com/kaist-dmlab/monaq/blob/HEAD/utils/evaluator.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":"b2346b776733fe41","code_sha256_prefix":"b2346b776733fe41","mcp_get_code":{"code_sha256":"b2346b776733fe41"}},{"arxiv_id":"2406.07424","arxiv_id_is_arxiv":true,"paper":"/paper/miners-multilingual-language-models-as","title":"MINERS: Multilingual Language Models as Semantic Retrievers","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gentaiscool/miners","path":"classification.py","file_url":"https://github.com/gentaiscool/miners/blob/HEAD/classification.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":"73e0a652d3ec6ca9","code_sha256_prefix":"73e0a652d3ec6ca9","mcp_get_code":{"code_sha256":"73e0a652d3ec6ca9"}},{"arxiv_id":"2406.07424","arxiv_id_is_arxiv":true,"paper":"/paper/miners-multilingual-language-models-as","title":"MINERS: Multilingual Language Models as Semantic Retrievers","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gentaiscool/miners","path":"classification_ensemble.py","file_url":"https://github.com/gentaiscool/miners/blob/HEAD/classification_ensemble.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":"dd6254a6573baa16","code_sha256_prefix":"dd6254a6573baa16","mcp_get_code":{"code_sha256":"dd6254a6573baa16"}},{"arxiv_id":"2203.02053","arxiv_id_is_arxiv":true,"paper":"/paper/mind-the-gap-understanding-the-modality-gap","title":"Mind the Gap: Understanding the Modality Gap in Multi-modal Contrastive Representation Learning","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weixin-liang/modality-gap","path":"Table_1_Implications_CLIP_Zero_Shot/training/train_clip.py","file_url":"https://github.com/weixin-liang/modality-gap/blob/HEAD/Table_1_Implications_CLIP_Zero_Shot/training/train_clip.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":"639e446fd84eec00","code_sha256_prefix":"639e446fd84eec00","mcp_get_code":{"code_sha256":"639e446fd84eec00"}},{"arxiv_id":"2005.14165","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asahi417/relbert","path":"relbert/evaluation/lexical_relation_classification.py","file_url":"https://github.com/asahi417/relbert/blob/HEAD/relbert/evaluation/lexical_relation_classification.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":"87cfebcf19ab803b","code_sha256_prefix":"87cfebcf19ab803b","mcp_get_code":{"code_sha256":"87cfebcf19ab803b"}},{"arxiv_id":"1811.11264","arxiv_id_is_arxiv":true,"paper":"/paper/synthesizing-tabular-data-using-generative","title":"Synthesizing Tabular Data using Generative Adversarial Networks","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sdv-dev/TGAN","path":"tgan/research/evaluation.py","file_url":"https://github.com/sdv-dev/TGAN/blob/HEAD/tgan/research/evaluation.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":"08d8c27f690165db","code_sha256_prefix":"08d8c27f690165db","mcp_get_code":{"code_sha256":"08d8c27f690165db"}}],"record_sha256":"c0d76968acc51ce794b4810099a3812b7b2f4c7221594f6f7ebc798defc3311f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}