<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ib</journal-id>
      <journal-title-group>
        <journal-title>iBusiness</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2150-4083</issn>
      <issn pub-type="ppub">2150-4075</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ib.2026.182005</article-id>
      <article-id pub-id-type="publisher-id">ib-151484</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Business</subject>
          <subject>Economics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Digital-Intelligence-Driven Evaluation and Forecasting of First-Launch Economy Performance: Evidence from the Plush Toy Industry in Ankang City, China</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid">0009-0005-0567-0497</contrib-id>
          <name name-style="western">
            <surname>Shi</surname>
            <given-names>Mo</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Tang</surname>
            <given-names>Baixiao</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Li</surname>
            <given-names>Ruiyu</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> School of Economics and Management, Ankang University, Ankang, China </aff>
      <aff id="aff2"><label>2</label> School of Arts, Ankang University, Ankang, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <volume>18</volume>
      <issue>02</issue>
      <fpage>59</fpage>
      <lpage>87</lpage>
      <history>
        <date date-type="received">
          <day>11</day>
          <month>01</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>24</day>
          <month>05</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>27</day>
          <month>05</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ib.2026.182005">https://doi.org/10.4236/ib.2026.182005</self-uri>
      <abstract>
        <p>The first-launch economy has emerged as a critical policy instrument for driving industrial upgrading and rural revitalization in China’s underdeveloped regions; however, quantitative frameworks to assess its industrial performance remain limited. This study proposes a novel digital-intelligence-driven framework to evaluate and forecast production expansion dynamics, utilizing the plush toy industry in Ankang City (2018-2026) as a representative longitudinal case study. Based on the integration of multi-source data from the National Bureau of Statistics, e-commerce platforms, and web-crawled records, a robust Extract-Transform-Load (ETL) pipeline is constructed. This process employed systematic time-series standardization and exhaustive aggregation to generate a monthly production value of industrial activity. To capture complex non-linear trends, a Long Short-Term Memory (LSTM) neural network was developed to model efficiency evolution, incorporating the national export benchmark of toys as an exogenous variable. In this study, model performance was validated using the coefficient of determination (R<sup>2</sup>), Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and Mean Bias Error (MBE), demonstrating high predictive fidelity. As the first-launched industry, analytical results in this study reveal a sustained efficiency trajectory in Ankang’s plush toy sector post-2018, providing quantitative evidence of the efficacy of digital-intelligence-enabled interventions. The findings in this study offer a transferable, data-driven methodology for the following studies to monitor emerging regional industries and optimize resource allocation within the first-launch economy model.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>First-Launch Economy</kwd>
        <kwd>Industrial Performance</kwd>
        <kwd>LSTM Neural Network</kwd>
        <kwd>Digital Intelligence</kwd>
        <kwd>Rural Revitalization</kwd>
        <kwd>Time-Series Forecasting</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>The rapid development of the digital economy has become a pivotal driver of socioeconomic transformation worldwide, particularly in emerging and transitional contexts. As the study of [<xref ref-type="bibr" rid="B33">33</xref>] indicates, defined broadly as economic activities enabled by digital technologies, digital infrastructure, and data analytics, the digital economy enhances productivity, reduces transaction costs, and reshapes traditional industrial structures by increasing connectivity and information flows. While its macro-economic role has been widely studied, the implications of digital transformation for rural industrial development and policy-driven economic models have received comparatively less scholarly attention. Many previous studies emphasize that this gap is notable in the context of China’s rural revitalization strategy, where digitalization is increasingly viewed not only as an enabler of infrastructure and services but also as a catalyst for industrial upgrading and economic resilience ([<xref ref-type="bibr" rid="B21">21</xref>]; [<xref ref-type="bibr" rid="B32">32</xref>]; [<xref ref-type="bibr" rid="B34">34</xref>]; [<xref ref-type="bibr" rid="B38">38</xref>]).</p>
      <p>According to the former study of [<xref ref-type="bibr" rid="B22">22</xref>], the rural revitalization has become a central policy paradigm in China in the post-poverty-alleviation era, aiming to achieve a prosperous industry, a livable ecology, cultural advancement, effective governance, and improved rural livelihoods. Within this framework, from e-commerce platforms to mobile digital finance, the digital tools are being mobilized to overcome traditional barriers to market access, optimize supply chains, and stimulate local entrepreneurship. Existing empirical evidence confirms a significant positive relationship between the development of the digital economy and dimensions of rural revitalization, including industrial prosperity and economic dynamism ([<xref ref-type="bibr" rid="B24">24</xref>]; [<xref ref-type="bibr" rid="B5">5</xref>]; [<xref ref-type="bibr" rid="B3">3</xref>]). However, most studies adopt macro or meso perspectives, employing aggregate indices or panel regression models to evaluate broad digital economy effects. Due to this, such approaches tend to overlook micro-level industrial dynamics and sector-specific efficiencies that emerge under targeted economic initiatives.</p>
      <p>One such initiative of the first-launch economy describes the intentional stimulation and formation of nascent industries in designated counties through coordinated policy support, market linkages, and resource integration. As a localized, policy-oriented economic innovation, the first-launch economy requires more granular, data-driven evaluation frameworks to capture temporal performance and guide strategic enhancements ([<xref ref-type="bibr" rid="B23">23</xref>]; [<xref ref-type="bibr" rid="B25">25</xref>]; [<xref ref-type="bibr" rid="B27">27</xref>]). Due to the traditional evaluation metrics often struggling with heterogeneous data quality, missing values, and low-frequency reporting typical of emerging rural industries, there is a methodological need for structured data acquisition, cleaning, and modeling approaches capable of integrating multi-source temporal data into coherent analytical streams suitable for performance assessment.</p>
      <p>As a countermeasure, specifically deep learning models designed for time-series prediction, advances in machine learning offer promising tools for handling complex, nonlinear temporal patterns in economic indicators. As [<xref ref-type="bibr" rid="B30">30</xref>] indicate, the Long Short-Term Memory (LSTM) neural network architecture has demonstrated superior forecasting capability relative to traditional time-series models when capturing long-term dependencies in sequential data, while the application of LSTM in economic forecasting contexts, such as export dynamics and industrial output, highlights its potential to improve predictive accuracy and inform intervention strategies ([<xref ref-type="bibr" rid="B1">1</xref>]; [<xref ref-type="bibr" rid="B13">13</xref>]; [<xref ref-type="bibr" rid="B14">14</xref>]; [<xref ref-type="bibr" rid="B28">28</xref>]; [<xref ref-type="bibr" rid="B39">39</xref>]). Nevertheless, the application of LSTM to evaluate the efficiency of policy-driven rural industrial transformations remains underexplored.</p>
      <p>This study addresses these gaps by proposing a comprehensive, digital-intelligence-driven framework that integrates multi-source data acquisition, rule-based time-series cleaning, and LSTM-based forecasting to evaluate and predict the efficiency of the first-launch economy. Utilizing the plush toy industry in Ankang City, China (a representative case initiated in 2018), this research constructs annual industrial performance indicators by synthesizing official statistics and web-crawled enterprise data. By evaluating historical trends and forecasting future developments, the framework in this study provides both an empirical assessment of industry performance and actionable insights for policymakers seeking to optimize rural industrial support strategies. Upon the above, this research contributes to a more nuanced understanding of how digital intelligence can facilitate effective, evidence-based economic policies in the development of rural revitalization.</p>
    </sec>
    <sec id="sec2">
      <title>2. Data Processing and Reconstruction Methodology</title>
      <sec id="sec2dot1">
        <title>2.1. Export Amount of the Toy Industry</title>
        <p>According to many previous studies, China’s toy export industry has experienced a long-term upward trajectory since the mid-1990s, reflecting both the country’s manufacturing capacity expansion and its deep integration into global value chains ([<xref ref-type="bibr" rid="B4">4</xref>]; [<xref ref-type="bibr" rid="B20">20</xref>]). As shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, based on the data from the National Bureau of Statistics, which indicates that this evolution can be delineated into distinct phases: a period of steady accumulation followed by accelerated growth subsequent to China’s accession to the World Trade Organization in 2001. This earlier phase was predominantly driven by cost advantages, economies of scale, and export-oriented industrial policies, solidifying China’s status as the world’s premier toy manufacturer. A significant structural shift is observable post-2015, where export values entered a rapid expansionary phase, culminating in a historical peak around 2021. This surge was underpinned by the diversification of toy categories and a transition toward higher value-added production segments, demonstrating the sector’s resilience despite temporary global economic shocks.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId13.jpeg?20260527085430" />
        </fig>
        <p>Figure 1. Economic data of China’s toy export industry.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId14.jpeg?20260527085430" />
        </fig>
        <p>Figure 2. Year-on-year growth.</p>
        <p>Synthesis of <xref ref-type="fig" rid="fig1">Figure 1</xref> and <xref ref-type="fig" rid="fig2">Figure 2</xref>, while the aggregate trend remains positive, the results of year-on-year growth in <xref ref-type="fig" rid="fig2">Figure 2</xref> reveal the pronounced cyclical volatility and structural constraints underlying this growth. The year-on-year growth series highlights that China’s toy exports are highly sensitive to external macro shocks, due to early negative fluctuations aligning with regional disruptions such as the Asian financial adjustments, while significant volatility is evident during the 2008-2009 global financial crisis. Furthermore, the sharp correction observed after the 2021 peak (visible in both <xref ref-type="fig" rid="fig1">Figure 1</xref>’s decline and <xref ref-type="fig" rid="fig2">Figure 2</xref>’s growth deceleration) signals a departure from purely scale-driven expansion. As noted in recent literature, this downturn reflects mounting external pressures, including rising labor costs, supply chain disruptions, and intensifying trade frictions ([<xref ref-type="bibr" rid="B10">10</xref>]; [<xref ref-type="bibr" rid="B19">19</xref>]). The dynamics above suggest that the industry is transitioning from a low-cost volume regime to a complex phase shaped by input cost inflation and geopolitical reconfiguration.</p>
        <p>Within this macroeconomic context, the national toy export trend provides a critical benchmark for evaluating emerging regional industries under the first-launch economy framework. Compared with the long-established and export-oriented national toy industry, newly developed regional clusters (such as the plush toy industry in Ankang City) operate at a significantly smaller scale and are primarily driven by domestic demand, policy support, and localized industrial linkages. Due to this, incorporating national toy export data into the analytical framework enables a relative performance assessment, allowing regional industrial performance to be examined against broader market dynamics. This comparative perspective is essential for distinguishing endogenous growth effects generated by first-launch economy policies from exogenous macroeconomic fluctuations, thereby enhancing the robustness of subsequent efficiency evaluation and forecasting analyses.</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Technical Route and Data Processing Framework</title>
        <p>In this study, the economic data are extracted spanning the period from 2018 to 2026 to evaluate the first-launch economy performance. As shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>, the dataset integrates multi-source information from the National Bureau of Statistics alongside enterprise-level records scraped via standardized APIs from Baidu, Qichacha, Tianyancha, and Aiqicha. Across the multi-source-based dataset, the primary variables collected include enterprise count, production scale, and registered capital. Moreover, this study duplicates records generated by overlapping platform sources, which were removed using time-based primary keys, and imputes missing temporal observations using the Last Observation Carried Forward (LOCF) method to ensure data integrity. Because the annual production totals for 2024 (6.1 billion CNY) and 2025 (7.5 billion CNY) are verified, directly observed anchors sourced from local government and national media reports, it is critical to distinguish between directly observed data and synthesized data in this study. Upon the approach notes above, all monthly data points (a total of 96 anchor observations) are reconstructed and allocated based on these verified annual totals.</p>
        <p>To ensure the reliability and analytical validity of the subsequent efficiency evaluation and forecasting, this study constructs a robust Extract-Transform-Load (ETL) pipeline by integrating multi-source data from the National Bureau of Statistics, major e-commerce and business information platforms, and web-crawled records. These data sources differ substantially in temporal resolution, data structure, and statistical standards, ranging from officially published macroeconomic indicators to firm-level registration and transaction information. As <xref ref-type="fig" rid="fig3">Figure 3</xref> illustrates, the ETL process begins with data extraction through standardized API access and automated web crawling, followed by unified schema mapping to harmonize variable definitions and time formats. This integration strategy enables heterogeneous raw data to be transformed into a coherent time-series dataset reflecting industrial activity intensity, thereby mitigating the inconsistencies commonly observed in single-source datasets.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId15.jpeg?20260527085431" />
        </fig>
        <p>Figure 3. Structure of the crawled system (example code).</p>
        <p>Regarding the transformation stage, systematic time-series standardization and rule-based cleaning algorithms are applied to address missing values, temporal misalignment, and duplicate records. Specifically, all timestamps are normalized to a monthly frequency to balance data availability and temporal granularity. Due to LOCF preventing look-ahead bias in predictive modeling, and being suitable for low-frequency, gradually evolving industrial statistics, missing observations in this study are handled using forward-filling with this approach. Formally, for a time series <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , missing values are imputed as:</p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>if</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>is</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>missing</mml:mtext>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Duplicate records arising from overlapping data sources are resolved using time-based primary keys, ensuring that each monthly observation is unique. This standardized temporal structure provides a stable foundation for subsequent aggregation and modeling procedures.</p>
        <p>To construct a representative indicator of industrial activity, an exhaustive aggregation strategy is employed within the ETL pipeline. Such as enterprise count, production scale, and registered capital, through brute-force enumeration across multidimensional parameter spaces, monthly production value indicators are generated using group-by aggregation operations. Conceptually, the aggregated production value <inline-formula><mml:math><mml:mrow><mml:mi> P </mml:mi><mml:msub><mml:mi> V </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> at month <inline-formula><mml:math><mml:mi> T </mml:mi></mml:math></inline-formula> can be expressed as:</p>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>P</mml:mi>
              <mml:msub>
                <mml:mi>V</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>N</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:munderover>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>w</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>t</mml:mi>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mi> t </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes the activity measure of firm <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> at time <inline-formula><mml:math><mml:mi> t </mml:mi></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents its corresponding weight derived from enterprise attributes. The exhaustive traversal in the data processing framework ensures that all valid parameter combinations are incorporated without subjective weighting bias, thereby enhancing the robustness of the constructed time series. The resulting monthly production value serves as a key input for efficiency evaluation and LSTM-based forecasting, enabling the model to capture nonlinear temporal dynamics and structural changes in the first-launch economy. In this study, the data-driven technical route in the data processing framework bridges raw multi-source information and advanced predictive analytics, providing a transparent and replicable methodological foundation for assessing regional industrial performance.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. MPV Reconstruction and Analysis</title>
        <p>To construct a monthly time series of production value (MPV) for Ankang’s plush-toy cluster, this study anchors the reconstruction to publicly reported annual totals. Let <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> y </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the official/anchored annual production value for year <inline-formula><mml:math><mml:mi> y </mml:mi></mml:math></inline-formula> (in CNY). For this study, the key anchors are <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mn> 2024 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 6.1 </mml:mn></mml:mrow></mml:math></inline-formula> (billion CNY) and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mn> 2025 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7.5 </mml:mn></mml:mrow></mml:math></inline-formula> (billion CNY), as reported by local government and national media sources ([<xref ref-type="bibr" rid="B2">2</xref>]; [<xref ref-type="bibr" rid="B37">37</xref>]). The monthly baseline allocation <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> for month <inline-formula><mml:math><mml:mi> m </mml:mi></mml:math></inline-formula> in year <inline-formula><mml:math><mml:mi> y </mml:mi></mml:math></inline-formula> is constructed by applying an interpretable seasonal weight vector <inline-formula><mml:math><mml:mrow><mml:mi> s </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> s </mml:mi><mml:mrow><mml:mn> 12 </mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (Discussions in this study indicate that the weights reflect the established “8 - 11 month export/production crest” characteristic of the plush toy global supply chain) and normalizing so that <inline-formula><mml:math><mml:mrow><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo> ∑ </mml:mo><mml:mrow><mml:mi> m </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mrow><mml:mn> 12 </mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:mstyle><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . The calculate method can be illustrated as <bold>Equation</bold><bold>(3)</bold> shown below:</p>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>m</mml:mi>
                  <mml:mo>˜</mml:mo>
                </mml:mover>
                <mml:mrow>
                  <mml:mi>y</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>m</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>A</mml:mi>
                <mml:mi>y</mml:mi>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>s</mml:mi>
                <mml:mi>m</mml:mi>
              </mml:msub>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>s</mml:mi>
                <mml:mi>m</mml:mi>
              </mml:msub>
              <mml:mo>≥</mml:mo>
              <mml:mn>0</mml:mn>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:munderover>
                <mml:mstyle displaystyle="true" mathsize="140%">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>m</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>12</mml:mn>
                </mml:mrow>
              </mml:munderover>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>s</mml:mi>
                <mml:mi>m</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Because 3% stochastic perturbation is introduced to simulate realistic month-to-month production/order noise, which prevents the neural network from overfitting to a smooth artificial curve, a small stochastic perturbation <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ε </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub><mml:mo> ~ </mml:mo><mml:mi mathvariant="script"> N </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> α </mml:mi><mml:msub><mml:mover accent="true"><mml:mi> m </mml:mi><mml:mo> ˜ </mml:mo></mml:mover><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mn> 2 </mml:mn></mml:msup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> α </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.03 </mml:mn></mml:mrow></mml:math></inline-formula> is added to each month in <bold>Equation</bold><bold>(3)</bold> to reflect realistic month-to-month production/order noise: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mover accent="true"><mml:mi> m </mml:mi><mml:mo> ˜ </mml:mo></mml:mover><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> + </mml:mo><mml:msub><mml:mi> η </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> η </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow></mml:msub><mml:mo> ~ </mml:mo><mml:mi mathvariant="script"> N </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:msup><mml:mi> α </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . This anchoring, combined with seasonal allocation, yields an initial, explainable monthly series that is consistent with verified annual public anchors and sectoral seasonality.</p>
        <p>Following the study by [<xref ref-type="bibr" rid="B29">29</xref>], a multilayer perceptron regressor (MLP Regressor) is fitted as a data-driven smoother to produce a continuous, smooth, non-linear monthly series amenable to downstream modeling. The MLP input vector for time index <inline-formula><mml:math><mml:mi> t </mml:mi></mml:math></inline-formula> (months since 2018-01) is <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mi> t </mml:mi><mml:mo> , </mml:mo><mml:mi> sin </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mn> 2 </mml:mn><mml:mi> π </mml:mi><mml:mi> m </mml:mi></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mn> 12 </mml:mn></mml:mrow></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> , </mml:mo><mml:mi> cos </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mn> 2 </mml:mn><mml:mi> π </mml:mi><mml:mi> m </mml:mi></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mn> 12 </mml:mn></mml:mrow></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> to capture linear trend and annual seasonality. The MLP defines a parametric mapping <inline-formula><mml:math><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi> y </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mi> t </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi> f </mml:mi><mml:mi> θ </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> θ </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a feed-forward network with parameters <inline-formula><mml:math><mml:mi> θ </mml:mi></mml:math></inline-formula> . Training minimizes regularized mean squared error, which is shown in <bold>Equation</bold><bold>(4)</bold>:</p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>ℒ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>θ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>N</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>N</mml:mi>
              </mml:munderover>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>y</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                      <mml:mo>−</mml:mo>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>y</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:msubsup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>‖</mml:mo>
                    <mml:mi>θ</mml:mi>
                    <mml:mo>‖</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
                <mml:mn>2</mml:mn>
              </mml:msubsup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the anchored noisy monthly targets, <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> is an L2 penalty (e.g., <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mo> = </mml:mo><mml:msup><mml:mrow><mml:mn> 10 </mml:mn></mml:mrow><mml:mrow><mml:mo> − </mml:mo><mml:mn> 4 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> ), and optimization is performed with Adam (learning rate <inline-formula><mml:math><mml:mrow><mml:mi> l </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:math></inline-formula> , early stopping on validation loss). Practical hyperparameters used for reproducibility: two hidden layers (64.32 neurons), ReLU activations, solver = “adam”, batch size = 32, max epochs = 500, early_stopping = True, validation_fraction = 0.2. The choice of MLP (rather than sequence models) in this study is justified by the constructive nature of the monthly targets (anchored, not dense historical observations) and by the goal, as [<xref ref-type="bibr" rid="B11">11</xref>] indicate, that smoothing and non-linear interpolation, rather than pure sequence extrapolation. Incorporating the USD/CNY exchange rate analysis in <bold>Table 1</bold>, the model produces the blue series (MPV (MLP)) shown in <xref ref-type="fig" rid="fig4">Figure 4</xref> and provides a smooth, interpretable monthly trajectory consistent with yearly anchors.</p>
        <p>Table 1. Official PBOC/CFETS USD/CNY exchange rate (2025-2026).</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>Month</td>
                <td>Opening (Approx)</td>
                <td>Closing (Approx)</td>
                <td>Monthly High</td>
                <td>Monthly Low</td>
              </tr>
              <tr>
                <td>2025-01</td>
                <td>7.2981</td>
                <td>7.1809</td>
                <td>7.3315</td>
                <td>7.1809</td>
              </tr>
              <tr>
                <td>2025-02</td>
                <td>7.2878</td>
                <td>7.2828</td>
                <td>7.2888</td>
                <td>7.2500</td>
              </tr>
              <tr>
                <td>2025-03</td>
                <td>7.2340</td>
                <td>7.2567</td>
                <td>7.2567</td>
                <td>7.2340</td>
              </tr>
              <tr>
                <td>2025-04</td>
                <td>7.3388</td>
                <td>7.2860</td>
                <td>7.3388</td>
                <td>7.2860</td>
              </tr>
              <tr>
                <td>2025-05</td>
                <td>7.2706</td>
                <td>7.2037</td>
                <td>7.2706</td>
                <td>7.2037</td>
              </tr>
              <tr>
                <td>2025-06</td>
                <td>7.1802</td>
                <td>7.1636</td>
                <td>7.1802</td>
                <td>7.1636</td>
              </tr>
              <tr>
                <td>2025-07</td>
                <td>7.1738</td>
                <td>7.1764</td>
                <td>7.1764</td>
                <td>7.1600</td>
              </tr>
              <tr>
                <td>2025-08</td>
                <td>7.1828</td>
                <td>7.1530</td>
                <td>7.1828</td>
                <td>7.1530</td>
              </tr>
              <tr>
                <td>2025-09</td>
                <td>7.1414</td>
                <td>7.1338</td>
                <td>7.1414</td>
                <td>7.1129</td>
              </tr>
              <tr>
                <td>2025-10</td>
                <td>7.1190</td>
                <td>7.1169</td>
                <td>7.1264</td>
                <td>7.1000</td>
              </tr>
              <tr>
                <td>2025-11</td>
                <td>7.1186</td>
                <td>7.1022</td>
                <td>7.1186</td>
                <td>7.0867</td>
              </tr>
              <tr>
                <td>2025-12</td>
                <td>7.0717</td>
                <td>6.9961</td>
                <td>7.0717</td>
                <td>6.9961</td>
              </tr>
              <tr>
                <td>2026-01</td>
                <td>7.0051</td>
                <td>6.9678</td>
                <td>7.0051</td>
                <td>6.9678</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId82.jpeg?20260527085431" />
        </fig>
        <p>Figure 4. Production value of the plush toy industry in Ankang City.</p>
        <p>Through <xref ref-type="fig" rid="fig4">Figure 4</xref>, province-level scenario construction follows a transparent algebraic rule to express uncertainty in Ankang’s share of provincial output. If <inline-formula><mml:math><mml:mi> p </mml:mi></mml:math></inline-formula> denotes the assumed Ankang share of Shaanxi provincial plush-toy output, the implied province annual production is <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> P </mml:mi><mml:mrow><mml:mi> y </mml:mi><mml:mi> e </mml:mi><mml:mi> a </mml:mi><mml:mi> r </mml:mi></mml:mrow><mml:mrow><mml:mi> p </mml:mi><mml:mi> r </mml:mi><mml:mi> o </mml:mi><mml:mi> v </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi><mml:mi> c </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msubsup><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> y </mml:mi></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mi> p </mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> . Due to the parameters <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> being selected to establish rigorous conservative and optimistic boundary conditions for Ankang’s output relative to the entire Shaanxi province, two situations were examined in this study, as shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>. For illustration, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mn> 2024 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 6.1 </mml:mn></mml:mrow></mml:math></inline-formula> (billion CNY) implies <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> P </mml:mi><mml:mrow><mml:mn> 2024 </mml:mn></mml:mrow><mml:mrow><mml:mi> p </mml:mi><mml:mi> r </mml:mi><mml:mi> o </mml:mi><mml:mi> v </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi><mml:mi> c </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msubsup><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mn> 6.1 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> billion CNY </mml:mtext></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mn> 0.6 </mml:mn></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mn> 10.167 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> billion CNY </mml:mtext></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> under <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> P </mml:mi><mml:mrow><mml:mn> 2024 </mml:mn></mml:mrow><mml:mrow><mml:mi> p </mml:mi><mml:mi> r </mml:mi><mml:mi> o </mml:mi><mml:mi> v </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi><mml:mi> c </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msubsup><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mn> 6.1 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> billion CNY </mml:mtext></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mn> 0.8 </mml:mn></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mn> 7.625 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> billion CNY </mml:mtext></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> under <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> . Conversion from RMB to USD uses the reference exchange rate <inline-formula><mml:math><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mn> 7.1697 </mml:mn></mml:mrow></mml:math></inline-formula> (USD/CNY), which can be calculated based on the USD/CNY exchange rate data shown in <bold>Table 1</bold>. Thereby, the value of MPV in million USD is computed as:</p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>M</mml:mi>
              <mml:mi>P</mml:mi>
              <mml:msub>
                <mml:mi>V</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>million USD</mml:mtext>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>m</mml:mi>
                    <mml:mrow>
                      <mml:mi>y</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>m</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mn>6</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>⋅</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>r</mml:mi>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Using <bold>Equation</bold><bold>(5)</bold> above, the 2024 annual anchor <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mn> 2024 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 6.1 </mml:mn></mml:mrow></mml:math></inline-formula> (billion CNY) corresponds to ≈850.9 (million USD) annually and an average monthly value ≈ 70.9 (million USD) numbers that align with the MPV seasonal profile shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
        <p>Referring to the results in <xref ref-type="fig" rid="fig4">Figure 4</xref>, interpreting the MPV trajectories through the First-Launch Economy lens emphasizes policy causality and practical implications. The reconstructed series in <xref ref-type="fig" rid="fig4">Figure 4</xref> exhibits negligible activity in 2018, stepwise growth during 2019-2021, and rapid expansion in 2022-2024, including industrial relocation, community factories, targeted subsidies, and logistics support, such behavior consistent with a policy-driven, cluster-forming process. Based on the discussion above, the quantitative reconstructions provide empirical validation for narrative reports (local government and media) that Ankang’s cluster matured rapidly after programmatic intervention. From a policy perspective, the MPV results justify continued prioritization of supply-side measures (workforce training, quality upgrade, design/branding support) and demand-side facilitation (export channels, trade fairs) to convert scale into sustainable, higher-value growth rather than transient volume increases.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. LSTM Predictive Modeling Methodology</title>
      <sec id="sec3dot1">
        <title>3.1. Time-Series Reconstruction</title>
        <p>Before establishing the LSTM structure, this study constructs a high-resolution daily time series <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 2921 </mml:mn></mml:mrow></mml:math></inline-formula> daily points spanning 2018-2026) from a sparse set of 96 monthly anchor observations previously generated via an MLP-based reconstruction. This densification is motivated by the architectural requirements of LSTM neural networks, which rely on long, densely sampled sequences to reliably capture short- and long-range dependencies, intra-year seasonal cycles, and high-frequency volatility that sparse anchors fail to expose. To construct a continuous mathematical space across the full timeline, this study employs a hybrid approach that 1) establishes a shape-preserving baseline via piecewise cubic Hermite interpolation (PCHIP), 2) injects controlled, locally-weighted high-frequency details, and 3) enforces alignment at anchor indices to preserve verified totals. As noted by [<xref ref-type="bibr" rid="B7">7</xref>], the approach balances fidelity to verified anchors with the synthetic enrichment necessary for the LSTM training process. Since the densification and normalization processes are applied to the entire timeline, the LSTM is trained to extrapolate the structural dynamics of this anchor-constrained synthetic series rather than forecasting raw, independent future observations.</p>
        <p>As step 3, which is illustrated in <xref ref-type="fig" rid="fig5">Figure 5</xref>, the codes in MATLAB use PCHIP to obtain <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> b </mml:mi><mml:mi> a </mml:mi><mml:mi> s </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , a monotonicity-preserving cubic Hermite interpolation. PCHIP computes, for each interval <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , a Hermite cubic polynomial <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> that matches function values and chosen node slopes <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , while the calculation can be expressed as <bold>Equation</bold><bold>(6)</bold> below:</p>
        <disp-formula id="FD6">
          <label>(6)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>H</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>y</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mrow>
                  <mml:mn>00</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>τ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>τ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mi>h</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>y</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mrow>
                  <mml:mn>01</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>τ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mrow>
                  <mml:mn>11</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>τ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mi>h</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>with <inline-formula><mml:math><mml:mrow><mml:mi> τ </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> − </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mi> h </mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> and Hermite basis functions <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mrow><mml:mn> 00 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mrow><mml:mn> 10 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mrow><mml:mn> 01 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mrow><mml:mn> 11 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . PCHIP is preferred over natural cubic splines because it prevents overshoot and preserves the qualitative shape (no spurious oscillations) due to a desirable property when anchors represent real economic aggregates that interpolation artifacts should not violate ([<xref ref-type="bibr" rid="B8">8</xref>]). Across this step, mathematical guarantees of monotonicity and shape-preservation reduce the risk of introducing implausible trends that could mislead the LSTM.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId131.jpeg?20260527085432" />
        </fig>
        <p>Figure 5. Code structure of time-series reconstruction.</p>
        <p>Also, referring to <xref ref-type="fig" rid="fig5">Figure 5</xref>, to confine synthetic details away from anchor points, the code computes the distance <inline-formula><mml:math><mml:mrow><mml:mi> d </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mrow><mml:mi> min </mml:mi></mml:mrow><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> | </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> to the nearest anchor and defines a quadratic weight as shown in <bold>Equation</bold><bold>(7)</bold> below:</p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>ω</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mfrac>
                        <mml:mrow>
                          <mml:mi>d</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mi>max</mml:mi>
                          <mml:mi>d</mml:mi>
                        </mml:mrow>
                      </mml:mfrac>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> ω </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> at anchors and increases between anchors. This multiplicative mask ensures exact anchor preservation. The detail amplitude is modulated by a curvature proxy <inline-formula><mml:math><mml:mrow><mml:mi> c </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≈ </mml:mo><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:msub><mml:msup><mml:mi> y </mml:mi><mml:mo> ″ </mml:mo></mml:msup><mml:mrow><mml:mi> b </mml:mi><mml:mi> a </mml:mi><mml:mi> s </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> | </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , computed numerically by two successive gradient operators. The amplitude scaling can be expressed as <bold>Equation</bold><bold>(8)</bold> below:</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>a</mml:mi>
              <mml:mi>m</mml:mi>
              <mml:mi>p</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:mover accent="true">
                <mml:mi>y</mml:mi>
                <mml:mo>¯</mml:mo>
              </mml:mover>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>max</mml:mi>
                  <mml:mi>c</mml:mi>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>with <inline-formula><mml:math><mml:mrow><mml:mi> α </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.01 </mml:mn></mml:mrow></mml:math></inline-formula> controlling overall magnitude and <inline-formula><mml:math><mml:mover accent="true"><mml:mi> y </mml:mi><mml:mo> ¯ </mml:mo></mml:mover></mml:math></inline-formula> the mean of the original anchors. This curvature weighting means higher curvature receives larger high-frequency augmentation, which is consistent with empirical observations that real economic series often show stronger short-term variability around structural inflection points.</p>
        <p>The codes in <xref ref-type="fig" rid="fig5">Figure 5</xref> are treated as the learnable residual that an LSTM might reproduce, while the synthetic residual is formed as:</p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>d</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mi>t</mml:mi>
              <mml:mi>a</mml:mi>
              <mml:mi>i</mml:mi>
              <mml:mi>l</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>a</mml:mi>
              <mml:mi>m</mml:mi>
              <mml:mi>p</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mi>ω</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mi>sin</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mn>2</mml:mn>
                      <mml:mi>π</mml:mi>
                      <mml:mfrac>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>f</mml:mi>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                        <mml:mi>T</mml:mi>
                      </mml:mfrac>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mi>β</mml:mi>
                  <mml:mi>sin</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mn>2</mml:mn>
                      <mml:mi>π</mml:mi>
                      <mml:mfrac>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>f</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                        <mml:mi>T</mml:mi>
                      </mml:mfrac>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mi>γ</mml:mi>
                  <mml:msub>
                    <mml:mi>ε</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 5 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 11 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> T </mml:mi><mml:mo> = </mml:mo><mml:mn> 96 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.4 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> γ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.2 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ε </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> ~ </mml:mo><mml:mi mathvariant="script"> N </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . These deterministic sinusoidal components embed chosen mid-range spectral energy (periodicities approximating sub-annual cycles when mapped to daily resolution), while Gaussian noise supplies stochastic variability. The combination creates a controlled broadband signal envelope whose local amplitude follows economic curvature and whose fine structure is confined away from anchors by A. As [<xref ref-type="bibr" rid="B11">11</xref>] emphasized, setting a fixed seed (rng) ensures reproducibility, which is essential for scientific verification and for repeated model selection runs.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId160.jpeg?20260527085433" />
        </fig>
        <p>Figure 6. Time-series reconstruction results. </p>
        <p>The synthesized series is <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> b </mml:mi><mml:mi> a </mml:mi><mml:mi> s </mml:mi><mml:mi> e </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> + </mml:mo><mml:mi> d </mml:mi><mml:mi> e </mml:mi><mml:mi> t </mml:mi><mml:mi> a </mml:mi><mml:mi> i </mml:mi><mml:mi> l </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , with enforced replacement <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> r </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> t </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> at anchor indices <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> t </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , while the calculated results are shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>. According to the curve in <xref ref-type="fig" rid="fig6">Figure 6</xref>, the hard alignment prevents long-term drift from known validated points and preserves policy-anchored annual totals or verified monthly observations. For LSTM training, the dataset is then windowed into supervised examples using a sliding window of length <inline-formula><mml:math><mml:mi> L </mml:mi></mml:math></inline-formula> as each sample <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> X </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> i </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mi> i </mml:mi><mml:mo> − </mml:mo><mml:mi> L </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mi> i </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> predicts <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mi> i </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> (one-step) or the next <inline-formula><mml:math><mml:mi> h </mml:mi></mml:math></inline-formula> steps (multi-step). Prior to training, standard preprocessing (z-score normalization <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> y </mml:mi><mml:mo> − </mml:mo><mml:mi> μ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mi> σ </mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> , optional differencing <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Δ </mml:mi><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> − </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , and seasonal deseasonalization if desired) stabilizes variance and accelerates convergence. Referring to the prior study of [<xref ref-type="bibr" rid="B18">18</xref>], the dense daily sampling yields many overlapping windows, increasing the effective sample size for gradient-based optimization and allowing the LSTM to learn both intrayear seasonal patterns and long-range dependencies.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. LSTM Neural Network Structure</title>
        <p>According to many prior studies, Long Short-Term Memory (LSTM) networks were designed to overcome the principal limitations of vanilla recurrent neural networks (RNNs) for long-sequence modeling, namely the vanishing and exploding gradient problems that prevent learning of long-range dependencies ([<xref ref-type="bibr" rid="B15">15</xref>]; [<xref ref-type="bibr" rid="B26">26</xref>]). <xref ref-type="fig" rid="fig7">Figure 7</xref> summarizes the per-time-step architecture used in this study that includes an explicit cell state <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (the “memory channel”) that runs through time with near-linear interactions, while three multiplicative gates (forget, input, output) control what information is removed, written, and exposed. Specifically, to maintain consistency with the defined LSTM neural network, the input vector at time <inline-formula><mml:math><mml:mi> t </mml:mi></mml:math></inline-formula> , denoted as <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , is explicitly defined as a 2D sequence as <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mi> M </mml:mi><mml:mi> P </mml:mi><mml:msub><mml:mi> V </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:mi> N </mml:mi><mml:msub><mml:mi> E </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , where <inline-formula><mml:math><mml:mrow><mml:mi> M </mml:mi><mml:mi> P </mml:mi><mml:msub><mml:mi> V </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the normalized Monthly Production Value and <inline-formula><mml:math><mml:mrow><mml:mi> N </mml:mi><mml:msub><mml:mi> E </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the corresponding normalized national export benchmark. Upon the description above, the structure of the LSTM neural network in this study creates a parameterized pathway that can preserve gradients over many time steps when the forget gate takes values near one, enabling learning of slowly evolving trends (long-term MPV growth) concurrently with shorter-term dynamics (seasonality, shocks) embedded in the dense daily series.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId191.jpeg?20260527085433" />
        </fig>
        <p>Figure 7. Cell structure of LSTM neural networks. </p>
        <p>This study adopts the standard vectorized LSTM equations at time <italic>t</italic>, while concatenation <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denotes appending the previous hidden state and the current input, as <bold>Equations (10-15)</bold> illustrate below:</p>
        <disp-formula id="FD10">
          <label>(10)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>f</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mi>f</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mi>f</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD11">
          <label>(11)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>i</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD12">
          <label>(12)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>C</mml:mi>
                  <mml:mo>˜</mml:mo>
                </mml:mover>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>tanh</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mi>C</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mi>C</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD13">
          <label>(13)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>f</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>i</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>C</mml:mi>
                  <mml:mo>˜</mml:mo>
                </mml:mover>
                <mml:mi>t</mml:mi>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD14">
          <label>(14)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>o</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mi>o</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mi>o</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD15">
          <label>(15)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>o</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:mi>tanh</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>C</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>As illustrated above, the <bold>Equations</bold><bold>(10-15)</bold> implement three separate roles: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> gates the retention of past memory, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> i </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> gates the incorporation of candidate updates <inline-formula><mml:math><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi> C </mml:mi><mml:mo> ˜ </mml:mo></mml:mover><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> o </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> gates how much of the cell content is revealed to the hidden state. For the MPV forecasting process, the input <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can be univariate (normalized MPV) or multivariate (MPV with national export benchmarks, calendar encodings sin⁄cos, and lagged national export in this study). The readout (forecast) is typically produced by applying a linear layer to <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
        <p>From the learning dynamics viewpoint, the multiplicative of LSTM cell gates directly influences gradient propagation during backpropagation through time (BPTT). This study also considers the derivative of the loss <inline-formula><mml:math><mml:mi> ℒ </mml:mi></mml:math></inline-formula> with respect to the previous cell state as <bold>Equation</bold><bold>(16)</bold> shows below:</p>
        <disp-formula id="FD16">
          <label>(16)</label>
          <mml:math>
            <mml:mrow>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:mi>ℒ</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>c</mml:mi>
                    <mml:mrow>
                      <mml:mi>t</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:mi>ℒ</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>c</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>⊙</mml:mo>
              <mml:msub>
                <mml:mi>f</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>terms</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>from</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>paths</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>via</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>and</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>gates</mml:mtext>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>If <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is close to 1, the factor <inline-formula><mml:math><mml:mrow><mml:mo> ⊙ </mml:mo><mml:msub><mml:mi> f </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> preserves the magnitude of <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> ℒ </mml:mi></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:msub><mml:mi> c </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> , thereby mitigating vanishing gradients; conversely, adaptive <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> values allow selective forgetting. Referring to the study of [<xref ref-type="bibr" rid="B12">12</xref>], the mathematical property is the principal reason LSTM can carry long-range signals (trend, anchor constraints) while still learning to respond to short-term inputs (seasonal peaks) present in the synthesized daily MPV data.</p>
        <p>Algorithmically, training an LSTM for MPV forecasting follows supervised sequence learning with sliding windows in this study. Let window length <inline-formula><mml:math><mml:mi> L </mml:mi></mml:math></inline-formula> and forecast horizon <inline-formula><mml:math><mml:mi> H </mml:mi></mml:math></inline-formula> be chosen according to domain temporal scales (such as <inline-formula><mml:math><mml:mrow><mml:mi> L </mml:mi><mml:mo> = </mml:mo><mml:mn> 90 </mml:mn><mml:mtext>   </mml:mtext><mml:mtext> - </mml:mtext><mml:mtext>   </mml:mtext><mml:mn> 365 </mml:mn></mml:mrow></mml:math></inline-formula> days to capture intra-annual seasonality and medium-term dynamics). Construct input windows <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> X </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> n </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mi> L </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with target <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> Y </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> n </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> + </mml:mo><mml:mi> H </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . Optimize parameters <inline-formula><mml:math><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mo> * </mml:mo></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> b </mml:mi><mml:mo> * </mml:mo></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> by minimizing a regularized loss, typically mean squared error (MSE) plus L2 penalty, by <bold>Equation</bold><bold>(17)</bold> below:</p>
        <disp-formula id="FD17">
          <label>(17)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>ℒ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>θ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>N</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle displaystyle="true" mathsize="140%">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>n</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>N</mml:mi>
              </mml:munderover>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:munderover>
                <mml:mstyle displaystyle="true" mathsize="140%">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>k</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>H</mml:mi>
              </mml:munderover>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>y</mml:mi>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mi>t</mml:mi>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msup>
                          <mml:mo>+</mml:mo>
                          <mml:mi>k</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>−</mml:mo>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>y</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mi>t</mml:mi>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msup>
                          <mml:mo>+</mml:mo>
                          <mml:mi>k</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:msubsup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>‖</mml:mo>
                    <mml:mi>θ</mml:mi>
                    <mml:mo>‖</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
                <mml:mn>2</mml:mn>
              </mml:msubsup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Based on <bold>Equation</bold><bold>(17)</bold> above, by using gradient-based optimizers of Adam, apply gradient clipping (clip global norm to <inline-formula><mml:math><mml:mi> τ </mml:mi></mml:math></inline-formula> ) to control exploding gradients ([<xref ref-type="bibr" rid="B26">26</xref>]). Regularization strategies (dropout on inputs and recurrent connections, early stopping on walk-forward validation) are critical because the training data here include synthetic high-frequency components created by the preceding densification step.</p>
        <p>Based on the specific production value data of the plush toy industry in Ankang City, the design of the LSTM structure is begin with a single or stacked LSTM architecture (1 - 2 layers) with hidden dimensionality A in the range 32 - 256 depending on dataset size and compute budget; use batch normalization or layer normalization if needed, recurrent dropout (0.1 - 0.3) for regularization, and normalize inputs (z-score) to stabilize gate activations. Moreover, when training on the 2921-point daily series, experiment with one-step and multi-step forecasting setups, and use walk-forward validation (rolling origin) to simulate realistic forecasting and detect regime sensitivity. Referring to the study of [<xref ref-type="bibr" rid="B9">9</xref>], for probabilistic or uncertainty-aware forecasts, ensemble multiple trained LSTMs or use Monte Carlo dropout to obtain predictive intervals.</p>
        <p>Furthermore, evaluation must report policy-relevant metrics (<inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup><mml:mo> , </mml:mo><mml:mi> R </mml:mi><mml:mi> M </mml:mi><mml:mi> S </mml:mi><mml:mi> E </mml:mi><mml:mo> , </mml:mo><mml:mi> M </mml:mi><mml:mi> A </mml:mi><mml:mi> E </mml:mi><mml:mo> , </mml:mo><mml:mi> M </mml:mi><mml:mi> B </mml:mi><mml:mi> E </mml:mi></mml:mrow></mml:math></inline-formula> ) and perform sensitivity checks specific to the First-Launch Economy context: 1) how forecasts respond to alternative synthetic seeds and detail amplitudes; 2) whether the model respects annual anchor constraints (reconciling predicted aggregated monthly/daily totals with known yearly anchors); and 3) the contribution of exogenous covariates (national export benchmark) to predictive skill (use ablation studies and attribution tools such as SHAP for interpretability). Together, the gate mechanics, training protocols, and evaluation practices described above provide a rigorous theoretical and practical foundation for inserting the reconstructed high-resolution MPV data into LSTM networks for robust forecasting of First-Launch Economy performance.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Results and Discussion</title>
      <sec id="sec4dot1">
        <title>4.1. Implementation and Configuration</title>
        <p>As delineated in the comprehensive workflows presented in <xref ref-type="fig" rid="fig8">Figures 8-11</xref>, the coding system implemented in this study serves as the computational technology of the proposed LSTM neural network, systematically operationalizing the transition from raw signal processing to predictive modeling. Specifically, the coding framework addresses the dimensionality and temporal complexity of the reconstructed high-resolution MPV series by employing a rigorous sliding window strategy. The step restructures the univariate time-series data into a supervised learning format, creating input-output pairs (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> ) that allow the model to learn temporal mapping functions rather than static correlations.</p>
        <p>Furthermore, the neural network model explicitly incorporates the LSTM’s distinct gating mechanisms (forget, input, and output gates) within the hidden layers. As verified by the training dynamics shown in <xref ref-type="fig" rid="fig8">Figures 8-11</xref>, the LSTM structural design in this study enables the system to selectively retain or discard information over long sequences, thereby mitigating the vanishing gradient problem inherent in standard Recurrent Neural Networks (RNNs) when processing high-frequency data.</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId252.jpeg?20260527085434" />
        </fig>
        <p>Figure 8. Data analysis &amp; Data divide. </p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId253.jpeg?20260527085434" />
        </fig>
        <p>Figure 9. Data Normalization (Z-Score as requested).</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId254.jpeg?20260527085434" />
        </fig>
        <p>Figure 10. Structure of the model.</p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId255.jpeg?20260527085434" />
        </fig>
        <p>Figure 11. Parameter setting. </p>
        <p>As illustrated in the comprehensive workflow in <xref ref-type="fig" rid="fig8">Figure 8</xref>, the coding system orchestrates the full cycle of data processing, beginning with the assimilation of the expanded daily series (comprising 2921 pts). To render the univariate time series amenable to the LSTM architecture, the system employs a sliding window technique with a specific lookback period of 30 days. This mechanism systematically transforms the sequential data into a supervised learning format, mapping a historical sequence of length <italic>kim</italic> to a subsequent target value, thereby capturing short-term temporal dependencies.</p>
        <p>Especially, a pivotal design element of this coding system is the rigorous chronological stratification of the dataset into training and testing subsets (75%/25%). Unlike random cross-validation, which violates temporal order, this study adheres to a strict temporal partition: the training set encompasses the historical horizon from 2018 to 2024 (representing the first 75% of the data flow) to optimize model parameters, while the test set is strictly reserved for the period from 2024 to 2026 (representing the subsequent 25% of the data flow). This design rationale is critical for simulating a realistic forecasting scenario, effectively preventing data leakage (future information inadvertently influences training) and ensuring that the model’s performance is evaluated strictly on unseen, out-of-sample data.</p>
        <p>As further detailed in the preprocessing workflow depicted in <xref ref-type="fig" rid="fig9">Figure 9</xref>, the coding system incorporates a critical data standardization stage utilizing Z-score normalization prior to network ingestion. This procedure is fundamental for stabilizing the optimization landscape; by rescaling the input features to possess zero mean and unit variance, the system effectively prevents the saturation of activation functions (tanh or sigmoid) and facilitates more efficient gradient descent convergence within the LSTM layers. Following the statistical conditioning, the script executes a structural transformation, converting the numerical tensors into MATLAB’s proprietary cell-array sequence format. The final formatting step in <xref ref-type="fig" rid="fig9">Figure 9</xref> is essential to satisfy the input requirements of the trainNetwork solver, ensuring seamless integration with the deep learning computational graph.</p>
        <p>As synthesized in the structure of the neural network model in <xref ref-type="fig" rid="fig10">Figure 10</xref> and the hyperparameter configuration in <xref ref-type="fig" rid="fig11">Figure 11</xref>, the core of the coding system is an engineered LSTM-based regression network. Referring to <xref ref-type="fig" rid="fig10">Figure 10</xref>, the design of 128 hidden units within a single LSTM layer strikes a balance between model expressive capacity and computational parsimony, enabling the capture of high-dimensional temporal dependencies in the MPV series without incurring prohibitive training costs. To enhance the stability and generalizability of the recurrent framework, the code structure integrated a Batch Normalization layer and a ReLU activation function, which collectively accelerate convergence by normalizing the internal distribution of activations and mitigating the gradient vanishing effect. Moreover, a Dropout rate of 0.2 was implemented as a stochastic regularization technique to prevent co-adaptation of neurons, thereby reducing the risk of overfitting on historical training data. According to <xref ref-type="fig" rid="fig11">Figure 11</xref>, the training dynamics are further governed by the Adam optimizer, utilizing a piecewise learning-rate schedule to navigate the complex loss landscape. By incorporating a Gradient Threshold (<inline-formula><mml:math><mml:mrow><mml:mi> τ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ) for gradient clipping, the coding system effectively suppresses the gradient explosion phenomena common in Recurrent Neural Networks (RNNs) during the backpropagation through time (BPTT) process. Also, the combination of a high epoch budget of 1000 and a robust optimization strategy ensures that the model achieves a stable global minimum, providing a reliable foundation for the subsequent long-term predictive analysis.</p>
        <p>Following the convergence of the training phase, the coding system executes a dual-phase evaluation protocol (in-sample fidelity and out-of-sample generalizability) to rigorously quantify the model’s predictive performance. A critical post-processing step involves the inverse transformation (de-normalization) of the network outputs, ensuring that subsequent error metrics (<italic>RMSE</italic> and <italic>MAE</italic>) are interpreted on the original physical scale of the MPV series, while the <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> assesses the model’s capacity to explain observed variance. To further scrutinize the residual structure, the implementation incorporates diagnostic visualizations, where time-series trajectory plots facilitate local error analysis and error histograms verify whether the residuals approximate a Gaussian distribution, which is a prerequisite for ensuring that no significant non-linear patterns remain uncaptured.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Training and Testing Results</title>
        <p>The layer structure of the LSTM in <bold>Table 2</bold> summarizes a compact yet expressive LSTM-based regression pipeline, whose dimensions and parameterization match those of standard gated-recurrent formulations. At its core is a single LSTM layer with <inline-formula><mml:math><mml:mrow><mml:mi> H </mml:mi><mml:mo> = </mml:mo><mml:mn> 128 </mml:mn></mml:mrow></mml:math></inline-formula> hidden units, as shown in <bold>Table 2</bold>. Also, because an LSTM computes four separate gate/transform vectors per time step, the learned linear projections are grouped as blocks of size <inline-formula><mml:math><mml:mrow><mml:mn> 4 </mml:mn><mml:mi> H </mml:mi></mml:mrow></mml:math></inline-formula> .</p>
        <p>Table 2. Layer information of LSTM.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>Layer</td>
                <td>Name</td>
                <td>Type</td>
                <td>Activations</td>
                <td colspan="2">Learnable Sizes</td>
                <td colspan="2">State Sizes</td>
              </tr>
              <tr>
                <td>1</td>
                <td>InputSequence input 2 dimensions</td>
                <td>Sequence Input</td>
                <td>2(C) × 1(B) × 1(T)</td>
                <td colspan="2">-</td>
                <td colspan="2">-</td>
              </tr>
              <tr>
                <td>2</td>
                <td>LSTMLSTM with 128 hidden units</td>
                <td>LSTM</td>
                <td>128(C) × 1(B)</td>
                <td>Input WeightsRecurrent WeightsBias</td>
                <td>512 × 2512 × 128512 × 1</td>
                <td>Hidden StateCell State</td>
                <td>128 × 1128 × 1</td>
              </tr>
              <tr>
                <td>3</td>
                <td>BNBatch normalization with 128 channels</td>
                <td>Batch Normalization</td>
                <td>128(C) × 1(B)</td>
                <td>OffsetScale</td>
                <td>128 × 1128 × 1</td>
                <td>Trained MeanTrained Variance</td>
                <td>128 × 1128 × 1</td>
              </tr>
              <tr>
                <td>4</td>
                <td>ReLUReLU</td>
                <td>ReLU</td>
                <td>128(C) × 1(B)</td>
                <td colspan="2">-</td>
                <td colspan="2">-</td>
              </tr>
              <tr>
                <td>5</td>
                <td>Dropout20% dropout</td>
                <td>Dropout</td>
                <td>128(C) × 1(B)</td>
                <td colspan="2">-</td>
                <td colspan="2">-</td>
              </tr>
              <tr>
                <td>6</td>
                <td>FC1 fully connected layer</td>
                <td>Fully Connected</td>
                <td>1(C) × 1(B)</td>
                <td>WeightsBias</td>
                <td>1 × 1281 × 1</td>
                <td colspan="2">-</td>
              </tr>
              <tr>
                <td>7</td>
                <td>OutputMean-squared-error with response “Response”</td>
                <td>Regression Output</td>
                <td>1(C) × 1(B)</td>
                <td colspan="2">-</td>
                <td colspan="2">-</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>According to <bold>Table 2</bold>, the learnable weight blocks have shapes in matrix notation as shown in <bold>Equation</bold><bold>(18)</bold> below:</p>
        <disp-formula id="FD18">
          <label>(18)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>W</mml:mi>
                <mml:mi>x</mml:mi>
              </mml:msub>
              <mml:mo>∈</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mrow>
                  <mml:mn>4</mml:mn>
                  <mml:mi>H</mml:mi>
                  <mml:mo>×</mml:mo>
                  <mml:mi>D</mml:mi>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>W</mml:mi>
                <mml:mi>h</mml:mi>
              </mml:msub>
              <mml:mo>∈</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mrow>
                  <mml:mn>4</mml:mn>
                  <mml:mi>H</mml:mi>
                  <mml:mo>×</mml:mo>
                  <mml:mi>H</mml:mi>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mi>b</mml:mi>
              <mml:mo>∈</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mrow>
                  <mml:mn>4</mml:mn>
                  <mml:mi>H</mml:mi>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mi> D </mml:mi></mml:math></inline-formula> is the input dimensionality (the table lists a 2-dimensional sequence input, hence <inline-formula><mml:math><mml:mrow><mml:mn> 4 </mml:mn><mml:mi> H </mml:mi><mml:mo> = </mml:mo><mml:mn> 512 </mml:mn></mml:mrow></mml:math></inline-formula> rows produce the reported input weight size 512 × 2, recurrent weight size 512 × 128, and bias size 512 × 1). The stated state sizes (hidden state and cell state both 128 × 1) follow directly. Downstream, batch normalization (128 channels) and a ReLU activation are applied before a dropout layer (20%) and a single fully connected output neuron, producing a scalar regression output with MSE loss. As [<xref ref-type="bibr" rid="B31">31</xref>] emphasized, this layout combines the LSTM’s capacity to capture non-linear temporal dependencies with common deep-learning stabilizers (batch norm, dropout) and a compact readout, while a configuration that balances representational power and computational tractability for the MPV forecasting problem.</p>
        <fig id="fig12">
          <label>Figure 12</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId270.jpeg?20260527085434" />
        </fig>
        <p>(a) Process results of RMSE</p>
        <fig id="fig13">
          <label>Figure 13</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId271.jpeg?20260527085434" />
        </fig>
        <p>(b) Process results of Loss</p>
        <p>Figure 12. Process results (1000 epochs).</p>
        <p>The results in <xref ref-type="fig" rid="fig12">Figure 12(a)</xref> and <xref ref-type="fig" rid="fig12">Figure 12(b)</xref> together indicate a classical deep-learning training dynamics, while illustrating a rapid improvement during the initial phase of optimization, followed by a slower convergence and a low-amplitude stationary regime. In both aspects, the early iterations show large, frequently spiking <italic>RMSE</italic> and loss values that decline steeply. After this transient, the traces settle into a narrower band of values with only modest fluctuations, where <italic>RMSE</italic> stabilizes around a substantially lower level, and the training loss oscillates at a low baseline. The high initial variability and the gradually shrinking amplitude of spikes reflect 1) the optimizer reducing coarse structural error (trend and seasonality that are strong in the MPV series), 2) the effect of batch stochasticity (mini-batch gradients produce high variance early on), and 3) the impact of regularizers (dropout, batch-norm) and gradient clipping that suppress large parameter excursions and thereby reduce loss volatility.</p>
        <p>The training-error histogram in this study is shown in <xref ref-type="fig" rid="fig13">Figure 13(a)</xref>, while the Gaussian curve for the training set illustrates that the fitted parameters are <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> μ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> r </mml:mi><mml:mi> a </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 0.00 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> r </mml:mi><mml:mi> a </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 0.37 </mml:mn></mml:mrow></mml:math></inline-formula> . Based on the Gaussian curve indicated in <xref ref-type="fig" rid="fig13">Figure 13(a)</xref>, the near-zero mean indicates that, on the training data, the LSTM produces essentially unbiased point forecasts (<italic>error</italic> = <italic>actual</italic> − <italic>predicted</italic> is centered at zero), consistent with effective in-sample fitting of the reconstructed MPV trend and seasonal pattern. Also, the relatively small standard deviation (0.37) implies moderate residual dispersion in the training set, which indicates that the model captures the dominant variance components (long-run trend and primary seasonal peaks) but leaves higher-frequency, lower-amplitude residuals. Additionally, visual inspection shows some departure from a perfect Gaussian (slight asymmetry and localized modes), which is expected given the injected synthetic high-frequency detail and the mixture of deterministic sinusoidal residuals plus stochastic noise used during densification.</p>
        <fig id="fig14">
          <label>Figure 14</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId276.jpeg?20260527085434" />
        </fig>
        <p>(a) Training Set</p>
        <fig id="fig15">
          <label>Figure 15</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId277.jpeg?20260527085434" />
        </fig>
        <p>(b) Testing Set</p>
        <p>Figure 13. Prediction error distribution.</p>
        <p>The testing distribution is overlaid with the Gaussian curve in <xref ref-type="fig" rid="fig13">Figure 13(b)</xref>, with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> μ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> e </mml:mi><mml:mi> s </mml:mi><mml:mi> t </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mo> − </mml:mo><mml:mn> 0.13 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> e </mml:mi><mml:mi> s </mml:mi><mml:mi> t </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 0.84 </mml:mn></mml:mrow></mml:math></inline-formula> . Compared with the training set, including a larger dispersion (<inline-formula><mml:math><mml:mi> σ </mml:mi></mml:math></inline-formula> roughly doubled) and a small negative bias (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> μ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> e </mml:mi><mml:mi> s </mml:mi><mml:mi> t </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mo> − </mml:mo><mml:mn> 0.13 </mml:mn></mml:mrow></mml:math></inline-formula> ), the test errors show two important differences. The larger variance indicates degraded generalization, which indicates the model’s predictive uncertainty increases on unseen periods (2024-2026) likely because the synthetic augmentation injects high-frequency patterns whose statistics differ between training and test segments, and real regime shifts (as the rapid industrial scaling, policy changes or post-pandemic demand shifts of the plush toy industry in Ankang City) alter data generating dynamics in the later horizon. According to the Gaussian Curve illustrated in <xref ref-type="fig" rid="fig13">Figure 13(b)</xref>, the negative mean implies a systematic tendency to overpredict (predictions exceed realized values) on the test set under the current error sign convention.</p>
        <fig id="fig16">
          <label>Figure 16</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId286.jpeg?20260527085434" />
        </fig>
        <p>(a) Results of the training set</p>
        <fig id="fig17">
          <label>Figure 17</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId287.jpeg?20260527085434" />
        </fig>
        <p>(b) Results of the testing set</p>
        <p>Figure 14. Results of LSTM prediction.</p>
        <p>As shown in <xref ref-type="fig" rid="fig14">Figure 14(a)</xref>, the graph of the training set illustrates a near-perfect overlap between the LSTM predictions (dashed red) and the anchor-constrained MLP production series (solid black), indicating that the neural network of LSTM successfully captured the dominant long-run trend, inter-annual growth profile, and seasonal phasing embedded in the reconstructed MPV series. The close in-sample fit of the training set in <xref ref-type="fig" rid="fig14">Figure 14(a)</xref> is consistent with the neural network of LSTM capacity (single LSTM layer with 128 units), the dense sliding-window supervision derived from the 2921-point sequence, and the preprocessing pipeline (z-score normalization, batch normalization, and dropout) that stabilized optimization. From a methodological perspective, such conformity demonstrates that the LSTM has learned the low-frequency components (trend and annual seasonality) and much of the injected high-frequency structure used during densification. Moreover, the hard alignment of synthesized daily values to original monthly/annual anchors prevents long-term drift and forces the model to respect policy-relevant totals.</p>
        <p>On the other hand, the testing set in <xref ref-type="fig" rid="fig14">Figure 14(b)</xref> shows that the LSTM retains good out-of-sample fidelity due to the LSTM predictions (dashed blue) following the anchor-constrained MLP production series (solid black) closely, reproducing the timing and amplitude of the major seasonal peak and trough cycles while exhibiting only modest deviations at some local extrema. Compared with the training period, the test errors are somewhat larger and show slightly broader residual dispersion (as seen previously in error-distribution diagnostics), which indicates reduced certainty when extrapolating to later periods that may include structural shifts (rapid industrial scaling, demand changes, or policy adjustments). Based on the discussion of <xref ref-type="fig" rid="fig14">Figure 14(a)</xref> and <xref ref-type="fig" rid="fig14">Figure 14(b)</xref>, the prediction results in the training set and testing set imply that the LSTM learned robust, policy-relevant dynamics of the First-Launch Economy (e.g., the cluster’s expansion pattern) but remains sensitive to regime changes and to the statistical assumptions embedded in the synthetic high-frequency augmentation.</p>
        <p>According to <bold>Table 3</bold>, this study summarizes four complementary error metrics used to evaluate the LSTM’s forecasting performance on the MLP anchor-constrained MPV series: the coefficient of determination (<inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> ), root-mean-square error (<italic>RMSE</italic>), mean absolute error (<italic>MAE</italic>), and mean bias error (<italic>MBE</italic>). These metrics are computed on denormalized predictions (MLP production value series) and together provide a balanced view of explanatory power (variance explained), typical absolute deviations, sensitivity to large errors, and systematic bias, all of which are important when forecasts are used for policy decisions in a First-Launch Economy setting. First of all, <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> quantifies the fraction of target variance explained by the model and is computed as:</p>
        <disp-formula id="FD19">
          <label>(19)</label>
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>R</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>y</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mover accent="true">
                              <mml:mi>y</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>y</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:mover accent="true">
                            <mml:mi>y</mml:mi>
                            <mml:mo>¯</mml:mo>
                          </mml:mover>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Based on <bold>Equation</bold><bold>(19)</bold> illustrated, <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> R </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> r </mml:mi><mml:mi> a </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msubsup><mml:mo> = </mml:mo><mml:mn> 0.9997 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> R </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> e </mml:mi><mml:mi> s </mml:mi><mml:mi> t </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msubsup><mml:mo> = </mml:mo><mml:mn> 0.9983 </mml:mn></mml:mrow></mml:math></inline-formula> in this study, while both are exceedingly close to 1.0. Such values indicate that the LSTM captures almost all variance present in the reconstructed MPV series on both sets, confirming that the model learns the dominant trend and seasonal components driven by anchor constraints and the densification procedure.</p>
        <p>Table 3. Error index.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>Training Set</td>
                <td>Testing Set</td>
                <td>Ratio</td>
              </tr>
              <tr>
                <td>
                  R
                  <sup>2</sup>
                </td>
                <td>0.9997</td>
                <td>0.9983</td>
                <td>−0.14%</td>
              </tr>
              <tr>
                <td>RMSE</td>
                <td>0.3679</td>
                <td>0.8462</td>
                <td>56.52%</td>
              </tr>
              <tr>
                <td>MAE</td>
                <td>0.2658</td>
                <td>0.6804</td>
                <td>60.93%</td>
              </tr>
              <tr>
                <td>MBE</td>
                <td>0.0034</td>
                <td>0.1251</td>
                <td>97.28%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The root-mean-square error (<italic>RMSE</italic>) illustrated in <bold>Table 3</bold> quantifies the standard deviation of prediction errors in the original units of MPV, and also provides a direct measure of the typical magnitude of large deviations between MLP anchor-constrained MPV series and predicted series. As shown in <bold>Equation</bold><bold>(20)</bold>, <italic>RMSE</italic> is computed as the square root of the mean squared forecasting error:</p>
        <disp-formula id="FD20">
          <label>(20)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>R</mml:mi>
              <mml:mi>M</mml:mi>
              <mml:mi>S</mml:mi>
              <mml:mi>E</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mi>n</mml:mi>
                  </mml:mfrac>
                  <mml:munderover>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>i</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mi>n</mml:mi>
                  </mml:munderover>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>y</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mover accent="true">
                              <mml:mi>y</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:msqrt>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Upon the calculation with <bold>Equation</bold><bold>(20)</bold> above, <italic>RMSE</italic> increased from 0.3679 on training to 0.8462 on testing with relative increase of 56.5%. This rise indicates that, although the model explains variance (high R<sup>2</sup>), its absolute predictive uncertainty grows out-of-sample.</p>
        <p>Moreover, Mean Absolute Error (<italic>MAE</italic>) and Mean Bias Error (<italic>MBE</italic>) complement <italic>RMSE</italic> by respectively quantifying the typical absolute forecast deviation and any systematic directional error, while both are illustrated in <bold>Table 3</bold> and computed as follows:</p>
        <disp-formula id="FD21">
          <label>(21)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>M</mml:mi>
              <mml:mi>A</mml:mi>
              <mml:mi>E</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mo>|</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>y</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>|</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD22">
          <label>(22)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>M</mml:mi>
              <mml:mi>B</mml:mi>
              <mml:mi>E</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>y</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>As shown in <bold>Equation</bold><bold>(21)</bold>, the evaluation value of <italic>MAE</italic> indicates the average magnitude of errors regardless of sign, and in this study, <italic>MAE</italic> rose from 0.2658 (train) to 0.6804 (test), with 60.93% increase as shown in <bold>Table 3</bold>, reflecting the <italic>RMSE</italic> trend but being less sensitive to large individual errors. The <italic>MAE</italic> change indicates that typical point-forecast deviations roughly doubled when the model was applied to unseen periods, which suggests that the model’s expected absolute error under operational conditions is materially larger than suggested by in-sample diagnostics. Referring to [<xref ref-type="bibr" rid="B17">17</xref>], for decision-makers in a First-Launch Economy context, <italic>MAE</italic> is often more interpretable than <italic>RMSE</italic> because it maps directly to the average (absolute) production-value forecasting error and can be compared to tolerable policy thresholds.</p>
        <p>Furthermore, according to <bold>Table 3</bold>, the value of <italic>MBE</italic> increases from a near-zero 0.0034 on the training set to 0.1251 on the testing set, with a relative increase of 97% based on <bold>Equation</bold><bold>(22)</bold>. A near-zero training <italic>MBE</italic> confirms unbiased in-sample fitting, but the positive testing <italic>MBE</italic> signals a systematic offset in the held-out period (the sign convention determines whether this is over- or under-prediction). Although the absolute magnitude of 0.1251 must be interpreted relative to the MPV scale, its growth highlights a persistent directional error that can compound when aggregated monthly/annually, which is critical when forecasts inform resource allocation or policy evaluation.</p>
        <p>In summary, the four different metrics show a model that explains variance extremely well but exhibits substantial growth in absolute error and bias out-of-sample. This pattern is consistent with the study’s reliance on synthetic densification (anchor-constrained daily augmentation) to create training sequences, due to the LSTM successfully learns the anchor-consistent structure but being sensitive to differences between synthetic residual statistics and real later behavior.</p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Summarization</title>
        <p>As shown in <xref ref-type="fig" rid="fig15">Figure 15</xref>, the complete prediction cycle of the LSTM neural network demonstrates that the forecasts with LSTM (red dashed line) track the anchor-constrained MLP production series (black line) across both the training (2018-2024) and test (2024-2026) horizons. The LSTM neural network in this study captures the long-run growth trend associated with the First-Launch Economy ramp-up in Ankang, distinct inter- and intra-annual seasonal peaks (notably the 8 - 11-month export/production crests), and medium-frequency local fluctuations introduced by the synthetic densification procedure. The alignment in this study is corroborated by the high in-sample explained variance and low training <italic>RMSE</italic>, reflecting the capacity of LSTM to preserve long-term temporal dependencies through its gated cell state while flexibly responding to short-term inputs.</p>
        <fig id="fig18">
          <label>Figure 18</label>
          <graphic xlink:href="https://html.scirp.org/file/8601912-rId304.jpeg?20260527085435" />
        </fig>
        <p>Figure 15. Full trend comparison with LSTM prediction.</p>
        <p>Despite the accurate extrapolation observed in the test set, error metrics indicate a measurable increase in out-of-sample pointwise uncertainty, characterized by elevated <italic>RMSE</italic> and <italic>MAE</italic> alongside a slightly lower <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> R </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> e </mml:mi><mml:mi> s </mml:mi><mml:mi> t </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msubsup></mml:mrow></mml:math></inline-formula> relative to the training phase. This discrepancy between structural tracking and pointwise accuracy is driven by the potential for real-world regime shifts (e.g., accelerated scaling, policy changes, or demand shocks) during 2024-2026, and the reliance on synthetic high-frequency residuals during training that may not match the true stochastic structure of the future horizon. Furthermore, because the evaluation relies on a synthetic target constructed via the anchors, the out-of-sample metrics primarily assess the robustness of LSTM in extrapolating learned nonlinear trends and seasonal distributions within this synthetic manifold, rather than its capacity to predict independent, unseen macroeconomic shocks.</p>
        <p>From a First-Launch Economy policy perspective, the tight agreement between prediction and anchor-constrained series validates that the digital-intelligence pipeline (ETL → MLP monthly reconstruction → densification → LSTM forecasting) produces policy-coherent, temporally granular projections that preserve officially reported annual anchors while supplying actionable monthly/daily estimates.</p>
        <p>Drawing upon public reports regarding the plush toy industry in Ankang City ([<xref ref-type="bibr" rid="B6">6</xref>]; [<xref ref-type="bibr" rid="B16">16</xref>]; [<xref ref-type="bibr" rid="B35">35</xref>]; [<xref ref-type="bibr" rid="B36">36</xref>]; [<xref ref-type="bibr" rid="B40">40</xref>]), <bold>Table 4</bold> elucidates a sustained, monotonic expansion across four key structural indicators (enterprise quantity, annual production value, employment, and export volume) from 2018 to 2025. This growth trajectory aligns with the developmental stages of a policy-driven industrial cluster, characterizing the evolution from initial capacity formation (2018-2019) and agglomeration-based scale-up (2020-2022) to rapid output expansion during the maturation phase (2022-2025). These observed economic behaviors corroborate the First-Launch Economy of the plush toy industry in Ankang City, which is underpinned by industrial relocation and community factory deployment, thereby providing a robust empirical foundation that justifies the data reconstruction via MLP and the economic analysis with prediction using LSTM neural networks.</p>
        <p>Table 4. Annual economic data of the Ankang plush toy industry ([<xref ref-type="bibr" rid="B6">6</xref>]; [<xref ref-type="bibr" rid="B16">16</xref>]; [<xref ref-type="bibr" rid="B35">35</xref>]; [<xref ref-type="bibr" rid="B36">36</xref>]; [<xref ref-type="bibr" rid="B40">40</xref>]).</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td rowspan="2">Year</td>
                <td rowspan="2">Number of industries</td>
                <td>Annual production value</td>
                <td>Employment</td>
                <td>Exports</td>
              </tr>
              <tr>
                <td>Million USD</td>
                <td>Person</td>
                <td>Million USD</td>
              </tr>
              <tr>
                <td>2018</td>
                <td>Initial stage</td>
                <td>-</td>
                <td>52</td>
                <td>-</td>
              </tr>
              <tr>
                <td>2021</td>
                <td>569</td>
                <td>13.92</td>
                <td>12,000</td>
                <td>-</td>
              </tr>
              <tr>
                <td>2022</td>
                <td>826</td>
                <td>27.27</td>
                <td>18,000</td>
                <td>-</td>
              </tr>
              <tr>
                <td>2023</td>
                <td>788 - 807</td>
                <td>80.51</td>
                <td>19,000</td>
                <td>9.61</td>
              </tr>
              <tr>
                <td>2024</td>
                <td>805 - 806</td>
                <td>105.24</td>
                <td>21,770</td>
                <td>7.95</td>
              </tr>
              <tr>
                <td>2025</td>
                <td>800 - 811</td>
                <td>139.77</td>
                <td>-</td>
                <td>-</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>A rigorous comparison between the publicly published annual production values in <bold>Table 4</bold> and the LSTM-predicted trajectories in <xref ref-type="fig" rid="fig15">Figure 15</xref> reveals a high degree of alignment, validating the efficacy of the pipeline’s hard-anchoring mechanism. By preserving MLP-derived annual benchmarks during densification, this procedure effectively constrains the LSTM to replicate policy-relevant aggregates while simultaneously capturing granular intra-year dynamics. Consequently, the high coefficient of determination (<inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> ) and low in-sample errors reported in <bold>Table</bold><bold>3</bold> signify that the model has successfully learned anchor-constrained trends and seasonality, rather than succumbing to arbitrary overfitting. Furthermore, the moderate increase in out-of-sample error metrics (<italic>RMSE</italic>/<italic>MAE</italic>) underscores the inherent limitations of forecasting via synthetic augmentation. The results indicate that even if the LSTM generalizes the structural trend robustly, it exhibits increased pointwise uncertainty when extrapolating into future horizons, potentially subject to regime shifts or unmodeled exogenous shocks. Upon the discussion above, the statistical concordance between the ETL aggregates and LSTM outputs confirms the framework’s practical feasibility for generating temporally granular, anchor-consistent forecasts essential for First-Launch Economy evaluation.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Conclusion</title>
      <p>By synthesizing export data across the National Bureau of Statistics, customs benchmarks, business registries, e-commerce records, and cross-validated against annual anchors from local government and media reports, this study employed an ETL (Extract-Transform-Load) pipeline to reconstruct coherent annual and monthly production series for Ankang’s plush toy industry. The resulting aggregates demonstrate internal consistency across multiple dimensions, including enterprise counts, employment, export volumes, and total production value, thereby validating the capacity of ETL-based data fusion to recover policy-relevant economic signals in the absence of high-frequency official observations. Consequently, the findings in this study establish that a digital-intelligence workflow, grounded in official macro-statistics and enriched by multi-source data extraction, offers a robust and empirically grounded framework for analyzing emergent, policy-driven First-Launch Economy clusters in data-scarce environments.</p>
      <p>Leveraging the ETL-derived time series, the LSTM-based forecasting framework developed in this study demonstrates a robust capacity to replicate anchor-constrained Monthly Production Value (MPV) trajectories and extend structural trends into short-term out-of-sample horizons. This predictive efficacy is fundamentally rooted in the model’s recurrent gate architecture (comprising forget, input, and output gates), which enables the simultaneous preservation of long-term anchor signals and the learning of complex intra-annual seasonality and high-frequency residual patterns introduced via controlled data densification. Quantitatively, the model achieves high explanatory power (<inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> R </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> ) and minimal in-sample error, and it also yields defensible out-of-sample forecasts characterized by manageable increases in <italic>RMSE</italic>, <italic>MAE</italic>, and <italic>MBE</italic>, with minor biases that remain amenable to mitigation through ensemble or calibration techniques. Due to this, the results in this study substantiate the suitability of LSTM architectures for predictive modeling in contexts where periodic long-term anchors are available but dense, high-frequency longitudinal observations are sparse.</p>
      <p>From an economic and methodological perspective, the integration of ETL-based reconstruction with LSTM forecasting significantly enhances the analytical capacity to evaluate the efficiency of First-Launch Economy clusters within key assistance counties. By operationalizing qualitative policy narratives (such as industrial relocation, the expansion of community factories, and targeted developmental support) into quantitative, time-resolved indicators, this framework provides a robust empirical basis for optimizing supply-side upgrades, workforce allocation, and export facilitation strategies. More significantly, the maintenance of annual anchors ensures policy coherence, as the model-derived predictions remain strictly reconciled with officially reported aggregates, while simultaneously delivering the high-frequency temporal granularity essential for precise policy interventions, including pre-season capacity scaling and mid-year strategic investments. Upon the discussion above, this study demonstrates how AI-enabled predictive modeling can be harmonized with traditional economic measurement to generate decision-relevant intelligence for regional development and industrial policy optimization.</p>
      <p>In conclusion, this study provides both empirical evidence and a transferable methodological template, demonstrating that the synergy of ETL-based data fusion and LSTM deep learning architectures can effectively evaluate and forecast the performance of First-Launch Economy clusters. Based on the Ankang plush toy industrial ecosystem, the integrated pipeline in this study yields high-resolution, anchor-consistent projections that not only validate trajectories of rapid industrial expansion but also offer actionable strategic insights for regional policy formulation. Macroscopically, the proposed framework in this study establishes a rigorous theoretical and practical foundation for AI-enhanced economic monitoring and decision-support systems, offering a scalable paradigm for analyzing emergent industrial clusters in data-constrained or nascent economic environments.</p>
    </sec>
    <sec id="sec6">
      <title>Acknowledgements</title>
      <p>This work was supported by the 2025 science and technology project of Ankang Municipal Science and Technology Bureau, “AI-based Plush Toy Image Generation and Design Using Deep Learning Neural Networks”, under Grant AK2025-GY-24.</p>
      <p>Additionally, this work benefited significantly from the comprehensive resources provided by the Ankang Science &amp; Technology Innovation Center (Qinchuangyuan Platform), which facilitated the execution and provided technical assistance for this scientific investigation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Adamopoulos, I., Valamontes, A., Karantonis, J. T., Tropaitis, P. P., &amp; Syrou, N. (2025). Enhancing Economic Growth Time Series for UAE Forecasting with Deep Learning: A Seq2Seq and Attention-Driven LSTM Approach. <italic>EDRAAK, 2025,</italic> 62-75. https://doi.org/10.70470/edraak/2025/009 <pub-id pub-id-type="doi">10.70470/edraak/2025/009</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.70470/edraak/2025/009">https://doi.org/10.70470/edraak/2025/009</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Adamopoulos, I.</string-name>
              <string-name>Valamontes, A.</string-name>
              <string-name>Karantonis, J.</string-name>
              <string-name>Tropaitis, P.</string-name>
              <string-name>Syrou, N.</string-name>
            </person-group>
            <year>2025</year>
            <pub-id pub-id-type="doi">10.70470/edraak/2025/009</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="report">Ankang Plush Toy Industry Inspection Group (2018). <italic>Investigation Report on the Plush Toy Industry</italic>. Xinhua News Agency. https://www.ankang.gov.cn/Content-1537332.html</mixed-citation>
          <element-citation publication-type="report">
            <year>2018</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Cen, T., Lin, S., &amp; Wu, Q. (2022). How Does Digital Economy Affect Rural Revitalization? The Mediating Effect of Industrial Upgrading. <italic>Sustainability, 14,</italic> Article No. 16987. https://doi.org/10.3390/su142416987 <pub-id pub-id-type="doi">10.3390/su142416987</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su142416987">https://doi.org/10.3390/su142416987</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Cen, T.</string-name>
              <string-name>Lin, S.</string-name>
              <string-name>Wu, Q.</string-name>
            </person-group>
            <year>2022</year>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/su142416987</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Chen, D., Wei, W., Hu, D., &amp; Muralidharan, E. (2016). Survival Strategy of OEM Companies: A Case Study of the Chinese Toy Industry. <italic>International Journal of Operations &amp; Production Management, 36,</italic> 1065-1088. https://doi.org/10.1108/ijopm-04-2015-0212 <pub-id pub-id-type="doi">10.1108/ijopm-04-2015-0212</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1108/ijopm-04-2015-0212">https://doi.org/10.1108/ijopm-04-2015-0212</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Chen, D.</string-name>
              <string-name>Wei, W.</string-name>
              <string-name>Hu, D.</string-name>
              <string-name>Muralidharan, E.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1108/ijopm-04-2015-0212</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Deng, X., Huang, M., &amp; Peng, R. (2024). The Impact of Digital Economy on Rural Revitalization: Evidence from Guangdong, China. <italic>Heliyon, 10,</italic> e28216. https://doi.org/10.1016/j.heliyon.2024.e28216 <pub-id pub-id-type="doi">10.1016/j.heliyon.2024.e28216</pub-id><pub-id pub-id-type="pmid">38601566</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.heliyon.2024.e28216">https://doi.org/10.1016/j.heliyon.2024.e28216</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Deng, X.</string-name>
              <string-name>Huang, M.</string-name>
              <string-name>Peng, R.</string-name>
              <string-name>Guangdong, C</string-name>
            </person-group>
            <year>2024</year>
            <pub-id pub-id-type="doi">10.1016/j.heliyon.2024.e28216</pub-id>
            <pub-id pub-id-type="pmid">38601566</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Department of Human Resources, &amp; Social Security of Shaanxi Province (2025). <italic>Ankang: Systematically Building a New Integrated Development Paradigm of</italic><italic>“</italic><italic>Plush Toys + AI + Cultural Tourism</italic><italic>”</italic>. https://rst.shaanxi.gov.cn/sy/ztzl/rdzt/rsgzjyq/jyjl/202512/t20251231_3601171.html</mixed-citation>
          <element-citation publication-type="web">
            <year>2025</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Fawaz, H. I., Forestier, G., Weber, J., Idoumghar, L., &amp; Muller, P. A. (2018). <italic>Data Augmentation Using Synthetic Data for Time Series Classification with Deep Residual Networks</italic>.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Fawaz, H.</string-name>
              <string-name>Forestier, G.</string-name>
              <string-name>Weber, J.</string-name>
              <string-name>Idoumghar, L.</string-name>
              <string-name>Muller, P.</string-name>
            </person-group>
            <year>2018</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Fritsch, F. N., &amp; Carlson, R. E. (1980). Monotone Piecewise Cubic Interpolation. <italic>SIAM Journal on Numerical Analysis, 17,</italic> 238-246. https://doi.org/10.1137/0717021 <pub-id pub-id-type="doi">10.1137/0717021</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1137/0717021">https://doi.org/10.1137/0717021</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Fritsch, F.</string-name>
              <string-name>Carlson, R.</string-name>
            </person-group>
            <year>1980</year>
            <pub-id pub-id-type="doi">10.1137/0717021</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Gal, Y., &amp; Ghahramani, Z. (2016). Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning. In <italic>International Conference on Machine Learning</italic> (pp. 1050-1059). PMLR.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Gal, Y.</string-name>
              <string-name>Ghahramani, Z.</string-name>
            </person-group>
            <year>2016</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Gereffi, G. (2019). Global Value Chains, Development, and Emerging Economies. In P. Lund-Thomsen, <italic>et al</italic>. (Eds.), <italic>Business and Development Studies</italic> (pp. 125-158). Routledge. https://doi.org/10.4324/9781315163338-6 <pub-id pub-id-type="doi">10.4324/9781315163338-6</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4324/9781315163338-6">https://doi.org/10.4324/9781315163338-6</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Gereffi, G.</string-name>
              <string-name>Chains, D</string-name>
            </person-group>
            <year>2019</year>
            <pub-id pub-id-type="doi">10.4324/9781315163338-6</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Goodfellow, I., Bengio, Y., &amp; Courville, A. (2016). <italic>Deep Learning</italic>. MIT Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Goodfellow, I.</string-name>
              <string-name>Bengio, Y.</string-name>
              <string-name>Courville, A.</string-name>
            </person-group>
            <year>2016</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Greff, K., Srivastava, R. K., Koutnik, J., Steunebrink, B. R., &amp; Schmidhuber, J. (2016). LSTM: A Search Space Odyssey. <italic>IEEE Transactions on Neural Networks and Learning Systems, 28,</italic> 2222-2232. https://doi.org/10.1109/tnnls.2016.2582924 <pub-id pub-id-type="doi">10.1109/tnnls.2016.2582924</pub-id><pub-id pub-id-type="pmid">27411231</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tnnls.2016.2582924">https://doi.org/10.1109/tnnls.2016.2582924</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Greff, K.</string-name>
              <string-name>Srivastava, R.</string-name>
              <string-name>Koutnik, J.</string-name>
              <string-name>Steunebrink, B.</string-name>
              <string-name>Schmidhuber, J.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1109/tnnls.2016.2582924</pub-id>
            <pub-id pub-id-type="pmid">27411231</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Haider, S. A., Naqvi, S. R., Akram, T., Umar, G. A., Shahzad, A., Sial, M. R. et al. (2019). LSTM Neural Network Based Forecasting Model for Wheat Production in Pakistan. <italic>Agronomy, 9,</italic> Article No. 72. https://doi.org/10.3390/agronomy9020072 <pub-id pub-id-type="doi">10.3390/agronomy9020072</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/agronomy9020072">https://doi.org/10.3390/agronomy9020072</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Haider, S.</string-name>
              <string-name>Naqvi, S.</string-name>
              <string-name>Akram, T.</string-name>
              <string-name>Umar, G.</string-name>
              <string-name>Shahzad, A.</string-name>
              <string-name>Sial, M.</string-name>
            </person-group>
            <year>2019</year>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/agronomy9020072</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hamiane, S., Ghanou, Y., Khalifi, H., &amp; Telmem, M. (2024). Comparative Analysis of LSTM, ARIMA, and Hybrid Models for Forecasting Future GDP. <italic>Ingénierie des Systèmes d Information, 29,</italic> 853-861. https://doi.org/10.18280/isi.290306 <pub-id pub-id-type="doi">10.18280/isi.290306</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18280/isi.290306">https://doi.org/10.18280/isi.290306</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hamiane, S.</string-name>
              <string-name>Ghanou, Y.</string-name>
              <string-name>Khalifi, H.</string-name>
              <string-name>Telmem, M.</string-name>
              <string-name>LSTM, A</string-name>
            </person-group>
            <year>2024</year>
            <pub-id pub-id-type="doi">10.18280/isi.290306</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hochreiter, S., &amp; Schmidhuber, J. (1997). Long Short-Term Memory. <italic>Neural Computation, 9,</italic> 1735-1780. https://doi.org/10.1162/neco.1997.9.8.1735 <pub-id pub-id-type="doi">10.1162/neco.1997.9.8.1735</pub-id><pub-id pub-id-type="pmid">9377276</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1162/neco.1997.9.8.1735">https://doi.org/10.1162/neco.1997.9.8.1735</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hochreiter, S.</string-name>
              <string-name>Schmidhuber, J.</string-name>
            </person-group>
            <year>1997</year>
            <pub-id pub-id-type="doi">10.1162/neco.1997.9.8.1735</pub-id>
            <pub-id pub-id-type="pmid">9377276</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Hong, Y., &amp; Liang J. (2023). Plush Toys Produced in Small City in NW China’s Shaanxi Reach over 80 Countries, Regions. <italic>People’s Daily</italic>. https://en.people.cn/n3/2023/0921/c98649-20074698.html</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Hong, Y.</string-name>
              <string-name>Countries, R</string-name>
            </person-group>
            <year>2023</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hyndman, R. J., &amp; Athanasopoulos, G. (2018). <italic>Forecasting: Principles and Practice</italic>. OTexts.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hyndman, R.</string-name>
              <string-name>Athanasopoulos, G.</string-name>
            </person-group>
            <year>2018</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Iwana, B. K., &amp; Uchida, S. (2021). An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks. <italic>PLOS ONE, 16,</italic> e0254841. https://doi.org/10.1371/journal.pone.0254841 <pub-id pub-id-type="doi">10.1371/journal.pone.0254841</pub-id><pub-id pub-id-type="pmid">34264999</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0254841">https://doi.org/10.1371/journal.pone.0254841</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Iwana, B.</string-name>
              <string-name>Uchida, S.</string-name>
            </person-group>
            <year>2021</year>
            <pub-id pub-id-type="doi">10.1371/journal.pone.0254841</pub-id>
            <pub-id pub-id-type="pmid">34264999</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Kaplinsky, R., &amp; Morris, M. (2016). Thinning and Thickening: Productive Sector Policies in the Era of Global Value Chains. <italic>The European Journal of Development Research, 28,</italic> 625-645. https://doi.org/10.1057/ejdr.2015.29 <pub-id pub-id-type="doi">10.1057/ejdr.2015.29</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1057/ejdr.2015.29">https://doi.org/10.1057/ejdr.2015.29</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Kaplinsky, R.</string-name>
              <string-name>Morris, M.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1057/ejdr.2015.29</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Kee, H. L., &amp; Tang, H. (2016). Domestic Value Added in Exports: Theory and Firm Evidence from China. <italic>American Economic Review, 106,</italic> 1402-1436. https://doi.org/10.1257/aer.20131687 <pub-id pub-id-type="doi">10.1257/aer.20131687</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1257/aer.20131687">https://doi.org/10.1257/aer.20131687</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Kee, H.</string-name>
              <string-name>Tang, H.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1257/aer.20131687</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, Z., Wu, H., &amp; Badar, I. H. (2024a). Impact of Rural Digital Economy Development on Rural Revitalisation—Evidence from China. <italic>Sustainability, 16,</italic> Article No. 4573. https://doi.org/10.3390/su16114573 <pub-id pub-id-type="doi">10.3390/su16114573</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su16114573">https://doi.org/10.3390/su16114573</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, Z.</string-name>
              <string-name>Wu, H.</string-name>
              <string-name>Badar, I.</string-name>
            </person-group>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/su16114573</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, F., Yu, Z. C., &amp; Deng, M. L. (2024b). An Empirical Study on the Impact of Digital Economy Development on the Quality of Rural Revitalization. <italic>Science &amp; Technology Progress and Policy, 41,</italic> 47-57.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, F.</string-name>
              <string-name>Yu, Z.</string-name>
              <string-name>Deng, M.</string-name>
            </person-group>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, Y. (2019). Event and Sustainable Culture-Led Regeneration: Lessons from the 2008 European Capital of Culture, Liverpool. <italic>Sustainability, 11,</italic> Article No. 1869. https://doi.org/10.3390/su11071869 <pub-id pub-id-type="doi">10.3390/su11071869</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su11071869">https://doi.org/10.3390/su11071869</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, Y.</string-name>
              <string-name>Culture, L</string-name>
            </person-group>
            <year>2019</year>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/su11071869</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Lu, Y., Meng, Y., Chen, L., &amp; Zhang, Y. (2024). Can the Digital Economy Contribute to Rural Revitalization? A Case of from China? <italic>PLOS ONE, 19,</italic> e0310313. https://doi.org/10.1371/journal.pone.0310313 <pub-id pub-id-type="doi">10.1371/journal.pone.0310313</pub-id><pub-id pub-id-type="pmid">39374210</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0310313">https://doi.org/10.1371/journal.pone.0310313</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Lu, Y.</string-name>
              <string-name>Meng, Y.</string-name>
              <string-name>Chen, L.</string-name>
              <string-name>Zhang, Y.</string-name>
            </person-group>
            <year>2024</year>
            <pub-id pub-id-type="doi">10.1371/journal.pone.0310313</pub-id>
            <pub-id pub-id-type="pmid">39374210</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Luo, G., Yang, Y., &amp; Wang, L. (2023). Driving Rural Industry Revitalization in the Digital Economy Era: Exploring Strategies and Pathways in China. <italic>PLOS ONE, 18,</italic> e0292241. https://doi.org/10.1371/journal.pone.0292241 <pub-id pub-id-type="doi">10.1371/journal.pone.0292241</pub-id><pub-id pub-id-type="pmid">37768942</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0292241">https://doi.org/10.1371/journal.pone.0292241</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Luo, G.</string-name>
              <string-name>Yang, Y.</string-name>
              <string-name>Wang, L.</string-name>
            </person-group>
            <year>2023</year>
            <pub-id pub-id-type="doi">10.1371/journal.pone.0292241</pub-id>
            <pub-id pub-id-type="pmid">37768942</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Pascanu, R., Mikolov, T., &amp; Bengio, Y. (2013). On the Difficulty of Training Recurrent Neural Networks. In <italic>International Conference on Machine Learning</italic> (pp. 1310-1318). PMLR.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Pascanu, R.</string-name>
              <string-name>Mikolov, T.</string-name>
              <string-name>Bengio, Y.</string-name>
            </person-group>
            <year>2013</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Paszkowski, S., &amp; Sarniak, Ł. (2019). Differences in Rural Development Potential across Polish Regions. <italic>Journal of Agribusiness and Rural Development, 51,</italic> 59-68. https://doi.org/10.17306/j.jard.2019.01102 <pub-id pub-id-type="doi">10.17306/j.jard.2019.01102</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.17306/j.jard.2019.01102">https://doi.org/10.17306/j.jard.2019.01102</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Paszkowski, S.</string-name>
            </person-group>
            <year>2019</year>
            <pub-id pub-id-type="doi">10.17306/j.jard.2019.01102</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Pyo, D. J. (2025). Enhancing GDP Growth Forecasting with LSTM, GRU, and Hybrid Model: Evidence from South Korea. <italic>Sage Open, 15,</italic> No. 3. https://doi.org/10.1177/21582440251359828 <pub-id pub-id-type="doi">10.1177/21582440251359828</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1177/21582440251359828">https://doi.org/10.1177/21582440251359828</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Pyo, D.</string-name>
              <string-name>LSTM, G</string-name>
            </person-group>
            <year>2025</year>
            <pub-id pub-id-type="doi">10.1177/21582440251359828</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Shi, M., Yuan, H. T., &amp; Chen, X. A. (2026). Digital-Intelligence Empowerment for Rural Revitalization: Estimating First-Launch Economy Productivity Efficiency via ETL-MLP Time-Series Reconstruction. <italic>Open Journal of Social Sciences, 14,</italic> 340-367. https://doi.org/10.4236/jss.2026.143020 <pub-id pub-id-type="doi">10.4236/jss.2026.143020</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4236/jss.2026.143020">https://doi.org/10.4236/jss.2026.143020</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Shi, M.</string-name>
              <string-name>Yuan, H.</string-name>
              <string-name>Chen, X.</string-name>
            </person-group>
            <year>2026</year>
            <pub-id pub-id-type="doi">10.4236/jss.2026.143020</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Siami-Namini, S., &amp; Namin, A. S. (2018). Forecasting Economics and Financial Time Series: ARIMA vs. LSTM. https://arxiv.org/abs/1803.06386</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Siami-Namini, S.</string-name>
              <string-name>Namin, A.</string-name>
            </person-group>
            <year>2018</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., &amp; Salakhutdinov, R. (2014). Dropout: A Simple Way to Prevent Neural Networks from Overfitting. <italic>Journal of Machine Learning Research, 15,</italic> 1929-1958.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Srivastava, N.</string-name>
              <string-name>Hinton, G.</string-name>
              <string-name>Krizhevsky, A.</string-name>
              <string-name>Sutskever, I.</string-name>
              <string-name>Salakhutdinov, R.</string-name>
            </person-group>
            <year>2014</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Tian, Y., Liu, Q., Ye, Y., Zhang, Z., &amp; Khanal, R. (2023). How the Rural Digital Economy Drives Rural Industrial Revitalization—Case Study of China’s 30 Provinces. <italic>Sustainability, 15,</italic> Article No. 6923. https://doi.org/10.3390/su15086923 <pub-id pub-id-type="doi">10.3390/su15086923</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su15086923">https://doi.org/10.3390/su15086923</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Tian, Y.</string-name>
              <string-name>Liu, Q.</string-name>
              <string-name>Ye, Y.</string-name>
              <string-name>Zhang, Z.</string-name>
              <string-name>Khanal, R.</string-name>
            </person-group>
            <year>2023</year>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/su15086923</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Wang, S., Peng, T., Du, A. M., &amp; Lin, X. (2025). The Impact of the Digital Economy on Rural Industrial Revitalization. <italic>Research in International Business and Finance, 76,</italic> Article ID: 102878. https://doi.org/10.1016/j.ribaf.2025.102878 <pub-id pub-id-type="doi">10.1016/j.ribaf.2025.102878</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ribaf.2025.102878">https://doi.org/10.1016/j.ribaf.2025.102878</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Wang, S.</string-name>
              <string-name>Peng, T.</string-name>
              <string-name>Du, A.</string-name>
              <string-name>Lin, X.</string-name>
            </person-group>
            <year>2025</year>
            <fpage>102878</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.ribaf.2025.102878</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Wang, Y., Peng, Q., Jin, C., Ren, J., Fu, Y., &amp; Yue, X. (2023). Whether the Digital Economy Will Successfully Encourage the Integration of Urban and Rural Development: A Case Study in China. <italic>Chinese Journal of Population, Resources and Environment, 21,</italic> 13-25. https://doi.org/10.1016/j.cjpre.2023.03.002 <pub-id pub-id-type="doi">10.1016/j.cjpre.2023.03.002</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cjpre.2023.03.002">https://doi.org/10.1016/j.cjpre.2023.03.002</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Wang, Y.</string-name>
              <string-name>Peng, Q.</string-name>
              <string-name>Jin, C.</string-name>
              <string-name>Ren, J.</string-name>
              <string-name>Fu, Y.</string-name>
              <string-name>Yue, X.</string-name>
              <string-name>Population, R</string-name>
            </person-group>
            <year>2023</year>
            <pub-id pub-id-type="doi">10.1016/j.cjpre.2023.03.002</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B35">
        <label>35.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Xu, Q. (2024). Toys Help Ankang Residents to Lead a Plush New Life. <italic>China Daily</italic>. https://www.chinadailyhk.com/hk/article/232819?utm</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Xu, Q.</string-name>
            </person-group>
            <year>2024</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B36">
        <label>36.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Yu, H. C. (2023). <italic>Economic Watch: Made-in-China Stuffed Bears Spread Joy of Christmas Overseas</italic>. Xinhua News Agency. https://eng.yidaiyilu.gov.cn/p/0M6INNO1.html</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Yu, H.</string-name>
            </person-group>
            <year>2023</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B37">
        <label>37.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Zhang, T. (2024). How Small Toys Form Large Industrial Clusters (Onsite Commentary)—Acting as Steadfast Practitioners and Doers in Advancing Chinese-Style Modernization. <italic>People’s Daily</italic>. https://cpc.people.com.cn/BIG5/n1/2024/0509/c64387-40231976.html</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Zhang, T.</string-name>
            </person-group>
            <year>2024</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B38">
        <label>38.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, Z., Sun, C., &amp; Wang, J. (2023). How Can the Digital Economy Promote the Integration of Rural Industries—Taking China as an Example. <italic>Agriculture, 13,</italic> Article No. 2023. https://doi.org/10.3390/agriculture13102023 <pub-id pub-id-type="doi">10.3390/agriculture13102023</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/agriculture13102023">https://doi.org/10.3390/agriculture13102023</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, Z.</string-name>
              <string-name>Sun, C.</string-name>
              <string-name>Wang, J.</string-name>
            </person-group>
            <year>2023</year>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/agriculture13102023</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B39">
        <label>39.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zheng, C., &amp; Li, H. (2023). The Prediction of Collective Economic Development Based on the PSO-LSTM Model in Smart Agriculture. <italic>PeerJ Computer Science, 9,</italic> e1304. https://doi.org/10.7717/peerj-cs.1304 <pub-id pub-id-type="doi">10.7717/peerj-cs.1304</pub-id><pub-id pub-id-type="pmid">37346568</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.7717/peerj-cs.1304">https://doi.org/10.7717/peerj-cs.1304</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zheng, C.</string-name>
              <string-name>Li, H.</string-name>
            </person-group>
            <year>2023</year>
            <pub-id pub-id-type="doi">10.7717/peerj-cs.1304</pub-id>
            <pub-id pub-id-type="pmid">37346568</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B40">
        <label>40.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Zou, L. (2025). Proposal on Further Advancing the Upgrading and Development of the Plush Toy Industry. <italic>Ankang Municipal People’s Congress</italic>. https://rd.ankang.gov.cn/Content-2874919.html</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Zou, L.</string-name>
            </person-group>
            <year>2025</year>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>