{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:V2E3QIUCCMITT4YBZQZQLDD7X6","short_pith_number":"pith:V2E3QIUC","canonical_record":{"source":{"id":"1208.5997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-29T19:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"e42411900a9bcc8cb661f34f828903b505bd9a0c114e1e5875751490f8665b70","abstract_canon_sha256":"b0db0463ffb12cde849054ec22995728e61237934e2bc032eba85b0ea0435721"},"schema_version":"1.0"},"canonical_sha256":"ae89b82282131139f301cc33058c7fbf81aa651aedb1ce8992f5e7b507696e78","source":{"kind":"arxiv","id":"1208.5997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5997","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5997v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5997","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"V2E3QIUCCMIT","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2E3QIUCCMITT4YB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2E3QIUC","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:V2E3QIUCCMITT4YBZQZQLDD7X6","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-29T19:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"e42411900a9bcc8cb661f34f828903b505bd9a0c114e1e5875751490f8665b70","abstract_canon_sha256":"b0db0463ffb12cde849054ec22995728e61237934e2bc032eba85b0ea0435721"},"schema_version":"1.0"},"canonical_sha256":"ae89b82282131139f301cc33058c7fbf81aa651aedb1ce8992f5e7b507696e78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:48.125093Z","signature_b64":"ugmXHrS7BzTUM1wADsJbWO66375WlhYULFyqQmNFKSgfvEZu5bIWMhWLF5nL/JXbYzvA0tWIkIyzGZrUXd5uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae89b82282131139f301cc33058c7fbf81aa651aedb1ce8992f5e7b507696e78","last_reissued_at":"2026-05-18T03:46:48.124389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:48.124389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5997","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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZavFbB6PKd6Swtr2xtK0O5N3YMxX1QkaTiRQ7+IFG1HeXW1Jt2Ilnjx3dFdzqI1jOYjlZUuvvM4CPyoCWkb+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:43:39.627654Z"},"content_sha256":"23846729ba3230d0067bb1ef8d29303dce6125bebcc3cef1c4162d3692e4661e","schema_version":"1.0","event_id":"sha256:23846729ba3230d0067bb1ef8d29303dce6125bebcc3cef1c4162d3692e4661e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:V2E3QIUCCMITT4YBZQZQLDD7X6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phases vs. Levels using Decision Trees for Intrusion Detection Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Heba Ezzat Ibrahim, Mohamed A. Shaheen, Sherif M. Badr","submitted_at":"2012-08-29T19:24:24Z","abstract_excerpt":"Security of computers and the networks that connect them is increasingly becoming of great significance. Intrusion detection system is one of the security defense tools for computer networks. This paper compares two different model Approaches for representing intrusion detection system by using decision tree techniques. These approaches are Phase-model approach and Level-model approach. Each model is implemented by using two techniques, New Attacks and Data partitioning techniques. The experimental results showed that Phase approach has higher classification rate in both New Attacks and Data P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5997","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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXS7HC0GSoOh1BMFRo6JG8yCZFsQvDQdBM+sdMPISXGxCNw6eXI54hwSuL+NtGbGhig4xbDhvSLrOtk96qBRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:43:39.628256Z"},"content_sha256":"3aaf776e2a9fc7d20bd433e9f093551d77d32d221e7bc89eaa8d2231287e4fb3","schema_version":"1.0","event_id":"sha256:3aaf776e2a9fc7d20bd433e9f093551d77d32d221e7bc89eaa8d2231287e4fb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/bundle.json","state_url":"https://pith.science/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/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-07-01T23:43:39Z","links":{"resolver":"https://pith.science/pith/V2E3QIUCCMITT4YBZQZQLDD7X6","bundle":"https://pith.science/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/bundle.json","state":"https://pith.science/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2E3QIUCCMITT4YBZQZQLDD7X6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V2E3QIUCCMITT4YBZQZQLDD7X6","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":"b0db0463ffb12cde849054ec22995728e61237934e2bc032eba85b0ea0435721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-29T19:24:24Z","title_canon_sha256":"e42411900a9bcc8cb661f34f828903b505bd9a0c114e1e5875751490f8665b70"},"schema_version":"1.0","source":{"id":"1208.5997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5997","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5997v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5997","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"V2E3QIUCCMIT","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2E3QIUCCMITT4YB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2E3QIUC","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:3aaf776e2a9fc7d20bd433e9f093551d77d32d221e7bc89eaa8d2231287e4fb3","target":"graph","created_at":"2026-05-18T03:46:48Z","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":"Security of computers and the networks that connect them is increasingly becoming of great significance. Intrusion detection system is one of the security defense tools for computer networks. This paper compares two different model Approaches for representing intrusion detection system by using decision tree techniques. These approaches are Phase-model approach and Level-model approach. Each model is implemented by using two techniques, New Attacks and Data partitioning techniques. The experimental results showed that Phase approach has higher classification rate in both New Attacks and Data P","authors_text":"Heba Ezzat Ibrahim, Mohamed A. Shaheen, Sherif M. Badr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-29T19:24:24Z","title":"Phases vs. Levels using Decision Trees for Intrusion Detection Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5997","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:23846729ba3230d0067bb1ef8d29303dce6125bebcc3cef1c4162d3692e4661e","target":"record","created_at":"2026-05-18T03:46:48Z","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":"b0db0463ffb12cde849054ec22995728e61237934e2bc032eba85b0ea0435721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-29T19:24:24Z","title_canon_sha256":"e42411900a9bcc8cb661f34f828903b505bd9a0c114e1e5875751490f8665b70"},"schema_version":"1.0","source":{"id":"1208.5997","kind":"arxiv","version":1}},"canonical_sha256":"ae89b82282131139f301cc33058c7fbf81aa651aedb1ce8992f5e7b507696e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae89b82282131139f301cc33058c7fbf81aa651aedb1ce8992f5e7b507696e78","first_computed_at":"2026-05-18T03:46:48.124389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:48.124389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ugmXHrS7BzTUM1wADsJbWO66375WlhYULFyqQmNFKSgfvEZu5bIWMhWLF5nL/JXbYzvA0tWIkIyzGZrUXd5uAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:48.125093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23846729ba3230d0067bb1ef8d29303dce6125bebcc3cef1c4162d3692e4661e","sha256:3aaf776e2a9fc7d20bd433e9f093551d77d32d221e7bc89eaa8d2231287e4fb3"],"state_sha256":"7d13e8c165e4d613065dec8bc2ea4ff7e2710f63a993fab0c7f5373d9a001b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHwQDTPhRLR5/BLeWpmG2//X/4xTuPCCrAM/ANkY/00J5pqtizD26LJFOla9ggKCRRzWR842o5RJ+tLCos4/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:43:39.632002Z","bundle_sha256":"be70eefc1bf9f19ad7e4a3835ca8275fb6cf4d3a9bf24ccedb2cb56784d45f30"}}