{"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/categorical-entropy","entry":"categorical_entropy","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":5,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2606.16535","paper":"/paper/arxiv-2606-16535","title":"Assessing Reliability of Symbol Detection in Concept Bottleneck Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Fuminides/cbm_sanity","path":"src/symbol_sanity/multihead.py","file_url":"https://github.com/Fuminides/cbm_sanity/blob/HEAD/src/symbol_sanity/multihead.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b292d0b5fb66705e","mcp_get_code":{"code_sha256":"b292d0b5fb66705e"}},{"arxiv_id":"2410.02511","paper":"/paper/choices-are-more-important-than-efforts-llm","title":"Choices are More Important than Efforts: LLM Enables Efficient Multi-Agent Exploration","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hijkzzz/pymarl2","path":"src/components/action_selectors.py","file_url":"https://github.com/hijkzzz/pymarl2/blob/HEAD/src/components/action_selectors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6008b0eb92d8067c","mcp_get_code":{"code_sha256":"6008b0eb92d8067c"}},{"arxiv_id":"2405.16854","paper":"/paper/knowing-what-not-to-do-leverage-language","title":"Knowing What Not to Do: Leverage Language Model Insights for Action Space Pruning in Multi-agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"liuzhihao2022/espark","path":"Baseline/MARL_algorithm/components/action_selectors.py","file_url":"https://github.com/liuzhihao2022/espark/blob/HEAD/Baseline/MARL_algorithm/components/action_selectors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6008b0eb92d8067c","mcp_get_code":{"code_sha256":"6008b0eb92d8067c"}},{"arxiv_id":"2207.05631","paper":"/paper/dgpo-discovering-multiple-strategies-with","title":"DGPO: Discovering Multiple Strategies with Diversity-Guided Policy Optimization","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WentseChen/Soft-QMIX","path":"src/components/action_selectors.py","file_url":"https://github.com/WentseChen/Soft-QMIX/blob/HEAD/src/components/action_selectors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"6008b0eb92d8067c","mcp_get_code":{"code_sha256":"6008b0eb92d8067c"}},{"arxiv_id":"2008.01062","paper":"/paper/qplex-duplex-dueling-multi-agent-q-learning","title":"QPLEX: Duplex Dueling Multi-Agent Q-Learning","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somnathhazra/uncertainties_marl","path":"src/components/action_selectors.py","file_url":"https://github.com/somnathhazra/uncertainties_marl/blob/HEAD/src/components/action_selectors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6008b0eb92d8067c","mcp_get_code":{"code_sha256":"6008b0eb92d8067c"}}]}