Theoretical Computer Science最新文献

{"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}

{"title":"Smaller kernels for 3-leaf power modifications problems","authors":"Dekel Tsur","doi":"10.1016/j.tcs.2025.115483","DOIUrl":"10.1016/j.tcs.2025.115483","url":null,"abstract":"<div><div>A graph <em>G</em> is a <em>3-leaf power</em> if there is a tree <em>T</em> and a bijective mapping <em>f</em> from <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> to the set of leaves of <em>T</em> such that <span><math><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo><mo>∈</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> if and only if the distance in <em>T</em> between <span><math><mi>f</mi><mo>(</mo><mi>u</mi><mo>)</mo></math></span> and <span><math><mi>f</mi><mo>(</mo><mi>v</mi><mo>)</mo></math></span> is at most 3 for every distinct <span><math><mi>u</mi><mo>,</mo><mi>v</mi><mo>∈</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. In the <span>3-Leaf Power Vertex Deletion</span> (resp., <span>3-Leaf Power Completion</span>) problem the input is a graph <em>G</em> and an integer <em>k</em>, and the goal is to decide whether <em>G</em> can be transformed into a 3-leaf power graph by deleting at most <em>k</em> vertices (resp., adding at most <em>k</em> edges). In this paper we give a kernel for <span>3-Leaf Power Vertex Deletion</span> with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>6</mn></mrow></msup><mo>)</mo></math></span> vertices and a kernel for <span>3-Leaf Power Completion</span> with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> vertices. Our results improve the previous <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>14</mn></mrow></msup><mo>)</mo></math></span>-vertices kernel for <span>3-Leaf Power Vertex Deletion</span> [Ahn et al., 2023 <span><span>[3]</span></span>] and the <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span>-vertices kernel for <span>3-Leaf Power Completion</span> [Bessy et al., 2010 <span><span>[5]</span></span>].</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1055 ","pages":"Article 115483"},"PeriodicalIF":0.9,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144694538","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":"Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds","authors":"Xinyu Fu ,&nbsp;Yitong Yin ,&nbsp;Chaodong Zheng","doi":"10.1016/j.tcs.2025.115456","DOIUrl":"10.1016/j.tcs.2025.115456","url":null,"abstract":"<div><div>Distributed graph coloring is one of the most extensively studied problems in distributed computing. There is a canonical family of distributed graph coloring algorithms known as the <em>locally-iterative</em> coloring algorithms, first formalized in Szegedy and Vishwanathan (1993) <span><span>[6]</span></span>. In such algorithms, every vertex iteratively updates its own color according to a predetermined function of the current coloring of its local neighborhood. Due to the simplicity and naturalness of its framework, locally-iterative coloring algorithms are of great significance both in theory and practice.</div><div>In this paper, we give a locally-iterative <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring algorithm with runtime <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>Δ</mi></mrow><mrow><mn>3</mn><mo>/</mo><mn>4</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>Δ</mi><mo>)</mo><mo>+</mo><msup><mrow><mi>log</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>⁡</mo><mi>n</mi></math></span>, using messages of size <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> bits. This is the first locally-iterative <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring algorithm with sublinear-in-Δ runtime, and answers the main open question raised by previous best result (Barenboim et al. (2021) <span><span>[16]</span></span>). The key component of our algorithm is a new locally-iterative procedure that transforms an <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>Δ</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span>-coloring to a <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mi>O</mi><mo>(</mo><msup><mrow><mi>Δ</mi></mrow><mrow><mn>3</mn><mo>/</mo><mn>4</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>Δ</mi><mo>)</mo><mo>)</mo></math></span>-coloring in <span><math><mi>o</mi><mo>(</mo><mi>Δ</mi><mo>)</mo></math></span> time. As an application of our result, we also devise a self-stabilizing algorithm for <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>Δ</mi></mrow><mrow><mn>3</mn><mo>/</mo><mn>4</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>Δ</mi><mo>)</mo><mo>+</mo><msup><mrow><mi>log</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>⁡</mo><mi>n</mi></math></span> stabilization time, using <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-bit messages. To the best of our knowledge, this is the first self-stabilizing algorithm for <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring in the CONGEST model with sublinear-in-Δ stabilization time.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1052 ","pages":"Article 115456"},"PeriodicalIF":0.9,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655292","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":"Computing the D-base and D-relation in finite closure systems","authors":"Kira Adaricheva ,&nbsp;Lhouari Nourine ,&nbsp;Simon Vilmin","doi":"10.1016/j.tcs.2025.115459","DOIUrl":"10.1016/j.tcs.2025.115459","url":null,"abstract":"<div><div>Implicational bases (IBs) are a common representation of finite closure systems and lattices, along with meet-irreducible elements. They appear in a wide variety of fields ranging from logic and databases to Knowledge Space Theory.</div><div>Different IBs can represent the same closure system. Therefore, several IBs have been studied, such as the canonical and canonical direct bases. In this paper, we investigate the <em>D</em>-base, a refinement of the canonical direct base. It is connected with the <em>D</em>-relation, an essential tool in the study of free lattices. The <em>D</em>-base demonstrates desirable algorithmic properties, and together with the <em>D</em>-relation, it conveys essential properties of the underlying closure system. Hence, computing the <em>D</em>-base and the <em>D</em>-relation of a closure system from another representation is crucial to enjoy its benefits. However, complexity results for this task are lacking.</div><div>In this paper, we give algorithms and hardness results for the computation of the <em>D</em>-base and <em>D</em>-relation. Specifically, we establish the <strong>NP</strong>-completeness of finding the <em>D</em>-relation from an arbitrary IB; we give an output-quasi-polynomial time algorithm to compute the <em>D</em>-base from meet-irreducible elements; and we obtain a polynomial-delay algorithm computing the <em>D</em>-base from an arbitrary IB. These results complete the picture regarding the complexity of identifying the <em>D</em>-base and <em>D</em>-relation of a closure system.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1052 ","pages":"Article 115459"},"PeriodicalIF":0.9,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655291","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}