{"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/atanh","entry":"atanh","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":7,"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":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"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":"2602.10793","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10793","title":"Semi-Supervised Cross-Domain Imitation Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"JasonMa2016/SMODICE","path":"networks_pytorch.py","file_url":"https://github.com/JasonMa2016/SMODICE/blob/HEAD/networks_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, JasonMa2016/SMODICE when it was checked","code_sha256":"cf5ce98955ab4534","code_sha256_prefix":"cf5ce98955ab4534","mcp_get_code":{"code_sha256":"cf5ce98955ab4534"}},{"arxiv_id":"2403.01734","arxiv_id_is_arxiv":true,"paper":"/paper/offline-goal-conditioned-reinforcement","title":"Offline Goal-Conditioned Reinforcement Learning for Safety-Critical Tasks with Recovery Policy","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunlighted/rbsl","path":"rl_modules/models.py","file_url":"https://github.com/sunlighted/rbsl/blob/HEAD/rl_modules/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, sunlighted/rbsl when it was checked","code_sha256":"cf5ce98955ab4534","code_sha256_prefix":"cf5ce98955ab4534","mcp_get_code":{"code_sha256":"cf5ce98955ab4534"}},{"arxiv_id":"2311.01331","arxiv_id_is_arxiv":true,"paper":"/paper/offline-imitation-from-observation-via-primal","title":"Offline Imitation from Observation via Primal Wasserstein State Occupancy Matching","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiYan289/PW-DICE","path":"PWDICE_continuous/NN.py","file_url":"https://github.com/KaiYan289/PW-DICE/blob/HEAD/PWDICE_continuous/NN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, KaiYan289/PW-DICE when it was checked","code_sha256":"cf5ce98955ab4534","code_sha256_prefix":"cf5ce98955ab4534","mcp_get_code":{"code_sha256":"cf5ce98955ab4534"}},{"arxiv_id":"2206.03023","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-i-ll-go-offline-goal-conditioned","title":"How Far I'll Go: Offline Goal-Conditioned Reinforcement Learning via $f$-Advantage Regression","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonma2016/gofar","path":"rl_modules/models.py","file_url":"https://github.com/jasonma2016/gofar/blob/HEAD/rl_modules/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 jasonma2016/smodice, and GitHub detected no licence in that repository when it was checked","code_sha256":"cf5ce98955ab4534","code_sha256_prefix":"cf5ce98955ab4534","mcp_get_code":{"code_sha256":"cf5ce98955ab4534"}},{"arxiv_id":"2205.14495","arxiv_id_is_arxiv":true,"paper":"/paper/task-agnostic-continual-reinforcement","title":"Task-Agnostic Continual Reinforcement Learning: Gaining Insights and Overcoming Challenges","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/replay-based-recurrent-rl","path":"code/misc/utils.py","file_url":"https://github.com/amazon-research/replay-based-recurrent-rl/blob/HEAD/code/misc/utils.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":"c96673bfd86f55b0","code_sha256_prefix":"c96673bfd86f55b0","mcp_get_code":{"code_sha256":"c96673bfd86f55b0"}},{"arxiv_id":"2202.02433","arxiv_id_is_arxiv":true,"paper":"/paper/smodice-versatile-offline-imitation-learning","title":"Versatile Offline Imitation from Observations and Examples via Regularized State-Occupancy Matching","date":"2022-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonma2016/smodice","path":"smodice_pytorch.py","file_url":"https://github.com/jasonma2016/smodice/blob/HEAD/smodice_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, jasonma2016/smodice when it was checked","code_sha256":"cf5ce98955ab4534","code_sha256_prefix":"cf5ce98955ab4534","mcp_get_code":{"code_sha256":"cf5ce98955ab4534"}},{"arxiv_id":"2007.14189","arxiv_id_is_arxiv":true,"paper":"/paper/trajgail-generating-urban-trajectories-using","title":"TrajGAIL: Generating Urban Vehicle Trajectories using Generative Adversarial Imitation Learning","date":"2020-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benchoi93/TrajGAIL","path":"models/gail/algo/gailrnn_pytorch.py","file_url":"https://github.com/benchoi93/TrajGAIL/blob/HEAD/models/gail/algo/gailrnn_pytorch.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":"dd3cd8c6570cec9d","code_sha256_prefix":"dd3cd8c6570cec9d","mcp_get_code":{"code_sha256":"dd3cd8c6570cec9d"}},{"arxiv_id":"2007.08202","arxiv_id_is_arxiv":true,"paper":"/paper/provably-good-batch-reinforcement-learning","title":"Provably Good Batch Reinforcement Learning Without Great Exploration","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoliucs/PQL","path":"BEAR.py","file_url":"https://github.com/yaoliucs/PQL/blob/HEAD/BEAR.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":"09fffc802ab0a363","code_sha256_prefix":"09fffc802ab0a363","mcp_get_code":{"code_sha256":"09fffc802ab0a363"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chamorajg/pl-dreamer","path":"planet.py","file_url":"https://github.com/chamorajg/pl-dreamer/blob/HEAD/planet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, chamorajg/pl-dreamer when it was checked","code_sha256":"094cf207447fa2a5","code_sha256_prefix":"094cf207447fa2a5","mcp_get_code":{"code_sha256":"094cf207447fa2a5"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmhuy0/SIM-RL","path":"Sources/algo/ppo.py","file_url":"https://github.com/hmhuy0/SIM-RL/blob/HEAD/Sources/algo/ppo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hmhuy0/SIM-RL when it was checked","code_sha256":"264c9e17d7dfe7eb","code_sha256_prefix":"264c9e17d7dfe7eb","mcp_get_code":{"code_sha256":"264c9e17d7dfe7eb"}}],"record_sha256":"47d7d9891052c6677ba9d1f89acec164493ebecd060a90249f6028e3337467bd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}