{"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/generate-random-color","entry":"generate_random_color","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":3,"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":3,"n_samples_ran":2,"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":2,"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":"2605.15138","paper":"/paper/arxiv-2605-15138","title":"Quantization-Permanent Unlearning via Circuit Attribution","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hannamw/EAP-IG","path":"src/eap/visualization.py","file_url":"https://github.com/hannamw/EAP-IG/blob/HEAD/src/eap/visualization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eecfb19bf7c5823f","mcp_get_code":{"code_sha256":"eecfb19bf7c5823f"}},{"arxiv_id":"2502.11196","paper":"/paper/how-do-llms-acquire-new-knowledge-a-knowledge","title":"How Do LLMs Acquire New Knowledge? A Knowledge Circuits Perspective on Continual Pre-Training","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowledgecircuits","path":"acdc/acdc_graphics.py","file_url":"https://github.com/zjunlp/knowledgecircuits/blob/HEAD/acdc/acdc_graphics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f89c1453cf54061","mcp_get_code":{"code_sha256":"6f89c1453cf54061"}},{"arxiv_id":"2403.19647","paper":"/paper/sparse-feature-circuits-discovering-and","title":"Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannamw/eap-ig","path":"src/eap/visualization.py","file_url":"https://github.com/hannamw/eap-ig/blob/HEAD/src/eap/visualization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eecfb19bf7c5823f","mcp_get_code":{"code_sha256":"eecfb19bf7c5823f"}},{"arxiv_id":"2310.10348","paper":"/paper/attribution-patching-outperforms-automated","title":"Attribution Patching Outperforms Automated Circuit Discovery","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaquib111/acdcpp","path":"utils/graphics_utils.py","file_url":"https://github.com/aaquib111/acdcpp/blob/HEAD/utils/graphics_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4891a91f0e41a7ca","mcp_get_code":{"code_sha256":"4891a91f0e41a7ca"}},{"arxiv_id":"2304.14997","paper":"/paper/towards-automated-circuit-discovery-for-1","title":"Towards Automated Circuit Discovery for Mechanistic Interpretability","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArthurConmy/Automatic-Circuit-Discovery","path":"acdc/acdc_graphics.py","file_url":"https://github.com/ArthurConmy/Automatic-Circuit-Discovery/blob/HEAD/acdc/acdc_graphics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f89c1453cf54061","mcp_get_code":{"code_sha256":"6f89c1453cf54061"}}]}