{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/pad-along-axis","entry":"pad_along_axis","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":4,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2405.16907","paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jaewoopudding/GTA","path":"corl/algorithms/dt.py","file_url":"https://github.com/Jaewoopudding/GTA/blob/HEAD/corl/algorithms/dt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"47482b0dd3325c35","mcp_get_code":{"code_sha256":"47482b0dd3325c35"}},{"arxiv_id":"2308.13568","paper":"/paper/region-disentangled-diffusion-model-for-high","title":"Region-Disentangled Diffusion Model for High-Fidelity PPG-to-ECG Translation","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debadityaqu/rddm","path":"std_eval.py","file_url":"https://github.com/debadityaqu/rddm/blob/HEAD/std_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ef696182b5b9dba","mcp_get_code":{"code_sha256":"4ef696182b5b9dba"}},{"arxiv_id":"2307.15913","paper":"/paper/moisesdb-a-dataset-for-source-separation","title":"Moisesdb: A dataset for source separation beyond 4-stems","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moises-ai/moises-db","path":"moisesdb/signal.py","file_url":"https://github.com/moises-ai/moises-db/blob/HEAD/moisesdb/signal.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"661455fa3ea1ef08","mcp_get_code":{"code_sha256":"661455fa3ea1ef08"}},{"arxiv_id":"2305.09836","paper":"/paper/revisiting-the-minimalist-approach-to-offline","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adamjelley/efficientofflinerl","path":"algorithms/dt.py","file_url":"https://github.com/adamjelley/efficientofflinerl/blob/HEAD/algorithms/dt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"47482b0dd3325c35","mcp_get_code":{"code_sha256":"47482b0dd3325c35"}},{"arxiv_id":"1604.07143","paper":"/paper/neural-random-forests","title":"Neural Random Forests","date":"2016-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhuynh95/cryptotree","path":"cryptotree/linear.py","file_url":"https://github.com/dhuynh95/cryptotree/blob/HEAD/cryptotree/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"231c0df12681fba8","mcp_get_code":{"code_sha256":"231c0df12681fba8"}},{"arxiv_id":"aaai_29422","paper":null,"title":"arXiv:aaai_29422","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DebadityaQU/RDDM","path":"std_eval.py","file_url":"https://github.com/DebadityaQU/RDDM/blob/HEAD/std_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ef696182b5b9dba","mcp_get_code":{"code_sha256":"4ef696182b5b9dba"}}]}