{"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/sum-independent-dims","entry":"sum_independent_dims","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":4,"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":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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.01771","paper":"/paper/arxiv-2603-01771","title":"Hyperparameter Trajectory Inference with Conditional Lagrangian Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"DLR-RM/stable-baselines3","path":"stable_baselines3/common/distributions.py","file_url":"https://github.com/DLR-RM/stable-baselines3/blob/HEAD/stable_baselines3/common/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a43c0716fbe4e561","mcp_get_code":{"code_sha256":"a43c0716fbe4e561"}},{"arxiv_id":"2406.07826","paper":"/paper/the-max-min-formulation-of-multi-objective","title":"The Max-Min Formulation of Multi-Objective Reinforcement Learning: From Theory to a Model-Free Algorithm","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giseung-park/maxmin-morl","path":"supplementary_ICML24/stable_baselines3/common/distributions.py","file_url":"https://github.com/giseung-park/maxmin-morl/blob/HEAD/supplementary_ICML24/stable_baselines3/common/distributions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee85c29e20e06d17","mcp_get_code":{"code_sha256":"ee85c29e20e06d17"}},{"arxiv_id":"2308.00398","paper":"/paper/driveadapter-breaking-the-coupling-barrier-of","title":"DriveAdapter: Breaking the Coupling Barrier of Perception and Planning in End-to-End Autonomous Driving","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/driveadapter","path":"roach/models/distributions.py","file_url":"https://github.com/opendrivelab/driveadapter/blob/HEAD/roach/models/distributions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"39695b28720f3e53","mcp_get_code":{"code_sha256":"39695b28720f3e53"}},{"arxiv_id":"2305.06242","paper":"/paper/think-twice-before-driving-towards-scalable","title":"Think Twice before Driving: Towards Scalable Decoders for End-to-End Autonomous Driving","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/thinktwice","path":"roach/models/distributions.py","file_url":"https://github.com/opendrivelab/thinktwice/blob/HEAD/roach/models/distributions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"39695b28720f3e53","mcp_get_code":{"code_sha256":"39695b28720f3e53"}},{"arxiv_id":"2106.07551","paper":"/paper/malib-a-parallel-framework-for-population","title":"MALib: A Parallel Framework for Population-based Multi-agent Reinforcement Learning","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtu-marl/malib","path":"malib/common/distributions.py","file_url":"https://github.com/sjtu-marl/malib/blob/HEAD/malib/common/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9036425be43a4578","mcp_get_code":{"code_sha256":"9036425be43a4578"}},{"arxiv_id":"2010.14484","paper":"/paper/one-solution-is-not-all-you-need-few-shot","title":"One Solution is Not All You Need: Few-Shot Extrapolation via Structured MaxEnt RL","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"egiob/diversityisallyouneed-sb3","path":"stable_baselines3/common/distributions.py","file_url":"https://github.com/egiob/diversityisallyouneed-sb3/blob/HEAD/stable_baselines3/common/distributions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee85c29e20e06d17","mcp_get_code":{"code_sha256":"ee85c29e20e06d17"}}]}