{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7NJFGVYIBEWRGIF34WT6URZU45","short_pith_number":"pith:7NJFGVYI","schema_version":"1.0","canonical_sha256":"fb52535708092d1320bbe5a7ea4734e75c887f0e1b15ff06c38b0cd5d72713a4","source":{"kind":"arxiv","id":"2409.09957","version":2},"attestation_state":"computed","paper":{"title":"Deep Graph Anomaly Detection: A Survey and New Perspectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo An, Charu Aggarwal, Guansong Pang, Hanghang Tong, Hezhe Qiao, Irwin King","submitted_at":"2024-09-16T03:05:11Z","abstract_excerpt":"Graph anomaly detection (GAD), which aims to identify unusual graph instances (nodes, edges, subgraphs, or graphs), has attracted increasing attention in recent years due to its significance in a wide range of applications. Deep learning approaches, graph neural networks (GNNs) in particular, have been emerging as a promising paradigm for GAD, owing to its strong capability in capturing complex structure and/or node attributes in graph data. Considering the large number of methods proposed for GNN-based GAD, it is of paramount importance to summarize the methodologies and findings in the exist"},"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":"2409.09957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T03:05:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"570690748f02a02120cc569e412b6137d5ae12b1bd3318886bf3d609823c6f7e","abstract_canon_sha256":"0aa4ab0c730abcd664e6db60396eb141f29ce40d12a1cbff9d83abed9acb9cef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:18.212670Z","signature_b64":"cYV6LVuVo0lO7WVvf4qtUf8opLIrL1lBUI2uI2mScmtF9uDOXV3yvP3vx4IM1vc/bpa2F5/liJlckd76ejUjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb52535708092d1320bbe5a7ea4734e75c887f0e1b15ff06c38b0cd5d72713a4","last_reissued_at":"2026-07-05T11:23:18.212168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:18.212168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Graph Anomaly Detection: A Survey and New Perspectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo An, Charu Aggarwal, Guansong Pang, Hanghang Tong, Hezhe Qiao, Irwin King","submitted_at":"2024-09-16T03:05:11Z","abstract_excerpt":"Graph anomaly detection (GAD), which aims to identify unusual graph instances (nodes, edges, subgraphs, or graphs), has attracted increasing attention in recent years due to its significance in a wide range of applications. Deep learning approaches, graph neural networks (GNNs) in particular, have been emerging as a promising paradigm for GAD, owing to its strong capability in capturing complex structure and/or node attributes in graph data. Considering the large number of methods proposed for GNN-based GAD, it is of paramount importance to summarize the methodologies and findings in the exist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09957","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/2409.09957/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":"2409.09957","created_at":"2026-07-05T11:23:18.212227+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09957v2","created_at":"2026-07-05T11:23:18.212227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09957","created_at":"2026-07-05T11:23:18.212227+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NJFGVYIBEWR","created_at":"2026-07-05T11:23:18.212227+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NJFGVYIBEWRGIF3","created_at":"2026-07-05T11:23:18.212227+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NJFGVYI","created_at":"2026-07-05T11:23:18.212227+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.08127","citing_title":"BlindGuard: Safeguarding LLM-based Multi-Agent Systems under Unknown Attacks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11749","citing_title":"Learning Feature Encoder with Synthetic Anomalies for Weakly Supervised Graph Anomaly Detection","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10242","citing_title":"When Normality Shifts: Risk-Aware Test-Time Adaptation for Unsupervised Tabular Anomaly Detection","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15668","citing_title":"NK-GAD: Neighbor Knowledge-Enhanced Unsupervised Graph Anomaly Detection","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45","json":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45.json","graph_json":"https://pith.science/api/pith-number/7NJFGVYIBEWRGIF34WT6URZU45/graph.json","events_json":"https://pith.science/api/pith-number/7NJFGVYIBEWRGIF34WT6URZU45/events.json","paper":"https://pith.science/paper/7NJFGVYI"},"agent_actions":{"view_html":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45","download_json":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45.json","view_paper":"https://pith.science/paper/7NJFGVYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09957&json=true","fetch_graph":"https://pith.science/api/pith-number/7NJFGVYIBEWRGIF34WT6URZU45/graph.json","fetch_events":"https://pith.science/api/pith-number/7NJFGVYIBEWRGIF34WT6URZU45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45/action/storage_attestation","attest_author":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45/action/author_attestation","sign_citation":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45/action/citation_signature","submit_replication":"https://pith.science/pith/7NJFGVYIBEWRGIF34WT6URZU45/action/replication_record"}},"created_at":"2026-07-05T11:23:18.212227+00:00","updated_at":"2026-07-05T11:23:18.212227+00:00"}