{"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/vgg-fc-layer","entry":"vgg_fc_layer","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":7,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":2},"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":"2510.07664","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07664","title":"FedQS: Optimizing Gradient and Model Aggregation for Semi-Asynchronous Federated Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"bkjod/FedQS_","path":"utils/afl_avg_our.py","file_url":"https://github.com/bkjod/FedQS_/blob/HEAD/utils/afl_avg_our.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bkjod/FedQS_ when it was checked","code_sha256":"49a4a29d4e3d492e","code_sha256_prefix":"49a4a29d4e3d492e","mcp_get_code":{"code_sha256":"49a4a29d4e3d492e"}},{"arxiv_id":"2210.04311","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-adversarially-robust-neural-networks","title":"Pruning Adversarially Robust Neural Networks without Adversarial Examples","date":"2022-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-spiral/pwoa","path":"source/hsicbt/model/vgg.py","file_url":"https://github.com/neu-spiral/pwoa/blob/HEAD/source/hsicbt/model/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d28a2414aed5b400","code_sha256_prefix":"d28a2414aed5b400","mcp_get_code":{"code_sha256":"d28a2414aed5b400"}},{"arxiv_id":"2106.02734","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-hilbert-schmidt-information","title":"Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-spiral/hbar","path":"source/hbar/model/vgg.py","file_url":"https://github.com/neu-spiral/hbar/blob/HEAD/source/hbar/model/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d28a2414aed5b400","code_sha256_prefix":"d28a2414aed5b400","mcp_get_code":{"code_sha256":"d28a2414aed5b400"}},{"arxiv_id":"2006.06958","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-role-of-training-regimes-in","title":"Understanding the Role of Training Regimes in Continual Learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imirzadeh/stable-continual-learning","path":"external_libs/continual_learning_algorithms/utils/vgg_utils.py","file_url":"https://github.com/imirzadeh/stable-continual-learning/blob/HEAD/external_libs/continual_learning_algorithms/utils/vgg_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dceae2df5c5c47ec","code_sha256_prefix":"dceae2df5c5c47ec","mcp_get_code":{"code_sha256":"dceae2df5c5c47ec"}},{"arxiv_id":"1903.07864","arxiv_id_is_arxiv":true,"paper":"/paper/class-incremental-learning-via-deep-model","title":"Class-incremental Learning via Deep Model Consolidation","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juntingzh/incremental-learning-baselines","path":"utils/vgg_utils.py","file_url":"https://github.com/juntingzh/incremental-learning-baselines/blob/HEAD/utils/vgg_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, juntingzh/incremental-learning-baselines, 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":"dceae2df5c5c47ec","code_sha256_prefix":"dceae2df5c5c47ec","mcp_get_code":{"code_sha256":"dceae2df5c5c47ec"}},{"arxiv_id":"1812.00420","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-lifelong-learning-with-a-gem","title":"Efficient Lifelong Learning with A-GEM","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/agem","path":"model/model.py","file_url":"https://github.com/facebookresearch/agem/blob/HEAD/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b1b9b69ee1f47548","code_sha256_prefix":"b1b9b69ee1f47548","mcp_get_code":{"code_sha256":"b1b9b69ee1f47548"}},{"arxiv_id":"aaai_25958","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25958","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tsingqguo/bgmix","path":"models/vgg16.py","file_url":"https://github.com/tsingqguo/bgmix/blob/HEAD/models/vgg16.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d33159f33b5cf54c","code_sha256_prefix":"d33159f33b5cf54c","mcp_get_code":{"code_sha256":"d33159f33b5cf54c"}}],"record_sha256":"04899f757231b4052372f3459dc723499106765a42fefd07930c767d135b3dd2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}