{"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/googlenet","entry":"googlenet","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":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":4,"unverified":3},"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":"2505.05522","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2603e42da3f6eb7e","code_sha256_prefix":"2603e42da3f6eb7e","mcp_get_code":{"code_sha256":"2603e42da3f6eb7e"}},{"arxiv_id":"2411.02853","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc86d582f7c75a6d","code_sha256_prefix":"cc86d582f7c75a6d","mcp_get_code":{"code_sha256":"cc86d582f7c75a6d"}},{"arxiv_id":"2111.13998","arxiv_id_is_arxiv":true,"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":"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":"cc86d582f7c75a6d","code_sha256_prefix":"cc86d582f7c75a6d","mcp_get_code":{"code_sha256":"cc86d582f7c75a6d"}},{"arxiv_id":"2105.03193","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e1e2c11c83101616","code_sha256_prefix":"e1e2c11c83101616","mcp_get_code":{"code_sha256":"e1e2c11c83101616"}},{"arxiv_id":"2002.08473","arxiv_id_is_arxiv":true,"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":"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":"890262140a75d9b9","code_sha256_prefix":"890262140a75d9b9","mcp_get_code":{"code_sha256":"890262140a75d9b9"}},{"arxiv_id":"1907.11561","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"636f79e82715abd8","code_sha256_prefix":"636f79e82715abd8","mcp_get_code":{"code_sha256":"636f79e82715abd8"}},{"arxiv_id":"1903.05503","arxiv_id_is_arxiv":true,"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":"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":"aa84ed1ace8fba4a","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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":"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":"4f411929e9c8672f","code_sha256_prefix":"4f411929e9c8672f","mcp_get_code":{"code_sha256":"4f411929e9c8672f"}}],"record_sha256":"511ca4cae06e421c0a33b11242700c69169511c14acf047575ed207994099f08","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}