{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/compute-auc","entry":"compute_auc","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":9,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2604.14602","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14602","title":"CausalDetox: Causal Head Selection and Intervention for Language Model Detoxification","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"unitaryai/detoxify","path":"model_eval/utils.py","file_url":"https://github.com/unitaryai/detoxify/blob/HEAD/model_eval/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e7535087b00d38f","code_sha256_prefix":"2e7535087b00d38f","mcp_get_code":{"code_sha256":"2e7535087b00d38f"}},{"arxiv_id":"2604.07615","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-07615","title":"ADAG: Automatically Describing Attribution Graphs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"TransluceAI/circuits","path":"circuits/analysis/score_features.py","file_url":"https://github.com/TransluceAI/circuits/blob/HEAD/circuits/analysis/score_features.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TransluceAI/circuits when it was checked","code_sha256":"597e394b194e3552","code_sha256_prefix":"597e394b194e3552","mcp_get_code":{"code_sha256":"597e394b194e3552"}},{"arxiv_id":"2412.16156","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-representation-from-personalized","title":"Personalized Representation from Personalized Generation","date":"2024-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssundaram21/personalized-rep","path":"downstream/classification.py","file_url":"https://github.com/ssundaram21/personalized-rep/blob/HEAD/downstream/classification.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52a4e7b1ef28e2dd","code_sha256_prefix":"52a4e7b1ef28e2dd","mcp_get_code":{"code_sha256":"52a4e7b1ef28e2dd"}},{"arxiv_id":"2408.03195","arxiv_id_is_arxiv":true,"paper":"/paper/2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JasonZhujp/RELIEF","path":"graph_level/base.py","file_url":"https://github.com/JasonZhujp/RELIEF/blob/HEAD/graph_level/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JasonZhujp/RELIEF when it was checked","code_sha256":"7704b623591b1777","code_sha256_prefix":"7704b623591b1777","mcp_get_code":{"code_sha256":"7704b623591b1777"}},{"arxiv_id":"2408.00992","arxiv_id_is_arxiv":true,"paper":"/paper/2408-00992","title":"Fairness in Large Language Models in Three Hours","date":"2024-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavinwong/fairness-in-large-language-models","path":"definitions/encoder_decoder/extrinsic_bias/counterfactual_fairness/counterfactual_auc.py","file_url":"https://github.com/lavinwong/fairness-in-large-language-models/blob/HEAD/definitions/encoder_decoder/extrinsic_bias/counterfactual_fairness/counterfactual_auc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lavinwong/fairness-in-large-language-models when it was checked","code_sha256":"f24368ab6cac8513","code_sha256_prefix":"f24368ab6cac8513","mcp_get_code":{"code_sha256":"f24368ab6cac8513"}},{"arxiv_id":"2406.17975","arxiv_id_is_arxiv":true,"paper":"/paper/inherent-challenges-of-post-hoc-membership","title":"SoK: Membership Inference Attacks on LLMs are Rushing Nowhere (and How to Fix It)","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/mia_llms_benchmark","path":"attacks/probe.py","file_url":"https://github.com/computationalprivacy/mia_llms_benchmark/blob/HEAD/attacks/probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, computationalprivacy/mia_llms_benchmark when it was checked","code_sha256":"494b6dd4d66449a8","code_sha256_prefix":"494b6dd4d66449a8","mcp_get_code":{"code_sha256":"494b6dd4d66449a8"}},{"arxiv_id":"2402.10010","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-signal-detectability-in-learning","title":"Enhancing signal detectability in learning-based CT reconstruction with a model observer inspired loss function","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-lantz/ct_recon_sigpro","path":"includes/auc.py","file_url":"https://github.com/m-lantz/ct_recon_sigpro/blob/HEAD/includes/auc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94a733c2e41b2f13","code_sha256_prefix":"94a733c2e41b2f13","mcp_get_code":{"code_sha256":"94a733c2e41b2f13"}},{"arxiv_id":"2304.03935","arxiv_id_is_arxiv":true,"paper":"/paper/last-layer-fairness-fine-tuning-is-simple-and","title":"Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networks","date":"2023-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modar7/the_fairness_stitch","path":"src/utils_abroca.py","file_url":"https://github.com/modar7/the_fairness_stitch/blob/HEAD/src/utils_abroca.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f34aff34be2461e9","code_sha256_prefix":"f34aff34be2461e9","mcp_get_code":{"code_sha256":"f34aff34be2461e9"}},{"arxiv_id":"2211.16349","arxiv_id_is_arxiv":true,"paper":"/paper/bartsmiles-generative-masked-language-models","title":"BARTSmiles: Generative Masked Language Models for Molecular Representations","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yerevann/bartsmiles","path":"utils/utils.py","file_url":"https://github.com/yerevann/bartsmiles/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd29169c736bf8ed","code_sha256_prefix":"fd29169c736bf8ed","mcp_get_code":{"code_sha256":"fd29169c736bf8ed"}},{"arxiv_id":"2105.15106","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-knowledge-tracing","title":"A Survey of Knowledge Tracing: Models, Variants, and Applications","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/EduKTM","path":"EduKTM/AKT/AKT.py","file_url":"https://github.com/bigdata-ustc/EduKTM/blob/HEAD/EduKTM/AKT/AKT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8597a8a1cd9a7cd5","code_sha256_prefix":"8597a8a1cd9a7cd5","mcp_get_code":{"code_sha256":"8597a8a1cd9a7cd5"}},{"arxiv_id":"2007.10088","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-multidimensional-multimodal","title":"Interpretable, Multidimensional, Multimodal Anomaly Detection with Negative Sampling for Detection of Device Failure","date":"2020-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/madi","path":"src/madi/utils/evaluation_utils.py","file_url":"https://github.com/google/madi/blob/HEAD/src/madi/utils/evaluation_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63954fed6a514f34","code_sha256_prefix":"63954fed6a514f34","mcp_get_code":{"code_sha256":"63954fed6a514f34"}},{"arxiv_id":"1907.06837","arxiv_id_is_arxiv":true,"paper":"/paper/a-self-attentive-model-for-knowledge-tracing","title":"A Self-Attentive model for Knowledge Tracing","date":"2019-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theophilegervet/learner-performance-prediction","path":"train_sakt.py","file_url":"https://github.com/theophilegervet/learner-performance-prediction/blob/HEAD/train_sakt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, theophilegervet/learner-performance-prediction when it was checked","code_sha256":"63379c3778af65f9","code_sha256_prefix":"63379c3778af65f9","mcp_get_code":{"code_sha256":"63379c3778af65f9"}},{"arxiv_id":"1905.06873","arxiv_id_is_arxiv":true,"paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"63379c3778af65f9","code_sha256_prefix":"63379c3778af65f9","mcp_get_code":{"code_sha256":"63379c3778af65f9"}}],"record_sha256":"1b24cbc5526741fa005ea9d6d9494324951837eda310704bdab6bbe8385d2eeb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}