{"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/pad-t-like-x","entry":"pad_t_like_x","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"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":"2606.15359","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"884297d5659039e2","code_sha256_prefix":"884297d5659039e2","mcp_get_code":{"code_sha256":"884297d5659039e2"}},{"arxiv_id":"2505.18647","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9e320fdaa5a3063f","code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2504.04798","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eeb5b8effffc6cdd","code_sha256_prefix":"eeb5b8effffc6cdd","mcp_get_code":{"code_sha256":"eeb5b8effffc6cdd"}},{"arxiv_id":"2502.02150","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e320fdaa5a3063f","code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2407.02398","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e320fdaa5a3063f","code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2405.16577","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eeb5b8effffc6cdd","code_sha256_prefix":"eeb5b8effffc6cdd","mcp_get_code":{"code_sha256":"eeb5b8effffc6cdd"}},{"arxiv_id":"2307.03672","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9e320fdaa5a3063f","code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}},{"arxiv_id":"2302.00482","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e320fdaa5a3063f","code_sha256_prefix":"9e320fdaa5a3063f","mcp_get_code":{"code_sha256":"9e320fdaa5a3063f"}}],"record_sha256":"407c505fe917ee27982b8524000d34eaf2d89e703e2fc1bc6c1758c3d23a44e4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}