example of elsevier output for a paper curl -H "Accept: application/json" -H "x-els-apikey: xxxxxx" "https://api.elsevier.com/content/article/pii/S0950584924002593"

elsevier.json

{
   "full-text-retrieval-response" : {
      "coredata" : {
         "articleNumber" : "107654",
         "dc:creator" : [
            {
               "$" : "Qian, Zhongsheng",
               "@_fa" : "true"
            },
            {
               "$" : "Yu, Qingyuan",
               "@_fa" : "true"
            },
            {
               "$" : "Zhu, Hui",
               "@_fa" : "true"
            },
            {
               "$" : "Liu, Jinping",
               "@_fa" : "true"
            },
            {
               "$" : "Fu, Tingfeng",
               "@_fa" : "true"
            }
         ],
         "dc:description" : "\n                  Integrating reinforcement learning (RL) into test case prioritization (TCP) aims to cope with the dynamic nature and time constraints of continuous integration (CI) testing. However, achieving optimal ranking across CI cycles is challenging if the RL agent starts from an unfavorable initial environment and deals with a dynamic environment characterized by continuous errors during learning. To mitigate the influence of adverse environments, this work proposes an approach to Test Case Prioritization which incorporates Locally Linear Embedding-based K-means Clustering and Dynamic Priority Factor into Reinforcement Learning (TCP-KDRL). Firstly, we exploit the K-means clustering method with Locally Linear Embedding (LLE) to mine the relationships between test cases, followed by assigning initial priority factors to the test cases. These test cases are ranked based on their initial factors, providing an improved initial learning environment for the agent in RL. Secondly, with the agent learning the ranking strategy in various cycles, we design a comprehensive reward indicator by considering running discrepancy and the position between test cases. Additionally, based on the reward values, the dynamic priority factors for the ranked test cases in each learning round of RL are adaptively updated and the sequence is locally fine-tuned. The fine-tuning strategy provides ample feedback to the agent and enables real-time correction of the erroneous ranking environment, enhancing the generalization of RL across various cycles. Finally, the experimental results demonstrate that TCP-KDRL, as an enhanced RL-based TCP method, outperforms other competitive TCP approaches. Specifically, incorporating the reward indicator and the fine-tuning strategy components, the results are significantly better than that of combining any other two components. For instance, in 12 projects, the average improvements are 0.1548 in APFD and 0.0793 in NRPA. Compared to other TCP methods, the proposed method achieves notable enhancement, with an increase of 0.6902 in APFD and 0.3816 in NRPA.\n               ",
         "dc:format" : "application/json",
         "dc:identifier" : "doi:10.1016/j.infsof.2024.107654",
         "dc:title" : "Reinforcement learning for test case prioritization based on LLEed K-means clustering and dynamic priority factor ",
         "dcterms:subject" : [
            {
               "$" : "Test case prioritization",
               "@_fa" : "true"
            },
            {
               "$" : "Continuous integration",
               "@_fa" : "true"
            },
            {
               "$" : "Reinforcement learning",
               "@_fa" : "true"
            },
            {
               "$" : "LLEed K-means clustering",
               "@_fa" : "true"
            },
            {
               "$" : "Dynamic priority factor",
               "@_fa" : "true"
            }
         ],
         "eid" : "1-s2.0-S0950584924002593",
         "link" : [
            {
               "@_fa" : "true",
               "@href" : "https://api.elsevier.com/content/article/pii/S0950584924002593",
               "@rel" : "self"
            },
            {
               "@_fa" : "true",
               "@href" : "https://www.sciencedirect.com/science/article/pii/S0950584924002593",
               "@rel" : "scidir"
            }
         ],
         "openArchiveArticle" : false,
         "openaccess" : "0",
         "openaccessArticle" : false,
         "openaccessSponsorName" : null,
         "openaccessSponsorType" : null,
         "openaccessType" : null,
         "openaccessUserLicense" : null,
         "pii" : "S0950-5849(24)00259-3",
         "prism:aggregationType" : "Journal",
         "prism:copyright" : "© 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.",
         "prism:coverDate" : "2025-03-31",
         "prism:coverDisplayDate" : "March 2025",
         "prism:doi" : "10.1016/j.infsof.2024.107654",
         "prism:issn" : "09505849",
         "prism:pageRange" : "107654",
         "prism:publicationName" : "Information and Software Technology",
         "prism:publisher" : "Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.",
         "prism:startingPage" : "107654",
         "prism:url" : "https://api.elsevier.com/content/article/pii/S0950584924002593",
         "prism:volume" : "179",
         "pubType" : "fla"
      },
      "link" : {
         "@href" : "https://api.elsevier.com/content/abstract/scopus_id/85213267484",
         "@rel" : "abstract"
      },
      "originalText" : {
         "xocs:doc" : {
            "xocs:meta" : {
               "xocs:available-online-date" : {
                  "$" : "2024-12-18",
                  "@yyyymmdd" : "20241218"
               },
               "xocs:open-access" : {
                  "xocs:oa-article-status" : {
                     "@is-open-access" : "0",
                     "@is-open-archive" : "0"
                  }
               }
            }
         }
      },
      "scopus-eid" : "2-s2.0-85213267484",
      "scopus-id" : "85213267484"
   }
}