{"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/efficientnet-params","entry":"efficientnet_params","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":6,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2403.01786","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-the-deception-uncovering-more","title":"Exposing the Deception: Uncovering More Forgery Clues for Deepfake Detection","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qingyuliu/exposing-the-deception","path":"models/MI_Net.py","file_url":"https://github.com/qingyuliu/exposing-the-deception/blob/HEAD/models/MI_Net.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"158895ccad37077c","code_sha256_prefix":"158895ccad37077c","mcp_get_code":{"code_sha256":"158895ccad37077c"}},{"arxiv_id":"2208.08630","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-visual-perception-by-dispersible","title":"Unifying Visual Perception by Dispersible Points Learning","date":"2022-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sense-X/UniHead","path":"up/models/backbones/efficientnet.py","file_url":"https://github.com/Sense-X/UniHead/blob/HEAD/up/models/backbones/efficientnet.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":"97f60d1e327e8cc2","code_sha256_prefix":"97f60d1e327e8cc2","mcp_get_code":{"code_sha256":"97f60d1e327e8cc2"}},{"arxiv_id":"2107.02612","arxiv_id_is_arxiv":true,"paper":"/paper/combining-efficientnet-and-vision","title":"Combining EfficientNet and Vision Transformers for Video Deepfake Detection","date":"2021-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davide-coccomini/Combining-EfficientNet-and-Vision-Transformers-for-Video-Deepfake-Detection","path":"cross-efficient-vit/efficient_net/tf_to_pytorch/convert_tf_to_pt/original_tf/efficientnet_builder.py","file_url":"https://github.com/davide-coccomini/Combining-EfficientNet-and-Vision-Transformers-for-Video-Deepfake-Detection/blob/HEAD/cross-efficient-vit/efficient_net/tf_to_pytorch/convert_tf_to_pt/original_tf/efficientnet_builder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ravi02512/efficientdet-keras, and GitHub detected no licence in that repository when it was checked","code_sha256":"9e354d875b0e94e6","code_sha256_prefix":"9e354d875b0e94e6","mcp_get_code":{"code_sha256":"9e354d875b0e94e6"}},{"arxiv_id":"2106.04015","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-baselines-benchmarks-for","title":"Uncertainty Baselines: Benchmarks for Uncertainty & Robustness in Deep Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thlarsen13/thlarsen_uncertainty_models","path":"uncertainty_baselines/models/efficientnet.py","file_url":"https://github.com/thlarsen13/thlarsen_uncertainty_models/blob/HEAD/uncertainty_baselines/models/efficientnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ravi02512/efficientdet-keras, and GitHub detected no licence in that repository when it was checked","code_sha256":"9e354d875b0e94e6","code_sha256_prefix":"9e354d875b0e94e6","mcp_get_code":{"code_sha256":"9e354d875b0e94e6"}},{"arxiv_id":"2106.04015","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-baselines-benchmarks-for","title":"Uncertainty Baselines: Benchmarks for Uncertainty & Robustness in Deep Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thlarsen13/thlarsen_uncertainty_models","path":"uncertainty_baselines/models/efficientnet_utils.py","file_url":"https://github.com/thlarsen13/thlarsen_uncertainty_models/blob/HEAD/uncertainty_baselines/models/efficientnet_utils.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":"bc1878c9e235eca0","code_sha256_prefix":"bc1878c9e235eca0","mcp_get_code":{"code_sha256":"bc1878c9e235eca0"}},{"arxiv_id":"2103.11703","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-3d-hand-reconstruction-via-self","title":"Model-based 3D Hand Reconstruction via Self-Supervised Learning","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TerenceCYJ/S2HAND","path":"efficientnet_pt/model.py","file_url":"https://github.com/TerenceCYJ/S2HAND/blob/HEAD/efficientnet_pt/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, TerenceCYJ/S2HAND when it was checked","code_sha256":"a8d5c98b4d991792","code_sha256_prefix":"a8d5c98b4d991792","mcp_get_code":{"code_sha256":"a8d5c98b4d991792"}},{"arxiv_id":"2103.02406","arxiv_id_is_arxiv":true,"paper":"/paper/multi-attentional-deepfake-detection","title":"Multi-attentional Deepfake Detection","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoctta/multiple-attention","path":"models/MAT.py","file_url":"https://github.com/yoctta/multiple-attention/blob/HEAD/models/MAT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yoctta/multiple-attention when it was checked","code_sha256":"0d2081257b75b978","code_sha256_prefix":"0d2081257b75b978","mcp_get_code":{"code_sha256":"0d2081257b75b978"}},{"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/efficientnet_builder.py","file_url":"https://github.com/cihangxie/SmoothAdversarialTraining/blob/HEAD/EfficientNet/efficientnet_builder.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":"a7b35049ce7d1511","code_sha256_prefix":"a7b35049ce7d1511","mcp_get_code":{"code_sha256":"a7b35049ce7d1511"}},{"arxiv_id":"1911.04252","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-with-noisy-student-improves","title":"Self-training with Noisy Student improves ImageNet classification","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/noisystudent","path":"efficientnet_builder.py","file_url":"https://github.com/google-research/noisystudent/blob/HEAD/efficientnet_builder.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":"00e16fdd1db60196","code_sha256_prefix":"00e16fdd1db60196","mcp_get_code":{"code_sha256":"00e16fdd1db60196"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shijianjian/efficientnet-pytorch-3d","path":"efficientnet_pytorch_3d/model.py","file_url":"https://github.com/shijianjian/efficientnet-pytorch-3d/blob/HEAD/efficientnet_pytorch_3d/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"320b5a90d92ede9f","code_sha256_prefix":"320b5a90d92ede9f","mcp_get_code":{"code_sha256":"320b5a90d92ede9f"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DableUTeeF/keras-efficientnet","path":"keras_efficientnet/efficientnet_builder.py","file_url":"https://github.com/DableUTeeF/keras-efficientnet/blob/HEAD/keras_efficientnet/efficientnet_builder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, DableUTeeF/keras-efficientnet when it was checked","code_sha256":"49ebeee8958767b6","code_sha256_prefix":"49ebeee8958767b6","mcp_get_code":{"code_sha256":"49ebeee8958767b6"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ravi02512/efficientdet-keras","path":"backbone/efficientnet_builder.py","file_url":"https://github.com/ravi02512/efficientdet-keras/blob/HEAD/backbone/efficientnet_builder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ravi02512/efficientdet-keras when it was checked","code_sha256":"9e354d875b0e94e6","code_sha256_prefix":"9e354d875b0e94e6","mcp_get_code":{"code_sha256":"9e354d875b0e94e6"}}],"record_sha256":"69194b2dbbc4f46c74a008228aba039c67246afc493ddb09e4d2c09106fa1d1e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}