{"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/alexnet-2","entry":"AlexNet","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":9,"n_samples_constructed":5,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"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":9,"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":"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":"67d3c99025558a9c","code_sha256_prefix":"67d3c99025558a9c","mcp_get_code":{"code_sha256":"67d3c99025558a9c"}},{"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":"26023475e9668a76","code_sha256_prefix":"26023475e9668a76","mcp_get_code":{"code_sha256":"26023475e9668a76"}},{"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":"3a77313e815f4446","code_sha256_prefix":"3a77313e815f4446","mcp_get_code":{"code_sha256":"3a77313e815f4446"}},{"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":"931c859769faecd5","code_sha256_prefix":"931c859769faecd5","mcp_get_code":{"code_sha256":"931c859769faecd5"}},{"arxiv_id":"2104.05485","arxiv_id_is_arxiv":true,"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":"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":"bfd1c2e7a1031af7","code_sha256_prefix":"bfd1c2e7a1031af7","mcp_get_code":{"code_sha256":"bfd1c2e7a1031af7"}},{"arxiv_id":"1803.07728","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da529ec59bbf59b8","code_sha256_prefix":"da529ec59bbf59b8","mcp_get_code":{"code_sha256":"da529ec59bbf59b8"}},{"arxiv_id":"1702.05373","arxiv_id_is_arxiv":true,"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":"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":"083164bfbeb0d9ca","code_sha256_prefix":"083164bfbeb0d9ca","mcp_get_code":{"code_sha256":"083164bfbeb0d9ca"}},{"arxiv_id":"1702.05373","arxiv_id_is_arxiv":true,"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":"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":"5aca9cbf66d5ea31","code_sha256_prefix":"5aca9cbf66d5ea31","mcp_get_code":{"code_sha256":"5aca9cbf66d5ea31"}},{"arxiv_id":"1603.09246","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Confusezius/selfsupervised_learning when it was checked","code_sha256":"c8988caab7b2ad80","code_sha256_prefix":"c8988caab7b2ad80","mcp_get_code":{"code_sha256":"c8988caab7b2ad80"}}],"record_sha256":"b8b9192e7214f8eaa0a680fb152367b04493e766a0aaa7e50d062e7da28cd68b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}