@inproceedings{710, abstract = {We revisit the problem of estimating entropy of discrete distributions from independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA 2015), improving their upper and lower bounds on the necessary sample size n. For estimating Renyi entropy of order alpha, up to constant accuracy and error probability, we show the following * Upper bounds n = O(1) 2^{(1-1/alpha)H_alpha} for integer alpha>1, as the worst case over distributions with Renyi entropy equal to H_alpha. * Lower bounds n = Omega(1) K^{1-1/alpha} for any real alpha>1, with the constant being an inverse polynomial of the accuracy, as the worst case over all distributions on K elements. Our upper bounds essentially replace the alphabet size by a factor exponential in the entropy, which offers improvements especially in low or medium entropy regimes (interesting for example in anomaly detection). As for the lower bounds, our proof explicitly shows how the complexity depends on both alphabet and accuracy, partially solving the open problem posted in previous works. The argument for upper bounds derives a clean identity for the variance of falling-power sum of a multinomial distribution. Our approach for lower bounds utilizes convex optimization to find a distribution with possibly worse estimation performance, and may be of independent interest as a tool to work with Le Cam’s two point method. }, author = {Obremski, Maciej and Skórski, Maciej}, issn = {1868-8969}, location = {Berkeley, USA}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Renyi entropy estimation revisited}}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.20}, volume = {81}, year = {2017}, } @inproceedings{711, abstract = {Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, issn = {1868-8969}, location = {Berlin, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Bidirectional nested weighted automata}}, doi = {10.4230/LIPIcs.CONCUR.2017.5}, volume = {85}, year = {2017}, } @article{713, abstract = {To determine the dynamics of allelic-specific expression during mouse development, we analyzed RNA-seq data from 23 F1 tissues from different developmental stages, including 19 female tissues allowing X chromosome inactivation (XCI) escapers to also be detected. We demonstrate that allelic expression arising from genetic or epigenetic differences is highly tissue-specific. We find that tissue-specific strain-biased gene expression may be regulated by tissue-specific enhancers or by post-transcriptional differences in stability between the alleles. We also find that escape from X-inactivation is tissue-specific, with leg muscle showing an unexpectedly high rate of XCI escapers. By surveying a range of tissues during development, and performing extensive validation, we are able to provide a high confidence list of mouse imprinted genes including 18 novel genes. This shows that cluster size varies dynamically during development and can be substantially larger than previously thought, with the Igf2r cluster extending over 10 Mb in placenta.}, author = {Andergassen, Daniel and Dotter, Christoph and Wenzel, Dyniel and Sigl, Verena and Bammer, Philipp and Muckenhuber, Markus and Mayer, Daniela and Kulinski, Tomasz and Theussl, Hans and Penninger, Josef and Bock, Christoph and Barlow, Denise and Pauler, Florian and Hudson, Quanah}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Mapping the mouse Allelome reveals tissue specific regulation of allelic expression}}, doi = {10.7554/eLife.25125}, volume = {6}, year = {2017}, } @article{715, abstract = {D-cycloserine ameliorates breathing abnormalities and survival rate in a mouse model of Rett syndrome.}, author = {Novarino, Gaia}, issn = {1946-6234}, journal = {Science Translational Medicine}, number = {405}, publisher = {American Association for the Advancement of Science}, title = {{More excitation for Rett syndrome}}, doi = {10.1126/scitranslmed.aao4218}, volume = {9}, year = {2017}, } @article{716, abstract = {Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion.While pushdown games have been studied before with qualitative objectives-such as reachability and ?-regular objectives- in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.}, author = {Chatterjee, Krishnendu and Velner, Yaron}, issn = {0004-5411}, journal = {Journal of the ACM}, number = {5}, pages = {34}, publisher = {ACM}, title = {{The complexity of mean-payoff pushdown games}}, doi = {10.1145/3121408}, volume = {64}, year = {2017}, } @misc{7163, abstract = {The de novo genome assemblies generated for this study, and the associated metadata.}, author = {Fraisse, Christelle}, publisher = {Institute of Science and Technology Austria}, title = {{Supplementary Files for "The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W"}}, doi = {10.15479/AT:ISTA:7163}, year = {2017}, } @article{717, abstract = {We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard.}, author = {Chatterjee, Krishnendu and Velner, Yaron}, journal = {Journal of Computer and System Sciences}, pages = {236 -- 259}, publisher = {Academic Press}, title = {{Hyperplane separation technique for multidimensional mean-payoff games}}, doi = {10.1016/j.jcss.2017.04.005}, volume = {88}, year = {2017}, } @article{719, abstract = {The ubiquity of computation in modern machines and devices imposes a need to assert the correctness of their behavior. Especially in the case of safety-critical systems, their designers need to take measures that enforce their safe operation. Formal methods has emerged as a research field that addresses this challenge: by rigorously proving that all system executions adhere to their specifications, the correctness of an implementation under concern can be assured. To achieve this goal, a plethora of techniques are nowadays available, all of which are optimized for different system types and application domains.}, author = {Chatterjee, Krishnendu and Ehlers, Rüdiger}, issn = {0001-5903}, journal = {Acta Informatica}, number = {6}, pages = {543 -- 544}, publisher = {Springer}, title = {{Special issue: Synthesis and SYNT 2014}}, doi = {10.1007/s00236-017-0299-0}, volume = {54}, year = {2017}, } @article{720, abstract = {Advances in multi-unit recordings pave the way for statistical modeling of activity patterns in large neural populations. Recent studies have shown that the summed activity of all neurons strongly shapes the population response. A separate recent finding has been that neural populations also exhibit criticality, an anomalously large dynamic range for the probabilities of different population activity patterns. Motivated by these two observations, we introduce a class of probabilistic models which takes into account the prior knowledge that the neural population could be globally coupled and close to critical. These models consist of an energy function which parametrizes interactions between small groups of neurons, and an arbitrary positive, strictly increasing, and twice differentiable function which maps the energy of a population pattern to its probability. We show that: 1) augmenting a pairwise Ising model with a nonlinearity yields an accurate description of the activity of retinal ganglion cells which outperforms previous models based on the summed activity of neurons; 2) prior knowledge that the population is critical translates to prior expectations about the shape of the nonlinearity; 3) the nonlinearity admits an interpretation in terms of a continuous latent variable globally coupling the system whose distribution we can infer from data. Our method is independent of the underlying system’s state space; hence, it can be applied to other systems such as natural scenes or amino acid sequences of proteins which are also known to exhibit criticality.}, author = {Humplik, Jan and Tkacik, Gasper}, issn = {1553-734X}, journal = {PLoS Computational Biology}, number = {9}, publisher = {Public Library of Science}, title = {{Probabilistic models for neural populations that naturally capture global coupling and criticality}}, doi = {10.1371/journal.pcbi.1005763}, volume = {13}, year = {2017}, } @article{721, abstract = {Let S be a positivity-preserving symmetric linear operator acting on bounded functions. The nonlinear equation -1/m=z+Sm with a parameter z in the complex upper half-plane ℍ has a unique solution m with values in ℍ. We show that the z-dependence of this solution can be represented as the Stieltjes transforms of a family of probability measures v on ℝ. Under suitable conditions on S, we show that v has a real analytic density apart from finitely many algebraic singularities of degree at most 3. Our motivation comes from large random matrices. The solution m determines the density of eigenvalues of two prominent matrix ensembles: (i) matrices with centered independent entries whose variances are given by S and (ii) matrices with correlated entries with a translation-invariant correlation structure. Our analysis shows that the limiting eigenvalue density has only square root singularities or cubic root cusps; no other singularities occur.}, author = {Ajanki, Oskari H and Krüger, Torben H and Erdös, László}, issn = {0010-3640}, journal = {Communications on Pure and Applied Mathematics}, number = {9}, pages = {1672 -- 1705}, publisher = {Wiley}, title = {{Singularities of solutions to quadratic vector equations on the complex upper half plane}}, doi = {10.1002/cpa.21639}, volume = {70}, year = {2017}, } @article{722, abstract = {Plants are sessile organisms rooted in one place. The soil resources that plants require are often distributed in a highly heterogeneous pattern. To aid foraging, plants have evolved roots whose growth and development are highly responsive to soil signals. As a result, 3D root architecture is shaped by myriad environmental signals to ensure resource capture is optimised and unfavourable environments are avoided. The first signals sensed by newly germinating seeds — gravity and light — direct root growth into the soil to aid seedling establishment. Heterogeneous soil resources, such as water, nitrogen and phosphate, also act as signals that shape 3D root growth to optimise uptake. Root architecture is also modified through biotic interactions that include soil fungi and neighbouring plants. This developmental plasticity results in a ‘custom-made’ 3D root system that is best adapted to forage for resources in each soil environment that a plant colonises.}, author = {Morris, Emily and Griffiths, Marcus and Golebiowska, Agata and Mairhofer, Stefan and Burr Hersey, Jasmine and Goh, Tatsuaki and Von Wangenheim, Daniel and Atkinson, Brian and Sturrock, Craig and Lynch, Jonathan and Vissenberg, Kris and Ritz, Karl and Wells, Darren and Mooney, Sacha and Bennett, Malcolm}, issn = {09609822}, journal = {Current Biology}, number = {17}, pages = {R919 -- R930}, publisher = {Cell Press}, title = {{Shaping 3D root system architecture}}, doi = {10.1016/j.cub.2017.06.043}, volume = {27}, year = {2017}, } @article{724, abstract = {We investigate the stationary and dynamical behavior of an Anderson localized chain coupled to a single central bound state. Although this coupling partially dilutes the Anderson localized peaks towards nearly resonant sites, the most weight of the original peaks remains unchanged. This leads to multifractal wave functions with a frozen spectrum of fractal dimensions, which is characteristic for localized phases in models with power-law hopping. Using a perturbative approach we identify two different dynamical regimes. At weak couplings to the central site, the transport of particles and information is logarithmic in time, a feature usually attributed to many-body localization. We connect such transport to the persistence of the Poisson statistics of level spacings in parts of the spectrum. In contrast, at stronger couplings the level repulsion is established in the entire spectrum, the problem can be mapped to the Fano resonance, and the transport is ballistic.}, author = {Hetterich, Daniel and Serbyn, Maksym and Domínguez, Fernando and Pollmann, Frank and Trauzettel, Björn}, issn = {2469-9950}, journal = {Physical Review B}, number = {10}, publisher = {American Physical Society}, title = {{Noninteracting central site model localization and logarithmic entanglement growth}}, doi = {10.1103/PhysRevB.96.104203}, volume = {96}, year = {2017}, } @article{725, abstract = {Individual computations and social interactions underlying collective behavior in groups of animals are of great ethological, behavioral, and theoretical interest. While complex individual behaviors have successfully been parsed into small dictionaries of stereotyped behavioral modes, studies of collective behavior largely ignored these findings; instead, their focus was on inferring single, mode-independent social interaction rules that reproduced macroscopic and often qualitative features of group behavior. Here, we bring these two approaches together to predict individual swimming patterns of adult zebrafish in a group. We show that fish alternate between an “active” mode, in which they are sensitive to the swimming patterns of conspecifics, and a “passive” mode, where they ignore them. Using a model that accounts for these two modes explicitly, we predict behaviors of individual fish with high accuracy, outperforming previous approaches that assumed a single continuous computation by individuals and simple metric or topological weighing of neighbors’ behavior. At the group level, switching between active and passive modes is uncorrelated among fish, but correlated directional swimming behavior still emerges. Our quantitative approach for studying complex, multi-modal individual behavior jointly with emergent group behavior is readily extensible to additional behavioral modes and their neural correlates as well as to other species.}, author = {Harpaz, Roy and Tkacik, Gasper and Schneidman, Elad}, issn = {0027-8424}, journal = {PNAS}, number = {38}, pages = {10149 -- 10154}, publisher = {National Academy of Sciences}, title = {{Discrete modes of social information processing predict individual behavior of fish in a group}}, doi = {10.1073/pnas.1703817114}, volume = {114}, year = {2017}, } @article{726, abstract = {The morphogenesis of branched organs remains a subject of abiding interest. Although much is known about the underlying signaling pathways, it remains unclear how macroscopic features of branched organs, including their size, network topology, and spatial patterning, are encoded. Here, we show that, in mouse mammary gland, kidney, and human prostate, these features can be explained quantitatively within a single unifying framework of branching and annihilating random walks. Based on quantitative analyses of large-scale organ reconstructions and proliferation kinetics measurements, we propose that morphogenesis follows from the proliferative activity of equipotent tips that stochastically branch and randomly explore their environment but compete neutrally for space, becoming proliferatively inactive when in proximity with neighboring ducts. These results show that complex branched epithelial structures develop as a self-organized process, reliant upon a strikingly simple but generic rule, without recourse to a rigid and deterministic sequence of genetically programmed events.}, author = {Hannezo, Edouard B and Scheele, Colinda and Moad, Mohammad and Drogo, Nicholas and Heer, Rakesh and Sampogna, Rosemary and Van Rheenen, Jacco and Simons, Benjamin}, issn = {0092-8674}, journal = {Cell}, number = {1}, pages = {242 -- 255}, publisher = {Cell Press}, title = {{A unifying theory of branching morphogenesis}}, doi = {10.1016/j.cell.2017.08.026}, volume = {171}, year = {2017}, } @article{727, abstract = {Actin filaments polymerizing against membranes power endocytosis, vesicular traffic, and cell motility. In vitro reconstitution studies suggest that the structure and the dynamics of actin networks respond to mechanical forces. We demonstrate that lamellipodial actin of migrating cells responds to mechanical load when membrane tension is modulated. In a steady state, migrating cell filaments assume the canonical dendritic geometry, defined by Arp2/3-generated 70° branch points. Increased tension triggers a dense network with a broadened range of angles, whereas decreased tension causes a shift to a sparse configuration dominated by filaments growing perpendicularly to the plasma membrane. We show that these responses emerge from the geometry of branched actin: when load per filament decreases, elongation speed increases and perpendicular filaments gradually outcompete others because they polymerize the shortest distance to the membrane, where they are protected from capping. This network-intrinsic geometrical adaptation mechanism tunes protrusive force in response to mechanical load.}, author = {Mueller, Jan and Szep, Gregory and Nemethova, Maria and De Vries, Ingrid and Lieber, Arnon and Winkler, Christoph and Kruse, Karsten and Small, John and Schmeiser, Christian and Keren, Kinneret and Hauschild, Robert and Sixt, Michael K}, issn = {0092-8674}, journal = {Cell}, number = {1}, pages = {188 -- 200}, publisher = {Cell Press}, title = {{Load adaptation of lamellipodial actin networks}}, doi = {10.1016/j.cell.2017.07.051}, volume = {171}, year = {2017}, } @article{728, abstract = {During animal development, cell-fate-specific changes in gene expression can modify the material properties of a tissue and drive tissue morphogenesis. While mechanistic insights into the genetic control of tissue-shaping events are beginning to emerge, how tissue morphogenesis and mechanics can reciprocally impact cell-fate specification remains relatively unexplored. Here we review recent findings reporting how multicellular morphogenetic events and their underlying mechanical forces can feed back into gene regulatory pathways to specify cell fate. We further discuss emerging techniques that allow for the direct measurement and manipulation of mechanical signals in vivo, offering unprecedented access to study mechanotransduction during development. Examination of the mechanical control of cell fate during tissue morphogenesis will pave the way to an integrated understanding of the design principles that underlie robust tissue patterning in embryonic development.}, author = {Chan, Chii and Heisenberg, Carl-Philipp J and Hiiragi, Takashi}, issn = {09609822}, journal = {Current Biology}, number = {18}, pages = {R1024 -- R1035}, publisher = {Cell Press}, title = {{Coordination of morphogenesis and cell fate specification in development}}, doi = {10.1016/j.cub.2017.07.010}, volume = {27}, year = {2017}, } @article{7288, abstract = {Nowadays commercial supercapacitors are based on purely capacitive storage at the porous carbons that are used for the electrodes. However, the limits that capacitive storage imposes on energy density calls to investigate new materials to improve the capacitance of the device. This new type of electrodes (e.g., RuO2, MnO2…) involves pseudo-capacitive faradaic redox processes with the solid material. Ion exchange with solid materials is, however, much slower than the adsorption process in capacitive storage and inevitably leads to significant loss of power. Faradaic process in the liquid state, in contrast can be similarly fast as capacitive processes due to the fast ion transport. Designing new devices with liquid like dynamics and improved specific capacitance is challenging. We present a new approach to increase the specific capacitance using biredox ionic liquids, where redox moieties are tethered to the electrolyte ions, allowing high redox concentrations and significant pseudo-capacitive storage in the liquid state. Anions and cations are functionalized with anthraquinone (AQ) and 2,2,6,6-tetramethylpiperidinyl-1-oxyl (TEMPO) moieties, respectively. Glassy carbon, carbon-onion, and commercial activated carbon electrodes that exhibit different double layer structures and thus different diffusion dynamics were used to simultaneously study the electrochemical response of biredox ionic liquids at the positive and negative electrode.}, author = {Bodin, C. and Mourad, E. and Zigah, D. and Le Vot, S. and Freunberger, Stefan Alexander and Favier, F. and Fontaine, O.}, issn = {1359-6640}, journal = {Faraday Discussions}, pages = {393--404}, publisher = {Royal Society of Chemistry}, title = {{Biredox ionic liquids: New opportunities toward high performance supercapacitors}}, doi = {10.1039/c7fd00174f}, volume = {206}, year = {2017}, } @article{7289, abstract = {Aprotic sodium–O2 batteries require the reversible formation/dissolution of sodium superoxide (NaO2) on cycling. Poor cycle life has been associated with parasitic chemistry caused by the reactivity of electrolyte and electrode with NaO2, a strong nucleophile and base. Its reactivity can, however, not consistently explain the side reactions and irreversibility. Herein we show that singlet oxygen (1O2) forms at all stages of cycling and that it is a main driver for parasitic chemistry. It was detected in‐ and ex‐situ via a 1O2 trap that selectively and rapidly forms a stable adduct with 1O2. The 1O2 formation mechanism involves proton‐mediated superoxide disproportionation on discharge, rest, and charge below ca. 3.3 V, and direct electrochemical 1O2 evolution above ca. 3.3 V. Trace water, which is needed for high capacities also drives parasitic chemistry. Controlling the highly reactive singlet oxygen is thus crucial for achieving highly reversible cell operation.}, author = {Schafzahl, Lukas and Mahne, Nika and Schafzahl, Bettina and Wilkening, Martin and Slugovc, Christian and Borisov, Sergey M. and Freunberger, Stefan Alexander}, issn = {1433-7851}, journal = {Angewandte Chemie International Edition}, number = {49}, pages = {15728--15732}, publisher = {Wiley}, title = {{Singlet oxygen during cycling of the aprotic sodium-O2 battery}}, doi = {10.1002/anie.201709351}, volume = {56}, year = {2017}, } @article{729, abstract = {The cellular mechanisms allowing tissues to efficiently regenerate are not fully understood. In this issue of Developmental Cell, Cao et al. (2017)) discover that during zebrafish heart regeneration, epicardial cells at the leading edge of regenerating tissue undergo endoreplication, possibly due to increased tissue tension, thereby boosting their regenerative capacity.}, author = {Spiro, Zoltan P and Heisenberg, Carl-Philipp J}, issn = {1534-5807}, journal = {Developmental Cell}, number = {6}, pages = {559 -- 560}, publisher = {Cell Press}, title = {{Regeneration tensed up polyploidy takes the lead}}, doi = {10.1016/j.devcel.2017.09.008}, volume = {42}, year = {2017}, } @article{7290, abstract = {We report a family of Pt and Pd benzoporphyrin dyes with versatile photophysical properties and easy access from cheap and abundant chemicals. Attaching 4 or 8 alkylsulfone groups onto a meso-tetraphenyltetrabenzoporphyrin (TPTBP) macrocylcle renders the dyes highly soluble in organic solvents, photostable, and electron-deficient with the redox potential raised up to 0.65 V versus the parent porphyrin. The new dyes intensively absorb in the blue (Soret band, 440–480 nm) and in the red (Q-band, 620–650 nm) parts of the electromagnetic spectrum and show bright phosphorescence at room-temperature in the NIR with quantum yields up to 30% in solution. The small singlet–triplet energy gap yields unusually efficient thermally activated delayed fluorescence (TADF) at elevated temperatures in solution and in polymeric matrices with quantum yields as high as 27% at 120 °C, which is remarkable for benzoporphyrins. Apart from oxygen sensing, these properties enable unprecedented simultaneous, self-referenced oxygen and temperature sensing with a single indicator dye: whereas oxygen can be determined either via the decay time of phosphorescence or TADF, the temperature is accessed via the ratio of the two emissions. Moreover, the dyes are efficient sensitizers for triplet–triplet annihilation (TTA)-based upconversion making possible longer sensitization wavelength than the conventional benzoporphyrin complexes. The Pt-octa-sulfone dye also features interesting semireversible transformation in basic media, which generates new NIR absorbing species.}, author = {Zach, Peter W. and Freunberger, Stefan Alexander and Klimant, Ingo and Borisov, Sergey M.}, issn = {1944-8252}, journal = {ACS Applied Materials & Interfaces}, number = {43}, pages = {38008--38023}, publisher = {ACS}, title = {{Electron-deficient near-infrared Pt(II) and Pd(II) benzoporphyrins with dual phosphorescence and unusually efficient thermally activated delayed fluorescence: First demonstration of simultaneous oxygen and temperature sensing with a single emitter}}, doi = {10.1021/acsami.7b10669}, volume = {9}, year = {2017}, }