{"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/auc","entry":"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":21,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":15,"n_papers_ran_instrument_only":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":16,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":9,"n_places":21,"n_places_pointer_only":7,"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":3,"ran_draft_wrong":0,"ran_fixture":2,"ran":7,"unverified":4},"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":"2607.28666","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-28666","title":"The Checking Problem What must be true before AI ships in a regulated firm","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"dsauce/checking-problem","path":"eval/analyse.py","file_url":"https://github.com/dsauce/checking-problem/blob/HEAD/eval/analyse.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, dsauce/checking-problem (NOASSERTION)","code_sha256":"a61c8d2f2130466b","code_sha256_prefix":"a61c8d2f2130466b","mcp_get_code":{"code_sha256":"a61c8d2f2130466b"}},{"arxiv_id":"2606.22314","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22314","title":"Diffusion Integrated Gradients: Controllable Path Generation for Flexible Feature Attribution","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pd90506/AGI","path":"evaluation.py","file_url":"https://github.com/pd90506/AGI/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, pd90506/AGI when it was checked","code_sha256":"f612c23143fa7983","code_sha256_prefix":"f612c23143fa7983","mcp_get_code":{"code_sha256":"f612c23143fa7983"}},{"arxiv_id":"2601.18222","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18222","title":"HomoFM: Deep Homography Estimation with Flow Matching","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hmf21/HomoFM","path":"estimation.py","file_url":"https://github.com/hmf21/HomoFM/blob/HEAD/estimation.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, hmf21/HomoFM when it was checked","code_sha256":"b04b32c6a45e63eb","code_sha256_prefix":"b04b32c6a45e63eb","mcp_get_code":{"code_sha256":"b04b32c6a45e63eb"}},{"arxiv_id":"2510.22897","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"structlearning/neural-subm-design-space","path":"GMN/evaluation.py","file_url":"https://github.com/structlearning/neural-subm-design-space/blob/HEAD/GMN/evaluation.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, structlearning/neural-subm-design-space when it was checked","code_sha256":"178cde1547585aa1","code_sha256_prefix":"178cde1547585aa1","mcp_get_code":{"code_sha256":"178cde1547585aa1"}},{"arxiv_id":"2506.13277","arxiv_id_is_arxiv":true,"paper":"/paper/seqpe-transformer-with-sequential-position","title":"SeqPE: Transformer with Sequential Position Encoding","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghrua/seqpe","path":"image_seqpe/eval/cal_imagenet_c.py","file_url":"https://github.com/ghrua/seqpe/blob/HEAD/image_seqpe/eval/cal_imagenet_c.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ghrua/seqpe when it was checked","code_sha256":"7a93b4bf9b9553b9","code_sha256_prefix":"7a93b4bf9b9553b9","mcp_get_code":{"code_sha256":"7a93b4bf9b9553b9"}},{"arxiv_id":"2407.11771","arxiv_id_is_arxiv":true,"paper":"/paper/xedgeai-a-human-centered-industrial","title":"XEdgeAI: A Human-centered Industrial Inspection Framework with Data-centric Explainable Edge AI Approach","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"analytics-everywhere-lab/vqixai","path":"explainer/metrics.py","file_url":"https://github.com/analytics-everywhere-lab/vqixai/blob/HEAD/explainer/metrics.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, analytics-everywhere-lab/vqixai when it was checked","code_sha256":"d26a95ab6145da6e","code_sha256_prefix":"d26a95ab6145da6e","mcp_get_code":{"code_sha256":"d26a95ab6145da6e"}},{"arxiv_id":"2405.01531","arxiv_id_is_arxiv":true,"paper":"/paper/improving-intervention-efficacy-via-concept","title":"Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/concept_realignment","path":"concept-realignment-experiments/plotting_utils.py","file_url":"https://github.com/explainableml/concept_realignment/blob/HEAD/concept-realignment-experiments/plotting_utils.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":"7a12116f11200608","code_sha256_prefix":"7a12116f11200608","mcp_get_code":{"code_sha256":"7a12116f11200608"}},{"arxiv_id":"2307.07002","arxiv_id_is_arxiv":true,"paper":"/paper/classical-out-of-distribution-detection","title":"Classical Out-of-Distribution Detection Methods Benchmark in Text Classification Tasks","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateuszbaransanok/TrustworthyAI","path":"trustworthyai/utils/metrics.py","file_url":"https://github.com/mateuszbaransanok/TrustworthyAI/blob/HEAD/trustworthyai/utils/metrics.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, mateuszbaransanok/TrustworthyAI when it was checked","code_sha256":"6f8a5d1694970c5a","code_sha256_prefix":"6f8a5d1694970c5a","mcp_get_code":{"code_sha256":"6f8a5d1694970c5a"}},{"arxiv_id":"2211.02912","arxiv_id_is_arxiv":true,"paper":"/paper/new-definitions-and-evaluations-for-saliency-1","title":"New Definitions and Evaluations for Saliency Methods: Staying Intrinsic, Complete and Sound","date":"2022-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eclique/RISE","path":"evaluation.py","file_url":"https://github.com/eclique/RISE/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f612c23143fa7983","code_sha256_prefix":"f612c23143fa7983","mcp_get_code":{"code_sha256":"f612c23143fa7983"}},{"arxiv_id":"2206.06420","arxiv_id_is_arxiv":true,"paper":"/paper/graphmlp-a-graph-mlp-like-architecture-for-3d","title":"GraphMLP: A Graph MLP-Like Architecture for 3D Human Pose Estimation","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vegetebird/graphmlp","path":"common/eval_cal.py","file_url":"https://github.com/vegetebird/graphmlp/blob/HEAD/common/eval_cal.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":"fdc879ae10929e49","code_sha256_prefix":"fdc879ae10929e49","mcp_get_code":{"code_sha256":"fdc879ae10929e49"}},{"arxiv_id":"2110.13771","arxiv_id_is_arxiv":true,"paper":"/paper/augmax-adversarial-composition-of-random","title":"AugMax: Adversarial Composition of Random Augmentations for Robust Training","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/AugMax","path":"augmax_modules/corruptions_IN.py","file_url":"https://github.com/VITA-Group/AugMax/blob/HEAD/augmax_modules/corruptions_IN.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a93b4bf9b9553b9","code_sha256_prefix":"7a93b4bf9b9553b9","mcp_get_code":{"code_sha256":"7a93b4bf9b9553b9"}},{"arxiv_id":"2110.13223","arxiv_id_is_arxiv":true,"paper":"/paper/identifying-and-benchmarking-natural-out-of","title":"Identifying and Benchmarking Natural Out-of-Context Prediction Problems","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmadras/nooch","path":"src/nooch.py","file_url":"https://github.com/dmadras/nooch/blob/HEAD/src/nooch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc57d2f52876c2cc","code_sha256_prefix":"fc57d2f52876c2cc","mcp_get_code":{"code_sha256":"fc57d2f52876c2cc"}},{"arxiv_id":"2104.14210","arxiv_id_is_arxiv":true,"paper":"/paper/biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juellsprott/graphair-reproducibility","path":"models/fairgraph/utils/utils.py","file_url":"https://github.com/juellsprott/graphair-reproducibility/blob/HEAD/models/fairgraph/utils/utils.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":"90c475fc06ff234d","code_sha256_prefix":"90c475fc06ff234d","mcp_get_code":{"code_sha256":"90c475fc06ff234d"}},{"arxiv_id":"2103.13859","arxiv_id_is_arxiv":true,"paper":"/paper/group-cam-group-score-weighted-visual","title":"Group-CAM: Group Score-Weighted Visual Explanations for Deep Convolutional Networks","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wofmanaf/Group-CAM","path":"ins_del_gc.py","file_url":"https://github.com/wofmanaf/Group-CAM/blob/HEAD/ins_del_gc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f612c23143fa7983","code_sha256_prefix":"f612c23143fa7983","mcp_get_code":{"code_sha256":"f612c23143fa7983"}},{"arxiv_id":"2006.09481","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-nonparametric-statistical-inference","title":"Efficient nonparametric statistical inference on population feature importance using Shapley values","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdwilliamson/vimpy","path":"vimpy/spvim.py","file_url":"https://github.com/bdwilliamson/vimpy/blob/HEAD/vimpy/spvim.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3b4f79c3ab9cdf9","code_sha256_prefix":"b3b4f79c3ab9cdf9","mcp_get_code":{"code_sha256":"b3b4f79c3ab9cdf9"}},{"arxiv_id":"2003.02501","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-attended-visual-targets-in-video","title":"Detecting Attended Visual Targets in Video","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejcgt/attention-target-detection","path":"utils/evaluation.py","file_url":"https://github.com/ejcgt/attention-target-detection/blob/HEAD/utils/evaluation.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":"4672566e034d749b","code_sha256_prefix":"4672566e034d749b","mcp_get_code":{"code_sha256":"4672566e034d749b"}},{"arxiv_id":"2001.03994","arxiv_id_is_arxiv":true,"paper":"/paper/fast-is-better-than-free-revisiting-1","title":"Fast is better than free: Revisiting adversarial training","date":"2020-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliborji/shapedefense","path":"test_noise_robustness.py","file_url":"https://github.com/aliborji/shapedefense/blob/HEAD/test_noise_robustness.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a93b4bf9b9553b9","code_sha256_prefix":"7a93b4bf9b9553b9","mcp_get_code":{"code_sha256":"7a93b4bf9b9553b9"}},{"arxiv_id":"1510.01784","arxiv_id_is_arxiv":true,"paper":"/paper/vbpr-visual-bayesian-personalized-ranking","title":"VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback","date":"2015-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abkds/r-ecommender","path":"utils.py","file_url":"https://github.com/abkds/r-ecommender/blob/HEAD/utils.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":"8a2d50da5ce02f98","code_sha256_prefix":"8a2d50da5ce02f98","mcp_get_code":{"code_sha256":"8a2d50da5ce02f98"}},{"arxiv_id":"aaai_26347","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26347","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bytedance/LargeBatchCTR","path":"utils.py","file_url":"https://github.com/bytedance/LargeBatchCTR/blob/HEAD/utils.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":"7a1db228afb97b79","code_sha256_prefix":"7a1db228afb97b79","mcp_get_code":{"code_sha256":"7a1db228afb97b79"}},{"arxiv_id":"Ren_Masked_Jigsaw_Puzzle_A_Versatile_Position_Embedding_for_Vision_Transformers_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ren_Masked_Jigsaw_Puzzle_A_Versatile_Position_Embedding_for_Vision_Transformers_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhlleo/MJP","path":"eval/cal_imagenet_c.py","file_url":"https://github.com/yhlleo/MJP/blob/HEAD/eval/cal_imagenet_c.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a93b4bf9b9553b9","code_sha256_prefix":"7a93b4bf9b9553b9","mcp_get_code":{"code_sha256":"7a93b4bf9b9553b9"}},{"arxiv_id":"Liu_GEN_Pushing_the_Limits_of_Softmax-Based_Out-of-Distribution_Detection_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liu_GEN_Pushing_the_Limits_of_Softmax-Based_Out-of-Distribution_Detection_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"XixiLiu95/GEN","path":"benchmark.py","file_url":"https://github.com/XixiLiu95/GEN/blob/HEAD/benchmark.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":"a65e08c87c532004","code_sha256_prefix":"a65e08c87c532004","mcp_get_code":{"code_sha256":"a65e08c87c532004"}}],"record_sha256":"653bb18e0ed8c5b0902ae93267f2b33096193bc1d7ef00ad56a73ec1c5e3dde5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}