{"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/alexnet-2","entry":"AlexNet","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":8,"n_papers_ran":6,"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":9,"n_samples_ran":6,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":3},"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","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,"code_sha256_prefix":"67d3c99025558a9c","mcp_get_code":{"code_sha256":"67d3c99025558a9c"}},{"arxiv_id":"2406.18561","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,"code_sha256_prefix":"26023475e9668a76","mcp_get_code":{"code_sha256":"26023475e9668a76"}},{"arxiv_id":"2310.00093","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,"code_sha256_prefix":"3a77313e815f4446","mcp_get_code":{"code_sha256":"3a77313e815f4446"}},{"arxiv_id":"2203.01531","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,"code_sha256_prefix":"931c859769faecd5","mcp_get_code":{"code_sha256":"931c859769faecd5"}},{"arxiv_id":"2104.05485","paper":"/paper/predicting-pedestrian-crossing-intention-with","title":"Predicting Pedestrian Crossing Intention with Feature Fusion and Spatio-Temporal Attention","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OSU-Haolin/Pedestrian_Crossing_Intention_Prediction","path":"base_models.py","file_url":"https://github.com/OSU-Haolin/Pedestrian_Crossing_Intention_Prediction/blob/HEAD/base_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfd1c2e7a1031af7","mcp_get_code":{"code_sha256":"bfd1c2e7a1031af7"}},{"arxiv_id":"1803.07728","paper":"/paper/unsupervised-representation-learning-by-1","title":"Unsupervised Representation Learning by Predicting Image Rotations","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzz1515151/self-supervised_learning_sketch","path":"AlexNet.py","file_url":"https://github.com/zzz1515151/self-supervised_learning_sketch/blob/HEAD/AlexNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"da529ec59bbf59b8","mcp_get_code":{"code_sha256":"da529ec59bbf59b8"}},{"arxiv_id":"1702.05373","paper":"/paper/emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/TensorFlow-MNIST","path":"v0_2/models.py","file_url":"https://github.com/Lornatang/TensorFlow-MNIST/blob/HEAD/v0_2/models.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":"083164bfbeb0d9ca","mcp_get_code":{"code_sha256":"083164bfbeb0d9ca"}},{"arxiv_id":"1702.05373","paper":"/paper/emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/TensorFlow-MNIST","path":"v0_1/models/alexnet.py","file_url":"https://github.com/Lornatang/TensorFlow-MNIST/blob/HEAD/v0_1/models/alexnet.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":"5aca9cbf66d5ea31","mcp_get_code":{"code_sha256":"5aca9cbf66d5ea31"}},{"arxiv_id":"1603.09246","paper":"/paper/unsupervised-learning-of-visual-1","title":"Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Confusezius/selfsupervised_learning","path":"JigsawNet/baseline_conv.py","file_url":"https://github.com/Confusezius/selfsupervised_learning/blob/HEAD/JigsawNet/baseline_conv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c8988caab7b2ad80","mcp_get_code":{"code_sha256":"c8988caab7b2ad80"}}]}