{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L2UMRB6UR4KJVXDSPFI3UB3YK6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a42502521e2c325fb60792f94342fdbcaab6a8dc00da6a3d3f28a7214da318b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-22T15:54:28Z","title_canon_sha256":"f2097e95f591076a4522583745d3def2aed3f6341305460eabbc18211c04b99f"},"schema_version":"1.0","source":{"id":"1902.08538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08538","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08538v1","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08538","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"L2UMRB6UR4KJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L2UMRB6UR4KJVXDS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L2UMRB6U","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:63849bdc57c4ab0d762c8d1ae8799a77576296238dcea78a711e838bacfeb0d0","target":"graph","created_at":"2026-05-17T23:52:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Bot detection using machine learning (ML), with network flow-level features, has been extensively studied in the literature. However, existing flow-based approaches typically incur a high computational overhead and do not completely capture the network communication patterns, which can expose additional aspects of malicious hosts. Recently, bot detection systems which leverage communication graph analysis using ML have gained attention to overcome these limitations. A graph-based approach is rather intuitive, as graphs are true representations of network communications. In this paper, we propo","authors_text":"Abbas Abou Daya, Mohammad A. Salahuddin, Noura Limam, Raouf Boutaba","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-22T15:54:28Z","title":"A Graph-Based Machine Learning Approach for Bot Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08538","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a865426269b7f01894e398d407269371e84a77cd3e68c4c4c79783036d76fd61","target":"record","created_at":"2026-05-17T23:52:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a42502521e2c325fb60792f94342fdbcaab6a8dc00da6a3d3f28a7214da318b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-22T15:54:28Z","title_canon_sha256":"f2097e95f591076a4522583745d3def2aed3f6341305460eabbc18211c04b99f"},"schema_version":"1.0","source":{"id":"1902.08538","kind":"arxiv","version":1}},"canonical_sha256":"5ea8c887d48f149adc727951ba0778578ea02b5cb1d4810cb756e9d47a278a6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ea8c887d48f149adc727951ba0778578ea02b5cb1d4810cb756e9d47a278a6f","first_computed_at":"2026-05-17T23:52:56.909689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:56.909689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BOFRzPztd4hPA7haRmfPmBCcdKsm0nMbmeuMOquwE3nCZ1pmYG+Duadcd3drzQpGNoducwyjd3Hg2PT96eOlAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:56.910328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a865426269b7f01894e398d407269371e84a77cd3e68c4c4c79783036d76fd61","sha256:63849bdc57c4ab0d762c8d1ae8799a77576296238dcea78a711e838bacfeb0d0"],"state_sha256":"5003eadb9d02b68f2b5a6f32e3ce80fa41c813ab80c248140a5a0f034cdc7277"}