{"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/intprod","entry":"intprod","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2403.12037","arxiv_id_is_arxiv":true,"paper":"/paper/minedreamer-learning-to-follow-instructions","title":"MineDreamer: Learning to Follow Instructions via Chain-of-Imagination for Simulated-World Control","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhoues/MineDreamer","path":"minedreamer/VPT/lib/misc.py","file_url":"https://github.com/Zhoues/MineDreamer/blob/HEAD/minedreamer/VPT/lib/misc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5234c0dfb707f813","code_sha256_prefix":"5234c0dfb707f813","mcp_get_code":{"code_sha256":"5234c0dfb707f813"}},{"arxiv_id":"2312.02405","arxiv_id_is_arxiv":true,"paper":"/paper/bedd-the-minerl-basalt-evaluation-and-1","title":"BEDD: The MineRL BASALT Evaluation and Demonstrations Dataset for Training and Benchmarking Agents that Solve Fuzzy Tasks","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minerllabs/basalt-benchmark","path":"basalt/vpt_lib/misc.py","file_url":"https://github.com/minerllabs/basalt-benchmark/blob/HEAD/basalt/vpt_lib/misc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5234c0dfb707f813","code_sha256_prefix":"5234c0dfb707f813","mcp_get_code":{"code_sha256":"5234c0dfb707f813"}},{"arxiv_id":"2308.00398","arxiv_id_is_arxiv":true,"paper":"/paper/driveadapter-breaking-the-coupling-barrier-of","title":"DriveAdapter: Breaking the Coupling Barrier of Perception and Planning in End-to-End Autonomous Driving","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/driveadapter","path":"roach/models/torch_util.py","file_url":"https://github.com/opendrivelab/driveadapter/blob/HEAD/roach/models/torch_util.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5234c0dfb707f813","code_sha256_prefix":"5234c0dfb707f813","mcp_get_code":{"code_sha256":"5234c0dfb707f813"}},{"arxiv_id":"2209.11553","arxiv_id_is_arxiv":true,"paper":"/paper/on-efficient-reinforcement-learning-for-full","title":"On Efficient Reinforcement Learning for Full-length Game of StarCraft II","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuruoze/hiernet-sc2","path":"lib/adversary.py","file_url":"https://github.com/liuruoze/hiernet-sc2/blob/HEAD/lib/adversary.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":"fe097265b3baf872","code_sha256_prefix":"fe097265b3baf872","mcp_get_code":{"code_sha256":"fe097265b3baf872"}},{"arxiv_id":"1806.04067","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-mechanism-design-learning-to-promote","title":"Adaptive Mechanism Design: Learning to Promote Cooperation","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longtermrisk/marltoolbox","path":"marltoolbox/algos/adaptive_mechanism_design/planning_agent.py","file_url":"https://github.com/longtermrisk/marltoolbox/blob/HEAD/marltoolbox/algos/adaptive_mechanism_design/planning_agent.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":"fe097265b3baf872","code_sha256_prefix":"fe097265b3baf872","mcp_get_code":{"code_sha256":"fe097265b3baf872"}}],"record_sha256":"56a567e9aaab106015841e7566c150fccb3a5eacfc8f0334c1da3f718e385fe6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}