{"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/classification-metrics","entry":"classification_metrics","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":4,"ran":4,"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":"2606.15307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15307","title":"Adapting Reinforcement Learning with Chain-of-Thought Supervision for Explainable Detection of Hateful and Propagandistic Memes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"MohamedBayan/MemeReason","path":"evaluation/compute_metrics.py","file_url":"https://github.com/MohamedBayan/MemeReason/blob/HEAD/evaluation/compute_metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, MohamedBayan/MemeReason when it was checked","code_sha256":"324967c6a6c4b693","code_sha256_prefix":"324967c6a6c4b693","mcp_get_code":{"code_sha256":"324967c6a6c4b693"}},{"arxiv_id":"2605.26036","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26036","title":"CITYREP: A Unified Benchmark for Urban Representations Across Cities, Tasks, and Modalities","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"inwind0212/CityRep","path":"urban_benchmark/metrics.py","file_url":"https://github.com/inwind0212/CityRep/blob/HEAD/urban_benchmark/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, inwind0212/CityRep when it was checked","code_sha256":"b152e0d18a7b6385","code_sha256_prefix":"b152e0d18a7b6385","mcp_get_code":{"code_sha256":"b152e0d18a7b6385"}},{"arxiv_id":"2604.24201","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24201","title":"CMGL: Confidence-guided Multi-omics Graph Learning for Cancer Subtype Classification","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"chenzRG/Cancer-Multi-Omics-Benchmark","path":"Baseline_and_Metric/Classification/Metrics/Classification_metrics.py","file_url":"https://github.com/chenzRG/Cancer-Multi-Omics-Benchmark/blob/HEAD/Baseline_and_Metric/Classification/Metrics/Classification_metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chenzRG/Cancer-Multi-Omics-Benchmark when it was checked","code_sha256":"1ff6721ce2ec83b7","code_sha256_prefix":"1ff6721ce2ec83b7","mcp_get_code":{"code_sha256":"1ff6721ce2ec83b7"}},{"arxiv_id":"2602.19788","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19788","title":"Bayesian Meta-Learning with Expert Feedback for Task-Shift Adaptation through Causal Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lottamakinen/causal-meta-learning","path":"metrics/accuracy.py","file_url":"https://github.com/lottamakinen/causal-meta-learning/blob/HEAD/metrics/accuracy.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":"5831505484c20cbc","code_sha256_prefix":"5831505484c20cbc","mcp_get_code":{"code_sha256":"5831505484c20cbc"}},{"arxiv_id":"2602.16738","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16738","title":"Self-Evolving Multi-Agent Network for Industrial IoT Predictive Maintenance","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"HySonLab/AgentIoT","path":"hama/agents/evolution.py","file_url":"https://github.com/HySonLab/AgentIoT/blob/HEAD/hama/agents/evolution.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"34a9706c22c472e6","code_sha256_prefix":"34a9706c22c472e6","mcp_get_code":{"code_sha256":"34a9706c22c472e6"}},{"arxiv_id":"2501.05040","arxiv_id_is_arxiv":true,"paper":"/paper/swe-fixer-training-open-source-llms-for","title":"SWE-Fixer: Training Open-Source LLMs for Effective and Efficient GitHub Issue Resolution","date":"2025-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jorge-martinez-gil/graphcodebert-feature-integration","path":"src/featfuse/metrics.py","file_url":"https://github.com/jorge-martinez-gil/graphcodebert-feature-integration/blob/HEAD/src/featfuse/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b12db6bf011d6fa","code_sha256_prefix":"1b12db6bf011d6fa","mcp_get_code":{"code_sha256":"1b12db6bf011d6fa"}},{"arxiv_id":"2402.17229","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-fairness-generalization-in","title":"Preserving Fairness Generalization in Deepfake Detection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"purdue-m2/fairness-generalization","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/fairness-generalization/blob/HEAD/training/fairness_metrics.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":"c987e7409c07b8d5","code_sha256_prefix":"c987e7409c07b8d5","mcp_get_code":{"code_sha256":"c987e7409c07b8d5"}},{"arxiv_id":"2208.10451","arxiv_id_is_arxiv":true,"paper":"/paper/minimax-auc-fairness-efficient-algorithm-with","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"purdue-m2/auc_fairness_with_noisy_groups","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/fairness_metrics.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":"09ce3125196e8c16","code_sha256_prefix":"09ce3125196e8c16","mcp_get_code":{"code_sha256":"09ce3125196e8c16"}},{"arxiv_id":"1901.01379","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-imbalanced","title":"Deep Reinforcement Learning for Imbalanced Classification","date":"2019-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Denbergvanthijs/imbDRL","path":"imbDRL/metrics.py","file_url":"https://github.com/Denbergvanthijs/imbDRL/blob/HEAD/imbDRL/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aa844be0122f4ad","code_sha256_prefix":"5aa844be0122f4ad","mcp_get_code":{"code_sha256":"5aa844be0122f4ad"}}],"record_sha256":"40a29b8b36da242b2d594705534b596b1c0e3d481f912852f1e6dfa1653471c4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}