{"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/squeezenet1-1","entry":"squeezenet1_1","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"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":2,"ran_fixture":0,"ran":3,"unverified":1},"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":"2207.13686","arxiv_id_is_arxiv":true,"paper":"/paper/shift-tolerant-perceptual-similarity-metric-1","title":"Shift-tolerant Perceptual Similarity Metric","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhijay9/shifttolerant-lpips","path":"models_lpf/squeezenet.py","file_url":"https://github.com/abhijay9/shifttolerant-lpips/blob/HEAD/models_lpf/squeezenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3b4e03c1df19138","code_sha256_prefix":"e3b4e03c1df19138","mcp_get_code":{"code_sha256":"e3b4e03c1df19138"}},{"arxiv_id":"1904.03441","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-normalization-beyond","title":"Iterative Normalization: Beyond Standardization towards Efficient Whitening","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangleiBuaa/IterNorm-pytorch","path":"ImageNet/models/squeezenet.py","file_url":"https://github.com/huangleiBuaa/IterNorm-pytorch/blob/HEAD/ImageNet/models/squeezenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0756b35ec8fe5483","code_sha256_prefix":"0756b35ec8fe5483","mcp_get_code":{"code_sha256":"0756b35ec8fe5483"}},{"arxiv_id":"1811.03194","arxiv_id_is_arxiv":true,"paper":"/paper/ad-versarial-perceptual-ad-blocking-meets","title":"AdVersarial: Perceptual Ad Blocking meets Adversarial Machine Learning","date":"2018-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftramer/ad-versarial","path":"element-frame-based/percival/ModuleSqueezeNet1.py","file_url":"https://github.com/ftramer/ad-versarial/blob/HEAD/element-frame-based/percival/ModuleSqueezeNet1.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":"43cd5c22cd650a33","code_sha256_prefix":"43cd5c22cd650a33","mcp_get_code":{"code_sha256":"43cd5c22cd650a33"}},{"arxiv_id":"1807.10459","arxiv_id_is_arxiv":true,"paper":"/paper/idtxl-the-information-dynamics-toolkit-xl-a","title":"IDTxl: The Information Dynamics Toolkit xl: a Python package for the efficient analysis of multivariate information dynamics in networks","date":null,"month_inferred_from_arxiv_id":"2018-07","title_source":"archive","repo":"dizcza/EmbedderSDR","path":"models/caltech.py","file_url":"https://github.com/dizcza/EmbedderSDR/blob/HEAD/models/caltech.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":"cf901cfe80efb8bc","code_sha256_prefix":"cf901cfe80efb8bc","mcp_get_code":{"code_sha256":"cf901cfe80efb8bc"}},{"arxiv_id":"1612.00603","arxiv_id_is_arxiv":true,"paper":"/paper/a-point-set-generation-network-for-3d-object","title":"A Point Set Generation Network for 3D Object Reconstruction from a Single Image","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gitikameher/A-Point-Set-Generation-Network-for-3D-Object-Reconstruction-from-a-Single-Image","path":"pic2points_model.py","file_url":"https://github.com/Gitikameher/A-Point-Set-Generation-Network-for-3D-Object-Reconstruction-from-a-Single-Image/blob/HEAD/pic2points_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Gitikameher/A-Point-Set-Generation-Network-for-3D-Object-Reconstruction-from-a-Single-Image when it was checked","code_sha256":"1403c57bdf16be4f","code_sha256_prefix":"1403c57bdf16be4f","mcp_get_code":{"code_sha256":"1403c57bdf16be4f"}},{"arxiv_id":"1602.07360","arxiv_id_is_arxiv":true,"paper":"/paper/squeezenet-alexnet-level-accuracy-with-50x","title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model size","date":"2016-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiweibo/imagenet","path":"models/squeezenet.py","file_url":"https://github.com/jiweibo/imagenet/blob/HEAD/models/squeezenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44349b0fe759e3a9","code_sha256_prefix":"44349b0fe759e3a9","mcp_get_code":{"code_sha256":"44349b0fe759e3a9"}}],"record_sha256":"66e6de38a50b1857a8e7332cfabceee3311099564321d461238625b21d1f0ae3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}