{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GE3VZKZ5FDQOGZDDRG26LZSDAE","short_pith_number":"pith:GE3VZKZ5","schema_version":"1.0","canonical_sha256":"31375cab3d28e0e3646389b5e5e643013497bfbd642a7b6e0399d0b8e43753c0","source":{"kind":"arxiv","id":"2009.08452","version":3},"attestation_state":"computed","paper":{"title":"Real-Time Anomaly Detection in Edge Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Christos Faloutsos, Kijung Shin, Minji Yoon, Rui Liu, Siddharth Bhatia","submitted_at":"2020-09-17T17:59:27Z","abstract_excerpt":"Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges in an online manner, for the purpose of detecting unusual behavior, using constant time and memory? Existing approaches aim to detect individually surprising edges. In this work, we propose MIDAS, which focuses on detecting microcluster anomalies, or suddenly arriving groups of suspiciously similar edges, such as lockstep behavior, including denial of service attacks in network traffic data. We further propose MIDAS-F, to solve the problem by which anomalies are incorporated into the algorithm's inter"},"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":"2009.08452","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T17:59:27Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"59b20d5979ca3093c7c1945f3a8f11e32df435972fa051bb7e1111bf634b8449","abstract_canon_sha256":"1f79d5bc107a88596eb4d1e320472cd6fb1f973354e9a35480a223394d7ded34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:12.994685Z","signature_b64":"eIbXNmtaTPC3rUUnkNKqLjpn3UXgY6Os3YPoTwS8ZdOetmUiGt7Y9nmkEh/n0UrFgvfdUbVB77iTAtBaO4qRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31375cab3d28e0e3646389b5e5e643013497bfbd642a7b6e0399d0b8e43753c0","last_reissued_at":"2026-07-05T04:17:12.994199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:12.994199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Anomaly Detection in Edge Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Christos Faloutsos, Kijung Shin, Minji Yoon, Rui Liu, Siddharth Bhatia","submitted_at":"2020-09-17T17:59:27Z","abstract_excerpt":"Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges in an online manner, for the purpose of detecting unusual behavior, using constant time and memory? Existing approaches aim to detect individually surprising edges. In this work, we propose MIDAS, which focuses on detecting microcluster anomalies, or suddenly arriving groups of suspiciously similar edges, such as lockstep behavior, including denial of service attacks in network traffic data. We further propose MIDAS-F, to solve the problem by which anomalies are incorporated into the algorithm's inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08452","kind":"arxiv","version":3},"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/2009.08452/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":"2009.08452","created_at":"2026-07-05T04:17:12.994260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.08452v3","created_at":"2026-07-05T04:17:12.994260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08452","created_at":"2026-07-05T04:17:12.994260+00:00"},{"alias_kind":"pith_short_12","alias_value":"GE3VZKZ5FDQO","created_at":"2026-07-05T04:17:12.994260+00:00"},{"alias_kind":"pith_short_16","alias_value":"GE3VZKZ5FDQOGZDD","created_at":"2026-07-05T04:17:12.994260+00:00"},{"alias_kind":"pith_short_8","alias_value":"GE3VZKZ5","created_at":"2026-07-05T04:17:12.994260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE","json":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE.json","graph_json":"https://pith.science/api/pith-number/GE3VZKZ5FDQOGZDDRG26LZSDAE/graph.json","events_json":"https://pith.science/api/pith-number/GE3VZKZ5FDQOGZDDRG26LZSDAE/events.json","paper":"https://pith.science/paper/GE3VZKZ5"},"agent_actions":{"view_html":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE","download_json":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE.json","view_paper":"https://pith.science/paper/GE3VZKZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.08452&json=true","fetch_graph":"https://pith.science/api/pith-number/GE3VZKZ5FDQOGZDDRG26LZSDAE/graph.json","fetch_events":"https://pith.science/api/pith-number/GE3VZKZ5FDQOGZDDRG26LZSDAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE/action/storage_attestation","attest_author":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE/action/author_attestation","sign_citation":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE/action/citation_signature","submit_replication":"https://pith.science/pith/GE3VZKZ5FDQOGZDDRG26LZSDAE/action/replication_record"}},"created_at":"2026-07-05T04:17:12.994260+00:00","updated_at":"2026-07-05T04:17:12.994260+00:00"}