{"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/greedy","entry":"greedy","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":17,"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":17,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":0,"unverified":13},"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":"2607.16741","paper":"/paper/arxiv-2607-16741","title":"The Anatomy of a Truth Direction Knowledge-Dependent Dimensionality, a Relational Law, and a Convergent Category Geometry in Small Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Francesco-Marhel/TruthProbe","path":"src/behav_check.py","file_url":"https://github.com/Francesco-Marhel/TruthProbe/blob/HEAD/src/behav_check.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":"f3690ae1dbc257fb","mcp_get_code":{"code_sha256":"f3690ae1dbc257fb"}},{"arxiv_id":"2506.07972","paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"egraph_extraction/baseline/greedy_baseline.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/egraph_extraction/baseline/greedy_baseline.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":"5bd4fd26f4dc8ebb","mcp_get_code":{"code_sha256":"5bd4fd26f4dc8ebb"}},{"arxiv_id":"2501.03675","paper":"/paper/smir-efficient-synthetic-data-pipeline-to","title":"SMIR: Efficient Synthetic Data Pipeline To Improve Multi-Image Reasoning","date":"2025-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"togethercomputer/smir","path":"pipelines/utils.py","file_url":"https://github.com/togethercomputer/smir/blob/HEAD/pipelines/utils.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":"d5c550be889398f8","mcp_get_code":{"code_sha256":"d5c550be889398f8"}},{"arxiv_id":"2406.13909","paper":"/paper/beyond-optimism-exploration-with-partially","title":"Beyond Optimism: Exploration With Partially Observable Rewards","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AmiiThinks/mon_mdp_neurips24","path":"src/actor.py","file_url":"https://github.com/AmiiThinks/mon_mdp_neurips24/blob/HEAD/src/actor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"0a417dbf6ba084b3","mcp_get_code":{"code_sha256":"0a417dbf6ba084b3"}},{"arxiv_id":"2405.17544","paper":"/paper/towards-human-ai-complementarity-with","title":"Towards Human-AI Complementarity with Prediction Sets","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Networks-Learning/towards-human-ai-complementarity-predictions-sets","path":"utils/general.py","file_url":"https://github.com/Networks-Learning/towards-human-ai-complementarity-predictions-sets/blob/HEAD/utils/general.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d70a4dec5d5c2758","mcp_get_code":{"code_sha256":"d70a4dec5d5c2758"}},{"arxiv_id":"2303.11101","paper":"/paper/coreset-sampling-from-open-set-for-fine","title":"Coreset Sampling from Open-Set for Fine-Grained Self-Supervised Learning","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungnyun/openssl-simcore","path":"util/sampling.py","file_url":"https://github.com/sungnyun/openssl-simcore/blob/HEAD/util/sampling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a573ac30f09aa8cc","mcp_get_code":{"code_sha256":"a573ac30f09aa8cc"}},{"arxiv_id":"2301.10816","paper":"/paper/into-the-unknown-assigning-reviewers-to","title":"Into the Unknown: Assigning Reviewers to Papers with Uncertain Affinities","date":null,"month_inferred_from_arxiv_id":"2023-01","title_source":"archive","repo":"justinpayan/rau","path":"baselines.py","file_url":"https://github.com/justinpayan/rau/blob/HEAD/baselines.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":"a43c6b7ef2fb981c","mcp_get_code":{"code_sha256":"a43c6b7ef2fb981c"}},{"arxiv_id":"2211.02759","paper":"/paper/diversity-based-deep-reinforcement-learning","title":"Diversity-based Deep Reinforcement Learning Towards Multidimensional Difficulty for Fighting Game AI","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emily-halina/brisket","path":"gymexe.py","file_url":"https://github.com/emily-halina/brisket/blob/HEAD/gymexe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4428b33a35a17bdf","mcp_get_code":{"code_sha256":"4428b33a35a17bdf"}},{"arxiv_id":"2108.02126","paper":"/paper/i-will-have-order-optimizing-orders-for-fair","title":"I Will Have Order! Optimizing Orders for Fair Reviewer Assignment","date":null,"month_inferred_from_arxiv_id":"2021-08","title_source":"archive","repo":"justinpayan/ReviewerAssignmentCode","path":"greedy_reviewer_round_robin.py","file_url":"https://github.com/justinpayan/ReviewerAssignmentCode/blob/HEAD/greedy_reviewer_round_robin.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"073ef70ee3d1632c","mcp_get_code":{"code_sha256":"073ef70ee3d1632c"}},{"arxiv_id":"2107.02784","paper":"/paper/data-driven-reduced-order-modeling-of","title":"Data-driven reduced order modeling of environmental hydrodynamics using deep autoencoders and neural ODEs","date":"2021-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erdc/pynirom","path":"pynirom/rbf/greedy.py","file_url":"https://github.com/erdc/pynirom/blob/HEAD/pynirom/rbf/greedy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"163ff6791fabf8ca","mcp_get_code":{"code_sha256":"163ff6791fabf8ca"}},{"arxiv_id":"1909.06296","paper":"/paper/bayesian-parameter-estimation-using","title":"Bayesian parameter estimation using conditional variational autoencoders for gravitational-wave astronomy","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hagabbar/VItamin","path":"plotsky.py","file_url":"https://github.com/hagabbar/VItamin/blob/HEAD/plotsky.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d17a35ed5fdd68b","mcp_get_code":{"code_sha256":"2d17a35ed5fdd68b"}},{"arxiv_id":"1907.11625","paper":"/paper/learning-policies-for-social-network","title":"Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kage08/graph_sample_rl","path":"utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"249aca583ea3bfdd","mcp_get_code":{"code_sha256":"249aca583ea3bfdd"}},{"arxiv_id":"1907.06173","paper":"/paper/the-fast-algorithm-for-submodular","title":"The FAST Algorithm for Submodular Maximization","date":"2019-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luccote/msm-primal-dual","path":"src/submodular.py","file_url":"https://github.com/luccote/msm-primal-dual/blob/HEAD/src/submodular.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f76560166d44e3a3","mcp_get_code":{"code_sha256":"f76560166d44e3a3"}},{"arxiv_id":"1904.11439","paper":"/paper/faster-and-more-accurate-learning-with-meta","title":"META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation","date":"2019-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PwnerHarry/META","path":"greedy.py","file_url":"https://github.com/PwnerHarry/META/blob/HEAD/greedy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a96948f392f2d15","mcp_get_code":{"code_sha256":"5a96948f392f2d15"}},{"arxiv_id":"aaai_26472","paper":null,"title":"arXiv:aaai_26472","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhwang1990/code-rrm-release","path":"data-summarization/data_summarization_HS_RRM.py","file_url":"https://github.com/yhwang1990/code-rrm-release/blob/HEAD/data-summarization/data_summarization_HS_RRM.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":"130eee0d98cd9ff9","mcp_get_code":{"code_sha256":"130eee0d98cd9ff9"}},{"arxiv_id":"aaai_26472","paper":null,"title":"arXiv:aaai_26472","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhwang1990/code-rrm-release","path":"max-cover/max_cover_HS_RRM.py","file_url":"https://github.com/yhwang1990/code-rrm-release/blob/HEAD/max-cover/max_cover_HS_RRM.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":"12428e0034796efa","mcp_get_code":{"code_sha256":"12428e0034796efa"}},{"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":"bd9d862ebfcc77cc","mcp_get_code":{"code_sha256":"bd9d862ebfcc77cc"}},{"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":"bd9d862ebfcc77cc","mcp_get_code":{"code_sha256":"bd9d862ebfcc77cc"}}]}