{"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/get-resnet","entry":"get_resnet","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":13,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":13,"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":2,"ran_fixture":0,"ran":6,"unverified":4},"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":"2509.26455","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-26455","title":"Stylos: Multi-View 3D Stylization with Single-Forward Gaussian Splatting","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"HanzhouLiu/Stylos","path":"ArtScore/models.py","file_url":"https://github.com/HanzhouLiu/Stylos/blob/HEAD/ArtScore/models.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":"70a96ff193901f14","code_sha256_prefix":"70a96ff193901f14","mcp_get_code":{"code_sha256":"70a96ff193901f14"}},{"arxiv_id":"2506.05407","arxiv_id_is_arxiv":true,"paper":"/paper/pcevolve-private-contrastive-evolution-for","title":"PCEvolve: Private Contrastive Evolution for Synthetic Dataset Generation via Few-Shot Private Data and Generative APIs","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":"archive","repo":"TsingZ0/PCEvolve","path":"models/resnets.py","file_url":"https://github.com/TsingZ0/PCEvolve/blob/HEAD/models/resnets.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":"ce37aade325b9f3d","code_sha256_prefix":"ce37aade325b9f3d","mcp_get_code":{"code_sha256":"ce37aade325b9f3d"}},{"arxiv_id":"2412.13690","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-clustering-via-targeted","title":"Personalized Clustering via Targeted Representation Learning","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhdxwen/pcl","path":"modules/resnet.py","file_url":"https://github.com/hhdxwen/pcl/blob/HEAD/modules/resnet.py","status":"ran","verification_level":1,"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, hhdxwen/pcl when it was checked","code_sha256":"6df43a5023f20180","code_sha256_prefix":"6df43a5023f20180","mcp_get_code":{"code_sha256":"6df43a5023f20180"}},{"arxiv_id":"2407.05246","arxiv_id_is_arxiv":true,"paper":"/paper/deep-probability-aggregation-clustering","title":"Deep Online Probability Aggregation Clustering","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aomandechenai/deep-probability-aggregation-clustering","path":"PAC_DPAC_program/models/resnet.py","file_url":"https://github.com/aomandechenai/deep-probability-aggregation-clustering/blob/HEAD/PAC_DPAC_program/models/resnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, aomandechenai/deep-probability-aggregation-clustering when it was checked","code_sha256":"a3799b1622a4261a","code_sha256_prefix":"a3799b1622a4261a","mcp_get_code":{"code_sha256":"a3799b1622a4261a"}},{"arxiv_id":"2312.17243","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-universal-image-segmentation","title":"Unsupervised Universal Image Segmentation","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"u2seg/u2seg","path":"u2seg/Instance_Clustering/semisup-simclrv2/resnet.py","file_url":"https://github.com/u2seg/u2seg/blob/HEAD/u2seg/Instance_Clustering/semisup-simclrv2/resnet.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":"1f977428f41dd1e0","code_sha256_prefix":"1f977428f41dd1e0","mcp_get_code":{"code_sha256":"1f977428f41dd1e0"}},{"arxiv_id":"2310.05469","arxiv_id_is_arxiv":true,"paper":"/paper/vibroacoustic-frequency-response-prediction","title":"Learning to Predict Structural Vibrations","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecker-lab/FQ-Operator","path":"acousticnn/model/resnet.py","file_url":"https://github.com/ecker-lab/FQ-Operator/blob/HEAD/acousticnn/model/resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ecker-lab/FQ-Operator (NOASSERTION)","code_sha256":"22a8e381f6125757","code_sha256_prefix":"22a8e381f6125757","mcp_get_code":{"code_sha256":"22a8e381f6125757"}},{"arxiv_id":"2110.03006","arxiv_id_is_arxiv":true,"paper":"/paper/data-centric-semi-supervised-learning","title":"Unsupervised Selective Labeling for More Effective Semi-Supervised Learning","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TonyLianLong/UnsupervisedSelectiveLabeling","path":"semisup-simclrv2/resnet.py","file_url":"https://github.com/TonyLianLong/UnsupervisedSelectiveLabeling/blob/HEAD/semisup-simclrv2/resnet.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":"1f977428f41dd1e0","code_sha256_prefix":"1f977428f41dd1e0","mcp_get_code":{"code_sha256":"1f977428f41dd1e0"}},{"arxiv_id":"2105.12245","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-properties-of-deep-residual-networks","title":"Scaling Properties of Deep Residual Networks","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"instadeepai/scaling-resnets","path":"cifar_run.py","file_url":"https://github.com/instadeepai/scaling-resnets/blob/HEAD/cifar_run.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":"ffce83443b756a92","code_sha256_prefix":"ffce83443b756a92","mcp_get_code":{"code_sha256":"ffce83443b756a92"}},{"arxiv_id":"2103.14021","arxiv_id_is_arxiv":true,"paper":"/paper/orthogonal-projection-loss","title":"Orthogonal Projection Loss","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kahnchana/opl","path":"classification/cifar/models/resnet.py","file_url":"https://github.com/kahnchana/opl/blob/HEAD/classification/cifar/models/resnet.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":"15f95876a5d31c2a","code_sha256_prefix":"15f95876a5d31c2a","mcp_get_code":{"code_sha256":"15f95876a5d31c2a"}},{"arxiv_id":"2009.09687","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-clustering","title":"Contrastive Clustering","date":"2020-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yunfan-Li/Contrastive-Clustering","path":"modules/resnet.py","file_url":"https://github.com/Yunfan-Li/Contrastive-Clustering/blob/HEAD/modules/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":"95c0bf40098a2477","code_sha256_prefix":"95c0bf40098a2477","mcp_get_code":{"code_sha256":"95c0bf40098a2477"}},{"arxiv_id":"2007.05426","arxiv_id_is_arxiv":true,"paper":"/paper/variational-inference-with-continuously","title":"Variational Inference with Continuously-Indexed Normalizing Flows","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anthonycaterini/cif-vi","path":"cif/models/components/networks.py","file_url":"https://github.com/anthonycaterini/cif-vi/blob/HEAD/cif/models/components/networks.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":"2e2b3a2ccfe1ccdc","code_sha256_prefix":"2e2b3a2ccfe1ccdc","mcp_get_code":{"code_sha256":"2e2b3a2ccfe1ccdc"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talipucar/PyFlow_BYOL","path":"utils/model_utils.py","file_url":"https://github.com/talipucar/PyFlow_BYOL/blob/HEAD/utils/model_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, talipucar/PyFlow_BYOL when it was checked","code_sha256":"d35a3394eb6872b1","code_sha256_prefix":"d35a3394eb6872b1","mcp_get_code":{"code_sha256":"d35a3394eb6872b1"}},{"arxiv_id":"1907.13315","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-with-progressive-augmentation","title":"Self-training with progressive augmentation for unsupervised cross-domain person re-identification","date":"2019-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxinyu-xyz/PAST-ReID","path":"reid/models/resnet.py","file_url":"https://github.com/zhangxinyu-xyz/PAST-ReID/blob/HEAD/reid/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":"513fecc74aacde61","code_sha256_prefix":"513fecc74aacde61","mcp_get_code":{"code_sha256":"513fecc74aacde61"}}],"record_sha256":"61e228b4e04334db33bd8c373a364789292cd3ab907b7b839d7723bdfd40e73f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}