{"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/googlenet","entry":"googlenet","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":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":7,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":7},"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":"2505.05522","paper":"/paper/continuous-thought-machines","title":"Continuous Thought Machines","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huyvnphan/PyTorch_CIFAR10","path":"cifar10_models/googlenet.py","file_url":"https://github.com/huyvnphan/PyTorch_CIFAR10/blob/HEAD/cifar10_models/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2603e42da3f6eb7e","mcp_get_code":{"code_sha256":"2603e42da3f6eb7e"}},{"arxiv_id":"2411.02853","paper":"/paper/adopt-modified-adam-can-converge-with-any-b-2","title":"ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UiPath/torchvision","path":"torchvision/models/googlenet.py","file_url":"https://github.com/UiPath/torchvision/blob/HEAD/torchvision/models/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"cc86d582f7c75a6d","mcp_get_code":{"code_sha256":"cc86d582f7c75a6d"}},{"arxiv_id":"2111.13998","paper":"/paper/targeted-supervised-contrastive-learning-for","title":"Targeted Supervised Contrastive Learning for Long-Tailed Recognition","date":"2021-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lth14/targeted-supcon","path":"moco_models/googlenet.py","file_url":"https://github.com/lth14/targeted-supcon/blob/HEAD/moco_models/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc86d582f7c75a6d","mcp_get_code":{"code_sha256":"cc86d582f7c75a6d"}},{"arxiv_id":"2105.03193","paper":"/paper/network-pruning-that-matters-a-case-study-on-1","title":"Network Pruning That Matters: A Case Study on Retraining Variants","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lehduong/NPTM","path":"hrank/models/googlenet_cifar.py","file_url":"https://github.com/lehduong/NPTM/blob/HEAD/hrank/models/googlenet_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1e2c11c83101616","mcp_get_code":{"code_sha256":"e1e2c11c83101616"}},{"arxiv_id":"2002.08473","paper":"/paper/revisiting-training-strategies-and","title":"Revisiting Training Strategies and Generalization Performance in Deep Metric Learning","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Confusezius/Deep-Metric-Learning-Baselines","path":"googlenet.py","file_url":"https://github.com/Confusezius/Deep-Metric-Learning-Baselines/blob/HEAD/googlenet.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":"890262140a75d9b9","mcp_get_code":{"code_sha256":"890262140a75d9b9"}},{"arxiv_id":"1907.11561","paper":"/paper/deep-learning-for-classification-and-severity","title":"Deep Learning for Classification and Severity Estimation of Coffee Leaf Biotic Stress","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esgario/lara2018","path":"classification/architectures/googlenet.py","file_url":"https://github.com/esgario/lara2018/blob/HEAD/classification/architectures/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"636f79e82715abd8","mcp_get_code":{"code_sha256":"636f79e82715abd8"}},{"arxiv_id":"1903.05503","paper":"/paper/hardness-aware-deep-metric-learning","title":"Hardness-Aware Deep Metric Learning","date":"2019-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neka-nat/pytorch-hdml","path":"hdml/googlenet.py","file_url":"https://github.com/neka-nat/pytorch-hdml/blob/HEAD/hdml/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa84ed1ace8fba4a","mcp_get_code":{"code_sha256":"aa84ed1ace8fba4a"}},{"arxiv_id":"Sun_Exploring_Effective_Data_for_Surrogate_Training_Towards_Black-Box_Attack_CVPR_2022_paper","paper":null,"title":"arXiv:Sun_Exploring_Effective_Data_for_Surrogate_Training_Towards_Black-Box_Attack_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xuxiangsun/ST-Data","path":"models/tinysizemodels/googlenet.py","file_url":"https://github.com/xuxiangsun/ST-Data/blob/HEAD/models/tinysizemodels/googlenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f411929e9c8672f","mcp_get_code":{"code_sha256":"4f411929e9c8672f"}}]}