{"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/lighten-color","entry":"lighten_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":9,"n_papers_ran":9,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":0},"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.14260","paper":"/paper/arxiv-2605-14260","title":"On the Burden of Achieving Fairness in Conformal Prediction","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"GreenPenguin001/group-cp-tradeoffs","path":"synthetic_sim/src/synthcp/plots.py","file_url":"https://github.com/GreenPenguin001/group-cp-tradeoffs/blob/HEAD/synthetic_sim/src/synthcp/plots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"839e4f589b75b194","mcp_get_code":{"code_sha256":"839e4f589b75b194"}},{"arxiv_id":"2408.15204","paper":"/paper/can-unconfident-llm-annotations-be-used-for","title":"Can Unconfident LLM Annotations Be Used for Confident Conclusions?","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kristinagligoric/confidence-driven-inference","path":"code/plotting_utils.py","file_url":"https://github.com/kristinagligoric/confidence-driven-inference/blob/HEAD/code/plotting_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79562521f7728505","mcp_get_code":{"code_sha256":"79562521f7728505"}},{"arxiv_id":"2407.11867","paper":"/paper/single-layer-single-gradient-unlearning","title":"Unlearning Targeted Information via Single Layer Unlearning Gradient","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSIPlab/SLUG","path":"src/utils.py","file_url":"https://github.com/CSIPlab/SLUG/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79562521f7728505","mcp_get_code":{"code_sha256":"79562521f7728505"}},{"arxiv_id":"2403.03194","paper":"/paper/magid-an-automated-pipeline-for-generating","title":"MAGID: An Automated Pipeline for Generating Synthetic Multi-modal Datasets","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/MAGID","path":"src/multimodal_dataset/graphics/chat_vis.py","file_url":"https://github.com/amazon-science/MAGID/blob/HEAD/src/multimodal_dataset/graphics/chat_vis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6ab6eeb90e811295","mcp_get_code":{"code_sha256":"6ab6eeb90e811295"}},{"arxiv_id":"2305.15269","paper":"/paper/testing-the-general-deductive-reasoning-1","title":"Testing the General Deductive Reasoning Capacity of Large Language Models Using OOD Examples","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"94b21ef3a27e0a02","mcp_get_code":{"code_sha256":"94b21ef3a27e0a02"}},{"arxiv_id":"2301.08517","paper":"/paper/cohere-privacy-management-in-large-scale","title":"Cohere: Managing Differential Privacy in Large Scale Systems","date":null,"month_inferred_from_arxiv_id":"2023-01","title_source":"archive","repo":"pps-lab/cohere","path":"doe-suite-config/does_etl_custom/plots/utility_plot_sp.py","file_url":"https://github.com/pps-lab/cohere/blob/HEAD/doe-suite-config/does_etl_custom/plots/utility_plot_sp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"79562521f7728505","mcp_get_code":{"code_sha256":"79562521f7728505"}},{"arxiv_id":"2210.01240","paper":"/paper/language-models-are-greedy-reasoners-a","title":"Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asaparov/prontoqa","path":"analyze_results.py","file_url":"https://github.com/asaparov/prontoqa/blob/HEAD/analyze_results.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"94b21ef3a27e0a02","mcp_get_code":{"code_sha256":"94b21ef3a27e0a02"}},{"arxiv_id":"2001.04032","paper":"/paper/popcorn-partially-observed-prediction","title":"POPCORN: Partially Observed Prediction COnstrained ReiNforcement Learning","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtak/POPCORN-POMDP","path":"src/tiger_gmm_results.py","file_url":"https://github.com/dtak/POPCORN-POMDP/blob/HEAD/src/tiger_gmm_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79562521f7728505","mcp_get_code":{"code_sha256":"79562521f7728505"}},{"arxiv_id":"ijcai2025_0850","paper":null,"title":"arXiv:ijcai2025_0850","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hongyi-Lyu-MQ/SULI","path":"utils/utils.py","file_url":"https://github.com/Hongyi-Lyu-MQ/SULI/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79562521f7728505","mcp_get_code":{"code_sha256":"79562521f7728505"}}]}