{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FJYLVFEXUZQYDDXHYVESRKWYVI","short_pith_number":"pith:FJYLVFEX","canonical_record":{"source":{"id":"1812.10748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T15:56:07Z","cross_cats_sorted":[],"title_canon_sha256":"f628d35f765b869e8b284b8f68f4be9a77e50e0bb9eada846e91fd54620b0b31","abstract_canon_sha256":"f64a5d8b1084cd6e510eaf83b46b0e7cb16e41a1ad1451feab60ab9911f9b909"},"schema_version":"1.0"},"canonical_sha256":"2a70ba9497a661818ee7c54928aad8aa1730bdbee51be01f9ac32f908f3ed143","source":{"kind":"arxiv","id":"1812.10748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10748","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10748v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10748","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"FJYLVFEXUZQY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJYLVFEXUZQYDDXH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJYLVFEX","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FJYLVFEXUZQYDDXHYVESRKWYVI","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T15:56:07Z","cross_cats_sorted":[],"title_canon_sha256":"f628d35f765b869e8b284b8f68f4be9a77e50e0bb9eada846e91fd54620b0b31","abstract_canon_sha256":"f64a5d8b1084cd6e510eaf83b46b0e7cb16e41a1ad1451feab60ab9911f9b909"},"schema_version":"1.0"},"canonical_sha256":"2a70ba9497a661818ee7c54928aad8aa1730bdbee51be01f9ac32f908f3ed143","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.096406Z","signature_b64":"e1FSsrVwzmDUlysdGfzfnxltiifEveHSeQhvrb7NYFapKbNmc3d63MnzsTxmL7fJH76IakFAHm5U2ghE1M7JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a70ba9497a661818ee7c54928aad8aa1730bdbee51be01f9ac32f908f3ed143","last_reissued_at":"2026-05-17T23:57:20.095860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.095860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10748","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFCO6ENqQa374Vm6886ZN5SWQGYHj9CiGAb1EiFxUiLOrHYEF+BU9CgsiB8vT5Mbv137zfLEtyJN3XNVcSa8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:09:01.983612Z"},"content_sha256":"e91a47131c3691488d9a06ddf9d5e3e604792f194d77952c9b48d457090f8fd6","schema_version":"1.0","event_id":"sha256:e91a47131c3691488d9a06ddf9d5e3e604792f194d77952c9b48d457090f8fd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FJYLVFEXUZQYDDXHYVESRKWYVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anna Mpanti, Iosif Polenakis, Stavros D. Nikolopoulos","submitted_at":"2018-12-27T15:56:07Z","abstract_excerpt":"In this work we propose a graph-based model that, utilizing relations between groups of System-calls, distinguishes malicious from benign software samples and classifies the detected malicious samples to one of a set of known malware families. More precisely, given a System-call Dependency Graph (ScDG) that depicts the malware's behavior, we first transform it to a more abstract representation, utilizing the indexing of System-calls to a set of groups of similar functionality, constructing thus an abstract and mutation-tolerant graph that we call Group Relation Graph (GrG); then, we construct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10748","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgEqT14OxCPBXZUbabDpYeQ5Qp0sN7XcnAYKjIERpXBWWBTc/0py8NAU623rPEXP/82bIDwe2WnKOIiLcwW+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:09:01.983950Z"},"content_sha256":"b20a58a1d72ed8880ae81201870d8f9ccfa4faef67b22a3dfe58e9a1bf76744a","schema_version":"1.0","event_id":"sha256:b20a58a1d72ed8880ae81201870d8f9ccfa4faef67b22a3dfe58e9a1bf76744a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/bundle.json","state_url":"https://pith.science/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/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-22T23:09:01Z","links":{"resolver":"https://pith.science/pith/FJYLVFEXUZQYDDXHYVESRKWYVI","bundle":"https://pith.science/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/bundle.json","state":"https://pith.science/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJYLVFEXUZQYDDXHYVESRKWYVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FJYLVFEXUZQYDDXHYVESRKWYVI","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":"f64a5d8b1084cd6e510eaf83b46b0e7cb16e41a1ad1451feab60ab9911f9b909","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T15:56:07Z","title_canon_sha256":"f628d35f765b869e8b284b8f68f4be9a77e50e0bb9eada846e91fd54620b0b31"},"schema_version":"1.0","source":{"id":"1812.10748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10748","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10748v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10748","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"FJYLVFEXUZQY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJYLVFEXUZQYDDXH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJYLVFEX","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:b20a58a1d72ed8880ae81201870d8f9ccfa4faef67b22a3dfe58e9a1bf76744a","target":"graph","created_at":"2026-05-17T23:57:20Z","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":"In this work we propose a graph-based model that, utilizing relations between groups of System-calls, distinguishes malicious from benign software samples and classifies the detected malicious samples to one of a set of known malware families. More precisely, given a System-call Dependency Graph (ScDG) that depicts the malware's behavior, we first transform it to a more abstract representation, utilizing the indexing of System-calls to a set of groups of similar functionality, constructing thus an abstract and mutation-tolerant graph that we call Group Relation Graph (GrG); then, we construct ","authors_text":"Anna Mpanti, Iosif Polenakis, Stavros D. Nikolopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T15:56:07Z","title":"Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10748","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:e91a47131c3691488d9a06ddf9d5e3e604792f194d77952c9b48d457090f8fd6","target":"record","created_at":"2026-05-17T23:57:20Z","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":"f64a5d8b1084cd6e510eaf83b46b0e7cb16e41a1ad1451feab60ab9911f9b909","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T15:56:07Z","title_canon_sha256":"f628d35f765b869e8b284b8f68f4be9a77e50e0bb9eada846e91fd54620b0b31"},"schema_version":"1.0","source":{"id":"1812.10748","kind":"arxiv","version":1}},"canonical_sha256":"2a70ba9497a661818ee7c54928aad8aa1730bdbee51be01f9ac32f908f3ed143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a70ba9497a661818ee7c54928aad8aa1730bdbee51be01f9ac32f908f3ed143","first_computed_at":"2026-05-17T23:57:20.095860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:20.095860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e1FSsrVwzmDUlysdGfzfnxltiifEveHSeQhvrb7NYFapKbNmc3d63MnzsTxmL7fJH76IakFAHm5U2ghE1M7JDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:20.096406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e91a47131c3691488d9a06ddf9d5e3e604792f194d77952c9b48d457090f8fd6","sha256:b20a58a1d72ed8880ae81201870d8f9ccfa4faef67b22a3dfe58e9a1bf76744a"],"state_sha256":"b6a427faa084d088c415431ecf3d63870edd3dd8b8d68bc1776e08bf8e4f527f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iMGQI8ajqkGq7VKXu8hczJTfjppWZ+BfHzv7vfDDpu1Yn7MUEgJeK92QQnvLJvdZYlYA/YZ5anCL7usSVHsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:09:01.985931Z","bundle_sha256":"e044933b6d476d1e08e9a46a2de522e00bfb7a0e5463cce96a6c2a6dcd22ea69"}}