{"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/eval-rocauc","entry":"eval_rocauc","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"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":1,"ran_fixture":3,"ran":1,"unverified":0},"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":"2601.11135","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11135","title":"Context-aware Graph Causality Inference for Few-Shot Molecular Property Prediction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NSLab-CUK/CaMol","path":"metrics.py","file_url":"https://github.com/NSLab-CUK/CaMol/blob/HEAD/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cae08c15fd4d60b","code_sha256_prefix":"7cae08c15fd4d60b","mcp_get_code":{"code_sha256":"7cae08c15fd4d60b"}},{"arxiv_id":"2412.09805","arxiv_id_is_arxiv":true,"paper":"/paper/universal-inceptive-gnns-by-eliminating-the","title":"Universal Inceptive GNNs by Eliminating the Smoothness-generalization Dilemma","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galogm/IGNN","path":"ignn/utils/common.py","file_url":"https://github.com/galogm/IGNN/blob/HEAD/ignn/utils/common.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"163cabf2572117b5","code_sha256_prefix":"163cabf2572117b5","mcp_get_code":{"code_sha256":"163cabf2572117b5"}},{"arxiv_id":"2411.16278","arxiv_id_is_arxiv":true,"paper":"/paper/even-sparser-graph-transformers","title":"Even Sparser Graph Transformers","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamed1375/Sp_Exphormer","path":"spexphormer/metrics_ogb.py","file_url":"https://github.com/hamed1375/Sp_Exphormer/blob/HEAD/spexphormer/metrics_ogb.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cae08c15fd4d60b","code_sha256_prefix":"7cae08c15fd4d60b","mcp_get_code":{"code_sha256":"7cae08c15fd4d60b"}},{"arxiv_id":"2406.04601","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-size-generalization-in-graph-neural","title":"Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphminddartmouth/disgen","path":"src/train_util.py","file_url":"https://github.com/graphminddartmouth/disgen/blob/HEAD/src/train_util.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, graphminddartmouth/disgen when it was checked","code_sha256":"43b70be4ca4a732e","code_sha256_prefix":"43b70be4ca4a732e","mcp_get_code":{"code_sha256":"43b70be4ca4a732e"}},{"arxiv_id":"2311.00164","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-road-safety-1","title":"Graph Neural Networks for Road Safety Modeling: Datasets and Evaluations for Accident Analysis","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VirtuosoResearch/ML4RoadSafety","path":"ml_for_road_safety/evaluators.py","file_url":"https://github.com/VirtuosoResearch/ML4RoadSafety/blob/HEAD/ml_for_road_safety/evaluators.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VirtuosoResearch/ML4RoadSafety when it was checked","code_sha256":"24a30de439ff18c8","code_sha256_prefix":"24a30de439ff18c8","mcp_get_code":{"code_sha256":"24a30de439ff18c8"}},{"arxiv_id":"2310.06396","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LFhase/GIA-HAO","path":"attacks/metric.py","file_url":"https://github.com/LFhase/GIA-HAO/blob/HEAD/attacks/metric.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":"4eae1658e4eeb3f7","code_sha256_prefix":"4eae1658e4eeb3f7","mcp_get_code":{"code_sha256":"4eae1658e4eeb3f7"}},{"arxiv_id":"2111.04314","arxiv_id_is_arxiv":true,"paper":"/paper/graph-robustness-benchmark-benchmarking-the","title":"Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/grb","path":"grb/evaluator/metric.py","file_url":"https://github.com/THUDM/grb/blob/HEAD/grb/evaluator/metric.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":"4eae1658e4eeb3f7","code_sha256_prefix":"4eae1658e4eeb3f7","mcp_get_code":{"code_sha256":"4eae1658e4eeb3f7"}}],"record_sha256":"f7d467618218cee47b7594617566eb88ec3ef8b768e48923fdc556d026b446b7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}