{"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/dropout-2","entry":"Dropout","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":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":6,"n_samples_constructed":5,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":8,"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":1,"ran_fixture":0,"ran":5,"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":"2510.11752","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-11752","title":"Fast and Interpretable Protein Substructure Alignment via Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ai4protein/VenusX","path":"src/models/gvp/gvp_modules.py","file_url":"https://github.com/ai4protein/VenusX/blob/HEAD/src/models/gvp/gvp_modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ai4protein/VenusX (NOASSERTION)","code_sha256":"237c3de7b66826f2","code_sha256_prefix":"237c3de7b66826f2","mcp_get_code":{"code_sha256":"237c3de7b66826f2"}},{"arxiv_id":"2203.03952","arxiv_id_is_arxiv":true,"paper":"/paper/edgeformer-improving-light-weight-convnets-by","title":"ParC-Net: Position Aware Circular Convolution with Merits from ConvNets and Transformer","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkzhang91/parc-net","path":"cvnets/modules/edgeformer_block.py","file_url":"https://github.com/hkzhang91/parc-net/blob/HEAD/cvnets/modules/edgeformer_block.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hkzhang91/parc-net when it was checked","code_sha256":"7466f7df30d27f91","code_sha256_prefix":"7466f7df30d27f91","mcp_get_code":{"code_sha256":"7466f7df30d27f91"}},{"arxiv_id":"2201.04850","arxiv_id_is_arxiv":true,"paper":"/paper/bridgeformer-bridging-video-text-retrieval","title":"Bridging Video-text Retrieval with Multiple Choice Questions","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"towhee-io/towhee","path":"towhee/models/bridgeformer/bridge_former_training_block.py","file_url":"https://github.com/towhee-io/towhee/blob/HEAD/towhee/models/bridgeformer/bridge_former_training_block.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a61100315c44e2c","code_sha256_prefix":"7a61100315c44e2c","mcp_get_code":{"code_sha256":"7a61100315c44e2c"}},{"arxiv_id":"2201.04676","arxiv_id_is_arxiv":true,"paper":"/paper/uniformer-unified-transformer-for-efficient-1","title":"UniFormer: Unified Transformer for Efficient Spatiotemporal Representation Learning","date":"2022-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"towhee-io/towhee","path":"towhee/models/uniformer/uniformer.py","file_url":"https://github.com/towhee-io/towhee/blob/HEAD/towhee/models/uniformer/uniformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b2146395f61d804","code_sha256_prefix":"6b2146395f61d804","mcp_get_code":{"code_sha256":"6b2146395f61d804"}},{"arxiv_id":"2106.01345","arxiv_id_is_arxiv":true,"paper":"/paper/decision-transformer-reinforcement-learning","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yun-kwak/decision-transformer-jax","path":"dt_jax/gpt.py","file_url":"https://github.com/yun-kwak/decision-transformer-jax/blob/HEAD/dt_jax/gpt.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":"2a9e66156b160093","code_sha256_prefix":"2a9e66156b160093","mcp_get_code":{"code_sha256":"2a9e66156b160093"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sylviesss/pytorch-simclr","path":"models/simclr.py","file_url":"https://github.com/sylviesss/pytorch-simclr/blob/HEAD/models/simclr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sylviesss/pytorch-simclr when it was checked","code_sha256":"43ca37aec47363d7","code_sha256_prefix":"43ca37aec47363d7","mcp_get_code":{"code_sha256":"43ca37aec47363d7"}},{"arxiv_id":"1905.02244","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/efficientnet-jax","path":"jeffnet/linen/blocks_linen.py","file_url":"https://github.com/rwightman/efficientnet-jax/blob/HEAD/jeffnet/linen/blocks_linen.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":"bb95cb930e46eee0","code_sha256_prefix":"bb95cb930e46eee0","mcp_get_code":{"code_sha256":"bb95cb930e46eee0"}},{"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":"gcucurull/jax-gat","path":"models.py","file_url":"https://github.com/gcucurull/jax-gat/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gcucurull/jax-gat when it was checked","code_sha256":"5afc838eec40772e","code_sha256_prefix":"5afc838eec40772e","mcp_get_code":{"code_sha256":"5afc838eec40772e"}}],"record_sha256":"2c43b879d3759bb4b41c6fd10055edad572d4e00fcfc690f944886d88edc64e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}