{"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/fc","entry":"fc","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":16,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":1,"ran_fixture":0,"ran":3,"unverified":10},"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":"2409.17411","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-semantic-clustering-in-deep","title":"Exploring Semantic Clustering in Deep Reinforcement Learning for Video Games","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ualiangzhang/semantic_rl","path":"baselines/common/spolicies.py","file_url":"https://github.com/ualiangzhang/semantic_rl/blob/HEAD/baselines/common/spolicies.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b8dee118869a28b","code_sha256_prefix":"7b8dee118869a28b","mcp_get_code":{"code_sha256":"7b8dee118869a28b"}},{"arxiv_id":"2406.00120","arxiv_id_is_arxiv":true,"paper":"/paper/reward-machines-for-deep-rl-in-noisy-and","title":"Reward Machines for Deep RL in Noisy and Uncertain Environments","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrewli77/reward-machines-noisy-environments","path":"src/policy_network.py","file_url":"https://github.com/andrewli77/reward-machines-noisy-environments/blob/HEAD/src/policy_network.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":"08eabb75de3ea8cc","code_sha256_prefix":"08eabb75de3ea8cc","mcp_get_code":{"code_sha256":"08eabb75de3ea8cc"}},{"arxiv_id":"2111.08176","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-to-fine-animal-pose-and-shape","title":"Coarse-to-fine Animal Pose and Shape Estimation","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaneyddtt/coarse-to-fine-3d-animal","path":"util/net_blocks.py","file_url":"https://github.com/chaneyddtt/coarse-to-fine-3d-animal/blob/HEAD/util/net_blocks.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":"483c5935ef25b6f6","code_sha256_prefix":"483c5935ef25b6f6","mcp_get_code":{"code_sha256":"483c5935ef25b6f6"}},{"arxiv_id":"2105.02961","arxiv_id_is_arxiv":true,"paper":"/paper/uvstyle-net-unsupervised-few-shot-learning-of","title":"UVStyle-Net: Unsupervised Few-shot Learning of 3D Style Similarity Measure for B-Reps","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AutodeskAILab/UVStyle-Net","path":"networks/encoder.py","file_url":"https://github.com/AutodeskAILab/UVStyle-Net/blob/HEAD/networks/encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, AutodeskAILab/UVStyle-Net (NOASSERTION)","code_sha256":"07fa345f292e7def","code_sha256_prefix":"07fa345f292e7def","mcp_get_code":{"code_sha256":"07fa345f292e7def"}},{"arxiv_id":"2103.12300","arxiv_id_is_arxiv":true,"paper":"/paper/drop-bottleneck-learning-discrete-compressed-1","title":"Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Exploration","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaekyeom/drop-bottleneck","path":"rlb/rlb_model.py","file_url":"https://github.com/jaekyeom/drop-bottleneck/blob/HEAD/rlb/rlb_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9770bed4caf46f77","code_sha256_prefix":"9770bed4caf46f77","mcp_get_code":{"code_sha256":"9770bed4caf46f77"}},{"arxiv_id":"2007.11110","arxiv_id_is_arxiv":true,"paper":"/paper/who-left-the-dogs-out-3d-animal","title":"Who Left the Dogs Out? 3D Animal Reconstruction with Expectation Maximization in the Loop","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benjiebob/WLDO","path":"global_utils/nnutils/net_blocks.py","file_url":"https://github.com/benjiebob/WLDO/blob/HEAD/global_utils/nnutils/net_blocks.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":"483c5935ef25b6f6","code_sha256_prefix":"483c5935ef25b6f6","mcp_get_code":{"code_sha256":"483c5935ef25b6f6"}},{"arxiv_id":"2006.07500","arxiv_id_is_arxiv":true,"paper":"/paper/domain-generalization-using-causal-matching-1","title":"Domain Generalization using Causal Matching","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/masf","path":"masf_func.py","file_url":"https://github.com/biomedia-mira/masf/blob/HEAD/masf_func.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eac7e24272801635","code_sha256_prefix":"eac7e24272801635","mcp_get_code":{"code_sha256":"eac7e24272801635"}},{"arxiv_id":"2004.01339","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-reinforcement-learning-for-2","title":"Multi-agent Reinforcement Learning for Networked System Control","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cts198859/deeprl_network","path":"agents/models.py","file_url":"https://github.com/cts198859/deeprl_network/blob/HEAD/agents/models.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, cts198859/deeprl_network when it was checked","code_sha256":"2e3728ff64410ef8","code_sha256_prefix":"2e3728ff64410ef8","mcp_get_code":{"code_sha256":"2e3728ff64410ef8"}},{"arxiv_id":"2001.03415","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-interactions-modeling-with-1","title":"Multi-Agent Interactions Modeling with Correlated Policies","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apexrl/CoDAIL","path":"multi-agent-irl/irl/mack/kfac_discriminator_codail.py","file_url":"https://github.com/apexrl/CoDAIL/blob/HEAD/multi-agent-irl/irl/mack/kfac_discriminator_codail.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a7b574670cffc86","code_sha256_prefix":"6a7b574670cffc86","mcp_get_code":{"code_sha256":"6a7b574670cffc86"}},{"arxiv_id":"1908.07201","arxiv_id_is_arxiv":true,"paper":"/paper/three-d-safari-learning-to-estimate-zebra","title":"Three-D Safari: Learning to Estimate Zebra Pose, Shape, and Texture from Images \"In the Wild\"","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silviazuffi/smalst","path":"nnutils/net_blocks.py","file_url":"https://github.com/silviazuffi/smalst/blob/HEAD/nnutils/net_blocks.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":"483c5935ef25b6f6","code_sha256_prefix":"483c5935ef25b6f6","mcp_get_code":{"code_sha256":"483c5935ef25b6f6"}},{"arxiv_id":"1906.06725","arxiv_id_is_arxiv":true,"paper":"/paper/persuasion-for-good-towards-a-personalized","title":"Persuasion for Good: Towards a Personalized Persuasive Dialogue System for Social Good","date":"2019-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ohyj1002/persuasionforgood","path":"classifier/charModel/encoder.py","file_url":"https://github.com/ohyj1002/persuasionforgood/blob/HEAD/classifier/charModel/encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8884096206ead8a","code_sha256_prefix":"e8884096206ead8a","mcp_get_code":{"code_sha256":"e8884096206ead8a"}},{"arxiv_id":"1905.08171","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-by-augmented","title":"Semi-Supervised Learning by Augmented Distribution Alignment","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinenergy/adanet","path":"convlarge/layers.py","file_url":"https://github.com/qinenergy/adanet/blob/HEAD/convlarge/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"202cb9fdec6cb50e","code_sha256_prefix":"202cb9fdec6cb50e","mcp_get_code":{"code_sha256":"202cb9fdec6cb50e"}},{"arxiv_id":"1805.05553","arxiv_id_is_arxiv":true,"paper":"/paper/on-learning-associations-of-faces-and-voices","title":"On Learning Associations of Faces and Voices","date":"2018-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changil/facevoice","path":"facevoice.py","file_url":"https://github.com/changil/facevoice/blob/HEAD/facevoice.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"041d099ede5f732f","code_sha256_prefix":"041d099ede5f732f","mcp_get_code":{"code_sha256":"041d099ede5f732f"}},{"arxiv_id":"1711.00937","arxiv_id_is_arxiv":true,"paper":"/paper/neural-discrete-representation-learning","title":"Neural Discrete Representation Learning","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjlolo/vae-audio","path":"model/model.py","file_url":"https://github.com/yjlolo/vae-audio/blob/HEAD/model/model.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":"f2450ca8951604d7","code_sha256_prefix":"f2450ca8951604d7","mcp_get_code":{"code_sha256":"f2450ca8951604d7"}},{"arxiv_id":"1710.07300","arxiv_id_is_arxiv":true,"paper":"/paper/figureqa-an-annotated-figure-dataset-for","title":"FigureQA: An Annotated Figure Dataset for Visual Reasoning","date":"2017-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vmichals/FigureQA-baseline","path":"models/ops.py","file_url":"https://github.com/vmichals/FigureQA-baseline/blob/HEAD/models/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, vmichals/FigureQA-baseline, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"d2417e6b89c71bc5","code_sha256_prefix":"d2417e6b89c71bc5","mcp_get_code":{"code_sha256":"d2417e6b89c71bc5"}},{"arxiv_id":"1312.5602","arxiv_id_is_arxiv":true,"paper":"/paper/playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alfredvc/paac","path":"networks.py","file_url":"https://github.com/alfredvc/paac/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, alfredvc/paac (NOASSERTION)","code_sha256":"11c5727aaabe378a","code_sha256_prefix":"11c5727aaabe378a","mcp_get_code":{"code_sha256":"11c5727aaabe378a"}}],"record_sha256":"e6103a635e1b1b321358e462566f71775b6dd68b004ceffc9cf69ec65b987ff2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}