{"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/process-action","entry":"process_action","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":4,"n_papers_ran_no_instrument_failure":4,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2304.08490","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-generation-of-audio-from-video","title":"Conditional Generation of Audio from Video via Foley Analogies","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XYPB/CondFoleyGen","path":"audio_type_analysis.py","file_url":"https://github.com/XYPB/CondFoleyGen/blob/HEAD/audio_type_analysis.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":"3f48d259e25d02bc","code_sha256_prefix":"3f48d259e25d02bc","mcp_get_code":{"code_sha256":"3f48d259e25d02bc"}},{"arxiv_id":"2206.14349","arxiv_id_is_arxiv":true,"paper":"/paper/fleet-dagger-interactive-robot-fleet-learning","title":"Fleet-DAgger: Interactive Robot Fleet Learning with Scalable Human Supervision","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berkeleyautomation/ifl_benchmark","path":"env/navigation.py","file_url":"https://github.com/berkeleyautomation/ifl_benchmark/blob/HEAD/env/navigation.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":"056564dc1eae1a84","code_sha256_prefix":"056564dc1eae1a84","mcp_get_code":{"code_sha256":"056564dc1eae1a84"}},{"arxiv_id":"1910.07207","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-for-discrete-action","title":"Soft Actor-Critic for Discrete Action Settings","date":"2019-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e5cbade112f15d84","code_sha256_prefix":"e5cbade112f15d84","mcp_get_code":{"code_sha256":"e5cbade112f15d84"}},{"arxiv_id":"1905.13402","arxiv_id_is_arxiv":true,"paper":"/paper/extending-deep-model-predictive-control-with","title":"Safety Augmented Value Estimation from Demonstrations (SAVED): Safe Deep Model-Based RL for Sparse Cost Robotic Tasks","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harryzhangOG/salved","path":"dmbrl/env/pointbot.py","file_url":"https://github.com/harryzhangOG/salved/blob/HEAD/dmbrl/env/pointbot.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":"e403f0ed1d843902","code_sha256_prefix":"e403f0ed1d843902","mcp_get_code":{"code_sha256":"e403f0ed1d843902"}},{"arxiv_id":"1904.09981","arxiv_id_is_arxiv":true,"paper":"/paper/graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphNAS/GraphNAS-simple","path":"graphnas/utils/model_utils.py","file_url":"https://github.com/GraphNAS/GraphNAS-simple/blob/HEAD/graphnas/utils/model_utils.py","status":"ran","verification_level":1,"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":"85f398d50a188593","code_sha256_prefix":"85f398d50a188593","mcp_get_code":{"code_sha256":"85f398d50a188593"}},{"arxiv_id":"1812.05905","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ac-93/soft-actor-critic","path":"array_observation/sac_discrete/sac.py","file_url":"https://github.com/ac-93/soft-actor-critic/blob/HEAD/array_observation/sac_discrete/sac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5cbade112f15d84","code_sha256_prefix":"e5cbade112f15d84","mcp_get_code":{"code_sha256":"e5cbade112f15d84"}}],"record_sha256":"16303eeac1e4a6f041c8305843c4a9d53890f64bea9cbd584dc205deefacb642","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}