{"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","entry":"efficientnet","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":2,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":4,"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":1,"ran_fixture":0,"ran":1,"unverified":6},"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":"2411.01981","arxiv_id_is_arxiv":true,"paper":"/paper/typicalness-aware-learning-for-failure","title":"Typicalness-Aware Learning for Failure Detection","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyijungoon/TAL","path":"model/efficientnet.py","file_url":"https://github.com/liuyijungoon/TAL/blob/HEAD/model/efficientnet.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":"4fa7bc5b18c28b84","code_sha256_prefix":"4fa7bc5b18c28b84","mcp_get_code":{"code_sha256":"4fa7bc5b18c28b84"}},{"arxiv_id":"2403.02886","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-confidence-estimation-towards","title":"Revisiting Confidence Estimation: Towards Reliable Failure Prediction","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"impression2805/fmfp","path":"model/efficientnet.py","file_url":"https://github.com/impression2805/fmfp/blob/HEAD/model/efficientnet.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":"4fa7bc5b18c28b84","code_sha256_prefix":"4fa7bc5b18c28b84","mcp_get_code":{"code_sha256":"4fa7bc5b18c28b84"}},{"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":"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":"7c07cd76854d45e9","code_sha256_prefix":"7c07cd76854d45e9","mcp_get_code":{"code_sha256":"7c07cd76854d45e9"}},{"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":"a088fd1c2c78a12c","code_sha256_prefix":"a088fd1c2c78a12c","mcp_get_code":{"code_sha256":"a088fd1c2c78a12c"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"257c1c1e61218873","code_sha256_prefix":"257c1c1e61218873","mcp_get_code":{"code_sha256":"257c1c1e61218873"}},{"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":"AmirmohammadRostami/KeywordsSpotting-EfficientNet-A0","path":"utils/efficientnet_pytorch/model.py","file_url":"https://github.com/AmirmohammadRostami/KeywordsSpotting-EfficientNet-A0/blob/HEAD/utils/efficientnet_pytorch/model.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":"1ec716db2a067c4e","code_sha256_prefix":"1ec716db2a067c4e","mcp_get_code":{"code_sha256":"1ec716db2a067c4e"}},{"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":"lvweiwolf/efficientdet","path":"backbone/efficientnet_builder.py","file_url":"https://github.com/lvweiwolf/efficientdet/blob/HEAD/backbone/efficientnet_builder.py","status":"unverified","verification_level":0,"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, lvweiwolf/efficientdet when it was checked","code_sha256":"04f39101f07909c0","code_sha256_prefix":"04f39101f07909c0","mcp_get_code":{"code_sha256":"04f39101f07909c0"}},{"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":"unverified","verification_level":0,"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, DableUTeeF/keras-efficientnet when it was checked","code_sha256":"dda6eef82d7f7b1d","code_sha256_prefix":"dda6eef82d7f7b1d","mcp_get_code":{"code_sha256":"dda6eef82d7f7b1d"}},{"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":"unverified","verification_level":0,"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, ravi02512/efficientdet-keras when it was checked","code_sha256":"3428492d04f44096","code_sha256_prefix":"3428492d04f44096","mcp_get_code":{"code_sha256":"3428492d04f44096"}},{"arxiv_id":"Zhu_RCL_Reliable_Continual_Learning_for_Unified_Failure_Detection_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhu_RCL_Reliable_Continual_Learning_for_Unified_Failure_Detection_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Impression2805/RCL","path":"model/efficientnet.py","file_url":"https://github.com/Impression2805/RCL/blob/HEAD/model/efficientnet.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":"4fa7bc5b18c28b84","code_sha256_prefix":"4fa7bc5b18c28b84","mcp_get_code":{"code_sha256":"4fa7bc5b18c28b84"}},{"arxiv_id":"136850512","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136850512 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Impression2805/FMFP","path":"model/efficientnet.py","file_url":"https://github.com/Impression2805/FMFP/blob/HEAD/model/efficientnet.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":"4fa7bc5b18c28b84","code_sha256_prefix":"4fa7bc5b18c28b84","mcp_get_code":{"code_sha256":"4fa7bc5b18c28b84"}}],"record_sha256":"998da9bebb388c37976d75b7540238f2d2d13e5850af3e371f55a795aa7f7808","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}