{"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/heuristic","entry":"heuristic","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":10,"n_papers_ran":4,"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":4,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":3},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f1161108aaeac133","mcp_get_code":{"code_sha256":"f1161108aaeac133"}},{"arxiv_id":"2501.07343","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,"code_sha256_prefix":"0b1fbc134a7709b8","mcp_get_code":{"code_sha256":"0b1fbc134a7709b8"}},{"arxiv_id":"2407.07086","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"03d1701bcc7f74f8","mcp_get_code":{"code_sha256":"03d1701bcc7f74f8"}},{"arxiv_id":"2307.05603","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,"code_sha256_prefix":"e65f499b671b5552","mcp_get_code":{"code_sha256":"e65f499b671b5552"}},{"arxiv_id":"2212.03117","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"2209.13508","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"2206.13326","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"858e421dc259e10b","mcp_get_code":{"code_sha256":"858e421dc259e10b"}},{"arxiv_id":"1805.08010","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,"code_sha256_prefix":"750266fcc0999cc7","mcp_get_code":{"code_sha256":"750266fcc0999cc7"}},{"arxiv_id":"2023.emnlp-main.534","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a11e0c055ad48b20","mcp_get_code":{"code_sha256":"a11e0c055ad48b20"}},{"arxiv_id":"2022.emnlp-main.242","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a11e0c055ad48b20","mcp_get_code":{"code_sha256":"a11e0c055ad48b20"}}]}