A static packer identifier using a Graph Matching Network and clustering reaches 93.7% macro F1 with 10 samples per packer, 98.3% with 100, and 100% recall on Themida.
IEEE Transactions on Software Engineering16(4), 483–487 (1990)
1 Pith paper cite this work, alongside 83 external citations. Polarity classification is still indexing.
1
Pith paper citing it
83
external citations · OpenAlex
citation-role summary
method 1
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
PackHero: A Scalable Graph-based Approach for Efficient Packer Identification
A static packer identifier using a Graph Matching Network and clustering reaches 93.7% macro F1 with 10 samples per packer, 98.3% with 100, and 100% recall on Themida.