{"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/size","entry":"size","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":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":3,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2310.14845","paper":"/paper/ultra-dp-unifying-graph-pre-training-with","title":"ULTRA-DP: Unifying Graph Pre-training with Multi-task Graph Dual Prompt","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keytoyze/ultra-dp","path":"preprocess_reachability.py","file_url":"https://github.com/keytoyze/ultra-dp/blob/HEAD/preprocess_reachability.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6abb242a63c1987c","mcp_get_code":{"code_sha256":"6abb242a63c1987c"}},{"arxiv_id":"2303.04673","paper":"/paper/cost-effective-hyperparameter-optimization","title":"Cost-Effective Hyperparameter Optimization for Large Language Model Generation Inference","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin666aa/flaml","path":"flaml/automl/automl.py","file_url":"https://github.com/kevin666aa/flaml/blob/HEAD/flaml/automl/automl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"f29ed149e7409855","mcp_get_code":{"code_sha256":"f29ed149e7409855"}},{"arxiv_id":"2106.09204","paper":"/paper/an-empirical-study-on-hyperparameter","title":"An Empirical Study on Hyperparameter Optimization for Fine-Tuning Pre-trained Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"f29ed149e7409855","mcp_get_code":{"code_sha256":"f29ed149e7409855"}},{"arxiv_id":"2106.04815","paper":"/paper/chacha-for-online-automl","title":"ChaCha for Online AutoML","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/flaml","path":"flaml/automl/automl.py","file_url":"https://github.com/microsoft/flaml/blob/HEAD/flaml/automl/automl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f29ed149e7409855","mcp_get_code":{"code_sha256":"f29ed149e7409855"}},{"arxiv_id":"1906.05226","paper":"/paper/continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramakanth-pasunuru/CAS-MAS","path":"models/shared_base.py","file_url":"https://github.com/ramakanth-pasunuru/CAS-MAS/blob/HEAD/models/shared_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6115371bb3b59d87","mcp_get_code":{"code_sha256":"6115371bb3b59d87"}}]}