{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/map-labels","entry":"map_labels","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2403.04272","paper":"/paper/active-generalized-category-discovery","title":"Active Generalized Category Discovery","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/activegcd","path":"utils_al/train_recipes_ema.py","file_url":"https://github.com/mashijie1028/activegcd/blob/HEAD/utils_al/train_recipes_ema.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec7d8c7bbd17eaa8","mcp_get_code":{"code_sha256":"ec7d8c7bbd17eaa8"}},{"arxiv_id":"2402.13956","paper":"/paper/can-you-learn-semantics-through-next-word","title":"Can You Learn Semantics Through Next-Word Prediction? The Case of Entailment","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofengwu/entailment-from-lm","path":"trained_classifier.py","file_url":"https://github.com/zhaofengwu/entailment-from-lm/blob/HEAD/trained_classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e065c52100664b5f","mcp_get_code":{"code_sha256":"e065c52100664b5f"}},{"arxiv_id":"2010.05063","paper":"/paper/meta-aggregating-networks-for-class-1","title":"Adaptive Aggregation Networks for Class-Incremental Learning","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoyao-liu/class-incremental-learning","path":"adaptive-aggregation-networks/trainer/incremental_lucir.py","file_url":"https://github.com/yaoyao-liu/class-incremental-learning/blob/HEAD/adaptive-aggregation-networks/trainer/incremental_lucir.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"368a74858ba14c36","mcp_get_code":{"code_sha256":"368a74858ba14c36"}},{"arxiv_id":"2004.01468","paper":"/paper/epitomic-variational-graph-autoencoder","title":"Epitomic Variational Graph Autoencoder","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RayyanRiaz/EVGAE","path":"helpers.py","file_url":"https://github.com/RayyanRiaz/EVGAE/blob/HEAD/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"105c844c00b9e257","mcp_get_code":{"code_sha256":"105c844c00b9e257"}},{"arxiv_id":"1806.04224","paper":"/paper/neuronet-fast-and-robust-reproduction-of","title":"NeuroNet: Fast and Robust Reproduction of Multiple Brain Image Segmentation Pipelines","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DLTK/models","path":"ukbb_neuronet_brain_segmentation/reader.py","file_url":"https://github.com/DLTK/models/blob/HEAD/ukbb_neuronet_brain_segmentation/reader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fcfda4902aa25b39","mcp_get_code":{"code_sha256":"fcfda4902aa25b39"}}]}