{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2O3MWED6MWHRF2D5F362MEHWMM","short_pith_number":"pith:2O3MWED6","schema_version":"1.0","canonical_sha256":"d3b6cb107e658f12e87d2efda610f66329087bec0e9b4d0f145472818d8d573f","source":{"kind":"arxiv","id":"2411.06427","version":1},"attestation_state":"computed","paper":{"title":"UniGAD: Unifying Multi-level Graph Anomaly Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenyi Zi, H.Vicky Zhao, Jia Li, Jianheng Tang, Yiqing Lin, Yuan Yao","submitted_at":"2024-11-10T11:09:55Z","abstract_excerpt":"Graph Anomaly Detection (GAD) aims to identify uncommon, deviated, or suspicious objects within graph-structured data. Existing methods generally focus on a single graph object type (node, edge, graph, etc.) and often overlook the inherent connections among different object types of graph anomalies. For instance, a money laundering transaction might involve an abnormal account and the broader community it interacts with. To address this, we present UniGAD, the first unified framework for detecting anomalies at node, edge, and graph levels jointly. Specifically, we develop the Maximum Rayleigh "},"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":"2411.06427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-10T11:09:55Z","cross_cats_sorted":[],"title_canon_sha256":"98a0688687d81861e2eb47b3c303bfdbeebeadf435363781c12baf842fbcc2c8","abstract_canon_sha256":"0fc67a0a0f62fa536fee1d99df937e9dc34312422cf11d1690eb22e6161d3e2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:46.104300Z","signature_b64":"300Uc1TAkM9P18mrNkNeZTlNiej8OG/dRDGLwWv4nQb7k7KlRYobSrw07ljoxRlkRXuKFlG/kYbCKFLY2EFADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b6cb107e658f12e87d2efda610f66329087bec0e9b4d0f145472818d8d573f","last_reissued_at":"2026-07-05T09:33:46.103892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:46.103892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UniGAD: Unifying Multi-level Graph Anomaly Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenyi Zi, H.Vicky Zhao, Jia Li, Jianheng Tang, Yiqing Lin, Yuan Yao","submitted_at":"2024-11-10T11:09:55Z","abstract_excerpt":"Graph Anomaly Detection (GAD) aims to identify uncommon, deviated, or suspicious objects within graph-structured data. Existing methods generally focus on a single graph object type (node, edge, graph, etc.) and often overlook the inherent connections among different object types of graph anomalies. For instance, a money laundering transaction might involve an abnormal account and the broader community it interacts with. To address this, we present UniGAD, the first unified framework for detecting anomalies at node, edge, and graph levels jointly. Specifically, we develop the Maximum Rayleigh "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.06427","kind":"arxiv","version":1},"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/2411.06427/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":"2411.06427","created_at":"2026-07-05T09:33:46.103949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.06427v1","created_at":"2026-07-05T09:33:46.103949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.06427","created_at":"2026-07-05T09:33:46.103949+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O3MWED6MWHR","created_at":"2026-07-05T09:33:46.103949+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O3MWED6MWHRF2D5","created_at":"2026-07-05T09:33:46.103949+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O3MWED6","created_at":"2026-07-05T09:33:46.103949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09254","citing_title":"AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly Detection","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM","json":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM.json","graph_json":"https://pith.science/api/pith-number/2O3MWED6MWHRF2D5F362MEHWMM/graph.json","events_json":"https://pith.science/api/pith-number/2O3MWED6MWHRF2D5F362MEHWMM/events.json","paper":"https://pith.science/paper/2O3MWED6"},"agent_actions":{"view_html":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM","download_json":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM.json","view_paper":"https://pith.science/paper/2O3MWED6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.06427&json=true","fetch_graph":"https://pith.science/api/pith-number/2O3MWED6MWHRF2D5F362MEHWMM/graph.json","fetch_events":"https://pith.science/api/pith-number/2O3MWED6MWHRF2D5F362MEHWMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM/action/storage_attestation","attest_author":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM/action/author_attestation","sign_citation":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM/action/citation_signature","submit_replication":"https://pith.science/pith/2O3MWED6MWHRF2D5F362MEHWMM/action/replication_record"}},"created_at":"2026-07-05T09:33:46.103949+00:00","updated_at":"2026-07-05T09:33:46.103949+00:00"}