{"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":"/task/fraud-detection/papers/ran/1","list_of":"/task/fraud-detection","task":"Fraud Detection","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,24],"of":24,"counts":{"archive_papers_tagged":547,"with_a_code_link":158,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":547,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/fraud-detection/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/2506-08762","slug":"2506-08762","title":"EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements","date":"2025-06-10","arxiv_id":"2506.08762","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2506-08762#ran","syntology_url":"https://syntology.ai/paper/2506.08762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08762"}},"official":{"repos":["sakanaai/edinet-bench","sakanaai/edinet2dataset"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-label-free-heterophily-guided-approach-for","slug":"a-label-free-heterophily-guided-approach-for","title":"A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection","date":"2025-02-18","arxiv_id":"2502.13308","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-label-free-heterophily-guided-approach-for#ran","syntology_url":"https://syntology.ai/paper/2502.13308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.13308"}},"official":{"repos":["campanulabells/huge-gad"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ad-llm-benchmarking-large-language-models-for","slug":"ad-llm-benchmarking-large-language-models-for","title":"AD-LLM: Benchmarking Large Language Models for Anomaly Detection","date":"2024-12-15","arxiv_id":"2412.11142","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ad-llm-benchmarking-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2412.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.11142"}},"official":{"repos":["usc-fortis/ad-llm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pyod-2-a-python-library-for-outlier-detection","slug":"pyod-2-a-python-library-for-outlier-detection","title":"PyOD 2: A Python Library for Outlier Detection with LLM-powered Model Selection","date":"2024-12-11","arxiv_id":"2412.12154","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pyod-2-a-python-library-for-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2412.12154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12154"}},"official":{"repos":["yzhao062/pyod"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/training-mlps-on-graphs-without-supervision","slug":"training-mlps-on-graphs-without-supervision","title":"Training MLPs on Graphs without Supervision","date":"2024-12-05","arxiv_id":"2412.03864","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-mlps-on-graphs-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2412.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03864"}},"official":{"repos":["zehong-wang/simmlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-distribution-valuation","slug":"data-distribution-valuation","title":"Data Distribution Valuation","date":"2024-10-06","arxiv_id":"2410.04386","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-distribution-valuation#ran","syntology_url":"https://syntology.ai/paper/2410.04386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04386"}},"official":{"repos":["xinyiys/data_distribution_valuation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-detection-of-reviewer-author-collusion","slug":"on-the-detection-of-reviewer-author-collusion","title":"On the Detection of Reviewer-Author Collusion Rings From Paper Bidding","date":"2024-02-12","arxiv_id":"2402.07860","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/on-the-detection-of-reviewer-author-collusion#ran","syntology_url":"https://syntology.ai/paper/2402.07860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07860"}},"official":{"repos":["sjecmen/peer-review-collusion-detection"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/ada-gad-anomaly-denoised-autoencoders-for","slug":"ada-gad-anomaly-denoised-autoencoders-for","title":"ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection","date":"2023-12-22","arxiv_id":"2312.14535","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ada-gad-anomaly-denoised-autoencoders-for#ran","syntology_url":"https://syntology.ai/paper/2312.14535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14535"}},"official":{"repos":["jweihe/ADA-GAD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fifar-a-fraud-detection-dataset-for-learning","slug":"fifar-a-fraud-detection-dataset-for-learning","title":"FiFAR: A Fraud Detection Dataset for Learning to Defer","date":"2023-12-20","arxiv_id":"2312.13218","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fifar-a-fraud-detection-dataset-for-learning#ran","syntology_url":"https://syntology.ai/paper/2312.13218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13218"}},"official":{"repos":["feedzai/fifar-dataset"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vertexserum-poisoning-graph-neural-networks","slug":"vertexserum-poisoning-graph-neural-networks","title":"VertexSerum: Poisoning Graph Neural Networks for Link Inference","date":"2023-08-02","arxiv_id":"2308.01469","repositories_listed":0,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vertexserum-poisoning-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2308.01469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.01469"}},"official":null}},{"url":"/paper/towards-reliable-rare-category-analysis-on","slug":"towards-reliable-rare-category-analysis-on","title":"Towards Reliable Rare Category Analysis on Graphs via Individual Calibration","date":"2023-07-19","arxiv_id":"2307.09858","repositories_listed":1,"syntology":{"n":16,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":16,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/towards-reliable-rare-category-analysis-on#ran","syntology_url":"https://syntology.ai/paper/2307.09858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09858"}},"official":{"repos":["wulongfeng/calirare"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/cost-sensitive-gnn-based-imbalanced-learning","slug":"cost-sensitive-gnn-based-imbalanced-learning","title":"Cost Sensitive GNN-based Imbalanced Learning for Mobile Social Network Fraud Detection","date":"2023-03-28","arxiv_id":"2303.17486","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cost-sensitive-gnn-based-imbalanced-learning#ran","syntology_url":"https://syntology.ai/paper/2303.17486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17486"}},"official":{"repos":["xxhu94/csgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-anomaly-detection-under-labeling-budget","slug":"deep-anomaly-detection-under-labeling-budget","title":"Deep Anomaly Detection under Labeling Budget Constraints","date":"2023-02-15","arxiv_id":"2302.07832","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-anomaly-detection-under-labeling-budget#ran","syntology_url":"https://syntology.ai/paper/2302.07832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07832"}},"official":{"repos":["aodongli/Active-SOEL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/turning-the-tables-biased-imbalanced-dynamic","slug":"turning-the-tables-biased-imbalanced-dynamic","title":"Turning the Tables: Biased, Imbalanced, Dynamic Tabular Datasets for ML Evaluation","date":"2022-11-24","arxiv_id":"2211.13358","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/turning-the-tables-biased-imbalanced-dynamic#ran","syntology_url":"https://syntology.ai/paper/2211.13358","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13358"}},"official":{"repos":["feedzai/bank-account-fraud"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-online-change-detection-for-high","slug":"scalable-online-change-detection-for-high","title":"Maximum Mean Discrepancy on Exponential Windows for Online Change Detection","date":"2022-05-25","arxiv_id":"2205.12706","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-online-change-detection-for-high#ran","syntology_url":"https://syntology.ai/paper/2205.12706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12706"}},"official":{"repos":["flopska/mmdew-change-detector"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tod-tensor-based-outlier-detection","slug":"tod-tensor-based-outlier-detection","title":"TOD: GPU-accelerated Outlier Detection via Tensor Operations","date":"2021-10-26","arxiv_id":"2110.14007","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tod-tensor-based-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2110.14007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14007"}},"official":{"repos":["yzhao062/pytod"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/customs-fraud-detection-in-the-presence-of","slug":"customs-fraud-detection-in-the-presence-of","title":"Customs Fraud Detection in the Presence of Concept Drift","date":"2021-09-29","arxiv_id":"2109.14155","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/customs-fraud-detection-in-the-presence-of#ran","syntology_url":"https://syntology.ai/paper/2109.14155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14155"}},"official":null}},{"url":"/paper/edits-modeling-and-mitigating-data-bias-for","slug":"edits-modeling-and-mitigating-data-bias-for","title":"EDITS: Modeling and Mitigating Data Bias for Graph Neural Networks","date":"2021-08-11","arxiv_id":"2108.05233","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/edits-modeling-and-mitigating-data-bias-for#ran","syntology_url":"https://syntology.ai/paper/2108.05233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05233"}},"official":{"repos":["yushundong/edits"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/saint-improved-neural-networks-for-tabular","slug":"saint-improved-neural-networks-for-tabular","title":"SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Training","date":"2021-06-02","arxiv_id":"2106.01342","repositories_listed":7,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":7,"n_honours":1,"n_violates":2,"n_no_contract":16,"n_pointer_only":13,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 2 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/saint-improved-neural-networks-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2106.01342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01342"}},"official":{"repos":["somepago/saint"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/enhancing-graph-neural-network-based-fraud","slug":"enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-graph-neural-network-based-fraud#ran","syntology_url":"https://syntology.ai/paper/2008.08692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08692"}},"official":{"repos":["YingtongDou/CARE-GNN","safe-graph/DGFraud"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/stealing-links-from-graph-neural-networks","slug":"stealing-links-from-graph-neural-networks","title":"Stealing Links from Graph Neural Networks","date":"2020-05-05","arxiv_id":"2005.02131","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stealing-links-from-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.02131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02131"}},"official":null}},{"url":"/paper/continuous-variable-quantum-neural-networks","slug":"continuous-variable-quantum-neural-networks","title":"Continuous-variable quantum neural networks","date":"2018-06-18","arxiv_id":"1806.06871","repositories_listed":8,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continuous-variable-quantum-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.06871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.06871"}},"official":null}}],"record_sha256":"a39a827b1e78919c0940ff868f5f7a58839a8ca743cf062fe9148aca9862d181","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}