{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZZLPML3KR32JCTI2PKOCWU4DIE","short_pith_number":"pith:ZZLPML3K","schema_version":"1.0","canonical_sha256":"ce56f62f6a8ef4914d1a7a9c2b538341235ee9745f71f50f6e77a0f8e578c3b7","source":{"kind":"arxiv","id":"2005.07427","version":2},"attestation_state":"computed","paper":{"title":"Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Luo, Ding Li, Haifeng Chen, Jiaping Gui, Jingchao Ni, Lei Cai, Zhengzhang Chen","submitted_at":"2020-05-15T09:17:08Z","abstract_excerpt":"Detecting anomalies in dynamic graphs is a vital task, with numerous practical applications in areas such as security, finance, and social media. Previous network embedding based methods have been mostly focusing on learning good node representations, whereas largely ignoring the subgraph structural changes related to the target nodes in dynamic graphs. In this paper, we propose StrGNN, an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propo"},"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":"2005.07427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-15T09:17:08Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f9f6e02255b628f8f9ae6bc1546e73d3becee5e15eab65ef37c40a35e7abfea7","abstract_canon_sha256":"107731726da4af2ed32ca53ff1f41efc036f2ffd64559b7447e357b03cfc8abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:27.499881Z","signature_b64":"M6s95/glfx8hnNdKQ8CkWdhnoiWA35GTFEIz7b3jOLIYvO1MqcC99jTG8QgKFnqxXlkqpHonk+ZaNCViocHeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce56f62f6a8ef4914d1a7a9c2b538341235ee9745f71f50f6e77a0f8e578c3b7","last_reissued_at":"2026-07-05T01:05:27.499420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:27.499420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Luo, Ding Li, Haifeng Chen, Jiaping Gui, Jingchao Ni, Lei Cai, Zhengzhang Chen","submitted_at":"2020-05-15T09:17:08Z","abstract_excerpt":"Detecting anomalies in dynamic graphs is a vital task, with numerous practical applications in areas such as security, finance, and social media. Previous network embedding based methods have been mostly focusing on learning good node representations, whereas largely ignoring the subgraph structural changes related to the target nodes in dynamic graphs. In this paper, we propose StrGNN, an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07427","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/2005.07427/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":"2005.07427","created_at":"2026-07-05T01:05:27.499490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07427v2","created_at":"2026-07-05T01:05:27.499490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07427","created_at":"2026-07-05T01:05:27.499490+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZLPML3KR32J","created_at":"2026-07-05T01:05:27.499490+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZLPML3KR32JCTI2","created_at":"2026-07-05T01:05:27.499490+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZLPML3K","created_at":"2026-07-05T01:05:27.499490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15354","citing_title":"Unified Semantic Log Parsing and Causal Graph Construction for Attack Attribution","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE","json":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE.json","graph_json":"https://pith.science/api/pith-number/ZZLPML3KR32JCTI2PKOCWU4DIE/graph.json","events_json":"https://pith.science/api/pith-number/ZZLPML3KR32JCTI2PKOCWU4DIE/events.json","paper":"https://pith.science/paper/ZZLPML3K"},"agent_actions":{"view_html":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE","download_json":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE.json","view_paper":"https://pith.science/paper/ZZLPML3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07427&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZLPML3KR32JCTI2PKOCWU4DIE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZLPML3KR32JCTI2PKOCWU4DIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE/action/storage_attestation","attest_author":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE/action/author_attestation","sign_citation":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE/action/citation_signature","submit_replication":"https://pith.science/pith/ZZLPML3KR32JCTI2PKOCWU4DIE/action/replication_record"}},"created_at":"2026-07-05T01:05:27.499490+00:00","updated_at":"2026-07-05T01:05:27.499490+00:00"}