{"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/compute-conv-output-size","entry":"compute_conv_output_size","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2404.13588","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hqc-ml/machine-unlearning-via-null-space-calibration when it was checked","code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2312.11973","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2312.00761","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sangamesh-kodge/class_forgetting when it was checked","code_sha256":"cec2ecd572648904","code_sha256_prefix":"cec2ecd572648904","mcp_get_code":{"code_sha256":"cec2ecd572648904"}},{"arxiv_id":"2311.14905","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zackschen/CGP when it was checked","code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2306.15058","arxiv_id_is_arxiv":true,"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":"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":"fe0600be139265b3","code_sha256_prefix":"fe0600be139265b3","mcp_get_code":{"code_sha256":"fe0600be139265b3"}},{"arxiv_id":"2106.05390","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2103.09762","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2008.11364","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"2003.09553","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/Adversarial-Continual-Learning, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"1905.11614","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71c2a2bc2fc8909","code_sha256_prefix":"e71c2a2bc2fc8909","mcp_get_code":{"code_sha256":"e71c2a2bc2fc8909"}},{"arxiv_id":"aaai_33972","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id 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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from sangamesh-kodge/class_forgetting, and GitHub detected no licence in that repository when it was checked","code_sha256":"cec2ecd572648904","code_sha256_prefix":"cec2ecd572648904","mcp_get_code":{"code_sha256":"cec2ecd572648904"}}],"record_sha256":"7dcf8bbe3c89cf724c5dd52075d653616f686cd7787847e2a2fe26cd0f13379c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}