{"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/categorical-sample","entry":"categorical_sample","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":5,"n_papers_ran":2,"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":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"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":"2602.03778","paper":"/paper/arxiv-2602-03778","title":"Reward Redistribution for CVaR MDPs using a Bellman Operator on L-infinity","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"amuni3/StaticCVaR-DP","path":"environments/cliffwalk.py","file_url":"https://github.com/amuni3/StaticCVaR-DP/blob/HEAD/environments/cliffwalk.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ea6842507f1496f","mcp_get_code":{"code_sha256":"7ea6842507f1496f"}},{"arxiv_id":"2112.01506","paper":"/paper/sample-complexity-of-robust-reinforcement","title":"Sample Complexity of Robust Reinforcement Learning with a Generative Model","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kishanpb/RobustRL","path":"frozen_lake_robustvi.py","file_url":"https://github.com/kishanpb/RobustRL/blob/HEAD/frozen_lake_robustvi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"059284287b6033da","mcp_get_code":{"code_sha256":"059284287b6033da"}},{"arxiv_id":"1904.02632","paper":"/paper/a-learned-representation-for-scalable-vector","title":"A Learned Representation for Scalable Vector Graphics","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/magenta","path":"magenta/contrib/seq2seq.py","file_url":"https://github.com/tensorflow/magenta/blob/HEAD/magenta/contrib/seq2seq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a2c9cba2b7f47fee","mcp_get_code":{"code_sha256":"a2c9cba2b7f47fee"}},{"arxiv_id":"1804.09399","paper":"/paper/convolutional-generative-adversarial-networks","title":"Convolutional Generative Adversarial Networks with Binary Neurons for Polyphonic Music Generation","date":"2018-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucylow/Stochastic_SoundCloud","path":"contrib/seq2seq.py","file_url":"https://github.com/lucylow/Stochastic_SoundCloud/blob/HEAD/contrib/seq2seq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2c9cba2b7f47fee","mcp_get_code":{"code_sha256":"a2c9cba2b7f47fee"}},{"arxiv_id":"1706.02275","paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chan1998/MAAC","path":"algorithms/attention_sac.py","file_url":"https://github.com/Chan1998/MAAC/blob/HEAD/algorithms/attention_sac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"8a12d52820205fa8","mcp_get_code":{"code_sha256":"8a12d52820205fa8"}}]}