{"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/heuristic","entry":"heuristic","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":9,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":2,"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":3,"ran_draft_wrong":0,"ran_fixture":1,"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.10685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10685","title":"Beyond Task Performance: A Metric-Based Analysis of Sequential Cooperation in Heterogeneous Multi-Agent Destructive Foraging","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"amendb/CollaborationMetrics","path":"Algorithms/a_star2.py","file_url":"https://github.com/amendb/CollaborationMetrics/blob/HEAD/Algorithms/a_star2.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, amendb/CollaborationMetrics when it was checked","code_sha256":"f1161108aaeac133","code_sha256_prefix":"f1161108aaeac133","mcp_get_code":{"code_sha256":"f1161108aaeac133"}},{"arxiv_id":"2501.07343","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2501.07343","date":null,"month_inferred_from_arxiv_id":"2025-01","title_source":null,"repo":"hcr-lab/FaRe-CPP","path":"FaRe/path_generator.py","file_url":"https://github.com/hcr-lab/FaRe-CPP/blob/HEAD/FaRe/path_generator.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":"0b1fbc134a7709b8","code_sha256_prefix":"0b1fbc134a7709b8","mcp_get_code":{"code_sha256":"0b1fbc134a7709b8"}},{"arxiv_id":"2407.07086","arxiv_id_is_arxiv":true,"paper":"/paper/hypothetical-minds-scaffolding-theory-of-mind","title":"Hypothetical Minds: Scaffolding Theory of Mind for Multi-Agent Tasks with Large Language Models","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locross93/hypothetical-minds","path":"llm_plan/agent/action_funcs.py","file_url":"https://github.com/locross93/hypothetical-minds/blob/HEAD/llm_plan/agent/action_funcs.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":"03d1701bcc7f74f8","code_sha256_prefix":"03d1701bcc7f74f8","mcp_get_code":{"code_sha256":"03d1701bcc7f74f8"}},{"arxiv_id":"2307.05603","arxiv_id_is_arxiv":true,"paper":"/paper/can-you-improve-my-code-optimizing-programs","title":"Can You Improve My Code? Optimizing Programs with Local Search","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FatemehAB/POLIS","path":"highway_heuristic.py","file_url":"https://github.com/FatemehAB/POLIS/blob/HEAD/highway_heuristic.py","status":"ran","verification_level":1,"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, FatemehAB/POLIS when it was checked","code_sha256":"e65f499b671b5552","code_sha256_prefix":"e65f499b671b5552","mcp_get_code":{"code_sha256":"e65f499b671b5552"}},{"arxiv_id":"2212.03117","arxiv_id_is_arxiv":true,"paper":"/paper/q-pensieve-boosting-sample-efficiency-of","title":"Q-Pensieve: Boosting Sample Efficiency of Multi-Objective RL Through Memory Sharing of Q-Snapshots","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NYCU-RL-Bandits-Lab/Q-Pensieve","path":"environments/MO_lunar_lander.py","file_url":"https://github.com/NYCU-RL-Bandits-Lab/Q-Pensieve/blob/HEAD/environments/MO_lunar_lander.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":"858e421dc259e10b","code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"2209.13508","arxiv_id_is_arxiv":true,"paper":"/paper/motion-transformer-with-global-intention","title":"Motion Transformer with Global Intention Localization and Local Movement Refinement","date":"2022-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikeke19/safe-mult-rl","path":"envs/lunar_lander.py","file_url":"https://github.com/nikeke19/safe-mult-rl/blob/HEAD/envs/lunar_lander.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":"858e421dc259e10b","code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"2206.13326","arxiv_id_is_arxiv":true,"paper":"/paper/a-penalisation-method-for-batch-multi","title":"A penalisation method for batch multi-objective Bayesian optimisation with application in heat exchanger design","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apaleyes/hippo","path":"experiments/lunar_lander/lunar_lander.py","file_url":"https://github.com/apaleyes/hippo/blob/HEAD/experiments/lunar_lander/lunar_lander.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":"858e421dc259e10b","code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"1805.08010","arxiv_id_is_arxiv":true,"paper":"/paper/where-do-you-think-youre-going-inferring","title":"Where Do You Think You're Going?: Inferring Beliefs about Dynamics from Behavior","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rddy/isql","path":"lunar_lander.py","file_url":"https://github.com/rddy/isql/blob/HEAD/lunar_lander.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"750266fcc0999cc7","code_sha256_prefix":"750266fcc0999cc7","mcp_get_code":{"code_sha256":"750266fcc0999cc7"}},{"arxiv_id":"2023.emnlp-main.534","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.534","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PreferredAI/superposed-topics","path":"algo/reint.py","file_url":"https://github.com/PreferredAI/superposed-topics/blob/HEAD/algo/reint.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":"a11e0c055ad48b20","code_sha256_prefix":"a11e0c055ad48b20","mcp_get_code":{"code_sha256":"a11e0c055ad48b20"}},{"arxiv_id":"2022.emnlp-main.242","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.emnlp-main.242","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PreferredAI/ReIntNTM","path":"algo/normal.py","file_url":"https://github.com/PreferredAI/ReIntNTM/blob/HEAD/algo/normal.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":"a11e0c055ad48b20","code_sha256_prefix":"a11e0c055ad48b20","mcp_get_code":{"code_sha256":"a11e0c055ad48b20"}}],"record_sha256":"537998cc29db0f55cc9d13361dbda380fb2c7812859c576d2cb02b5a141273b9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}