{"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/evaluate-auc","entry":"evaluate_auc","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":5,"n_papers_ran":1,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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.18567","paper":"/paper/arxiv-2605-18567","title":"GUT-IS: A Data-Driven Approach to Integrating Constructs and Their Relations in Information Systems","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MaxHReinhardt/gut-is","path":"src/projection_model.py","file_url":"https://github.com/MaxHReinhardt/gut-is/blob/HEAD/src/projection_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"39f2abf466c33ff6","mcp_get_code":{"code_sha256":"39f2abf466c33ff6"}},{"arxiv_id":"2210.00116","paper":"/paper/predicting-cellular-responses-with","title":"Predicting Cellular Responses with Variational Causal Inference and Refined Relational Information","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yulun-rayn/graphvci","path":"gvci/evaluate/evaluate.py","file_url":"https://github.com/yulun-rayn/graphvci/blob/HEAD/gvci/evaluate/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"04954d48d604a356","mcp_get_code":{"code_sha256":"04954d48d604a356"}},{"arxiv_id":"2209.15486","paper":"/paper/graph-neural-networks-for-link-prediction","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"melifluos/subgraph-sketching","path":"src/evaluation.py","file_url":"https://github.com/melifluos/subgraph-sketching/blob/HEAD/src/evaluation.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":"bbb365889e4b165c","mcp_get_code":{"code_sha256":"bbb365889e4b165c"}},{"arxiv_id":"2106.06935","paper":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fs302/EasyLink","path":"easylink/common/eval_utils.py","file_url":"https://github.com/fs302/EasyLink/blob/HEAD/easylink/common/eval_utils.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":"a27462150ae41053","mcp_get_code":{"code_sha256":"a27462150ae41053"}},{"arxiv_id":"2007.00216","paper":"/paper/an-efficient-neighborhood-based-interaction","title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jinjiarui/GraphHINGE","path":"utils/utils.py","file_url":"https://github.com/Jinjiarui/GraphHINGE/blob/HEAD/utils/utils.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":"85b2aba4e65eb4a2","mcp_get_code":{"code_sha256":"85b2aba4e65eb4a2"}}]}