{"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/dtype","entry":"Dtype","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":7,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":3,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":3,"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":0,"unverified":3},"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":"2312.10308","arxiv_id_is_arxiv":true,"paper":"/paper/event-based-contrastive-learning-for-medical","title":"Event-Based Contrastive Learning for Medical Time Series","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-ccrg/ebcl","path":"src/model/ebcl_model.py","file_url":"https://github.com/mit-ccrg/ebcl/blob/HEAD/src/model/ebcl_model.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":"df0b4dffc58cc48c","code_sha256_prefix":"df0b4dffc58cc48c","mcp_get_code":{"code_sha256":"df0b4dffc58cc48c"}},{"arxiv_id":"2309.16217","arxiv_id_is_arxiv":true,"paper":"/paper/gaflow-incorporating-gaussian-attention-into-1","title":"GAFlow: Incorporating Gaussian Attention into Optical Flow","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LA30/GAFlow","path":"core/model/cuda.py","file_url":"https://github.com/LA30/GAFlow/blob/HEAD/core/model/cuda.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, LA30/GAFlow when it was checked","code_sha256":"1e624f979ea53ae4","code_sha256_prefix":"1e624f979ea53ae4","mcp_get_code":{"code_sha256":"1e624f979ea53ae4"}},{"arxiv_id":"2107.08391","arxiv_id_is_arxiv":true,"paper":"/paper/as-mlp-an-axial-shifted-mlp-architecture-for","title":"AS-MLP: An Axial Shifted MLP Architecture for Vision","date":"2021-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"svip-lab/AS-MLP","path":"models/shift_cuda.py","file_url":"https://github.com/svip-lab/AS-MLP/blob/HEAD/models/shift_cuda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thomasverelst/dynconv, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e624f979ea53ae4","code_sha256_prefix":"1e624f979ea53ae4","mcp_get_code":{"code_sha256":"1e624f979ea53ae4"}},{"arxiv_id":"2106.04263","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-local-vision-transformer-sparse","title":"On the Connection between Local Attention and Dynamic Depth-wise Convolution","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Atten4Vis/DemystifyLocalViT","path":"models/idynamic.py","file_url":"https://github.com/Atten4Vis/DemystifyLocalViT/blob/HEAD/models/idynamic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thomasverelst/dynconv, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e624f979ea53ae4","code_sha256_prefix":"1e624f979ea53ae4","mcp_get_code":{"code_sha256":"1e624f979ea53ae4"}},{"arxiv_id":"1912.03203","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-convolutions-exploiting-spatial","title":"Dynamic Convolutions: Exploiting Spatial Sparsity for Faster Inference","date":"2019-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomasverelst/dynconv","path":"pose/lib/dynconv/cuda.py","file_url":"https://github.com/thomasverelst/dynconv/blob/HEAD/pose/lib/dynconv/cuda.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, thomasverelst/dynconv when it was checked","code_sha256":"1e624f979ea53ae4","code_sha256_prefix":"1e624f979ea53ae4","mcp_get_code":{"code_sha256":"1e624f979ea53ae4"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whut2962575697/gat_sementic_segmentation","path":"roi_pooling/utils.py","file_url":"https://github.com/whut2962575697/gat_sementic_segmentation/blob/HEAD/roi_pooling/utils.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":"a71b339ad4cd268f","code_sha256_prefix":"a71b339ad4cd268f","mcp_get_code":{"code_sha256":"a71b339ad4cd268f"}},{"arxiv_id":"Wang_Deep_Arbitrary-Scale_Image_Super-Resolution_via_Scale-Equivariance_Pursuit_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Deep_Arbitrary-Scale_Image_Super-Resolution_via_Scale-Equivariance_Pursuit_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"neuralchen/EQSR","path":"EQSR/archs/Involution.py","file_url":"https://github.com/neuralchen/EQSR/blob/HEAD/EQSR/archs/Involution.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from thomasverelst/dynconv, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e624f979ea53ae4","code_sha256_prefix":"1e624f979ea53ae4","mcp_get_code":{"code_sha256":"1e624f979ea53ae4"}}],"record_sha256":"2f05c45e303a82c50f23d58273984d52f64b37e27c83705e4292d192fd4d83fc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}