{"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/stochastic-depth","entry":"stochastic_depth","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":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":9,"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":5,"ran":2,"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":"2510.25094","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-25094","title":"Visual Diversity and Region-aware Prompt Learning for Zero-shot HOI Detection","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mlvlab/VDRP","path":"transformer_layers.py","file_url":"https://github.com/mlvlab/VDRP/blob/HEAD/transformer_layers.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":"256ec3ee8631f23b","code_sha256_prefix":"256ec3ee8631f23b","mcp_get_code":{"code_sha256":"256ec3ee8631f23b"}},{"arxiv_id":"2403.07711","arxiv_id_is_arxiv":true,"paper":"/paper/ssm-meets-video-diffusion-models-efficient","title":"SSM Meets Video Diffusion Models: Efficient Long-Term Video Generation with Structured State Spaces","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shim0114/SSM-Meets-Video-Diffusion-Models","path":"video_diffusion_pytorch/s4d.py","file_url":"https://github.com/shim0114/SSM-Meets-Video-Diffusion-Models/blob/HEAD/video_diffusion_pytorch/s4d.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":"cb1e186caa6a9a11","code_sha256_prefix":"cb1e186caa6a9a11","mcp_get_code":{"code_sha256":"cb1e186caa6a9a11"}},{"arxiv_id":"2308.06202","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-predicate-visual-context-in","title":"Exploring Predicate Visual Context in Detecting Human-Object Interactions","date":"2023-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fredzzhang/pvic","path":"transformers.py","file_url":"https://github.com/fredzzhang/pvic/blob/HEAD/transformers.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":"256ec3ee8631f23b","code_sha256_prefix":"256ec3ee8631f23b","mcp_get_code":{"code_sha256":"256ec3ee8631f23b"}},{"arxiv_id":"2201.03545","arxiv_id_is_arxiv":true,"paper":"/paper/a-convnet-for-the-2020s","title":"A ConvNet for the 2020s","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/vision","path":"torchvision/models/convnext.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/models/convnext.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a796360490702186","code_sha256_prefix":"a796360490702186","mcp_get_code":{"code_sha256":"a796360490702186"}},{"arxiv_id":"2103.14030","arxiv_id_is_arxiv":true,"paper":"/paper/swin-transformer-hierarchical-vision","title":"Swin Transformer: Hierarchical Vision Transformer using Shifted Windows","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/vision","path":"torchvision/models/swin_transformer.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/models/swin_transformer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e6ac1ffd60c632a3","code_sha256_prefix":"e6ac1ffd60c632a3","mcp_get_code":{"code_sha256":"e6ac1ffd60c632a3"}},{"arxiv_id":"1911.04252","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-with-noisy-student-improves","title":"Self-training with Noisy Student improves ImageNet classification","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/noisystudent","path":"utils.py","file_url":"https://github.com/google-research/noisystudent/blob/HEAD/utils.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":"c0942e1efe9598d2","code_sha256_prefix":"c0942e1efe9598d2","mcp_get_code":{"code_sha256":"c0942e1efe9598d2"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"canturan10/satellighte","path":"satellighte/archs/efficientnet/module.py","file_url":"https://github.com/canturan10/satellighte/blob/HEAD/satellighte/archs/efficientnet/module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"326c8379ce627360","code_sha256_prefix":"326c8379ce627360","mcp_get_code":{"code_sha256":"326c8379ce627360"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/vision","path":"torchvision/models/efficientnet.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/models/efficientnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6010c21fa9b1def9","code_sha256_prefix":"6010c21fa9b1def9","mcp_get_code":{"code_sha256":"6010c21fa9b1def9"}},{"arxiv_id":"1603.09382","arxiv_id_is_arxiv":true,"paper":"/paper/deep-networks-with-stochastic-depth","title":"Deep Networks with Stochastic Depth","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/vision","path":"torchvision/ops/stochastic_depth.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/ops/stochastic_depth.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23e54ee64c53fb22","code_sha256_prefix":"23e54ee64c53fb22","mcp_get_code":{"code_sha256":"23e54ee64c53fb22"}}],"record_sha256":"bb058150fc0c07804934db9e44ba852494092781a95df69c879eddb8fd704613","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}