{"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/tensor-to-numpy","entry":"tensor_to_numpy","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":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":3,"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":3,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"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":"2602.08182","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08182","title":"NANSDE-Net: A NEURAL SDE FRAMEWORK FOR GENERATING TIME SERIES WITH MEMORY","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ozhr/ArmaNoise-SDE-Net","path":"utils/utils.py","file_url":"https://github.com/ozhr/ArmaNoise-SDE-Net/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ozhr/ArmaNoise-SDE-Net (NOASSERTION)","code_sha256":"cfc91086348ac8c3","code_sha256_prefix":"cfc91086348ac8c3","mcp_get_code":{"code_sha256":"cfc91086348ac8c3"}},{"arxiv_id":"2409.11355","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-image-conditional-diffusion","title":"Fine-Tuning Image-Conditional Diffusion Models is Easier than You Think","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualComputingInstitute/diffusion-e2e-ft","path":"DSINE/utils/visualize.py","file_url":"https://github.com/VisualComputingInstitute/diffusion-e2e-ft/blob/HEAD/DSINE/utils/visualize.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, VisualComputingInstitute/diffusion-e2e-ft when it was checked","code_sha256":"e4738f6dce471506","code_sha256_prefix":"e4738f6dce471506","mcp_get_code":{"code_sha256":"e4738f6dce471506"}},{"arxiv_id":"2407.10775","arxiv_id_is_arxiv":true,"paper":"/paper/last-iterate-global-convergence-of-policy","title":"Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MontenegroAlessandro/MagicRL","path":"algorithms/utils.py","file_url":"https://github.com/MontenegroAlessandro/MagicRL/blob/HEAD/algorithms/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d76fa07dc298ca8","code_sha256_prefix":"6d76fa07dc298ca8","mcp_get_code":{"code_sha256":"6d76fa07dc298ca8"}},{"arxiv_id":"2403.09603","arxiv_id_is_arxiv":true,"paper":"/paper/optimistic-verifiable-training-by-controlling","title":"Optimistic Verifiable Training by Controlling Hardware Nondeterminism","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meghabyte/verifiable-training","path":"merkle.py","file_url":"https://github.com/meghabyte/verifiable-training/blob/HEAD/merkle.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, meghabyte/verifiable-training when it was checked","code_sha256":"98749e1de6e2db3e","code_sha256_prefix":"98749e1de6e2db3e","mcp_get_code":{"code_sha256":"98749e1de6e2db3e"}},{"arxiv_id":"2309.07944","arxiv_id_is_arxiv":true,"paper":"/paper/text-to-image-models-for-counterfactual","title":"Text-to-Image Models for Counterfactual Explanations: a Black-Box Approach","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guillaumejs2403/time","path":"generate-ce.py","file_url":"https://github.com/guillaumejs2403/time/blob/HEAD/generate-ce.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d22e1cfeea97e8e5","code_sha256_prefix":"d22e1cfeea97e8e5","mcp_get_code":{"code_sha256":"d22e1cfeea97e8e5"}},{"arxiv_id":"2306.07193","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-scientific-document","title":"Weakly-Supervised Scientific Document Classification via Retrieval-Augmented Multi-Stage Training","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ritaranx/wander","path":"keyword_expansion.py","file_url":"https://github.com/ritaranx/wander/blob/HEAD/keyword_expansion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0450e58f35f90bdf","code_sha256_prefix":"0450e58f35f90bdf","mcp_get_code":{"code_sha256":"0450e58f35f90bdf"}},{"arxiv_id":"2210.09598","arxiv_id_is_arxiv":true,"paper":"/paper/planning-for-sample-efficient-imitation","title":"Planning for Sample Efficient Imitation Learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaohengyin/EfficientImitate","path":"algo/obs_ei/model.py","file_url":"https://github.com/zhaohengyin/EfficientImitate/blob/HEAD/algo/obs_ei/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"255167c323c80d7b","code_sha256_prefix":"255167c323c80d7b","mcp_get_code":{"code_sha256":"255167c323c80d7b"}},{"arxiv_id":"2209.08212","arxiv_id_is_arxiv":true,"paper":"/paper/compose-embellish-well-structured-piano","title":"Compose & Embellish: Well-Structured Piano Performance Generation via A Two-Stage Approach","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slseanwu/compose_and_embellish","path":"stage01_compose/utils.py","file_url":"https://github.com/slseanwu/compose_and_embellish/blob/HEAD/stage01_compose/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":"5f9b99960db4d771","code_sha256_prefix":"5f9b99960db4d771","mcp_get_code":{"code_sha256":"5f9b99960db4d771"}},{"arxiv_id":"2004.10240","arxiv_id_is_arxiv":true,"paper":"/paper/neural-forecasting-introduction-and","title":"Deep Learning for Time Series Forecasting: Tutorial and Literature Survey","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"potosnakw/neuralforecast","path":"neuralforecast/common/_base_model.py","file_url":"https://github.com/potosnakw/neuralforecast/blob/HEAD/neuralforecast/common/_base_model.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":"8824bbf9d068ffce","code_sha256_prefix":"8824bbf9d068ffce","mcp_get_code":{"code_sha256":"8824bbf9d068ffce"}},{"arxiv_id":"1901.11365","arxiv_id_is_arxiv":true,"paper":"/paper/noise2self-blind-denoising-by-self","title":"Noise2Self: Blind Denoising by Self-Supervision","date":"2019-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czbiohub/noise2self","path":"util.py","file_url":"https://github.com/czbiohub/noise2self/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d58cee70f947cab","code_sha256_prefix":"6d58cee70f947cab","mcp_get_code":{"code_sha256":"6d58cee70f947cab"}}],"record_sha256":"4a74dcf4890066b17712bf9dc52ca6a48700df932a3c2c9e625a6d5ceb3b2433","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}