{"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/upsample1d","entry":"Upsample1d","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":6,"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":6,"n_samples_ran":6,"n_samples_constructed":3,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"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":"2509.25822","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25822","title":"Act to See, See to Act: Diffusion-Driven Perception-Action Interplay for Adaptive Policies","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ARISE-Initiative/robomimic","path":"robomimic/models/diffusion_policy_nets.py","file_url":"https://github.com/ARISE-Initiative/robomimic/blob/HEAD/robomimic/models/diffusion_policy_nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"154f21024f2c0a78","code_sha256_prefix":"154f21024f2c0a78","mcp_get_code":{"code_sha256":"154f21024f2c0a78"}},{"arxiv_id":"2502.07202","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-tree-diffusion-for-system-2","title":"Monte Carlo Tree Diffusion for System 2 Planning","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changchencc/plandq","path":"antmaze/diffuser/models/temporal.py","file_url":"https://github.com/changchencc/plandq/blob/HEAD/antmaze/diffuser/models/temporal.py","status":"ran","verification_level":1,"contract_check":null,"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, changchencc/plandq when it was checked","code_sha256":"8dabfe9002d64497","code_sha256_prefix":"8dabfe9002d64497","mcp_get_code":{"code_sha256":"8dabfe9002d64497"}},{"arxiv_id":"2403.02782","arxiv_id_is_arxiv":true,"paper":"/paper/why-not-use-your-textbook-knowledge-enhanced","title":"Why Not Use Your Textbook? Knowledge-Enhanced Procedure Planning of Instructional Videos","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ravindu-Yasas-Nagasinghe/KEPP","path":"plan/model/temporal.py","file_url":"https://github.com/Ravindu-Yasas-Nagasinghe/KEPP/blob/HEAD/plan/model/temporal.py","status":"ran","verification_level":1,"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, Ravindu-Yasas-Nagasinghe/KEPP when it was checked","code_sha256":"bdb824a0a950ca32","code_sha256_prefix":"bdb824a0a950ca32","mcp_get_code":{"code_sha256":"bdb824a0a950ca32"}},{"arxiv_id":"2402.07226","arxiv_id_is_arxiv":true,"paper":"/paper/stitching-sub-trajectories-with-conditional","title":"Stitching Sub-Trajectories with Conditional Diffusion Model for Goal-Conditioned Offline RL","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlatjddbs/SSD","path":"dc/dc.py","file_url":"https://github.com/rlatjddbs/SSD/blob/HEAD/dc/dc.py","status":"ran","verification_level":1,"contract_check":null,"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, rlatjddbs/SSD when it was checked","code_sha256":"3ff139e92610787b","code_sha256_prefix":"3ff139e92610787b","mcp_get_code":{"code_sha256":"3ff139e92610787b"}},{"arxiv_id":"2305.01319","arxiv_id_is_arxiv":true,"paper":"/paper/long-term-rhythmic-video-soundtracker","title":"Long-Term Rhythmic Video Soundtracker","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/loris","path":"audio_diffusion_pytorch/modules.py","file_url":"https://github.com/opengvlab/loris/blob/HEAD/audio_diffusion_pytorch/modules.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":"24d2462d278a835e","code_sha256_prefix":"24d2462d278a835e","mcp_get_code":{"code_sha256":"24d2462d278a835e"}},{"arxiv_id":"2111.08679","arxiv_id_is_arxiv":true,"paper":"/paper/automatically-detecting-anomalous-exoplanet","title":"Automatically detecting anomalous exoplanet transits","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"christophhoenes/anomalousexoplanettransits","path":"architectures.py","file_url":"https://github.com/christophhoenes/anomalousexoplanettransits/blob/HEAD/architectures.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d764b73a39b8e5e","code_sha256_prefix":"2d764b73a39b8e5e","mcp_get_code":{"code_sha256":"2d764b73a39b8e5e"}}],"record_sha256":"3ad5900a98e77cbcaf214b75ffe7144e814beadfd3edc9e5a48a090809236580","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}