Information Technology Convergence and Services最新文献

{"title":"Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization","authors":"P. Dey, R. Kannan, Nick Ryder, N. Srivastava","doi":"10.4230/LIPIcs.ITCS.2023.42","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2023.42","url":null,"abstract":"We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $tilde{O}(n^{omega+3}a+n^4a^2+n^omegalog(1/epsilon))$ time algorithm for finding an $epsilon-$approximation to the Jordan Normal form of an integer matrix with $a-$bit entries, where $omega$ is the exponent of matrix multiplication. (2) An $tilde{O}(n^6d^6a+n^4d^4a^2+n^3d^3log(1/epsilon))$ time algorithm for $epsilon$-approximately computing the spectral factorization $P(x)=Q^*(x)Q(x)$ of a given monic $ntimes n$ rational matrix polynomial of degree $2d$ with rational $a-$bit coefficients having $a-$bit common denominators, which satisfies $P(x)succeq 0$ for all real $x$. The first algorithm is used as a subroutine in the second one. Despite its being of central importance, polynomial complexity bounds were not previously known for spectral factorization, and for Jordan form the best previous best running time was an unspecified polynomial in $n$ of degree at least twelve cite{cai1994computing}. Our algorithms are simple and judiciously combine techniques from numerical and symbolic computation, yielding significant advantages over either approach by itself.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133867742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sublinear-Time Computation in the Presence of Online Erasures","authors":"Iden Kalemaj, Sofya Raskhodnikova, Nithin M. Varma","doi":"10.4230/LIPIcs.ITCS.2022.90","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.90","url":null,"abstract":"We initiate the study of sublinear-time algorithms that access their input via an online adversarial erasure oracle. After answering each query to the input object, such an oracle can erase $t$ input values. Our goal is to understand the complexity of basic computational tasks in extremely adversarial situations, where the algorithm's access to data is blocked during the execution of the algorithm in response to its actions. Specifically, we focus on property testing in the model with online erasures. We show that two fundamental properties of functions, linearity and quadraticity, can be tested for constant $t$ with asymptotically the same complexity as in the standard property testing model. For linearity testing, we prove tight bounds in terms of $t$, showing that the query complexity is $Theta(log t)$. In contrast to linearity and quadraticity, some other properties, including sortedness and the Lipschitz property of sequences, cannot be tested at all, even for $t=1$. Our investigation leads to a deeper understanding of the structure of violations of linearity and other widely studied properties. We also consider implications of our results for algorithms that are resilient to online adversarial corruptions instead of erasures.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123620272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras","authors":"G. Ivanyos, Tushant Mittal, Youming Qiao","doi":"10.4230/LIPIcs.ITCS.2022.87","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.87","url":null,"abstract":"One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg–Gurvits–Oliveira–Wigderson, Found. Comput. Math. 2020; Ivanyos–Qiao–Subrahmanyam, Comput. Complex. 2018), a natural next step is to understand singular matrix spaces whose non-commutative rank is full. At present, examples of such matrix spaces are mostly sporadic, so it is desirable to discover them in a more systematic way. In this paper, we make a step towards this direction, by studying the family of matrix spaces that are closed under the commutator operation, that is, matrix Lie algebras. On the one hand, we demonstrate that matrix Lie algebras over the complex number field give rise to singular matrix spaces with full non-commutative ranks. On the other hand, we show that SDIT of such spaces can be decided in deterministic polynomial time. Moreover, we give a characterization for the matrix Lie algebras to yield a matrix space possessing singularity certificates as studied by Lovász (B. Braz. Math. Soc., 1989) and Raz and Wigderson (Building Bridges II, 2019). 2012 ACM Subject Classification Theory of computation → Algebraic complexity theory; Theory of computation → Pseudorandomness and derandomization","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132461630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Monotone Complexity of Spanning Tree Polynomial Re-visited","authors":"A. Chattopadhyay, Rajit Datta, U. Ghosal, P. Mukhopadhyay","doi":"10.4230/LIPIcs.ITCS.2022.39","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.39","url":null,"abstract":"We prove two results that shed new light on the monotone complexity of the spanning tree polynomial, a classic polynomial in algebraic complexity and beyond. First, we show that the spanning tree polynomials having $n$ variables and defined over constant-degree expander graphs, have monotone arithmetic complexity $2^{Omega(n)}$. This yields the first strongly exponential lower bound on the monotone arithmetic circuit complexity for a polynomial in VP. Before this result, strongly exponential size monotone lower bounds were known only for explicit polynomials in VNP (Gashkov-Sergeev'12, Raz-Yehudayoff'11, Srinivasan'20, Cavalar-Kumar-Rossman'20, Hrubes-Yehudayoff'21). Recently, Hrubes'20 initiated a program to prove lower bounds against general arithmetic circuits by proving $epsilon$-sensitive lower bounds for monotone arithmetic circuits for a specific range of values for $epsilon in (0,1)$. We consider the spanning tree polynomial $ST_{n}$ defined over the complete graph on $n$ vertices and show that the polynomials $F_{n-1,n} - epsilon cdot ST_{n}$ and $F_{n-1,n} + epsilon cdot ST_{n}$ defined over $n^2$ variables, have monotone circuit complexity $2^{Omega(n)}$ if $epsilon geq 2^{-Omega(n)}$ and $F_{n-1,n} = prod_{i=2}^n (x_{i,1} +cdots + x_{i,n})$ is the complete set-multilinear polynomial. This provides the first $epsilon$-sensitive exponential lower bound for a family of polynomials inside VP. En-route, we consider a problem in 2-party, best partition communication complexity of deciding whether two sets of oriented edges distributed among Alice and Bob form a spanning tree or not. We prove that there exists a fixed distribution, under which the problem has low discrepancy with respect to every nearly-balanced partition. This result could be of interest beyond algebraic complexity.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128596778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Domain Sparsification of Discrete Distributions using Entropic Independence","authors":"Nima Anari, Michal Derezinski, T. Vuong, E. Yang","doi":"10.4230/LIPIcs.ITCS.2022.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.5","url":null,"abstract":"We present a framework for speeding up the time it takes to sample from discrete distributions $mu$ defined over subsets of size $k$ of a ground set of $n$ elements, in the regime $kll n$. We show that having estimates of marginals $mathbb{P}_{Ssim mu}[iin S]$, the task of sampling from $mu$ can be reduced to sampling from distributions $nu$ supported on size $k$ subsets of a ground set of only $n^{1-alpha}cdot operatorname{poly}(k)$ elements. Here, $1/alphain [1, k]$ is the parameter of entropic independence for $mu$. Further, the sparsified distributions $nu$ are obtained by applying a sparse (mostly $0$) external field to $mu$, an operation that often retains algorithmic tractability of sampling from $nu$. This phenomenon, which we dub domain sparsification, allows us to pay a one-time cost of estimating the marginals of $mu$, and in return reduce the amortized cost needed to produce many samples from the distribution $mu$, as is often needed in upstream tasks such as counting and inference. For a wide range of distributions where $alpha=Omega(1)$, our result reduces the domain size, and as a corollary, the cost-per-sample, by a $operatorname{poly}(n)$ factor. Examples include monomers in a monomer-dimer system, non-symmetric determinantal point processes, and partition-constrained Strongly Rayleigh measures. Our work significantly extends the reach of prior work of Anari and Derezi'nski who obtained domain sparsification for distributions with a log-concave generating polynomial (corresponding to $alpha=1$). As a corollary of our new analysis techniques, we also obtain a less stringent requirement on the accuracy of marginal estimates even for the case of log-concave polynomials; roughly speaking, we show that constant-factor approximation is enough for domain sparsification, improving over $O(1/k)$ relative error established in prior work.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131098982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved Hardness of BDD and SVP Under Gap-(S)ETH","authors":"Huck Bennett, Chris Peikert, Yi Tang","doi":"10.4230/LIPIcs.ITCS.2022.19","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.19","url":null,"abstract":"We show improved fine-grained hardness of two key lattice problems in the $ell_p$ norm: Bounded Distance Decoding to within an $alpha$ factor of the minimum distance ($mathrm{BDD}_{p, alpha}$) and the (decisional) $gamma$-approximate Shortest Vector Problem ($mathrm{SVP}_{p,gamma}$), assuming variants of the Gap (Strong) Exponential Time Hypothesis (Gap-(S)ETH). Specifically, we show: 1. For all $p in [1, infty)$, there is no $2^{o(n)}$-time algorithm for $mathrm{BDD}_{p, alpha}$ for any constant $alpha>alpha_mathsf{kn}$, where $alpha_mathsf{kn} = 2^{-c_mathsf{kn}}<0.98491$ and $c_mathsf{kn}$ is the $ell_2$ kissing-number constant, unless non-uniform Gap-ETH is false. 2. For all $p in [1, infty)$, there is no $2^{o(n)}$-time algorithm for $mathrm{BDD}_{p, alpha}$ for any constant $alpha>alpha^ddagger_p$, where $alpha^ddagger_p$ is explicit and satisfies $alpha^ddagger_p = 1$ for $1 leq p leq 2$, $alpha^ddagger_p<1$ for all $p>2$, and $alpha^ddagger_p to 1/2$ as $p to infty$, unless randomized Gap-ETH is false. 3. For all $p in [1, infty) setminus 2 mathbb{Z}$ and all $C>1$, there is no $2^{n/C}$-time algorithm for $mathrm{BDD}_{p, alpha}$ for any constant $alpha>alpha^dagger_{p, C}$, where $alpha^dagger_{p, C}$ is explicit and satisfies $alpha^dagger_{p, C} to 1$ as $C to infty$ for any fixed $p in [1, infty)$, unless non-uniform Gap-SETH is false. 4. For all $p>p_0 approx 2.1397$, $p notin 2mathbb{Z}$, and all $C>C_p$, there is no $2^{n/C}$-time algorithm for $mathrm{SVP}_{p, gamma}$ for some constant $gamma>1$, where $C_p>1$ is explicit and satisfies $C_p to 1$ as $p to infty$, unless randomized Gap-SETH is false.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Continuous Tasks and the Asynchronous Computability Theorem","authors":"Hugo Rincon Galeana, S. Rajsbaum, U. Schmid","doi":"10.4230/LIPIcs.ITCS.2022.73","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.73","url":null,"abstract":"The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connection with algebraic topology. We present a novel interpretation of this theorem, through the notion of continuous task, defined by an input/output specification that is a continuous function. To do so, we introduce a chromatic version of a foundational result for algebraic topology: the simplicial approximation theorem. In addition to providing a different proof of the ACT, the notion of continuous task seems interesting in itself. Indeed, besides the fact that certain distributed problems are naturally specified by continuous functions, continuous tasks have an expressive power that also allows to specify the density of desired outputs for each combination of possible inputs,for example.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123259626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Deterministic Dynamic Matching in Worst-Case Update Time","authors":"P. Kiss","doi":"10.4230/LIPIcs.ITCS.2022.94","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.94","url":null,"abstract":"<jats:p>We present deterministic algorithms for maintaining a <jats:inline-formula><jats:alternatives><jats:tex-math>$$(3/2 + epsilon )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\u0000 <mml:mrow>\u0000 <mml:mo>(</mml:mo>\u0000 <mml:mn>3</mml:mn>\u0000 <mml:mo>/</mml:mo>\u0000 <mml:mn>2</mml:mn>\u0000 <mml:mo>+</mml:mo>\u0000 <mml:mi>ϵ</mml:mi>\u0000 <mml:mo>)</mml:mo>\u0000 </mml:mrow>\u0000 </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$(2 + epsilon )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\u0000 <mml:mrow>\u0000 <mml:mo>(</mml:mo>\u0000 <mml:mn>2</mml:mn>\u0000 <mml:mo>+</mml:mo>\u0000 <mml:mi>ϵ</mml:mi>\u0000 <mml:mo>)</mml:mo>\u0000 </mml:mrow>\u0000 </mml:math></jats:alternatives></jats:inline-formula>-approximate maximum matching in a fully dynamic graph with worst-case update times <jats:inline-formula><jats:alternatives><jats:tex-math>$${hat{O}}(sqrt{n})$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\u0000 <mml:mrow>\u0000 <mml:mover>\u0000 <mml:mi>O</mml:mi>\u0000 <mml:mo>^</mml:mo>\u0000 </mml:mover>\u0000 <mml:mrow>\u0000 <mml:mo>(</mml:mo>\u0000 <mml:msqrt>\u0000 <mml:mi>n</mml:mi>\u0000 </mml:msqrt>\u0000 <mml:mo>)</mml:mo>\u0000 </mml:mrow>\u0000 </mml:mrow>\u0000 </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${tilde{O}}(1)$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\u0000 <mml:mrow>\u0000 <mml:mover>\u0000 <mml:mi>O</mml:mi>\u0000 <mml:mo>~</mml:mo>\u0000 </mml:mover>\u0000 <mml:mrow>\u0000 <mml:mo>(</mml:mo>\u0000 <mml:mn>1</mml:mn>\u0000 <mml:mo>)</mml:mo>\u0000 </mml:mrow>\u0000 </mml:mrow>\u0000 </mml:math></jats:alternatives></jats:inline-formula> respectively. The fastest known deterministic worst-case update time algorithms for achieving approximation ratio <jats:inline-formula><jats:alternatives><jats:tex-math>$$(2 - delta )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\u0000 <mml:mrow>\u0000 <mml:mo>(</mml:mo>\u0000 <mml:mn>2</mml:mn>\u0000 <mml:mo>-</mml:mo>\u0000 <mml:mi>δ</mml:mi>\u0000 <mml:mo>)</mml:mo>\u0000 </mml:mrow>\u0000 </mml:math></jats:alternatives></jats:inline-formula> (for any <jats:inline-formula><jats:alternatives><jats:","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128185043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Interactive Proofs for Synthesizing Quantum States and Unitaries","authors":"Gregory Rosenthal, H. Yuen","doi":"10.4230/LIPIcs.ITCS.2022.112","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.112","url":null,"abstract":"Whereas quantum complexity theory has traditionally been concerned with problems arising from classical complexity theory (such as computing boolean functions), it also makes sense to study the complexity of inherently quantum operations such as constructing quantum states or performing unitary transformations. With this motivation, we define models of interactive proofs for synthesizing quantum states and unitaries, where a polynomial-time quantum verifier interacts with an untrusted quantum prover, and a verifier who accepts also outputs an approximation of the target state (for the state synthesis problem) or the result of the target unitary applied to the input state (for the unitary synthesis problem); furthermore there should exist an “honest” prover which the verifier accepts with probability 1. Our main result is a “state synthesis” analogue of the inclusion PSPACE ⊆ IP: any sequence of states computable by a polynomial-space quantum algorithm (which may run for exponential time) admits an interactive protocol of the form described above. Leveraging this state synthesis protocol, we also give a unitary synthesis protocol for polynomial space-computable unitaries that act nontrivially on only a polynomial-dimensional subspace. We obtain analogous results in the setting with multiple entangled provers as well. 2012 ACM Subject Classification Theory of computation → Interactive proof systems; Theory of computation → Quantum complexity theory; Theory of computation → Quantum complexity theory","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"432 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116003693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","authors":"Idan Attias, E. Cohen, M. Shechner, Uri Stemmer","doi":"10.4230/LIPIcs.ITCS.2023.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2023.8","url":null,"abstract":"Classical streaming algorithms operate under the (not always reasonable) assumption that the input stream is fixed in advance. Recently, there is a growing interest in designing robust streaming algorithms that provide provable guarantees even when the input stream is chosen adaptively as the execution progresses. We propose a new framework for robust streaming that combines techniques from two recently suggested frameworks by Hassidim et al. [NeurIPS 2020] and by Woodruff and Zhou [FOCS 2021]. These recently suggested frameworks rely on very different ideas, each with its own strengths and weaknesses. We combine these two frameworks into a single hybrid framework that obtains the ``best of both worlds'', thereby solving a question left open by Woodruff and Zhou.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"2674 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}