{"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/preprocess-for-eval","entry":"preprocess_for_eval","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":10,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":12,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":1,"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":3,"unverified":9},"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":"2010.01412","arxiv_id_is_arxiv":true,"paper":"/paper/sharpness-aware-minimization-for-efficiently-1","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/sam","path":"sam_jax/datasets/dataset_source_imagenet.py","file_url":"https://github.com/google-research/sam/blob/HEAD/sam_jax/datasets/dataset_source_imagenet.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":"db053b3b48a12365","code_sha256_prefix":"db053b3b48a12365","mcp_get_code":{"code_sha256":"db053b3b48a12365"}},{"arxiv_id":"2008.03703","arxiv_id_is_arxiv":true,"paper":"/paper/what-neural-networks-memorize-and-why","title":"What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/heldout-influence-estimation","path":"libdata/imagenet_preprocessing.py","file_url":"https://github.com/google-research/heldout-influence-estimation/blob/HEAD/libdata/imagenet_preprocessing.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":"46fa247f2c3e6e4d","code_sha256_prefix":"46fa247f2c3e6e4d","mcp_get_code":{"code_sha256":"46fa247f2c3e6e4d"}},{"arxiv_id":"2006.14536","arxiv_id_is_arxiv":true,"paper":"/paper/smooth-adversarial-training","title":"Smooth Adversarial Training","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cihangxie/SmoothAdversarialTraining","path":"EfficientNet/preprocessing.py","file_url":"https://github.com/cihangxie/SmoothAdversarialTraining/blob/HEAD/EfficientNet/preprocessing.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":"6d17319dde175b8a","code_sha256_prefix":"6d17319dde175b8a","mcp_get_code":{"code_sha256":"6d17319dde175b8a"}},{"arxiv_id":"1908.07410","arxiv_id_is_arxiv":true,"paper":"/paper/visil-fine-grained-spatio-temporal-video","title":"ViSiL: Fine-grained Spatio-Temporal Video Similarity Learning","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MKLab-ITI/visil","path":"model/nets/vgg_preprocessing.py","file_url":"https://github.com/MKLab-ITI/visil/blob/HEAD/model/nets/vgg_preprocessing.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":"b35644780c2d36b7","code_sha256_prefix":"b35644780c2d36b7","mcp_get_code":{"code_sha256":"b35644780c2d36b7"}},{"arxiv_id":"1905.02231","arxiv_id_is_arxiv":true,"paper":"/paper/a-geometric-approach-to-obtain-a-birds-eye","title":"A Geometric Approach to Obtain a Bird's Eye View from an Image","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SAmmarAbbas/birds-eye-view","path":"preprocessing/vgg_preprocessing.py","file_url":"https://github.com/SAmmarAbbas/birds-eye-view/blob/HEAD/preprocessing/vgg_preprocessing.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":"9d85e040f6eb6b96","code_sha256_prefix":"9d85e040f6eb6b96","mcp_get_code":{"code_sha256":"9d85e040f6eb6b96"}},{"arxiv_id":"1904.02877","arxiv_id_is_arxiv":true,"paper":"/paper/single-path-nas-designing-hardware-efficient","title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dstamoulis/single-path-nas","path":"nas-search/preprocessing.py","file_url":"https://github.com/dstamoulis/single-path-nas/blob/HEAD/nas-search/preprocessing.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":"3a458358e2a9447b","code_sha256_prefix":"3a458358e2a9447b","mcp_get_code":{"code_sha256":"3a458358e2a9447b"}},{"arxiv_id":"1806.03287","arxiv_id_is_arxiv":true,"paper":"/paper/slalom-fast-verifiable-and-private-execution","title":"Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware","date":"2018-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftramer/slalom","path":"python/preprocessing/cifarnet_preprocessing.py","file_url":"https://github.com/ftramer/slalom/blob/HEAD/python/preprocessing/cifarnet_preprocessing.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":"8dd44485a0d07e53","code_sha256_prefix":"8dd44485a0d07e53","mcp_get_code":{"code_sha256":"8dd44485a0d07e53"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sarasra/models","path":"research/adv_imagenet_models/eval_on_adversarial.py","file_url":"https://github.com/Sarasra/models/blob/HEAD/research/adv_imagenet_models/eval_on_adversarial.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, Sarasra/models, 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":"b1b870e26b8c5598","code_sha256_prefix":"b1b870e26b8c5598","mcp_get_code":{"code_sha256":"b1b870e26b8c5598"}},{"arxiv_id":"1608.06993","arxiv_id_is_arxiv":true,"paper":"/paper/densely-connected-convolutional-networks","title":"Densely Connected Convolutional Networks","date":"2016-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pudae/tensorflow-densenet","path":"preprocessing/densenet_preprocessing.py","file_url":"https://github.com/pudae/tensorflow-densenet/blob/HEAD/preprocessing/densenet_preprocessing.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":"0617da01fe728ab6","code_sha256_prefix":"0617da01fe728ab6","mcp_get_code":{"code_sha256":"0617da01fe728ab6"}},{"arxiv_id":"1608.00859","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-segment-networks-towards-good","title":"Temporal Segment Networks: Towards Good Practices for Deep Action Recognition","date":"2016-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichiganCOG/M-PACT","path":"models/c3d/default_preprocessing.py","file_url":"https://github.com/MichiganCOG/M-PACT/blob/HEAD/models/c3d/default_preprocessing.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":"541b84f358db0382","code_sha256_prefix":"541b84f358db0382","mcp_get_code":{"code_sha256":"541b84f358db0382"}},{"arxiv_id":"1608.00859","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-segment-networks-towards-good","title":"Temporal Segment Networks: Towards Good Practices for Deep Action Recognition","date":"2016-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichiganCOG/M-PACT","path":"models/c3d/tf_version_HMDB51_preprocessing.py","file_url":"https://github.com/MichiganCOG/M-PACT/blob/HEAD/models/c3d/tf_version_HMDB51_preprocessing.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":"2d6a9afae20381b6","code_sha256_prefix":"2d6a9afae20381b6","mcp_get_code":{"code_sha256":"2d6a9afae20381b6"}},{"arxiv_id":"1608.00859","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-segment-networks-towards-good","title":"Temporal Segment Networks: Towards Good Practices for Deep Action Recognition","date":"2016-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichiganCOG/M-PACT","path":"models/i3d/default_preprocessing.py","file_url":"https://github.com/MichiganCOG/M-PACT/blob/HEAD/models/i3d/default_preprocessing.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":"634caffb34a18a9c","code_sha256_prefix":"634caffb34a18a9c","mcp_get_code":{"code_sha256":"634caffb34a18a9c"}}],"record_sha256":"d5d9bea1755e8293ca9dbbd458b67ff1edbcdfd2bcb54159faec78cc59201d90","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}