{"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-t-like-x","entry":"pad_t_like_x","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-25T09:33:49+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":8,"n_papers_ran":8,"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":3,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":0},"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":"2606.15359","paper":"/paper/arxiv-2606-15359","title":"DiRecT: Safe Diffusion-Based Planning via Receding-Horizon Denoising","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"azizanlab/DiRecT","path":"maze2d/diffusion.py","file_url":"https://github.com/azizanlab/DiRecT/blob/HEAD/maze2d/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"884297d5659039e2","mcp_get_code":{"code_sha256":"884297d5659039e2"}},{"arxiv_id":"2505.18647","paper":"/paper/flow-matching-for-geometric-trajectory","title":"Flow Matching for Geometric Trajectory Simulation","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2504.04798","paper":"/paper/tabrep-a-simple-and-effective-continuous","title":"TabRep: a Simple and Effective Continuous Representation for Training Tabular Diffusion Models","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobyhsi/TabRep","path":"tabrep_flow/models/flow_matching.py","file_url":"https://github.com/jacobyhsi/TabRep/blob/HEAD/tabrep_flow/models/flow_matching.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eeb5b8effffc6cdd","mcp_get_code":{"code_sha256":"eeb5b8effffc6cdd"}},{"arxiv_id":"2502.02150","paper":"/paper/on-the-guidance-of-flow-matching","title":"On the Guidance of Flow Matching","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4science-westlakeu/flow_guidance","path":"offline_rl/gflower/models_flow/flow_matcher.py","file_url":"https://github.com/ai4science-westlakeu/flow_guidance/blob/HEAD/offline_rl/gflower/models_flow/flow_matcher.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2407.02398","paper":"/paper/consistency-flow-matching-defining-straight","title":"Consistency Flow Matching: Defining Straight Flows with Velocity Consistency","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/consistency_flow_matching","path":"consistencyfm/torchcfm/conditional_flow_matching.py","file_url":"https://github.com/yangling0818/consistency_flow_matching/blob/HEAD/consistencyfm/torchcfm/conditional_flow_matching.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2405.16577","paper":"/paper/reflected-flow-matching","title":"Reflected Flow Matching","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyuxie/RFM","path":"CIFAR10/utils/flow.py","file_url":"https://github.com/tyuxie/RFM/blob/HEAD/CIFAR10/utils/flow.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eeb5b8effffc6cdd","mcp_get_code":{"code_sha256":"eeb5b8effffc6cdd"}},{"arxiv_id":"2307.03672","paper":"/paper/simulation-free-schrodinger-bridges-via-score","title":"Simulation-free Schrödinger bridges via score and flow matching","date":"2023-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2302.00482","paper":"/paper/conditional-flow-matching-simulation-free","title":"Improving and generalizing flow-based generative models with minibatch optimal transport","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atong01/conditional-flow-matching","path":"torchcfm/conditional_flow_matching.py","file_url":"https://github.com/atong01/conditional-flow-matching/blob/HEAD/torchcfm/conditional_flow_matching.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}}]}