{"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/convert-array","entry":"convert_array","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":6,"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":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"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":"2501.05906","paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"data.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7eaf327f929283a","mcp_get_code":{"code_sha256":"d7eaf327f929283a"}},{"arxiv_id":"2310.00451","paper":"/paper/on-the-role-of-neural-collapse-in-meta","title":"On the Role of Neural Collapse in Meta Learning Models for Few-shot Learning","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saakethmm/nc-prototypical-networks","path":"protonets/utils/log.py","file_url":"https://github.com/saakethmm/nc-prototypical-networks/blob/HEAD/protonets/utils/log.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4601716ebff8a67b","mcp_get_code":{"code_sha256":"4601716ebff8a67b"}},{"arxiv_id":"2306.04201","paper":"/paper/improving-hyperparameter-learning-under","title":"Improving Hyperparameter Learning under Approximate Inference in Gaussian Process Models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/improved-hyperparameter-learning","path":"python/bayesian_benchmarks/database_utils.py","file_url":"https://github.com/aaltoml/improved-hyperparameter-learning/blob/HEAD/python/bayesian_benchmarks/database_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6969043e1e929528","mcp_get_code":{"code_sha256":"6969043e1e929528"}},{"arxiv_id":"1902.08605","paper":"/paper/centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabrielhuang/centroid-networks","path":"protonets/utils/log.py","file_url":"https://github.com/gabrielhuang/centroid-networks/blob/HEAD/protonets/utils/log.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4601716ebff8a67b","mcp_get_code":{"code_sha256":"4601716ebff8a67b"}},{"arxiv_id":"1806.05975","paper":"/paper/structured-variational-learning-of-bayesian","title":"Structured Variational Learning of Bayesian Neural Networks with Horseshoe Priors","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hughsalimbeni/bayesian_benchmarks","path":"bayesian_benchmarks/database_utils.py","file_url":"https://github.com/hughsalimbeni/bayesian_benchmarks/blob/HEAD/bayesian_benchmarks/database_utils.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":"6969043e1e929528","mcp_get_code":{"code_sha256":"6969043e1e929528"}},{"arxiv_id":"1012.2599","paper":"/paper/a-tutorial-on-bayesian-optimization-of","title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","date":"2010-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chariff/GPro","path":"GPro/validations.py","file_url":"https://github.com/chariff/GPro/blob/HEAD/GPro/validations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"318ddf5331788977","mcp_get_code":{"code_sha256":"318ddf5331788977"}}]}