{"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/resnet32-2","entry":"ResNet32","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_fixture":0,"ran":3,"unverified":2},"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.04608","arxiv_id_is_arxiv":true,"paper":"/paper/watch-weighted-adaptive-testing-for","title":"WATCH: Adaptive Monitoring for AI Deployments via Weighted-Conformal Martingales","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaronhan223/watch","path":"src/resnet.py","file_url":"https://github.com/aaronhan223/watch/blob/HEAD/src/resnet.py","status":"unverified","verification_level":0,"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":"d6c9d2e6d30cf13c","code_sha256_prefix":"d6c9d2e6d30cf13c","mcp_get_code":{"code_sha256":"d6c9d2e6d30cf13c"}},{"arxiv_id":"2201.01212","arxiv_id_is_arxiv":true,"paper":"/paper/autobalance-optimized-loss-functions-for-1","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucr-optml/autobalance","path":"models/ResNet.py","file_url":"https://github.com/ucr-optml/autobalance/blob/HEAD/models/ResNet.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":"80b1b62fc8826034","code_sha256_prefix":"80b1b62fc8826034","mcp_get_code":{"code_sha256":"80b1b62fc8826034"}},{"arxiv_id":"2105.14399","arxiv_id_is_arxiv":true,"paper":"/paper/improving-entropic-out-of-distribution","title":"Enhanced Isotropy Maximization Loss: Seamless and High-Performance Out-of-Distribution Detection Simply Replacing the SoftMax Loss","date":"2021-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlmacedo/entropic-out-of-distribution-detection","path":"models/proper_resnet.py","file_url":"https://github.com/dlmacedo/entropic-out-of-distribution-detection/blob/HEAD/models/proper_resnet.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":"5f5d80dbb2ac3d2d","code_sha256_prefix":"5f5d80dbb2ac3d2d","mcp_get_code":{"code_sha256":"5f5d80dbb2ac3d2d"}},{"arxiv_id":"1904.12368","arxiv_id_is_arxiv":true,"paper":"/paper/legr-filter-pruning-via-learned-global","title":"Towards Efficient Model Compression via Learned Global Ranking","date":"2019-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmu-enyac/LeGR","path":"model/resnet_cifar10.py","file_url":"https://github.com/cmu-enyac/LeGR/blob/HEAD/model/resnet_cifar10.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":"2dcb962bd5f3dc20","code_sha256_prefix":"2dcb962bd5f3dc20","mcp_get_code":{"code_sha256":"2dcb962bd5f3dc20"}},{"arxiv_id":"1901.08933","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-generalisation-with-meta","title":"Self-Supervised Generalisation with Meta Auxiliary Learning","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"COMP6248-Reproducability-Challenge/COMP6248-Self-Supervised-Generalisation-with-Meta-Auxiliary-Learning","path":"ResNet/model_ResNet_maxl_pri3.py","file_url":"https://github.com/COMP6248-Reproducability-Challenge/COMP6248-Self-Supervised-Generalisation-with-Meta-Auxiliary-Learning/blob/HEAD/ResNet/model_ResNet_maxl_pri3.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, COMP6248-Reproducability-Challenge/COMP6248-Self-Supervised-Generalisation-with-Meta-Auxiliary-Learning when it was checked","code_sha256":"ba64bb38b617cb31","code_sha256_prefix":"ba64bb38b617cb31","mcp_get_code":{"code_sha256":"ba64bb38b617cb31"}}],"record_sha256":"cbc88f9bc6672fe7ae7d4d1aa07be614c2ae5d6e8a96289bc2d31cf4be73c063","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}