{"url":"/sota/malware-classification-on-malevis","task":{"name":"Malware Classification","url":"/task/malware-classification","note":null},"dataset":{"name":"MaleVis","url":null},"category":"Miscellaneous","categories":["Miscellaneous"],"category_note":null,"description":"**Malware Classification** is the process of assigning a malware sample to a specific malware family. Malware within a family shares similar properties that can be used to create signatures for detection and classification. Signatures can be categorized as static or dynamic based on how they are extracted. A static signature can be based on a byte-code sequence, binary assembly instruction, or an imported Dynamic Link Library (DLL). Dynamic signatures can be based on file system activities, terminal commands, network communications, or function and system call sequences.\r\n\r\n\r\n<span class=\"description-source\">Source: [Behavioral Malware Classification using Convolutional Recurrent Neural Networks ](https://arxiv.org/abs/1811.07842)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":1,"rows_with_code":1,"rows_with_paper_page":1,"rows_dated":1,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"Levit-MC","metrics":{"Accuracy":"96.6"},"uses_additional_data":true,"paper_date":"2024-09-28","paper":"/paper/accelerating-malware-classification-a-vision","paper_url":"https://arxiv.org/abs/2409.19461v1","paper_title":"Accelerating Malware Classification: A Vision Transformer Solution","code":"https://github.com/Shrey-55/MalwareClassification","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":1,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}