{"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/cuda-timestamp","entry":"cuda_timestamp","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":11,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2411.14429","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-integration-of-convolution-and","title":"Revisiting the Integration of Convolution and Attention for Vision Backbone","date":"2024-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rayleizhu/GLMix","path":"benchmark.py","file_url":"https://github.com/rayleizhu/GLMix/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2403.19588","arxiv_id_is_arxiv":true,"paper":"/paper/densenets-reloaded-paradigm-shift-beyond","title":"DenseNets Reloaded: Paradigm Shift Beyond ResNets and ViTs","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/rdnet","path":"benchmark.py","file_url":"https://github.com/naver-ai/rdnet/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2402.04744","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-gradient-flow-for-robust-n-m","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhibambhaniya/progressive_gradient_flow_nm_sparsity","path":"benchmark.py","file_url":"https://github.com/abhibambhaniya/progressive_gradient_flow_nm_sparsity/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2401.17992","arxiv_id_is_arxiv":true,"paper":"/paper/multilinear-operator-networks","title":"Multilinear Operator Networks","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Allencheng97/Multilinear_Operator_Networks","path":"benchmark.py","file_url":"https://github.com/Allencheng97/Multilinear_Operator_Networks/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2312.13131","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-compute-is-not-all-you-need-for","title":"Scaling Compute Is Not All You Need for Adversarial Robustness","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dedeswim/timm-adv-training","path":"benchmark.py","file_url":"https://github.com/dedeswim/timm-adv-training/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dedeswim/timm-adv-training when it was checked","code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2305.17205","arxiv_id_is_arxiv":true,"paper":"/paper/ghost-noise-for-regularizing-deep-neural","title":"Ghost Noise for Regularizing Deep Neural Networks","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/ghost-noise","path":"submodules/timm/benchmark.py","file_url":"https://github.com/epfml/ghost-noise/blob/HEAD/submodules/timm/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2305.17190","arxiv_id_is_arxiv":true,"paper":"/paper/multiplication-free-transformer-training-via-1","title":"Multiplication-Free Transformer Training via Piecewise Affine Operations","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/piecewise-affine-multiplication","path":"submodules/timm/benchmark.py","file_url":"https://github.com/epfml/piecewise-affine-multiplication/blob/HEAD/submodules/timm/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2303.16900","arxiv_id_is_arxiv":true,"paper":"/paper/inceptionnext-when-inception-meets-convnext","title":"InceptionNeXt: When Inception Meets ConvNeXt","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/inceptionnext","path":"benchmark.py","file_url":"https://github.com/sail-sg/inceptionnext/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2201.09792","arxiv_id_is_arxiv":true,"paper":"/paper/patches-are-all-you-need-1","title":"Patches Are All You Need?","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmp-iclr/convmixer","path":"pytorch-image-models/benchmark.py","file_url":"https://github.com/tmp-iclr/convmixer/blob/HEAD/pytorch-image-models/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"2108.01390","arxiv_id_is_arxiv":true,"paper":"/paper/evo-vit-slow-fast-token-evolution-for-dynamic","title":"Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer","date":"2021-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YifanXu74/Evo-ViT","path":"benchmark.py","file_url":"https://github.com/YifanXu74/Evo-ViT/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}},{"arxiv_id":"ijcai2023_0106","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2023_0106","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"kkahatapitiya/SWAT","path":"benchmark.py","file_url":"https://github.com/kkahatapitiya/SWAT/blob/HEAD/benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50d653ee6a59955c","code_sha256_prefix":"50d653ee6a59955c","mcp_get_code":{"code_sha256":"50d653ee6a59955c"}}],"record_sha256":"4ace58683944acae5f2e2be7bb427177c56bdc719df9ea54c8b6729f497f4e78","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}