{"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/train-classifier","entry":"train_classifier","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":11,"n_papers_ran":2,"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":11,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":9},"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.06315","paper":"/paper/arxiv-2606-06315","title":"LLM Self-Recognition: Steering and Retrieving Activation Signatures","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Thibaud-Ardoin/LLM-Self-Recognition","path":"self_recognition/LLM_SelfRecognition_via_Activations-public/evaluation.py","file_url":"https://github.com/Thibaud-Ardoin/LLM-Self-Recognition/blob/HEAD/self_recognition/LLM_SelfRecognition_via_Activations-public/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9974a7c5722e6232","mcp_get_code":{"code_sha256":"9974a7c5722e6232"}},{"arxiv_id":"2505.17013","paper":"/paper/when-are-concepts-erased-from-diffusion","title":"When Are Concepts Erased From Diffusion Models?","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevinlu4588/diffusionconcepterasure","path":"classifier_guidance/e2e_concept_classifier.py","file_url":"https://github.com/kevinlu4588/diffusionconcepterasure/blob/HEAD/classifier_guidance/e2e_concept_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afc91356d3af2d59","mcp_get_code":{"code_sha256":"afc91356d3af2d59"}},{"arxiv_id":"2411.10019","paper":"/paper/towards-utilising-a-range-of-neural","title":"Towards Utilising a Range of Neural Activations for Comprehending Representational Associations","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lauraaisling/MID-level-activations","path":"src/dsprites/models.py","file_url":"https://github.com/lauraaisling/MID-level-activations/blob/HEAD/src/dsprites/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a30b3c76ee2cb2c","mcp_get_code":{"code_sha256":"4a30b3c76ee2cb2c"}},{"arxiv_id":"2406.16201","paper":"/paper/blind-baselines-beat-membership-inference","title":"Blind Baselines Beat Membership Inference Attacks for Foundation Models","date":"2024-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-spylab/Blind-MIA","path":"bag_of_words.py","file_url":"https://github.com/ethz-spylab/Blind-MIA/blob/HEAD/bag_of_words.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fb852909e39360e3","mcp_get_code":{"code_sha256":"fb852909e39360e3"}},{"arxiv_id":"2404.12545","paper":"/paper/latent-concept-based-explanation-of-nlp","title":"Latent Concept-based Explanation of NLP Models","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuemin-yu/eraser_movie_latentconcept","path":"src/classifier_mapping/logistic_regression.py","file_url":"https://github.com/xuemin-yu/eraser_movie_latentconcept/blob/HEAD/src/classifier_mapping/logistic_regression.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65765821d1790f91","mcp_get_code":{"code_sha256":"65765821d1790f91"}},{"arxiv_id":"2404.05678","paper":"/paper/flexible-fairness-learning-via-inverse","title":"FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuhenglai/fairicp","path":"FairICP/FairICP_learning.py","file_url":"https://github.com/yuhenglai/fairicp/blob/HEAD/FairICP/FairICP_learning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"603a07757f23713b","mcp_get_code":{"code_sha256":"603a07757f23713b"}},{"arxiv_id":"2401.02683","paper":"/paper/geometric-facilitated-denoising-diffusion","title":"Geometric-Facilitated Denoising Diffusion Model for 3D Molecule Generation","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LEOXC1571/GFMDiff","path":"sample_eval.py","file_url":"https://github.com/LEOXC1571/GFMDiff/blob/HEAD/sample_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d71ad8e980762c7","mcp_get_code":{"code_sha256":"9d71ad8e980762c7"}},{"arxiv_id":"2310.18936","paper":"/paper/adversarial-examples-are-not-real-features-1","title":"Adversarial Examples Are Not Real Features","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-ML/AdvNotRealFeatures","path":"AdvNotRealFeatures/CL/train_cl.py","file_url":"https://github.com/PKU-ML/AdvNotRealFeatures/blob/HEAD/AdvNotRealFeatures/CL/train_cl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3d758ab8c3fd224d","mcp_get_code":{"code_sha256":"3d758ab8c3fd224d"}},{"arxiv_id":"2309.15965","paper":"/paper/trace-trajectory-counterfactual-explanation","title":"TraCE: Trajectory Counterfactual Explanation Scores","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeffnclark/trace","path":"ICU_TraCE_scores.py","file_url":"https://github.com/jeffnclark/trace/blob/HEAD/ICU_TraCE_scores.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":"2080bccdc34c542c","mcp_get_code":{"code_sha256":"2080bccdc34c542c"}},{"arxiv_id":"2108.06721","paper":"/paper/training-for-the-future-a-simple-gradient","title":"Training for the Future: A Simple Gradient Interpolation Loss to Generalize Along Time","date":"2021-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anshuln/training-for-the-future","path":"src/CDOT/ot_main.py","file_url":"https://github.com/anshuln/training-for-the-future/blob/HEAD/src/CDOT/ot_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0c917287552e370b","mcp_get_code":{"code_sha256":"0c917287552e370b"}},{"arxiv_id":"1511.06085","paper":"/paper/variable-rate-image-compression-with","title":"Variable Rate Image Compression with Recurrent Neural Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eyalfish/artoveq","path":"ResidualVQVAE.py","file_url":"https://github.com/eyalfish/artoveq/blob/HEAD/ResidualVQVAE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8101a561f67542dc","mcp_get_code":{"code_sha256":"8101a561f67542dc"}}]}