{"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/angle-normalize","entry":"angle_normalize","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2510.24482","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24482","title":"Sample-efficient and Scalable Exploration in Continuous-Time RL","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"lasgroup/ombrl","path":"ombrl/utils/rewards.py","file_url":"https://github.com/lasgroup/ombrl/blob/HEAD/ombrl/utils/rewards.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, lasgroup/ombrl (NOASSERTION)","code_sha256":"f05930a77b5311f4","code_sha256_prefix":"f05930a77b5311f4","mcp_get_code":{"code_sha256":"f05930a77b5311f4"}},{"arxiv_id":"2401.07369","arxiv_id_is_arxiv":true,"paper":"/paper/covo-mpc-theoretical-analysis-of-sampling","title":"CoVO-MPC: Theoretical Analysis of Sampling-based MPC and Optimal Covariance Design","date":"2024-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeCAR-Lab/CoVO-MPC","path":"quadjax/dynamics/utils.py","file_url":"https://github.com/LeCAR-Lab/CoVO-MPC/blob/HEAD/quadjax/dynamics/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74287e2a6f6b1fb0","code_sha256_prefix":"74287e2a6f6b1fb0","mcp_get_code":{"code_sha256":"74287e2a6f6b1fb0"}},{"arxiv_id":"2210.09622","arxiv_id_is_arxiv":true,"paper":"/paper/deep-black-box-reinforcement-learning-with","title":"Deep Black-Box Reinforcement Learning with Movement Primitives","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ALRhub/fancy_gym","path":"fancy_gym/utils/utils.py","file_url":"https://github.com/ALRhub/fancy_gym/blob/HEAD/fancy_gym/utils/utils.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":"38fb46c86c62915f","code_sha256_prefix":"38fb46c86c62915f","mcp_get_code":{"code_sha256":"38fb46c86c62915f"}},{"arxiv_id":"2106.12782","arxiv_id_is_arxiv":true,"paper":"/paper/hamiltonian-based-neural-ode-networks-on-the","title":"Hamiltonian-based Neural ODE Networks on the SE(3) Manifold For Dynamics Learning and Control","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thaipduong/SE3HamDL","path":"envs/pendulum.py","file_url":"https://github.com/thaipduong/SE3HamDL/blob/HEAD/envs/pendulum.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 axelbr/dvbf, and GitHub detected no licence in that repository when it was checked","code_sha256":"e0c8661c35e1c81d","code_sha256_prefix":"e0c8661c35e1c81d","mcp_get_code":{"code_sha256":"e0c8661c35e1c81d"}},{"arxiv_id":"1810.09103","arxiv_id_is_arxiv":true,"paper":"/paper/actor-expert-a-framework-for-using-action","title":"Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement","date":"2018-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelfneumann/greedyac","path":"env/PendulumEnv.py","file_url":"https://github.com/samuelfneumann/greedyac/blob/HEAD/env/PendulumEnv.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":"eef88b4b150868c5","code_sha256_prefix":"eef88b4b150868c5","mcp_get_code":{"code_sha256":"eef88b4b150868c5"}},{"arxiv_id":"1605.06432","arxiv_id_is_arxiv":true,"paper":"/paper/deep-variational-bayes-filters-unsupervised","title":"Deep Variational Bayes Filters: Unsupervised Learning of State Space Models from Raw Data","date":"2016-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axelbr/dvbf","path":"wrapper.py","file_url":"https://github.com/axelbr/dvbf/blob/HEAD/wrapper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, axelbr/dvbf when it was checked","code_sha256":"e0c8661c35e1c81d","code_sha256_prefix":"e0c8661c35e1c81d","mcp_get_code":{"code_sha256":"e0c8661c35e1c81d"}}],"record_sha256":"c412538a92a6f72c6861a1c5f1a745a7b3de43ce660c92c6c24c0cbbdc0978bc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}