{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Q5CB3UADRUGNX32UBDE2CGUKUX","short_pith_number":"pith:Q5CB3UAD","canonical_record":{"source":{"id":"1110.2704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-12T17:06:12Z","cross_cats_sorted":[],"title_canon_sha256":"c8aff1f33fcfe4c87b602ea2378784bcc7e2dc28ae8aff8fda6761d1257d4627","abstract_canon_sha256":"6220ea419ad42dbba5320ddc529d4f1a378956c14f013e4fa1184c198a0383fd"},"schema_version":"1.0"},"canonical_sha256":"87441dd0038d0cdbef5408c9a11a8aa5c92d2881215415aef49d692c87244193","source":{"kind":"arxiv","id":"1110.2704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2704","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2704v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2704","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q5CB3UADRUGN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q5CB3UADRUGNX32U","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q5CB3UAD","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Q5CB3UADRUGNX32UBDE2CGUKUX","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-12T17:06:12Z","cross_cats_sorted":[],"title_canon_sha256":"c8aff1f33fcfe4c87b602ea2378784bcc7e2dc28ae8aff8fda6761d1257d4627","abstract_canon_sha256":"6220ea419ad42dbba5320ddc529d4f1a378956c14f013e4fa1184c198a0383fd"},"schema_version":"1.0"},"canonical_sha256":"87441dd0038d0cdbef5408c9a11a8aa5c92d2881215415aef49d692c87244193","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:07.762501Z","signature_b64":"5GAYHWIv+me45rZ1qWMTgsmRxGPjdSDMBrKlkZORHrR9uURSB/3u3uU/Oyjg7JjAhk5EKhcn1BgfLe4BMTYFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87441dd0038d0cdbef5408c9a11a8aa5c92d2881215415aef49d692c87244193","last_reissued_at":"2026-05-18T04:11:07.762032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:07.762032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2704","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWkqKTg/bLCvNaGmre2Mpr9XI6o2pKMBTdQEAGILzivF/qRSUwj0QPQ93mQWtqC52zxXqb1D3H3H8sPiia/ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:26:43.156104Z"},"content_sha256":"dea855086ad8d5268a798955d78600b195a48fbfe02d9a43c3674ec7eb076472","schema_version":"1.0","event_id":"sha256:dea855086ad8d5268a798955d78600b195a48fbfe02d9a43c3674ec7eb076472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Q5CB3UADRUGNX32UBDE2CGUKUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Fuzzy Clustering-Based Approach for Intrusion Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Huu Hoa Nguyen (ERIC), J\\'er\\^ome Darmont (ERIC), Nouria Harbi (ERIC)","submitted_at":"2011-10-12T17:06:12Z","abstract_excerpt":"The need to increase accuracy in detecting sophisticated cyber attacks poses a great challenge not only to the research community but also to corporations. So far, many approaches have been proposed to cope with this threat. Among them, data mining has brought on remarkable contributions to the intrusion detection problem. However, the generalization ability of data mining-based methods remains limited, and hence detecting sophisticated attacks remains a tough task. In this thread, we present a novel method based on both clustering and classification for developing an efficient intrusion detec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2704","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja4ybDDzgX3UiFsvQMcPUFrU5Gqqxs90pYyjiMaZkuMLYivCXWOtkkaLdRwBLQ9Bu9BFhoW5xiw0aM+GiRTwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:26:43.156762Z"},"content_sha256":"84c98f73354ac12fcab8fade64f28500433e5cb3febd5a3d702efc2f43addcce","schema_version":"1.0","event_id":"sha256:84c98f73354ac12fcab8fade64f28500433e5cb3febd5a3d702efc2f43addcce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/bundle.json","state_url":"https://pith.science/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/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-06-09T11:26:43Z","links":{"resolver":"https://pith.science/pith/Q5CB3UADRUGNX32UBDE2CGUKUX","bundle":"https://pith.science/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/bundle.json","state":"https://pith.science/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5CB3UADRUGNX32UBDE2CGUKUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q5CB3UADRUGNX32UBDE2CGUKUX","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":"6220ea419ad42dbba5320ddc529d4f1a378956c14f013e4fa1184c198a0383fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-12T17:06:12Z","title_canon_sha256":"c8aff1f33fcfe4c87b602ea2378784bcc7e2dc28ae8aff8fda6761d1257d4627"},"schema_version":"1.0","source":{"id":"1110.2704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2704","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2704v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2704","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q5CB3UADRUGN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q5CB3UADRUGNX32U","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q5CB3UAD","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:84c98f73354ac12fcab8fade64f28500433e5cb3febd5a3d702efc2f43addcce","target":"graph","created_at":"2026-05-18T04:11:07Z","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":"The need to increase accuracy in detecting sophisticated cyber attacks poses a great challenge not only to the research community but also to corporations. So far, many approaches have been proposed to cope with this threat. Among them, data mining has brought on remarkable contributions to the intrusion detection problem. However, the generalization ability of data mining-based methods remains limited, and hence detecting sophisticated attacks remains a tough task. In this thread, we present a novel method based on both clustering and classification for developing an efficient intrusion detec","authors_text":"Huu Hoa Nguyen (ERIC), J\\'er\\^ome Darmont (ERIC), Nouria Harbi (ERIC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-12T17:06:12Z","title":"An Efficient Fuzzy Clustering-Based Approach for Intrusion Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2704","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:dea855086ad8d5268a798955d78600b195a48fbfe02d9a43c3674ec7eb076472","target":"record","created_at":"2026-05-18T04:11:07Z","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":"6220ea419ad42dbba5320ddc529d4f1a378956c14f013e4fa1184c198a0383fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-12T17:06:12Z","title_canon_sha256":"c8aff1f33fcfe4c87b602ea2378784bcc7e2dc28ae8aff8fda6761d1257d4627"},"schema_version":"1.0","source":{"id":"1110.2704","kind":"arxiv","version":1}},"canonical_sha256":"87441dd0038d0cdbef5408c9a11a8aa5c92d2881215415aef49d692c87244193","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87441dd0038d0cdbef5408c9a11a8aa5c92d2881215415aef49d692c87244193","first_computed_at":"2026-05-18T04:11:07.762032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:07.762032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GAYHWIv+me45rZ1qWMTgsmRxGPjdSDMBrKlkZORHrR9uURSB/3u3uU/Oyjg7JjAhk5EKhcn1BgfLe4BMTYFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:07.762501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dea855086ad8d5268a798955d78600b195a48fbfe02d9a43c3674ec7eb076472","sha256:84c98f73354ac12fcab8fade64f28500433e5cb3febd5a3d702efc2f43addcce"],"state_sha256":"d578340507706ddf2ab617f3b57a0fb082ee1bbb63d33c1896c52605e8dca54c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkIN9rLqIYkMbapWz9ZnLLqnJItdvfIDhrlIQz5PeWWjqCspQzVHg6K59pinJyqheOLJvWwfZdAPyQdGxrD3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:26:43.161089Z","bundle_sha256":"2b6d66c8d6ab216c6d44afbb0b453612e9983b5e12e911d5a32afedc5c03c02e"}}