{"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/convnet","entry":"ConvNet","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"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":14,"n_samples_ran":13,"n_samples_constructed":9,"n_samples_ran_checked":13,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":7,"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":0,"ran_fixture":0,"ran":13,"unverified":1},"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":"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","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, bigml-cs-ucla/mkdt when it was checked","code_sha256":"ca6e6ec945d065f2","code_sha256_prefix":"ca6e6ec945d065f2","mcp_get_code":{"code_sha256":"ca6e6ec945d065f2"}},{"arxiv_id":"2406.03057","arxiv_id_is_arxiv":true,"paper":"/paper/bws-best-window-selection-based-on-sample","title":"BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Ranges","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NohyunKi/BWS","path":"model/convnet.py","file_url":"https://github.com/NohyunKi/BWS/blob/HEAD/model/convnet.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, NohyunKi/BWS when it was checked","code_sha256":"2dfd0d1de2e58612","code_sha256_prefix":"2dfd0d1de2e58612","mcp_get_code":{"code_sha256":"2dfd0d1de2e58612"}},{"arxiv_id":"2406.18561","arxiv_id_is_arxiv":true,"paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Yongalls/SelMatch when it was checked","code_sha256":"cf3443b66d74eec0","code_sha256_prefix":"cf3443b66d74eec0","mcp_get_code":{"code_sha256":"cf3443b66d74eec0"}},{"arxiv_id":"2310.00093","arxiv_id_is_arxiv":true,"paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, datadistillation/datadam when it was checked","code_sha256":"cacbe6eda6096eec","code_sha256_prefix":"cacbe6eda6096eec","mcp_get_code":{"code_sha256":"cacbe6eda6096eec"}},{"arxiv_id":"2203.01531","arxiv_id_is_arxiv":true,"paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.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, kaiwang960112/cafe when it was checked","code_sha256":"1a326419c73ee5da","code_sha256_prefix":"1a326419c73ee5da","mcp_get_code":{"code_sha256":"1a326419c73ee5da"}},{"arxiv_id":"2005.02359","arxiv_id_is_arxiv":true,"paper":"/paper/classification-based-anomaly-detection-for-1","title":"Classification-Based Anomaly Detection for General Data","date":"2020-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/DeepOD","path":"deepod/models/tabular/goad.py","file_url":"https://github.com/xuhongzuo/DeepOD/blob/HEAD/deepod/models/tabular/goad.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51a1f05a69ec1e74","code_sha256_prefix":"51a1f05a69ec1e74","mcp_get_code":{"code_sha256":"51a1f05a69ec1e74"}},{"arxiv_id":"2002.11896","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-boosted-flows","title":"Gradient Boosted Normalizing Flows","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robert-giaquinto/gradient-boosted-normalizing-flows","path":"models/boosted_flow.py","file_url":"https://github.com/robert-giaquinto/gradient-boosted-normalizing-flows/blob/HEAD/models/boosted_flow.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":"85e265af1f8b4721","code_sha256_prefix":"85e265af1f8b4721","mcp_get_code":{"code_sha256":"85e265af1f8b4721"}},{"arxiv_id":"2002.06038","arxiv_id_is_arxiv":true,"paper":"/paper/never-give-up-learning-directed-exploration-1","title":"Never Give Up: Learning Directed Exploration Strategies","date":"2020-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YHL04/agent57","path":"curiosity/episodicnovelty.py","file_url":"https://github.com/YHL04/agent57/blob/HEAD/curiosity/episodicnovelty.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":"c31a9de8654051ec","code_sha256_prefix":"c31a9de8654051ec","mcp_get_code":{"code_sha256":"c31a9de8654051ec"}},{"arxiv_id":"1703.05175","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HenryCWoo/LTLProject","path":"models/convnet_mini.py","file_url":"https://github.com/HenryCWoo/LTLProject/blob/HEAD/models/convnet_mini.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c8ab3061fc4f61b","code_sha256_prefix":"0c8ab3061fc4f61b","mcp_get_code":{"code_sha256":"0c8ab3061fc4f61b"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crashmoon/MAML-Pytorch-Multi-GPUs","path":"meta_learner.py","file_url":"https://github.com/crashmoon/MAML-Pytorch-Multi-GPUs/blob/HEAD/meta_learner.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, crashmoon/MAML-Pytorch-Multi-GPUs when it was checked","code_sha256":"5d78dd8984d02527","code_sha256_prefix":"5d78dd8984d02527","mcp_get_code":{"code_sha256":"5d78dd8984d02527"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seacevedo/ReinforcementLearningProjects","path":"ddqn.py","file_url":"https://github.com/seacevedo/ReinforcementLearningProjects/blob/HEAD/ddqn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seacevedo/ReinforcementLearningProjects when it was checked","code_sha256":"e8bea3ffc28d3e32","code_sha256_prefix":"e8bea3ffc28d3e32","mcp_get_code":{"code_sha256":"e8bea3ffc28d3e32"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzheng51/rl-dino-run","path":"agent.py","file_url":"https://github.com/yzheng51/rl-dino-run/blob/HEAD/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7c5b75c3f5b0451","code_sha256_prefix":"d7c5b75c3f5b0451","mcp_get_code":{"code_sha256":"d7c5b75c3f5b0451"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"condiff-dataset/ConDiff","path":"architectures/UNet.py","file_url":"https://github.com/condiff-dataset/ConDiff/blob/HEAD/architectures/UNet.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":"ddefc9039f608382","code_sha256_prefix":"ddefc9039f608382","mcp_get_code":{"code_sha256":"ddefc9039f608382"}},{"arxiv_id":"1502.03167","arxiv_id_is_arxiv":true,"paper":"/paper/batch-normalization-accelerating-deep-network","title":"Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift","date":"2015-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzheng51/rl-dino-run","path":"model.py","file_url":"https://github.com/yzheng51/rl-dino-run/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"275928042f41cfff","code_sha256_prefix":"275928042f41cfff","mcp_get_code":{"code_sha256":"275928042f41cfff"}}],"record_sha256":"c7d7591f2e102b4363e73d6c0c2bbce42416e4547759ab8ef5671d11bd6d5bc2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}