{"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/weightedl1","entry":"WeightedL1","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":8,"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":9,"n_samples_ran":9,"n_samples_constructed":1,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":9,"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":0,"ran_fixture":0,"ran":9,"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":"2603.17685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17685","title":"Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints","date":"2026-03-18","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"wadx2019/qvpo","path":"agent/qvpo.py","file_url":"https://github.com/wadx2019/qvpo/blob/HEAD/agent/qvpo.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":"20545bf1089ab44e","code_sha256_prefix":"20545bf1089ab44e","mcp_get_code":{"code_sha256":"20545bf1089ab44e"}},{"arxiv_id":"2510.11499","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-11499","title":"Offline Reinforcement Learning with Generative Trajectory Policies","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"wmd3i/gtp","path":"agents/diffusion.py","file_url":"https://github.com/wmd3i/gtp/blob/HEAD/agents/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wmd3i/gtp when it was checked","code_sha256":"2e0c2c54ebebc9bc","code_sha256_prefix":"2e0c2c54ebebc9bc","mcp_get_code":{"code_sha256":"2e0c2c54ebebc9bc"}},{"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":true,"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":"dfe036fdc5d15991","code_sha256_prefix":"dfe036fdc5d15991","mcp_get_code":{"code_sha256":"dfe036fdc5d15991"}},{"arxiv_id":"2310.05333","arxiv_id_is_arxiv":true,"paper":"/paper/diffcps-diffusion-model-based-constrained","title":"DiffCPS: Diffusion Model based Constrained Policy Search for Offline Reinforcement Learning","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felix-thu/DiffCPS","path":"agents/diffcps.py","file_url":"https://github.com/felix-thu/DiffCPS/blob/HEAD/agents/diffcps.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7e6cca0e2c2e381","code_sha256_prefix":"a7e6cca0e2c2e381","mcp_get_code":{"code_sha256":"a7e6cca0e2c2e381"}},{"arxiv_id":"2309.16984","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-models-as-a-rich-and-efficient","title":"Consistency Models as a Rich and Efficient Policy Class for Reinforcement Learning","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quantumiracle/consistency_model_for_reinforcement_learning","path":"agents/consistency.py","file_url":"https://github.com/quantumiracle/consistency_model_for_reinforcement_learning/blob/HEAD/agents/consistency.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a195e5fbb1ffc8f2","code_sha256_prefix":"a195e5fbb1ffc8f2","mcp_get_code":{"code_sha256":"a195e5fbb1ffc8f2"}},{"arxiv_id":"2305.18459","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-model-is-an-effective-planner-and-1","title":"Diffusion Model is an Effective Planner and Data Synthesizer for Multi-Task Reinforcement Learning","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jannerm/diffuser","path":"diffuser/models/diffusion.py","file_url":"https://github.com/jannerm/diffuser/blob/HEAD/diffuser/models/diffusion.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":"bb0b654d7e2f043a","code_sha256_prefix":"bb0b654d7e2f043a","mcp_get_code":{"code_sha256":"bb0b654d7e2f043a"}},{"arxiv_id":"2210.15629","arxiv_id_is_arxiv":true,"paper":"/paper/lad-language-augmented-diffusion-for","title":"Language Control Diffusion: Efficiently Scaling through Space, Time, and Tasks","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ezhang7423/language-control-diffusion","path":"src/lcd/models/diffusion.py","file_url":"https://github.com/ezhang7423/language-control-diffusion/blob/HEAD/src/lcd/models/diffusion.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":"eac173f0a5136904","code_sha256_prefix":"eac173f0a5136904","mcp_get_code":{"code_sha256":"eac173f0a5136904"}},{"arxiv_id":"2003.07833","arxiv_id_is_arxiv":true,"paper":"/paper/latent-embedding-feedback-and-discriminative","title":"Latent Embedding Feedback and Discriminative Features for Zero-Shot Classification","date":"2020-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akshitac8/tfvaegan","path":"train_actions.py","file_url":"https://github.com/akshitac8/tfvaegan/blob/HEAD/train_actions.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":"167cb4b4ad32f511","code_sha256_prefix":"167cb4b4ad32f511","mcp_get_code":{"code_sha256":"167cb4b4ad32f511"}},{"arxiv_id":"2003.07833","arxiv_id_is_arxiv":true,"paper":"/paper/latent-embedding-feedback-and-discriminative","title":"Latent Embedding Feedback and Discriminative Features for Zero-Shot Classification","date":"2020-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akshitac8/tfvaegan","path":"train_images.py","file_url":"https://github.com/akshitac8/tfvaegan/blob/HEAD/train_images.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":"3bb6f4b7a7021d0f","code_sha256_prefix":"3bb6f4b7a7021d0f","mcp_get_code":{"code_sha256":"3bb6f4b7a7021d0f"}}],"record_sha256":"a0395d70a65fa7c416d4406c957711dcfa2cf8be217da081fddec949603bf053","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}