Theoretical Computer Science最新文献

{"title":"Packing internally disjoint Steiner paths of modified bubble-sort networks","authors":"Lina Zhao ,&nbsp;Shiying Wang ,&nbsp;Wei Feng","doi":"10.1016/j.tcs.2025.115484","DOIUrl":"10.1016/j.tcs.2025.115484","url":null,"abstract":"<div><div>Let <em>G</em> be a connected simple graph with vertex set <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> and edge set <span><math><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. For <span><math><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> with <span><math><mo>|</mo><mi>S</mi><mo>|</mo><mo>≥</mo><mn>2</mn></math></span>, a path <em>P</em> in <em>G</em> is said to be an <em>S</em>-Steiner path (or <em>S</em>-path for short) if it connects all vertices of <em>S</em>. Two <em>S</em>-paths <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are internally disjoint if <span><math><mi>E</mi><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo><mo>∩</mo><mi>E</mi><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo><mo>=</mo><mo>∅</mo></math></span> and <span><math><mi>V</mi><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo><mo>∩</mo><mi>V</mi><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo><mo>=</mo><mi>S</mi></math></span>. The packing number of internally disjoint <em>S</em>-paths, denoted as <span><math><msub><mrow><mi>π</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span>, is the maximum number of internally disjoint <em>S</em>-paths in <em>G</em>. For an integer <span><math><mn>2</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mo>|</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>|</mo></math></span>, the <em>k</em>-path connectivity of a graph <em>G</em> is defined as <span><math><msub><mrow><mi>π</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo></math></span> min<span><math><mo>{</mo><msub><mrow><mi>π</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> and <span><math><mo>|</mo><mi>S</mi><mo>|</mo><mo>=</mo><mi>k</mi><mo>}</mo></math></span>. The modified bubble-sort graph, denoted <span><math><mi>M</mi><msub><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, is an interconnection network topological model for multiprocessor systems. In this paper, we focus on the 3-path-connectivity of the <em>n</em>-dimensional modified bubble sort graphs. By analyzing the structural properties of <span><math><mi>M</mi><msub><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, we determine that <span><math><msub><mrow><mi>π</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>(</mo><mi>M</mi><msub><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo><mo>=</mo><mo>⌊</mo><mfrac><mrow><mn>3</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>4</mn></mrow></mfrac><mo>⌋</mo></math></span> for <span><math><mi>n</mi><mo>≥</mo><mn>4</mn></math></span>.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115484"},"PeriodicalIF":1.0,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144738334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A matching-based approximation algorithm for the traveling tournament problem","authors":"Jingyang Zhao,&nbsp;Mingyu Xiao","doi":"10.1016/j.tcs.2025.115485","DOIUrl":"10.1016/j.tcs.2025.115485","url":null,"abstract":"<div><div>The Traveling Tournament Problem (TTP-<em>k</em>) is a well-known benchmark problem in tournament timetabling. It involves designing a feasible double round-robin tournament for a sports league of <em>n</em> teams under several feasibility requirements, while minimizing the total traveling costs of the teams. The parameter <em>k</em> requires that in the tournament at most <em>k</em> consecutive home games or away games for each team are allowed. TTP-<em>k</em> with a small <em>k</em>, especially for <span><math><mi>k</mi><mo>=</mo><mn>2</mn><mo>,</mo><mn>3</mn></math></span> and 4, have been extensively studied in the literature. In this paper, we focus on TTP-4 and design an efficient algorithm for it based on minimum weight matching. In theory, we prove that our algorithm has an approximation ratio of <span><math><mn>1.625</mn><mo>+</mo><mi>ε</mi></math></span> for any constant <span><math><mi>ε</mi><mo>&gt;</mo><mn>0</mn></math></span>, improving the best-known approximation ratio of <span><math><mn>1.7</mn><mo>+</mo><mi>ε</mi></math></span>. In practice, our experimental results indicate an average improvement of 6.65% over the best-known solutions on 9 benchmark instances.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115485"},"PeriodicalIF":1.0,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144722189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Arborescences and shortest path trees when colors matter","authors":"P.S. Ardra ,&nbsp;Jasine Babu ,&nbsp;Kritika Kashyap ,&nbsp;R. Krithika ,&nbsp;Sreejith K. Pallathumadam ,&nbsp;Deepak Rajendraprasad","doi":"10.1016/j.tcs.2025.115486","DOIUrl":"10.1016/j.tcs.2025.115486","url":null,"abstract":"<div><div>We are given an edge-colored (directed or undirected) graph and our objective is to find a specific type of subgraph, like a spanning tree, an arborescence, a single-source shortest path tree, a perfect matching etc., with constraints on the number of edges of each color. Some of these problems, like color-constrained spanning tree, have elegant solutions and some of them, like color-constrained perfect matching, are longstanding open questions. In this work, we study color-constrained arborescences and shortest path trees. Computing a color-constrained shortest path tree on weighted digraphs turns out to be <span><math><mi>NP</mi></math></span>-hard in general but polynomial-time solvable when all cycles have positive weight. This polynomial-time solvability is due to the fact that the solution space is essentially the set of all color-constrained arborescences of a directed acyclic subgraph of the original graph. While finding color-constrained arborescences of digraphs is <span><math><mi>NP</mi></math></span>-hard in general, we give an efficient algorithm when the input digraph is acyclic. Consequently, a color-constrained shortest path tree on weighted digraphs having only positive weight cycles can be efficiently computed. Our algorithm generalizes to the problem of finding a color-constrained shortest path tree with the minimum total weight. Both our algorithms use a single source shortest path algorithm and a (minimum cost) maximum flow algorithm as subroutines. By using the recent algorithm by van den Brand et al. (FOCS 2023) for these subroutines, our algorithms achieve near-linear running time when the edge weights are integral and polynomially-bounded in the size of the graph. En route, we sight nice connections to colored matroids and color-constrained bases. In fact, our approach can be adapted to find a largest common independent set of two generalized partition matroids in near-linear time.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115486"},"PeriodicalIF":1.0,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144723933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Recognizing and eliciting weakly single crossing profiles on trees","authors":"Palash Dey","doi":"10.1016/j.tcs.2025.115487","DOIUrl":"10.1016/j.tcs.2025.115487","url":null,"abstract":"<div><div>Single crossing profiles on trees are not downward closed — a sub-profile of a single crossing profile on trees is not necessarily a single crossing profile on trees. We define weakly single-crossing profiles on trees to be all single crossing profiles on trees and their sub-profiles thereby restoring downward closedness. We design a polynomial-time algorithm for recognizing these profiles. We then develop an efficient elicitation algorithm for this domain which works even if the preferences can be accessed only sequentially and the underlying single-crossing tree structure is not known beforehand. We complement our algorithmic results by proving a matching lower bound on the query complexity of our elicitation algorithm when the number of voters is large compared to the number of candidates. We also prove a lower bound of <span><math><mi>Ω</mi><mo>(</mo><msup><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> on the number of queries that any algorithm needs to ask to elicit single-crossing profile when random queries are allowed. This resolves an open question in <span><span>[18]</span></span> and proves optimality of their preference elicitation algorithm when random queries are allowed.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115487"},"PeriodicalIF":0.9,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144712990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ternary is still good for Parikh matrices","authors":"Robert Mercaş ,&nbsp;Wen Chean Teh","doi":"10.1016/j.tcs.2025.115489","DOIUrl":"10.1016/j.tcs.2025.115489","url":null,"abstract":"<div><div>The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 2021 only stands in the case of ternary alphabets, while providing counterexamples for larger alphabets. In particular, we show that the only type of distinguishability in the case of 3-letter alphabets is the trivial one. The second part of the paper builds on the notion of Parikh matrices for projections of words, discussed in the former part of this work, and answers, once more in the case of a ternary alphabet, a question posed by Atanasiu et al. in 2022 with regards to the minimal Hamming distance in between words sharing a congruency class.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115489"},"PeriodicalIF":0.9,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144712988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Faster and space efficient indexing for locality sensitive hashing","authors":"Bhisham Dev Verma ,&nbsp;Rameshwar Pratap","doi":"10.1016/j.tcs.2025.115479","DOIUrl":"10.1016/j.tcs.2025.115479","url":null,"abstract":"<div><div>This work suggests faster and space-efficient index construction algorithms for LSH for Euclidean distance (<em>a.k.a.</em> E2LSH) and cosine similarity (<em>a.k.a.</em> SRP). The index construction step of these LSHs relies on grouping data points into several bins of hash tables based on their hashcode. To generate an <em>m</em>-dimensional hashcode of the <em>d</em>-dimensional data point, these LSHs first project the data point onto a <em>d</em>-dimensional random Gaussian vector and then discretise the resulting inner product. The time and space complexity of both E2LSH and SRP for computing an <em>m</em>-sized hashcode of a <em>d</em>-dimensional vector is <span><math><mi>O</mi><mo>(</mo><mi>m</mi><mi>d</mi><mo>)</mo></math></span>, which becomes impractical for large values of <em>m</em> and <em>d</em>. To overcome this problem, we propose two alternative LSH hashcode generation algorithms both for Euclidean distance and cosine similarity, namely, CS-E2LSH, HCS-E2LSH and CS-SRP, HCS-SRP, respectively. CS-E2LSH and CS-SRP are based on count sketch <span><span>[1]</span></span> and HCS-E2LSH and HCS-SRP utilize higher-order count sketch <span><span>[2]</span></span>. These proposals significantly reduce the hashcode computation time from <span><math><mi>O</mi><mo>(</mo><mi>m</mi><mi>d</mi><mo>)</mo></math></span> to <span><math><mi>O</mi><mo>(</mo><mi>d</mi><mo>)</mo></math></span>. Additionally, both CS-E2LSH and CS-SRP reduce the space complexity from <span><math><mi>O</mi><mo>(</mo><mi>m</mi><mi>d</mi><mo>)</mo></math></span> to <span><math><mi>O</mi><mo>(</mo><mi>d</mi><mo>)</mo></math></span>; and HCS-E2LSH, HCS-SRP reduce the space complexity from <span><math><mi>O</mi><mo>(</mo><mi>m</mi><mi>d</mi><mo>)</mo></math></span> to <span><math><mi>O</mi><mo>(</mo><mi>N</mi><mroot><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></mroot><mo>)</mo></math></span> respectively, where <span><math><mi>N</mi><mo>≥</mo><mn>1</mn></math></span> denotes the size of the input/reshaped tensor. Our proposals are backed by strong mathematical guarantees, and we validate their performance through simulations on various real-world datasets.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115479"},"PeriodicalIF":0.9,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144694539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The automaticity of the set of primes","authors":"Thomas Dubbe","doi":"10.1016/j.tcs.2025.115480","DOIUrl":"10.1016/j.tcs.2025.115480","url":null,"abstract":"<div><div>For an integer <span><math><mi>q</mi><mo>≥</mo><mn>2</mn></math></span>, let <span><math><mi>A</mi><mo>=</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>}</mo></math></span>. The <em>q</em>-automaticity <span><math><mi>A</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> of a set <span><math><mi>X</mi></math></span> is the size of the smallest automaton over the alphabet <span><math><mi>A</mi></math></span> that recognizes <span><math><mi>X</mi></math></span> on all words of length ≤<em>x</em>. We show that the <em>q</em>-automaticity of the set of primes is at least <span><math><mi>x</mi><mi>exp</mi><mo>⁡</mo><mrow><mo>(</mo><mo>−</mo><mi>c</mi><msup><mrow><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>x</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>x</mi><mo>)</mo></mrow></math></span>, which is fairly close to the maximal <em>q</em>-automaticity.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1053 ","pages":"Article 115480"},"PeriodicalIF":0.9,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144679127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model","authors":"Lora Bailey ,&nbsp;Heather Smith Blake ,&nbsp;Garner Cochran ,&nbsp;Nathan Fox ,&nbsp;Michael Levet ,&nbsp;Reem Mahmoud ,&nbsp;Inne Singgih ,&nbsp;Grace Stadnyk ,&nbsp;Alexander Wiedemann","doi":"10.1016/j.tcs.2025.115481","DOIUrl":"10.1016/j.tcs.2025.115481","url":null,"abstract":"<div><div>Genome rearrangement is a common model for molecular evolution. In this paper, we consider the <span>Pairwise Rearrangement</span> problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming the first genome into the second. In the Single Cut-and-Join model (Bergeron et al., 2010 <span><span>[3]</span></span>), <span>Pairwise Rearrangement</span> is <span><math><mi>#</mi><mtext>P</mtext></math></span>-complete (Bailey et al., 2024 <span><span>[1]</span></span>), which implies that exact sampling is intractable. In order to cope with this intractability, we investigate the parameterized complexity of this problem. We exhibit a fixed-parameter tractable algorithm with respect to the number of components in the <em>adjacency graph</em> that are not cycles of length 2 or paths of length 1. As a consequence, we obtain that <span>Pairwise Rearrangement</span> in the Single Cut-and-Join model is fixed-parameter tractable by distance. Our results suggest that the number of nontrivial components in the adjacency graph serves as the key obstacle for efficient sampling.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115481"},"PeriodicalIF":0.9,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144686548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Proper conflict-free coloring of Mycielskians with fast algorithms","authors":"Yali Wu,&nbsp;Xin Zhang","doi":"10.1016/j.tcs.2025.115482","DOIUrl":"10.1016/j.tcs.2025.115482","url":null,"abstract":"<div><div>A proper conflict-free coloring, often termed as PCF-coloring, of a graph refers to a proper vertex coloring wherein each vertex's open neighborhood contains at least one color appearing exactly once. PCF-coloring boasts a wide range of applications, from theoretical graph analysis to practical applications in networking, geographic information systems, scheduling, and constraint satisfaction problems. Caro, Petruševski, and Škrekovski conjectured in 2023 that every graph with maximum degree <span><math><mi>Δ</mi><mo>≥</mo><mn>3</mn></math></span> has a PCF-<span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring. In this paper, we validate this conjecture for the Mycielskians of 1-subdivided graphs. Additionally, we determine the PCF-chromatic number for Mycielskians of paths, cycles, complete graphs, complete bipartite graphs, and wheels, and provide efficient algorithms that produce optimal PCF-colorings for these graphs.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1054 ","pages":"Article 115482"},"PeriodicalIF":0.9,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144680007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Finiteness problem for automaton groups over a binary alphabet is almost decidable","authors":"Andriy Russyev","doi":"10.1016/j.tcs.2025.115478","DOIUrl":"10.1016/j.tcs.2025.115478","url":null,"abstract":"<div><div>We establish a sufficient condition for infiniteness of automaton groups. In the case of a binary alphabet an alternative sufficient condition is provided that is easy to check and almost all automata over a binary alphabet satisfy this condition.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1052 ","pages":"Article 115478"},"PeriodicalIF":0.9,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144680330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}