{"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/resnet10","entry":"ResNet10","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":15,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":13,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":4,"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":2,"ran_fixture":0,"ran":3,"unverified":8},"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":"2603.05116","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-05116","title":"FedBCGD: Communication-Efficient Accelerated Block Coordinate Gradient Descent for Federated Learning","date":"2026-03-05","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"junkangLiu0/FedBCGD","path":"models/resnet.py","file_url":"https://github.com/junkangLiu0/FedBCGD/blob/HEAD/models/resnet.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, junkangLiu0/FedBCGD when it was checked","code_sha256":"0c476b33924be46e","code_sha256_prefix":"0c476b33924be46e","mcp_get_code":{"code_sha256":"0c476b33924be46e"}},{"arxiv_id":"2410.02116","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-knowledge","title":"Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigml-cs-ucla/mkdt","path":"distill.py","file_url":"https://github.com/bigml-cs-ucla/mkdt/blob/HEAD/distill.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, bigml-cs-ucla/mkdt when it was checked","code_sha256":"866a9b0276570cac","code_sha256_prefix":"866a9b0276570cac","mcp_get_code":{"code_sha256":"866a9b0276570cac"}},{"arxiv_id":"2406.16422","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-cross-domain-few-shot","title":"Exploring Cross-Domain Few-Shot Classification via Frequency-Aware Prompting","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkez/fap_cdfsc","path":"methods/backbone.py","file_url":"https://github.com/tinkez/fap_cdfsc/blob/HEAD/methods/backbone.py","status":"unverified","verification_level":0,"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, tinkez/fap_cdfsc when it was checked","code_sha256":"156415175e0efadf","code_sha256_prefix":"156415175e0efadf","mcp_get_code":{"code_sha256":"156415175e0efadf"}},{"arxiv_id":"2405.16560","arxiv_id_is_arxiv":true,"paper":"/paper/task-groupings-regularization-data-free-meta","title":"Task Groupings Regularization: Data-Free Meta-Learning with Heterogeneous Pre-trained Models","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"walkerworldpeace/tgr","path":"network.py","file_url":"https://github.com/walkerworldpeace/tgr/blob/HEAD/network.py","status":"unverified","verification_level":0,"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":"1c7f99c71103253a","code_sha256_prefix":"1c7f99c71103253a","mcp_get_code":{"code_sha256":"1c7f99c71103253a"}},{"arxiv_id":"2403.00567","arxiv_id_is_arxiv":true,"paper":"/paper/flatten-long-range-loss-landscapes-for-cross","title":"Flatten Long-Range Loss Landscapes for Cross-Domain Few-Shot Learning","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/flor","path":"methods/backbone.py","file_url":"https://github.com/zoilsen/flor/blob/HEAD/methods/backbone.py","status":"unverified","verification_level":0,"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, zoilsen/flor when it was checked","code_sha256":"7f253b800d51e8d9","code_sha256_prefix":"7f253b800d51e8d9","mcp_get_code":{"code_sha256":"7f253b800d51e8d9"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"BiDO/backbone.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/BiDO/backbone.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":"d30f849071ebea54","code_sha256_prefix":"d30f849071ebea54","mcp_get_code":{"code_sha256":"d30f849071ebea54"}},{"arxiv_id":"2208.10930","arxiv_id_is_arxiv":true,"paper":"/paper/fs-ban-born-again-networks-for-domain","title":"FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/Born-Again-FS","path":"baseline_model/methods/backbone.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/methods/backbone.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":"abced9a48013eeb0","code_sha256_prefix":"abced9a48013eeb0","mcp_get_code":{"code_sha256":"abced9a48013eeb0"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"BiDO/backbone.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/BiDO/backbone.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":"d30f849071ebea54","code_sha256_prefix":"d30f849071ebea54","mcp_get_code":{"code_sha256":"d30f849071ebea54"}},{"arxiv_id":"2202.02471","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learning-as-cluster-induced-voronoi","title":"Few-shot Learning as Cluster-induced Voronoi Diagrams: A Geometric Approach","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"horsepurve/deepvoro","path":"backbone.py","file_url":"https://github.com/horsepurve/deepvoro/blob/HEAD/backbone.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":"2582452f5ccbebc2","code_sha256_prefix":"2582452f5ccbebc2","mcp_get_code":{"code_sha256":"2582452f5ccbebc2"}},{"arxiv_id":"2202.01339","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-cross-domain-few-shot-learning","title":"Understanding Cross-Domain Few-Shot Learning Based on Domain Similarity and Few-Shot Difficulty","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungnyun/cd-fsl","path":"backbone.py","file_url":"https://github.com/sungnyun/cd-fsl/blob/HEAD/backbone.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":"70c0c18a54fee43a","code_sha256_prefix":"70c0c18a54fee43a","mcp_get_code":{"code_sha256":"70c0c18a54fee43a"}},{"arxiv_id":"2110.05422","arxiv_id_is_arxiv":true,"paper":"/paper/calibrate-your-listeners-robust-communication","title":"Calibrate your listeners! Robust communication-based training for pragmatic speakers","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosewang2008/calibrate_your_listeners","path":"calibrate_your_listeners/src/models/vision.py","file_url":"https://github.com/rosewang2008/calibrate_your_listeners/blob/HEAD/calibrate_your_listeners/src/models/vision.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":"be99f64faca5ddda","code_sha256_prefix":"be99f64faca5ddda","mcp_get_code":{"code_sha256":"be99f64faca5ddda"}},{"arxiv_id":"2010.06498","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-few-shot-learning-by-1","title":"Cross-Domain Few-Shot Learning by Representation Fusion","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/chef","path":"res10.py","file_url":"https://github.com/ml-jku/chef/blob/HEAD/res10.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":"dbd513fa100f72a6","code_sha256_prefix":"dbd513fa100f72a6","mcp_get_code":{"code_sha256":"dbd513fa100f72a6"}},{"arxiv_id":"1912.07200","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-benchmark-for-evaluation-of-cross","title":"A Broader Study of Cross-Domain Few-Shot Learning","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/cdfsl-benchmark","path":"backbone.py","file_url":"https://github.com/IBM/cdfsl-benchmark/blob/HEAD/backbone.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":"592e3a34636ae458","code_sha256_prefix":"592e3a34636ae458","mcp_get_code":{"code_sha256":"592e3a34636ae458"}},{"arxiv_id":"1911.03584","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-relationship-between-self-attention-1","title":"On the Relationship between Self-Attention and Convolutional Layers","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/attention-cnn","path":"models/resnet.py","file_url":"https://github.com/epfml/attention-cnn/blob/HEAD/models/resnet.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":"1119795bf433256e","code_sha256_prefix":"1119795bf433256e","mcp_get_code":{"code_sha256":"1119795bf433256e"}},{"arxiv_id":"1905.13613","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArnoutDevos/RegressionNet","path":"backbone.py","file_url":"https://github.com/ArnoutDevos/RegressionNet/blob/HEAD/backbone.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":"2582452f5ccbebc2","code_sha256_prefix":"2582452f5ccbebc2","mcp_get_code":{"code_sha256":"2582452f5ccbebc2"}}],"record_sha256":"3099da00cf91090c592a90f85528e2d83b3c79621902ebe38913a26c8894d874","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}