Fixed-Candidate Reliability Auditing for Closed-Set Binary Function Retrieval Under Known-Source Cross-Compilation Protocols
Entropy · 21.08.2026 · 28 (8) · 938
DOI: 10.3390/e28080938 ↗Kurz gefasst
Fachartikel in der Zeitschrift Entropy, online erschienen am 21.08.2026. Verfasst von Yiming An und 3 weiteren Autor:innen. Beteiligte Einrichtung: Detroit Green Technology Institute, Hubei University of Technology, Wuhan 430068, China. Die Arbeit nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Binary code similarity detection (BCSD) ranks candidates but does not quantify the reliability of an already selected Top-1 match. We study this post-retrieval problem in a known-source, closed-set protocol: the target Top-1 is frozen before same-source cross-compilation views are queried, so auxiliary evidence audits cannot replace it. A frozen 34-variable map feeds a low-capacity logistic model with project-grouped cross-fitting, Platt calibration, and training-side threshold selection. On 413 families from 16 projects, cross-view evidence improved discrimination over target score/margin features. GCC-O0 was a dominant-anchor regime: Full showed no statistically resolved ROC-AUC gain over Primary-anchor, whereas Clang-O0 benefited from complementary non-primary evidence. On 240 project-identity-disjoint families from 55 projects, the design-locked structural branch accepted 75/240 GCC and 99/240 Clang candidates (31.3%/41.3% coverage) with no observed family-level errors. Correspondence mismatch reduced discrimination toward chance. Corrected TF-IDF remained supportive because correction followed label access. The contribution of this paper is a versioned candidate-preserving audit interface with explicit evidence and deployment boundaries, but not a universal retrieval improvement or distribution-free guarantee.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Detroit Green Technology Institute, Hubei University of Technology, Wuhan 430068, China.
- School of Computer Science and Artificial Intelligence, Hubei University of Technology, Wuhan 430068, China.
- Department of Information-Measuring Technologies, Lviv Polytechnic National University, 79013 Lviv, Ukraine.
ORCID-Profile: Yanshu Yu, Orest Kochan
Zitieren
APA
An, Y., Yu, Y., Li, W., & Kochan, O. (2026). Fixed-Candidate Reliability Auditing for Closed-Set Binary Function Retrieval Under Known-Source Cross-Compilation Protocols. Entropy, 28(8), 938. https://doi.org/10.3390/e28080938
Vancouver
An Y, Yu Y, Li W, Kochan O. Fixed-Candidate Reliability Auditing for Closed-Set Binary Function Retrieval Under Known-Source Cross-Compilation Protocols. Entropy. 2026;28(8):938. doi:10.3390/e28080938
BibTeX
@article{An2026,
author = {An, Yiming and Yu, Yanshu and Li, Weidong and Kochan, Orest},
title = {Fixed-Candidate Reliability Auditing for Closed-Set Binary Function Retrieval Under Known-Source Cross-Compilation Protocols},
journal = {Entropy},
year = {2026},
volume = {28},
number = {8},
pages = {938},
doi = {10.3390/e28080938}
}
EUVIMED