Dmitry Martysyuk
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dmitry Martysyuk has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Ivan Malashin
Bauman Moscow State Technical University, Moscow, Russian Federation
22 shared publications - Vadim Sergeevich Tynchenko
Bauman Moscow State Technical University, Moscow, Russian Federation
21 shared publications - Aleksei Borodulin
Bauman Moscow State Technical University, Moscow, Russian Federation
18 shared publications - Andrei Gantimurov
Bauman Moscow State Technical University, Moscow, Russian Federation
18 shared publications - Vladimir Nelyub
Bauman Moscow State Technical University, Moscow, Russian Federation
18 shared publications - A. L. Galinovskii
Bauman Moscow State Technical University, Moscow, Russia
6 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PhysMelt: Physics-Anchored Temporal Regime Discovery for Edge Monitoring of Laser Powder Bed Fusion
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPhysMelt: Physics-Anchored Temporal Regime Discovery for Edge Monitoring of Laser Powder Bed Fusion
- Open Access
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 5-11
TaxVerif: Verification-Oriented COBOL Tax-Code Migration via Invariant Extraction and Semantic Validation
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 5-11
Open AccessTaxVerif: Verification-Oriented COBOL Tax-Code Migration via Invariant Extraction and Semantic Validation
- Open Access
VeriCrypt-Agent: Evidence-Grounded Multi-Agent Verification for Cryptographic Dependency Updates
Cryptographic dependency updates can install cleanly and pass visible regression tests while changing project-facing behavior or leaving an application inside a vulnerable version range. This study presents VeriCrypt-Agent, an evidence-grounded workflow for bounded-autonomy cryptographic maintenance. The system combines a frozen snapshot of release/advisory evidence, a public catalog of project-level executable probes, cross-version execution under old and candidate dependency versions, role-specialized LLM reasoning, and a deterministic decision gate. Automatic merging is allowed only when mandatory probes pass, policy constraints are satisfied, and the audit record is complete. On CryptoUpdate-Mini-30, ten unique package-version transitions are evaluated through 30 controlled executions. Visible tests accept all five non-mergeable transitions, while advisory-only screening accepts two of five. The deterministic All-Probes Gate performs best on this benchmark, with perfect transition-level decisions and no review cases, when all relevant probes are already known and inexpensive. The full workflow observes no unsafe auto-merges (0/5; exact 95% CI: 0.000–0.522) and routes 9/30 executions to review (0.30; exact 95% CI: 0.147–0.494). Removing grounding accepts three of five non-mergeable transitions, and a fixed probe budget accepts two of five. On 48 blinded static crypto-API audit files, including 32 unsafe cases, two-pass review detects 20/32 unsafe cases (0.625; exact 95% CI: 0.437–0.789) and reaches macro-F1 . These point estimates characterize evidence-backed release decisions only under the evaluated conditions; they do not establish general superiority over exhaustive deterministic testing or a deployable static vulnerability detector.Open AccessVeriCrypt-Agent: Evidence-Grounded Multi-Agent Verification for Cryptographic Dependency Updates
Cryptographic dependency updates can install cleanly and pass visible regression tests while changing project-facing behavior or leaving an application inside a vulnerable version range. This study presents VeriCrypt-Agent, an evidence-grounded workflow for bounded-autonomy cryptographic maintenance. The system combines a frozen snapshot of release/advisory evidence, a public catalog of project-level executable probes, cross-version execution under old and candidate dependency versions, role-specialized LLM reasoning, and a deterministic decision gate. Automatic merging is allowed only when mandatory probes pass, policy constraints are satisfied, and the audit record is complete. On CryptoUpdate-Mini-30, ten unique package-version transitions are evaluated through 30 controlled executions. Visible tests accept all five non-mergeable transitions, while advisory-only screening accepts two of five. The deterministic All-Probes Gate performs best on this benchmark, with perfect transition-level decisions and no review cases, when all relevant probes are already known and inexpensive. The full workflow observes no unsafe auto-merges (0/5; exact 95% CI: 0.000–0.522) and routes 9/30 executions to review (0.30; exact 95% CI: 0.147–0.494). Removing grounding accepts three of five non-mergeable transitions, and a fixed probe budget accepts two of five. On 48 blinded static crypto-API audit files, including 32 unsafe cases, two-pass review detects 20/32 unsafe cases (0.625; exact 95% CI: 0.437–0.789) and reaches macro-F1 . These point estimates characterize evidence-backed release decisions only under the evaluated conditions; they do not establish general superiority over exhaustive deterministic testing or a deployable static vulnerability detector. - Open Access
- 12 September 2026
- Published by Springer Nature in Discover Materials
Torsional damage analysis of metallic materials using simulation-guided defect assessment
- 12 September 2026
- Published by Springer Nature in Discover Materials
Open AccessTorsional damage analysis of metallic materials using simulation-guided defect assessment
- 30 July 2026
- Published by Springer Nature
- p. 257-267
Intelligent Visual Inspection of FDM Parts Using Machine Learning and Computer Vision
- 30 July 2026
- Published by Springer Nature
- p. 257-267
Intelligent Visual Inspection of FDM Parts Using Machine Learning and Computer Vision
- Open Access
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 721-728
LLM-augmented Hybrid Recommendation System for Structured Classification of Customs Commodity Descriptions
This paper presents a pipeline for structured information extraction and commodity classification from unstructured customs declaration texts using a sparse Mixture-of-Experts large language model with deterministic post-processing and rule-based validation, and integrates the extracted outputs into an interactive recommendation system that supports customs officers in classification and decision-making tasks. A Mixtral-8×7B decoder-only architecture is adapted to the customs domain using Low-Rank Adaptation, enabling parameter-efficient fine-tuning while processing long inputs of up to 32k tokens. On a corpus of 847 Russian-language customs product descriptions, the model produces syntactically valid JSON outputs in 98.1% of cases, with deterministic post-processing reducing the invalid rate to 1.06%. Fine-tuning with LoRA on the original dataset yields validation losses in the range 0.015–0.025, while training on an augmented dataset of approximately 106 records reduces validation loss to below 0.002, at the cost of increased training time. Inference benchmarks show that the sparse MoE model, activating 2 of 8 experts per token, achieves higher scores than dense baselines under comparable inference budgets, with gains of approximately 10–15 percentage points on reasoning-oriented tasks. The results also identify limitations related to semantic correctness, numeric and unit interpretation, routing stability, and uncertainty estimation, indicating directions for further development of language-model-based systems for regulatory and decision-support applications.
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 721-728
Open AccessLLM-augmented Hybrid Recommendation System for Structured Classification of Customs Commodity Descriptions
This paper presents a pipeline for structured information extraction and commodity classification from unstructured customs declaration texts using a sparse Mixture-of-Experts large language model with deterministic post-processing and rule-based validation, and integrates the extracted outputs into an interactive recommendation system that supports customs officers in classification and decision-making tasks. A Mixtral-8×7B decoder-only architecture is adapted to the customs domain using Low-Rank Adaptation, enabling parameter-efficient fine-tuning while processing long inputs of up to 32k tokens. On a corpus of 847 Russian-language customs product descriptions, the model produces syntactically valid JSON outputs in 98.1% of cases, with deterministic post-processing reducing the invalid rate to 1.06%. Fine-tuning with LoRA on the original dataset yields validation losses in the range 0.015–0.025, while training on an augmented dataset of approximately 106 records reduces validation loss to below 0.002, at the cost of increased training time. Inference benchmarks show that the sparse MoE model, activating 2 of 8 experts per token, achieves higher scores than dense baselines under comparable inference budgets, with gains of approximately 10–15 percentage points on reasoning-oriented tasks. The results also identify limitations related to semantic correctness, numeric and unit interpretation, routing stability, and uncertainty estimation, indicating directions for further development of language-model-based systems for regulatory and decision-support applications.
- Open Access
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1399-1409
EmoTg: Modeling Social Response to Telegram Posts Using LLM and NLP Features
This paper presents a pipeline for analyzing Telegram posts and predicting audience reactions in the absence of comment data. Raw messages were processed using both NLP methods and GPT-based structured prompts to extract linguistic, stylistic, semantic, and emotional features. Comment-level responses were independently annotated using a dedicated prompt to generate thread-level labels capturing sentiment, toxicity, stance, humor, and conflict. These labels were then used as targets in a post-to-comment inference task formulated as a multi-task classification problem. XGBoost models achieved up to 0.85 accuracy for emotional attributes (cuteness, conflict) and 0.71 for toxic comment prediction, confirming that post content contains reliable signals of potential audience behavior. SHAP-based explainability showed that LLM-derived features are interpretable and behaviorally meaningful. Overall, the approach demonstrates that content dynamics in comment threads can be anticipated from post features alone, enabling proactive moderation, risk assessment, and socially aware AI support for online communication.
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1399-1409
Open AccessEmoTg: Modeling Social Response to Telegram Posts Using LLM and NLP Features
This paper presents a pipeline for analyzing Telegram posts and predicting audience reactions in the absence of comment data. Raw messages were processed using both NLP methods and GPT-based structured prompts to extract linguistic, stylistic, semantic, and emotional features. Comment-level responses were independently annotated using a dedicated prompt to generate thread-level labels capturing sentiment, toxicity, stance, humor, and conflict. These labels were then used as targets in a post-to-comment inference task formulated as a multi-task classification problem. XGBoost models achieved up to 0.85 accuracy for emotional attributes (cuteness, conflict) and 0.71 for toxic comment prediction, confirming that post content contains reliable signals of potential audience behavior. SHAP-based explainability showed that LLM-derived features are interpretable and behaviorally meaningful. Overall, the approach demonstrates that content dynamics in comment threads can be anticipated from post features alone, enabling proactive moderation, risk assessment, and socially aware AI support for online communication.
- Open Access
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1453-1460
Boltzmann Interaction Models with Gibbs Decision Policies in Multi-Agent Delivery Systems
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1453-1460
Open AccessBoltzmann Interaction Models with Gibbs Decision Policies in Multi-Agent Delivery Systems
- Open Access
- 5 March 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (3) , 63
Soft-Prompted Semantic Normalization for Unsupervised Analysis of the Scientific Literature
Mapping thematic structure in large scientific corpora enables the systematic analysis of research trends and conceptual organization. This work presents an unsupervised framework that leverages large language models (LLMs) as fixed semantic inference operators guided by structured soft prompts. The framework transforms raw abstracts into normalized semantic representations that reduce stylistic variability while retaining core conceptual content. These representations are embedded into a continuous vector space, where density-based clustering identifies latent research themes without predefining the number of topics. Cluster-level interpretation is performed using LLM-based semantic decoding to generate concise, human-readable descriptions of the discovered themes. Experiments on ICML and ACL 2025 abstracts demonstrate that the method produces coherent clusters reflecting problem formulations, methodological contributions, and empirical contexts. The findings indicate that prompt-driven semantic normalization combined with geometric analysis provides a scalable and model-agnostic approach for unsupervised thematic discovery across large scholarly corpora.
- 5 March 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (3) , 63
Open AccessSoft-Prompted Semantic Normalization for Unsupervised Analysis of the Scientific Literature
Mapping thematic structure in large scientific corpora enables the systematic analysis of research trends and conceptual organization. This work presents an unsupervised framework that leverages large language models (LLMs) as fixed semantic inference operators guided by structured soft prompts. The framework transforms raw abstracts into normalized semantic representations that reduce stylistic variability while retaining core conceptual content. These representations are embedded into a continuous vector space, where density-based clustering identifies latent research themes without predefining the number of topics. Cluster-level interpretation is performed using LLM-based semantic decoding to generate concise, human-readable descriptions of the discovered themes. Experiments on ICML and ACL 2025 abstracts demonstrate that the method produces coherent clusters reflecting problem formulations, methodological contributions, and empirical contexts. The findings indicate that prompt-driven semantic normalization combined with geometric analysis provides a scalable and model-agnostic approach for unsupervised thematic discovery across large scholarly corpora.
- Open Access
- 22 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 48-57
SciGraph-LLM: Automatic Knowledge Graph Construction from Scientific Papers
- 22 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 48-57
Open AccessSciGraph-LLM: Automatic Knowledge Graph Construction from Scientific Papers