{"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/convert-to-one-hot","entry":"convert_to_one_hot","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":2,"ran":3,"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":"2409.15647","arxiv_id_is_arxiv":true,"paper":"/paper/looped-transformers-for-length-generalization","title":"Looped Transformers for Length Generalization","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UW-Madison-Lee-Lab/looped-tf","path":"src/utils.py","file_url":"https://github.com/UW-Madison-Lee-Lab/looped-tf/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, UW-Madison-Lee-Lab/looped-tf when it was checked","code_sha256":"2b0656642339e6c3","code_sha256_prefix":"2b0656642339e6c3","mcp_get_code":{"code_sha256":"2b0656642339e6c3"}},{"arxiv_id":"2402.19470","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalizable-tumor-synthesis","title":"Towards Generalizable Tumor Synthesis","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrgiovanni/difftumor","path":"STEP3.SegmentationModel/monai_trainer.py","file_url":"https://github.com/mrgiovanni/difftumor/blob/HEAD/STEP3.SegmentationModel/monai_trainer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, mrgiovanni/difftumor (NOASSERTION)","code_sha256":"07043f3ace7177ab","code_sha256_prefix":"07043f3ace7177ab","mcp_get_code":{"code_sha256":"07043f3ace7177ab"}},{"arxiv_id":"2402.11301","arxiv_id_is_arxiv":true,"paper":"/paper/revit-enhancing-vision-transformers-with","title":"ReViT: Enhancing Vision Transformers Feature Diversity with Attention Residual Connections","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adiko1997/revit","path":"dataset/mixup.py","file_url":"https://github.com/adiko1997/revit/blob/HEAD/dataset/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1d7ffe2c3f88e99","code_sha256_prefix":"c1d7ffe2c3f88e99","mcp_get_code":{"code_sha256":"c1d7ffe2c3f88e99"}},{"arxiv_id":"2306.07703","arxiv_id_is_arxiv":true,"paper":"/paper/e2e-load-end-to-end-long-form-online-action","title":"E2E-LOAD: End-to-End Long-form Online Action Detection","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sqiangcao99/e2e-load","path":"src/datasets/mixup.py","file_url":"https://github.com/sqiangcao99/e2e-load/blob/HEAD/src/datasets/mixup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, sqiangcao99/e2e-load, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"7e91df719cc1d4ff","code_sha256_prefix":"7e91df719cc1d4ff","mcp_get_code":{"code_sha256":"7e91df719cc1d4ff"}},{"arxiv_id":"2302.04869","arxiv_id_is_arxiv":true,"paper":"/paper/reversible-vision-transformers-1","title":"Reversible Vision Transformers","date":"2023-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/mvit","path":"mvit/datasets/mixup.py","file_url":"https://github.com/facebookresearch/mvit/blob/HEAD/mvit/datasets/mixup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, facebookresearch/mvit, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"547be2babaca4859","code_sha256_prefix":"547be2babaca4859","mcp_get_code":{"code_sha256":"547be2babaca4859"}},{"arxiv_id":"2206.13559","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-efficient-image-to-video-transfer","title":"ST-Adapter: Parameter-Efficient Image-to-Video Transfer Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linziyi96/st-adapter","path":"video_dataset/mixup.py","file_url":"https://github.com/linziyi96/st-adapter/blob/HEAD/video_dataset/mixup.py","status":"ran","verification_level":1,"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 facebookresearch/mvit, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"547be2babaca4859","code_sha256_prefix":"547be2babaca4859","mcp_get_code":{"code_sha256":"547be2babaca4859"}},{"arxiv_id":"2008.02457","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutional-networks-for-1","title":"Graph Convolutional Networks for Hyperspectral Image Classification","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danfenghong/IEEE_TGRS_GCN","path":"miniGCN.py","file_url":"https://github.com/danfenghong/IEEE_TGRS_GCN/blob/HEAD/miniGCN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, danfenghong/IEEE_TGRS_GCN when it was checked","code_sha256":"459f2984ea055ede","code_sha256_prefix":"459f2984ea055ede","mcp_get_code":{"code_sha256":"459f2984ea055ede"}},{"arxiv_id":"1612.07659","arxiv_id_is_arxiv":true,"paper":"/paper/structured-sequence-modeling-with-graph","title":"Structured Sequence Modeling with Graph Convolutional Recurrent Networks","date":"2016-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andymogul/gcrnn_revised","path":"utils.py","file_url":"https://github.com/andymogul/gcrnn_revised/blob/HEAD/utils.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":"660f5f33fc38af17","code_sha256_prefix":"660f5f33fc38af17","mcp_get_code":{"code_sha256":"660f5f33fc38af17"}},{"arxiv_id":"1611.01144","arxiv_id_is_arxiv":true,"paper":"/paper/categorical-reparameterization-with-gumbel","title":"Categorical Reparameterization with Gumbel-Softmax","date":"2016-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chijames/gst","path":"model/basic.py","file_url":"https://github.com/chijames/gst/blob/HEAD/model/basic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, chijames/gst when it was checked","code_sha256":"ddba371fd54afdd0","code_sha256_prefix":"ddba371fd54afdd0","mcp_get_code":{"code_sha256":"ddba371fd54afdd0"}},{"arxiv_id":"1606.02147","arxiv_id_is_arxiv":true,"paper":"/paper/enet-a-deep-neural-network-architecture-for","title":"ENet: A Deep Neural Network Architecture for Real-Time Semantic Segmentation","date":"2016-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alililia/ascend_E-NET","path":"src/iou_eval.py","file_url":"https://github.com/alililia/ascend_E-NET/blob/HEAD/src/iou_eval.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":"11aacaf9af63492c","code_sha256_prefix":"11aacaf9af63492c","mcp_get_code":{"code_sha256":"11aacaf9af63492c"}}],"record_sha256":"150496948033b50d58d4c68da6bf34dcadae45416de5e8731b1c7b72b8ef42df","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}