{"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/compute-conv-output-size","entry":"compute_conv_output_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":11,"n_papers_ran":10,"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":0,"n_places":11,"n_places_pointer_only":4,"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":"2404.13588","paper":"/paper/machine-unlearning-via-null-space-calibration","title":"Machine Unlearning via Null Space Calibration","date":"2024-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqc-ml/machine-unlearning-via-null-space-calibration","path":"utils.py","file_url":"https://github.com/hqc-ml/machine-unlearning-via-null-space-calibration/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2312.11973","paper":"/paper/continual-learning-forget-free-winning","title":"Continual Learning: Forget-free Winning Subnetworks for Video Representations","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/pnr","path":"model/subnet.py","file_url":"https://github.com/ihaeyong/pnr/blob/HEAD/model/subnet.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2312.00761","paper":"/paper/deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangamesh-kodge/class_forgetting","path":"models/model_utils.py","file_url":"https://github.com/sangamesh-kodge/class_forgetting/blob/HEAD/models/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cec2ecd572648904","mcp_get_code":{"code_sha256":"cec2ecd572648904"}},{"arxiv_id":"2311.14905","paper":"/paper/class-gradient-projection-for-continual","title":"Class Gradient Projection For Continual Learning","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zackschen/CGP","path":"main_cifar100.py","file_url":"https://github.com/zackschen/CGP/blob/HEAD/main_cifar100.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2306.15058","paper":"/paper/batchgfn-generative-flow-networks-for-batch","title":"BatchGFN: Generative Flow Networks for Batch Active Learning","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-a-malik/batchgfn","path":"batchgfn/models/cnn.py","file_url":"https://github.com/s-a-malik/batchgfn/blob/HEAD/batchgfn/models/cnn.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":"fe0600be139265b3","mcp_get_code":{"code_sha256":"fe0600be139265b3"}},{"arxiv_id":"2106.05390","paper":"/paper/optimizing-reusable-knowledge-for-continual","title":"Optimizing Reusable Knowledge for Continual Learning via Metalearning","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JuliousHurtado/meta-training-setup","path":"models/conv.py","file_url":"https://github.com/JuliousHurtado/meta-training-setup/blob/HEAD/models/conv.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2103.09762","paper":"/paper/gradient-projection-memory-for-continual-1","title":"Gradient Projection Memory for Continual Learning","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sahagobinda/GPM","path":"main_cifar100.py","file_url":"https://github.com/sahagobinda/GPM/blob/HEAD/main_cifar100.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2008.11364","paper":"/paper/benchmarking-semi-supervised-federated","title":"Improving Semi-supervised Federated Learning by Reducing the Gradient Diversity of Models","date":"2020-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhcknzzm/SSFL-Benchmarking-Semi-supervised-Federated-Learning","path":"models/Semi_net.py","file_url":"https://github.com/jhcknzzm/SSFL-Benchmarking-Semi-supervised-Federated-Learning/blob/HEAD/models/Semi_net.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2003.09553","paper":"/paper/adversarial-continual-learning","title":"Adversarial Continual Learning","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/Adversarial-Continual-Learning","path":"src/utils.py","file_url":"https://github.com/facebookresearch/Adversarial-Continual-Learning/blob/HEAD/src/utils.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"1905.11614","paper":"/paper/uncertainty-based-continual-learning-with","title":"Uncertainty-based Continual Learning with Adaptive Regularization","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csm9493/UCL","path":"networks/conv_net_omniglot_ucl.py","file_url":"https://github.com/csm9493/UCL/blob/HEAD/networks/conv_net_omniglot_ucl.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":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"aaai_33972","paper":null,"title":"arXiv:aaai_33972","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sangamesh-kodge/SAP","path":"models/model_utils.py","file_url":"https://github.com/sangamesh-kodge/SAP/blob/HEAD/models/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"cec2ecd572648904","mcp_get_code":{"code_sha256":"cec2ecd572648904"}}]}