{"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/torch2numpy","entry":"torch2numpy","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_fixture":1,"ran":3,"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":"2306.07743","arxiv_id_is_arxiv":true,"paper":"/paper/v-lol-a-diagnostic-dataset-for-visual-logical","title":"V-LoL: A Diagnostic Dataset for Visual Logical Learning","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/vlol-dataset-gen","path":"util.py","file_url":"https://github.com/ml-research/vlol-dataset-gen/blob/HEAD/util.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":"69420971b8594eb5","code_sha256_prefix":"69420971b8594eb5","mcp_get_code":{"code_sha256":"69420971b8594eb5"}},{"arxiv_id":"2305.05773","arxiv_id_is_arxiv":true,"paper":"/paper/deeptextmark-deep-learning-based-text","title":"DeepTextMark: A Deep Learning-Driven Text Watermarking Approach for Identifying Large Language Model Generated Text","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2024-MindSpore-1/Code4","path":"OCRNet/convert_from_torch.py","file_url":"https://github.com/2024-MindSpore-1/Code4/blob/HEAD/OCRNet/convert_from_torch.py","status":"ran","verification_level":1,"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":"59a201993bc5c9f2","code_sha256_prefix":"59a201993bc5c9f2","mcp_get_code":{"code_sha256":"59a201993bc5c9f2"}},{"arxiv_id":"2209.09484","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-temporal-transformer-for-3d-hand","title":"Hierarchical Temporal Transformer for 3D Hand Pose Estimation and Action Recognition from Egocentric RGB Videos","date":"2022-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fylwen/htt","path":"models/utils.py","file_url":"https://github.com/fylwen/htt/blob/HEAD/models/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":"c543ebbcba3e5933","code_sha256_prefix":"c543ebbcba3e5933","mcp_get_code":{"code_sha256":"c543ebbcba3e5933"}},{"arxiv_id":"2110.13878","arxiv_id_is_arxiv":true,"paper":"/paper/deep-explicit-duration-switching-models-for","title":"Deep Explicit Duration Switching Models for Time Series","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abdulfatir/REDSDS","path":"src/model.py","file_url":"https://github.com/abdulfatir/REDSDS/blob/HEAD/src/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, abdulfatir/REDSDS when it was checked","code_sha256":"78327e7d8435ed60","code_sha256_prefix":"78327e7d8435ed60","mcp_get_code":{"code_sha256":"78327e7d8435ed60"}},{"arxiv_id":"2012.14966","arxiv_id_is_arxiv":true,"paper":"/paper/kaleidoscope-an-efficient-learnable-1","title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","date":"2020-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/butterfly","path":"butterfly/butterfly.py","file_url":"https://github.com/HazyResearch/butterfly/blob/HEAD/butterfly/butterfly.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76afe345657ec2e7","code_sha256_prefix":"76afe345657ec2e7","mcp_get_code":{"code_sha256":"76afe345657ec2e7"}},{"arxiv_id":"1808.07371","arxiv_id_is_arxiv":true,"paper":"/paper/everybody-dance-now","title":"Everybody Dance Now","date":"2018-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lotayou/everybody_dance_now_pytorch","path":"face_enhancer/enhance.py","file_url":"https://github.com/Lotayou/everybody_dance_now_pytorch/blob/HEAD/face_enhancer/enhance.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, Lotayou/everybody_dance_now_pytorch, is not in the permissive set Syntology serves inline","code_sha256":"3f826d9a61399fe6","code_sha256_prefix":"3f826d9a61399fe6","mcp_get_code":{"code_sha256":"3f826d9a61399fe6"}}],"record_sha256":"6de81b2459d401623aeadb944dd71a30c745c9e26379743716826ce3dcfe0aea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}