{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DNLLZYV3LKGU5BYCUNO3J75D7T","short_pith_number":"pith:DNLLZYV3","schema_version":"1.0","canonical_sha256":"1b56bce2bb5a8d4e8702a35db4ffa3fce7d2092fdf480e55a721dc7aa9fe22d2","source":{"kind":"arxiv","id":"2406.15523","version":2},"attestation_state":"computed","paper":{"title":"Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenyu Li, Kaize Ding, Rui Miao, Shirui Pan, Xin Wang, Xu Shen, Yili Wang, Ying Wang, Yixin Liu","submitted_at":"2024-06-21T04:07:43Z","abstract_excerpt":"To build safe and reliable graph machine learning systems, unsupervised graph-level anomaly detection (GLAD) and unsupervised graph-level out-of-distribution (OOD) detection (GLOD) have received significant attention in recent years. Though those two lines of research indeed share the same objective, they have been studied independently in the community due to distinct evaluation setups, creating a gap that hinders the application and evaluation of methods from one to the other. To bridge the gap, in this work, we present a \\underline{\\textbf{U}}nified \\underline{\\textbf{B}}enchmark for unsupe"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.15523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-21T04:07:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"184ad1a27523a7292d324745728df1eab3c5de2f7e46511b5a39cb6192b5428c","abstract_canon_sha256":"3a834af3fe2f3ceb6743452e8d73094b746aaa2ff67ede99b17a622a99b4269b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:14.780104Z","signature_b64":"rq863vOCAFFlUVD8fpQr5l1H/lhDqtReSIDjNMDXG8Z46lT5Y1d9uAPihU81XgHn4VJ+xV3yzWSKYdHYpWIjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b56bce2bb5a8d4e8702a35db4ffa3fce7d2092fdf480e55a721dc7aa9fe22d2","last_reissued_at":"2026-07-05T10:44:14.779630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:14.779630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenyu Li, Kaize Ding, Rui Miao, Shirui Pan, Xin Wang, Xu Shen, Yili Wang, Ying Wang, Yixin Liu","submitted_at":"2024-06-21T04:07:43Z","abstract_excerpt":"To build safe and reliable graph machine learning systems, unsupervised graph-level anomaly detection (GLAD) and unsupervised graph-level out-of-distribution (OOD) detection (GLOD) have received significant attention in recent years. Though those two lines of research indeed share the same objective, they have been studied independently in the community due to distinct evaluation setups, creating a gap that hinders the application and evaluation of methods from one to the other. To bridge the gap, in this work, we present a \\underline{\\textbf{U}}nified \\underline{\\textbf{B}}enchmark for unsupe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.15523","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.15523/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.15523","created_at":"2026-07-05T10:44:14.779694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.15523v2","created_at":"2026-07-05T10:44:14.779694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.15523","created_at":"2026-07-05T10:44:14.779694+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNLLZYV3LKGU","created_at":"2026-07-05T10:44:14.779694+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNLLZYV3LKGU5BYC","created_at":"2026-07-05T10:44:14.779694+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNLLZYV3","created_at":"2026-07-05T10:44:14.779694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.15461","citing_title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T","json":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T.json","graph_json":"https://pith.science/api/pith-number/DNLLZYV3LKGU5BYCUNO3J75D7T/graph.json","events_json":"https://pith.science/api/pith-number/DNLLZYV3LKGU5BYCUNO3J75D7T/events.json","paper":"https://pith.science/paper/DNLLZYV3"},"agent_actions":{"view_html":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T","download_json":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T.json","view_paper":"https://pith.science/paper/DNLLZYV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.15523&json=true","fetch_graph":"https://pith.science/api/pith-number/DNLLZYV3LKGU5BYCUNO3J75D7T/graph.json","fetch_events":"https://pith.science/api/pith-number/DNLLZYV3LKGU5BYCUNO3J75D7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T/action/storage_attestation","attest_author":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T/action/author_attestation","sign_citation":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T/action/citation_signature","submit_replication":"https://pith.science/pith/DNLLZYV3LKGU5BYCUNO3J75D7T/action/replication_record"}},"created_at":"2026-07-05T10:44:14.779694+00:00","updated_at":"2026-07-05T10:44:14.779694+00:00"}