{"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/ensemblize","entry":"ensemblize","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":11,"n_places_pointer_only_link_open":5,"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":2,"ran_fixture":0,"ran":1,"unverified":1},"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":"2609.15883","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-15883","title":"Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Yonsei-DILLab/OptiFlow","path":"optiflow/networks.py","file_url":"https://github.com/Yonsei-DILLab/OptiFlow/blob/HEAD/optiflow/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Yonsei-DILLab/OptiFlow when it was checked","code_sha256":"f157becc6d5dd71b","code_sha256_prefix":"f157becc6d5dd71b","mcp_get_code":{"code_sha256":"f157becc6d5dd71b"}},{"arxiv_id":"2608.01205","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01205","title":"ReBRAC-v2: The Return of the King","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"JongseongChae/FAC","path":"agents/rebrac.py","file_url":"https://github.com/JongseongChae/FAC/blob/HEAD/agents/rebrac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, JongseongChae/FAC when it was checked","code_sha256":"f157becc6d5dd71b","code_sha256_prefix":"f157becc6d5dd71b","mcp_get_code":{"code_sha256":"f157becc6d5dd71b"}},{"arxiv_id":"2606.11087","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11087","title":"Test-Time Gradient Guidance of Flow Policies in Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"zhouzypaul/qgf","path":"utils/networks.py","file_url":"https://github.com/zhouzypaul/qgf/blob/HEAD/utils/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JongseongChae/FAC, and GitHub detected no licence in that repository when it was checked","code_sha256":"f157becc6d5dd71b","code_sha256_prefix":"f157becc6d5dd71b","mcp_get_code":{"code_sha256":"f157becc6d5dd71b"}},{"arxiv_id":"2510.15382","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-15382","title":"Towards Robust Zero-Shot Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"seohongpark/HILP","path":"hilp_gcrl/jaxrl_m/networks.py","file_url":"https://github.com/seohongpark/HILP/blob/HEAD/hilp_gcrl/jaxrl_m/networks.py","status":"unverified","verification_level":0,"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, seohongpark/HILP when it was checked","code_sha256":"7f174e0d2fe49c08","code_sha256_prefix":"7f174e0d2fe49c08","mcp_get_code":{"code_sha256":"7f174e0d2fe49c08"}},{"arxiv_id":"2506.08902","arxiv_id_is_arxiv":true,"paper":"/paper/intention-conditioned-flow-occupancy-models","title":"Intention-Conditioned Flow Occupancy Models","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chongyi-zheng/infom","path":"agents/infom.py","file_url":"https://github.com/chongyi-zheng/infom/blob/HEAD/agents/infom.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2b6e84f73d1d030","code_sha256_prefix":"e2b6e84f73d1d030","mcp_get_code":{"code_sha256":"e2b6e84f73d1d030"}},{"arxiv_id":"2502.05450","arxiv_id_is_arxiv":true,"paper":"/paper/conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cccedric/conrft","path":"serl_launcher/serl_launcher/networks/actor_critic_nets.py","file_url":"https://github.com/cccedric/conrft/blob/HEAD/serl_launcher/serl_launcher/networks/actor_critic_nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zhouzypaul/wsrl, and GitHub detected no licence in that repository when it was checked","code_sha256":"4e9a6a46c6aeee0b","code_sha256_prefix":"4e9a6a46c6aeee0b","mcp_get_code":{"code_sha256":"4e9a6a46c6aeee0b"}},{"arxiv_id":"2412.07762","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-online-reinforcement-learning-fine","title":"Efficient Online Reinforcement Learning Fine-Tuning Need Not Retain Offline Data","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouzypaul/wsrl","path":"wsrl/networks/actor_critic_nets.py","file_url":"https://github.com/zhouzypaul/wsrl/blob/HEAD/wsrl/networks/actor_critic_nets.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, zhouzypaul/wsrl when it was checked","code_sha256":"4e9a6a46c6aeee0b","code_sha256_prefix":"4e9a6a46c6aeee0b","mcp_get_code":{"code_sha256":"4e9a6a46c6aeee0b"}},{"arxiv_id":"2402.17135","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-zero-shot-reinforcement-learning","title":"Unsupervised Zero-Shot Reinforcement Learning via Functional Reward Encodings","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvfrans/fre","path":"common/networks/basic.py","file_url":"https://github.com/kvfrans/fre/blob/HEAD/common/networks/basic.py","status":"unverified","verification_level":0,"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, kvfrans/fre when it was checked","code_sha256":"7f174e0d2fe49c08","code_sha256_prefix":"7f174e0d2fe49c08","mcp_get_code":{"code_sha256":"7f174e0d2fe49c08"}},{"arxiv_id":"2402.15567","arxiv_id_is_arxiv":true,"paper":"/paper/foundation-policies-with-hilbert","title":"Foundation Policies with Hilbert Representations","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seohongpark/hilp","path":"hilp_gcrl/jaxrl_m/networks.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/jaxrl_m/networks.py","status":"unverified","verification_level":0,"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, seohongpark/hilp when it was checked","code_sha256":"7f174e0d2fe49c08","code_sha256_prefix":"7f174e0d2fe49c08","mcp_get_code":{"code_sha256":"7f174e0d2fe49c08"}},{"arxiv_id":"2308.12952","arxiv_id_is_arxiv":true,"paper":"/paper/bridgedata-v2-a-dataset-for-robot-learning-at","title":"BridgeData V2: A Dataset for Robot Learning at Scale","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rail-berkeley/BridgeData-V2","path":"jaxrl_m/networks/actor_critic_nets.py","file_url":"https://github.com/rail-berkeley/BridgeData-V2/blob/HEAD/jaxrl_m/networks/actor_critic_nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhouzypaul/wsrl, and GitHub detected no licence in that repository when it was checked","code_sha256":"4e9a6a46c6aeee0b","code_sha256_prefix":"4e9a6a46c6aeee0b","mcp_get_code":{"code_sha256":"4e9a6a46c6aeee0b"}},{"arxiv_id":"2307.11949","arxiv_id_is_arxiv":true,"paper":"/paper/hiql-offline-goal-conditioned-rl-with-latent-1","title":"HIQL: Offline Goal-Conditioned RL with Latent States as Actions","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seohongpark/hiql","path":"jaxrl_m/networks.py","file_url":"https://github.com/seohongpark/hiql/blob/HEAD/jaxrl_m/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from seohongpark/HILP, and GitHub detected no licence in that repository when it was checked","code_sha256":"7f174e0d2fe49c08","code_sha256_prefix":"7f174e0d2fe49c08","mcp_get_code":{"code_sha256":"7f174e0d2fe49c08"}},{"arxiv_id":"openreview_RdkOaK4q6p","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_RdkOaK4q6p","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"2012060/DFQL","path":"utils/networks.py","file_url":"https://github.com/2012060/DFQL/blob/HEAD/utils/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JongseongChae/FAC, and GitHub detected no licence in that repository when it was checked","code_sha256":"f157becc6d5dd71b","code_sha256_prefix":"f157becc6d5dd71b","mcp_get_code":{"code_sha256":"f157becc6d5dd71b"}}],"record_sha256":"0241b31dd05d1c2bb4a469f054d2cd63d56b8e625804dfc87a9a2f76fd316c01","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}