{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7TJRLBPYYKEA52EDP743YK5UHC","short_pith_number":"pith:7TJRLBPY","canonical_record":{"source":{"id":"1812.09059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-21T11:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"3edfd6ac17589879e88a161bceda7f7ecd70bf7c1ee31ad29c397265f2c78b3a","abstract_canon_sha256":"f4791430c87475ea9f3a5ef61c019e5a611ba974d17894dd3e38894b7a5aded5"},"schema_version":"1.0"},"canonical_sha256":"fcd31585f8c2880ee8837ff9bc2bb438bbe3270d80231f8950dddf64c40ea314","source":{"kind":"arxiv","id":"1812.09059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09059","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09059v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09059","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"7TJRLBPYYKEA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7TJRLBPYYKEA52ED","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7TJRLBPY","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7TJRLBPYYKEA52EDP743YK5UHC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-21T11:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"3edfd6ac17589879e88a161bceda7f7ecd70bf7c1ee31ad29c397265f2c78b3a","abstract_canon_sha256":"f4791430c87475ea9f3a5ef61c019e5a611ba974d17894dd3e38894b7a5aded5"},"schema_version":"1.0"},"canonical_sha256":"fcd31585f8c2880ee8837ff9bc2bb438bbe3270d80231f8950dddf64c40ea314","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:45.525763Z","signature_b64":"zi9bnmLPEaBnHhcV4FrSYdeHBiqrstASfJyySoN3EWUSadKInSjCM8Ld58H64tOk7DntzKg92JzZsMU9OD1OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd31585f8c2880ee8837ff9bc2bb438bbe3270d80231f8950dddf64c40ea314","last_reissued_at":"2026-05-17T23:57:45.525280Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:45.525280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvO5vpvMPUxfFSGuDEGVbn61VWfpJ6O/+su90Fn09MSiMf8t3BHl9V88VlXZVRQi2bCDElxVQFOpc+u3m5UyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:16:06.705427Z"},"content_sha256":"91f61209bba76db648d350af092a5199038fb345057444344fc6129178fdacb6","schema_version":"1.0","event_id":"sha256:91f61209bba76db648d350af092a5199038fb345057444344fc6129178fdacb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7TJRLBPYYKEA52EDP743YK5UHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Hierarchical Intrusion Detection System based on Decision Tree and Rules-based Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ahmed Ahmim, Helge Janicke, Leandros Maglaras, Makhlouf Derdour, Mohamed Amine Ferrag","submitted_at":"2018-12-21T11:28:27Z","abstract_excerpt":"This paper proposes a novel intrusion detection system (IDS) that combines different classifier approaches which are based on decision tree and rules-based concepts, namely, REP Tree, JRip algorithm and Forest PA. Specifically, the first and second method take as inputs features of the data set, and classify the network traffic as Attack/Benign. The third classifier uses features of the initial data set in addition to the outputs of the first and the second classifier as inputs. The experimental results obtained by analyzing the proposed IDS using the CICIDS2017 dataset, attest their superiori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09059","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehujI8W1dFSegVdc4UoqH/eb7vrdMoYs3DZW8uwp2QQONWAuKTCCmAiMDyeeK+ctuWkniz328fg88sDjBH/sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:16:06.705837Z"},"content_sha256":"5d009033168d38d752dc23b204a63860dd063b43dc0ba8d5da6bc39111a24086","schema_version":"1.0","event_id":"sha256:5d009033168d38d752dc23b204a63860dd063b43dc0ba8d5da6bc39111a24086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TJRLBPYYKEA52EDP743YK5UHC/bundle.json","state_url":"https://pith.science/pith/7TJRLBPYYKEA52EDP743YK5UHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TJRLBPYYKEA52EDP743YK5UHC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T20:16:06Z","links":{"resolver":"https://pith.science/pith/7TJRLBPYYKEA52EDP743YK5UHC","bundle":"https://pith.science/pith/7TJRLBPYYKEA52EDP743YK5UHC/bundle.json","state":"https://pith.science/pith/7TJRLBPYYKEA52EDP743YK5UHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TJRLBPYYKEA52EDP743YK5UHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7TJRLBPYYKEA52EDP743YK5UHC","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":"f4791430c87475ea9f3a5ef61c019e5a611ba974d17894dd3e38894b7a5aded5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-21T11:28:27Z","title_canon_sha256":"3edfd6ac17589879e88a161bceda7f7ecd70bf7c1ee31ad29c397265f2c78b3a"},"schema_version":"1.0","source":{"id":"1812.09059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09059","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09059v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09059","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"7TJRLBPYYKEA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7TJRLBPYYKEA52ED","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7TJRLBPY","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5d009033168d38d752dc23b204a63860dd063b43dc0ba8d5da6bc39111a24086","target":"graph","created_at":"2026-05-17T23:57:45Z","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":"This paper proposes a novel intrusion detection system (IDS) that combines different classifier approaches which are based on decision tree and rules-based concepts, namely, REP Tree, JRip algorithm and Forest PA. Specifically, the first and second method take as inputs features of the data set, and classify the network traffic as Attack/Benign. The third classifier uses features of the initial data set in addition to the outputs of the first and the second classifier as inputs. The experimental results obtained by analyzing the proposed IDS using the CICIDS2017 dataset, attest their superiori","authors_text":"Ahmed Ahmim, Helge Janicke, Leandros Maglaras, Makhlouf Derdour, Mohamed Amine Ferrag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-21T11:28:27Z","title":"A Novel Hierarchical Intrusion Detection System based on Decision Tree and Rules-based Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09059","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:91f61209bba76db648d350af092a5199038fb345057444344fc6129178fdacb6","target":"record","created_at":"2026-05-17T23:57:45Z","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":"f4791430c87475ea9f3a5ef61c019e5a611ba974d17894dd3e38894b7a5aded5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-21T11:28:27Z","title_canon_sha256":"3edfd6ac17589879e88a161bceda7f7ecd70bf7c1ee31ad29c397265f2c78b3a"},"schema_version":"1.0","source":{"id":"1812.09059","kind":"arxiv","version":1}},"canonical_sha256":"fcd31585f8c2880ee8837ff9bc2bb438bbe3270d80231f8950dddf64c40ea314","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcd31585f8c2880ee8837ff9bc2bb438bbe3270d80231f8950dddf64c40ea314","first_computed_at":"2026-05-17T23:57:45.525280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:45.525280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zi9bnmLPEaBnHhcV4FrSYdeHBiqrstASfJyySoN3EWUSadKInSjCM8Ld58H64tOk7DntzKg92JzZsMU9OD1OCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:45.525763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91f61209bba76db648d350af092a5199038fb345057444344fc6129178fdacb6","sha256:5d009033168d38d752dc23b204a63860dd063b43dc0ba8d5da6bc39111a24086"],"state_sha256":"ec29a123857343262f73292632ed728b7369aa1a22625aa75528ac988e84dcc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EMLgnr4sSTQwln6tcR0JnhcEGLv1Y25gS7oFd9CjVobd/L4NbmONVuR8VcrG/dUncnlIBFRM3HcQjThKtVDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:16:06.708630Z","bundle_sha256":"2e4157c3ff9bdac16d1430a04f5a4767b28ccc28a8db683f6737cbcb9a5f35a7"}}