Search

Large language models (LLMs) represent a promising, but controversial, tool in aiding scientific peer review. This study evaluates the usefulness of LLMs in a conference setting as a tool for vetting paper submissions against submission standards. We conduct an experiment at the 2024 Neural Information Processing Systems (NeurIPS) conference, where 234 papers were voluntarily submitted to an "LLM-based Checklist Assistant." This assistant validates whether papers adhere to the author checklist used by NeurIPS, which includes questions to ensure compliance with research and manuscript preparation standards. Evaluation of the assistant by NeurIPS paper authors suggests that the LLM-based assistant was generally helpful in verifying checklist completion. In post-usage surveys, over 70% of authors found the assistant useful, and 70% indicate that they would revise their papers or checklist responses based on its feedback. While causal attribution to the assistant is not definitive, qualitative evidence suggests that the LLM contributed to improving some submissions. Survey responses and analysis of re-submissions indicate that authors made substantive revisions to their submissions in response to specific feedback from the LLM. The experiment also highlights common issues with LLMs: inaccuracy (20/52) and excessive strictness (14/52) were the most frequent issues flagged by authors. We also conduct experiments to understand potential gaming of the system, which reveal that the assistant could be manipulated to enhance scores through fabricated justifications, highlighting potential vulnerabilities of automated review tools.

The universal availability of ChatGPT and other similar tools since late 2022 has prompted tremendous public excitement and experimental effort about the potential of large language models (LLMs) to improve learning experience and outcomes, especially for learners from disadvantaged backgrounds. However, little research has systematically examined the real-world impacts of LLM availability on educational equity beyond theoretical projections and controlled studies of innovative LLM applications. To depict trends of post-LLM inequalities, we analyze 1,140,328 academic writing submissions from 16,791 college students across 2,391 courses between 2021 and 2024 at a public, minority-serving institution in the US. We find that students' overall writing quality gradually increased following the availability of LLMs and that the writing quality gaps between linguistically advantaged and disadvantaged students became increasingly narrower. However, this equitizing effect was more concentrated on students with higher socioeconomic status. These findings shed light on the digital divides in the era of LLMs and raise questions about the equity benefits of LLMs in early stages and highlight the need for researchers and practitioners on developing responsible practices to improve educational equity through LLMs.

With the global economic integration and the high interconnection of financial markets, financial institutions are facing unprecedented challenges, especially liquidity risk. This paper proposes a liquidity coverage ratio (LCR) prediction model based on the gated recurrent unit (GRU) network to help financial institutions manage their liquidity risk more effectively. By utilizing the GRU network in deep learning technology, the model can automatically learn complex patterns from historical data and accurately predict LCR for a period of time in the future. The experimental results show that compared with traditional methods, the GRU model proposed in this study shows significant advantages in mean absolute error (MAE), proving its higher accuracy and robustness. This not only provides financial institutions with a more reliable liquidity risk management tool but also provides support for regulators to formulate more scientific and reasonable policies, which helps to improve the stability of the entire financial system.

The projector plays a crucial role in multi-modal language models (MLLMs). The number of visual tokens it outputs affects the efficiency of the MLLM, while the quality of the visual tokens influences the visual understanding capabilities of the MLLM. Current explorations on the projector focus on reducing the number of visual tokens to improve efficiency, often overlooking the inherent spatial discrepancy between the serialized 2-dimensional visual token sequences and natural language token sequences. A Spatial-Aware Efficient Projector (SAEP) is proposed to address this issue. In detail, our SAEP method employs an modified separable depthwise convolution module on multi-layer visual features to enhance the spatial information of visual tokens. As a result, our SAEP method can not only largely reduce the number of visual tokens by 75\%, but also significantly improve the multimodal spatial understanding capability of MLLMs. Moreover, compared to existing projectors, our SAEP gets best performances on massive multimodal evaluation benchmarks, which denotes its effectiveness on bridging the modality gap., Comment: 10 pages, 3 figures

This paper presents a novel approach to credit risk prediction by employing Graph Convolutional Neural Networks (GCNNs) to assess the creditworthiness of borrowers. Leveraging the power of big data and artificial intelligence, the proposed method addresses the challenges faced by traditional credit risk assessment models, particularly in handling imbalanced datasets and extracting meaningful features from complex relationships. The paper begins by transforming raw borrower data into graph-structured data, where borrowers and their relationships are represented as nodes and edges, respectively. A classic subgraph convolutional model is then applied to extract local features, followed by the introduction of a hybrid GCNN model that integrates both local and global convolutional operators to capture a comprehensive representation of node features. The hybrid model incorporates an attention mechanism to adaptively select features, mitigating issues of over-smoothing and insufficient feature consideration. The study demonstrates the potential of GCNNs in improving the accuracy of credit risk prediction, offering a robust solution for financial institutions seeking to enhance their lending decision-making processes.

The myelinated axons are widely present in both central and peripheral nervous systems. Its unique compact spiraling structure poses significant challenges to understanding its biological functions and developmental mechanisms. Conventionally, myelin is considered as an insulating layer to achieve saltatory conduction for the enhancement of the neural signal speed, which serves as the foundation of neuroscience. However, this insulating hypothesis is inadequate to account for various experimental observations, especially the long unmyelinated tract observed in the cortex. We here show non-random distributions in three ultrastructural features of myelin: the non-random spiraling directions, the localization preferences of myelin outer tongues, and the radial components along boundaries between oppositely spiraled myelin sheaths. These phenomena are predicted by a novel concept of myelin biological function, which we propose as the signal synchronization function. Our findings demonstrate that cytoplasmic channels within myelin may act as coiled inductors, facilitating electromagnetic induction between adjacent myelin sheaths, and thereby promoting signal synchronization between axons. This, in turn, explains the non-random ultrastructural features observed. We believe these insights lay the foundation for a new understanding of myelin inductive function.

This study presents a novel method combining Graph Neural Networks (GNNs) and Generative Adversarial Networks (GANs) for generating packet-level header traces. By incorporating word2vec embeddings, this work significantly mitigates the dimensionality curse often associated with traditional one-hot encoding, thereby enhancing the training effectiveness of the model. Experimental results demonstrate that word2vec encoding captures semantic relationships between field values more effectively than one-hot encoding, improving the accuracy and naturalness of the generated data. Additionally, the introduction of GNNs further boosts the discriminator's ability to distinguish between real and synthetic data, leading to more realistic and diverse generated samples. The findings not only provide a new theoretical approach for network traffic data generation but also offer practical insights into improving data synthesis quality through enhanced feature representation and model architecture. Future research could focus on optimizing the integration of GNNs and GANs, reducing computational costs, and validating the model's generalizability on larger datasets. Exploring other encoding methods and model structure improvements may also yield new possibilities for network data generation. This research advances the field of data synthesis, with potential applications in network security and traffic analysis.

In this study, we obtain specific picture of the phase transitions for the 6-dimensional Gauss-Bonnet Anti-de Sitter (AdS) black hole with triple phases, using the generalized free energy we constructed and Kramers escape rate in stochastic motion. There are six possible phase transition processes between the three different stable states (small, medium, and large black hole states). During these phase transitions, there are two key temperatures. One is the temperature at which the medium black hole state emerges, and the other is the temperature at which the small black hole state annihilates. Meanwhile, two dynamic equilibrium processes are formed. One is a dynamic equilibrium of the transition from the medium black hole state to the large black hole state and the transition from the small black hole state to the medium black hole state. The other is a dynamic equilibrium of the transition from the small black hole state to the medium black hole state and the transition from the medium black hole state to the small black hole state., Comment: 10 pages, 4 figures

Capturing the inter-dependencies among multiple types of clinically-critical events is critical not only to accurate future event prediction, but also to better treatment planning. In this work, we propose a deep latent state-space generative model to capture the interactions among different types of correlated clinical events (e.g., kidney failure, mortality) by explicitly modeling the temporal dynamics of patients' latent states. Based on these learned patient states, we further develop a new general discrete-time formulation of the hazard rate function to estimate the survival distribution of patients with significantly improved accuracy. Extensive evaluations over real EMR data show that our proposed model compares favorably to various state-of-the-art baselines. Furthermore, our method also uncovers meaningful insights about the latent correlations among mortality and different types of organ failures., Comment: Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

A novel thermodynamic phenomenon has been observed in the quantum Ba\~{n}ados-Teitelboim-Zanelli (qBTZ) black hole, utilizing generalized free energy and Kramer escape rate. This phenomenon also reveals the unique property of the quantum black hole. The stochastic thermal motion of various thermodynamic states within the black hole system induces phase transitions, under the influence of generalized free energy which obtained by extending Maxwell's construction. Through the analysis of Kramer escape rate, it is discovered that the qBTZ black hole thermodynamic system exhibits a bounce effect. Furthermore, the overall thermodynamic picture of the qBTZ black hole has been obtained under different quantum backreactions., Comment: 8 pages, 3 figures

The prospected sensitivity in $\alpha_\mathrm{S}$ determination using an event shape observable, ratio of energy correlators at future electron-positron collider is presented. The study focuses on the collinear region which has suffered from large theoretical and hadronization uncertainty in the past. The ratio effectively reduces the impacts of the uncertainties. With the amount of data that future electron-positron collider could produce in 1 minute (40 $\text{pb}^{-1}$) and 0.5 hour (1 $\text{fb}^{-1}$), a 1% and 0.2% precision of $\alpha_\mathrm{S}$ could be reached., Comment: 10 pages, 4 figures

Link prediction is a fundamental task in graph learning, inherently shaped by the topology of the graph. While traditional heuristics are grounded in graph topology, they encounter challenges in generalizing across diverse graphs. Recent research efforts have aimed to leverage the potential of heuristics, yet a unified formulation accommodating both local and global heuristics remains undiscovered. Drawing insights from the fact that both local and global heuristics can be represented by adjacency matrix multiplications, we propose a unified matrix formulation to accommodate and generalize various heuristics. We further propose the Heuristic Learning Graph Neural Network (HL-GNN) to efficiently implement the formulation. HL-GNN adopts intra-layer propagation and inter-layer connections, allowing it to reach a depth of around 20 layers with lower time complexity than GCN. Extensive experiments on the Planetoid, Amazon, and OGB datasets underscore the effectiveness and efficiency of HL-GNN. It outperforms existing methods by a large margin in prediction performance. Additionally, HL-GNN is several orders of magnitude faster than heuristic-inspired methods while requiring only a few trainable parameters. The case study further demonstrates that the generalized heuristics and learned weights are highly interpretable., Comment: Accepted by KDD 2024

Multipartite entanglement is one of the crucial resources in quantum information processing tasks such as quantum metrology, quantum computing and quantum communications. It is essential to verify not only the multipartite entanglement, but also the entanglement structure in both fundamental theories and the applications of quantum information technologies. However, it is proved to be challenging to detect the entanglement structures, including entanglement depth, entanglement intactness and entanglement stretchability, especially for general states and large-scale quantum systems. By using the partitions of the tensor product space we propose a systematic method to construct powerful entanglement witnesses which identify better the multipartite entanglement structures. Besides, an efficient algorithm using semi-definite programming and a gradient descent algorithm are designed to detect entanglement structure from the inner polytope of the convex set containing all the states with the same entanglement structure. We demonstrate by detailed examples that our criteria perform better than other known ones. Our results may be applied to many quantum information processing tasks.

In recent years, energy correlators have emerged as a powerful tool to explore the field theoretic structure of strong interactions at particle colliders. In this Letter we initiate a novel study of the non-perturbative power corrections to the projected $N$-point energy correlators in the limit where the angle between the detectors is small. Using the light-ray operator product expansion (OPE) as a guiding principle, we derive the power corrections in terms of two non-perturbative quantities describing the fragmentation of quarks and gluons. In analogy with their perturbative leading-power counterpart, we show that power corrections obey a classical scaling behavior that is violated at the quantum level. This crucially results in a dependence on the hard scale $Q$ of the problem that is calculable in perturbation theory. Our analytic predictions are successfully tested against Monte Carlo simulations for both lepton and hadron colliders, marking a significant step forward in the understanding of these observables., Comment: 5 pages + references + supplemental material

Topological design of pi-electrons in zigzag-edged graphene nanoribbons (ZGNRs) leads to a wealth of magnetic quantum phenomena and exotic quantum phases. Symmetric ZGNRs typically exhibit antiferromagnetically coupled spin-ordered edge states. Eliminating cross-edge magnetic coupling in ZGNRs not only enables the realization of a new class of ferromagnetic quantum spin chains, enabling the exploration of quantum spin physics and entanglement of multiple qubits in the 1D limit, but also establishes a long-sought carbon-based ferromagnetic transport channel, pivotal for ultimate scaling of GNR-based quantum electronics. However, designing such GNRs entails overcoming daunting challenges, including simultaneous breaking of structural and spin symmetries, and designing elegant precursors for asymmetric fabrication of reactive zigzag edges. Here, we report a general approach for designing and fabricating such ferromagnetic GNRs in the form of Janus GNRs with two distinct edge configurations. Guided by Lieb's theorem and topological classification theory, we devised two JGNRs by asymmetrically introduced a topological defect array of benzene motifs to one zigzag edge, while keeping the opposing zigzag edge unchanged. This breaks structural symmetry and creates a sublattice imbalance within each unit cell, initiating a spin symmetry breaking. Three Z-shape precursors are designed to fabricate one parent ZGNR and two JGNRs with an optimal lattice spacing of the defect array for a complete quench of the magnetic edge states at the defective edge. Characterization via scanning probe microscopy/spectroscopy and first-principles density functional theory confirms the successful fabrication of Janus GNRs with ferromagnetic ground state delocalised along the pristine zigzag edge., Comment: 19 pages, 4 figures

Large language models (LLMs) demonstrate exceptional instruct-following ability to complete various downstream tasks. Although this impressive ability makes LLMs flexible task solvers, their performance in solving tasks also heavily relies on instructions. In this paper, we reveal that LLMs are over-sensitive to lexical variations in task instructions, even when the variations are imperceptible to humans. By providing models with neighborhood instructions, which are closely situated in the latent representation space and differ by only one semantically similar word, the performance on downstream tasks can be vastly different. Following this property, we propose a black-box Combinatorial Optimization framework for Prompt Lexical Enhancement (COPLE). COPLE performs iterative lexical optimization according to the feedback from a batch of proxy tasks, using a search strategy related to word influence. Experiments show that even widely-used human-crafted prompts for current benchmarks suffer from the lexical sensitivity of models, and COPLE recovers the declined model ability in both instruct-following and solving downstream tasks.

The phase transition has always been a major focus in the study of black hole thermodynamics. This study employs the Kramer escape rate from stochastic processes to investigate the first-order phase transition strength between the large and small black hole states. The results indicate that the phase transition of the third-order Lovelock black holes exhibits significant asymmetric characteristics in diverse dimensions both in the hyperbolic and spherical topology, with an overall trend of the transition from large black holes to small black holes. Especially for the spherical topology, when the dimension is higher than seven, there exists a certain temperature beyond which a dynamic equilibrium is established for the phase transition. This study provides valuable insights into the first-order phase transition rate of black holes and enriches the understanding of black hole phase transitions., Comment: v1: 11 pages, 8 figures

We present a framework for quantifying information flow within general quantum processes. For this purpose, we introduce the signaling power of quantum channels and discuss its relevant operational properties. This function supports extensions to higher order maps, enabling the evaluation of information flow in general quantum causal networks and also processes with indefinite causal order. Furthermore, our results offer a rigorous approach to information dynamics in open systems that applies also in the presence of initial system-environment correlations, and allows for the distinction between classical and quantum information backflow., Comment: 6+10 pages. Comments welcome! v2: text compression, some corrections and improvements, and new references added

Volumetric video is a technology that digitally records dynamic events such as artistic performances, sporting events, and remote conversations. When acquired, such volumography can be viewed from any viewpoint and timestamp on flat screens, 3D displays, or VR headsets, enabling immersive viewing experiences and more flexible content creation in a variety of applications such as sports broadcasting, video conferencing, gaming, and movie productions. With the recent advances and fast-growing interest in neural scene representations for volumetric video, there is an urgent need for a unified open-source library to streamline the process of volumetric video capturing, reconstruction, and rendering for both researchers and non-professional users to develop various algorithms and applications of this emerging technology. In this paper, we present EasyVolcap, a Python & Pytorch library for accelerating neural volumetric video research with the goal of unifying the process of multi-view data processing, 4D scene reconstruction, and efficient dynamic volumetric video rendering. Our source code is available at https://github.com/zju3dv/EasyVolcap., Comment: SIGGRAPH Asia 2023 Technical Communications. Source code: https://github.com/zju3dv/EasyVolcap

Organising an AI challenge does not end with the final event. The long-lasting impact also needs to be organised. This chapter covers the various activities after the challenge is formally finished. The target audience of different post-challenge activities is identified. The various outputs of the challenge are listed with the means to collect them. The main part of the chapter is a template for a typical post-challenge paper, including possible graphs as well as advice on how to turn the challenge into a long-lasting benchmark., Comment: 5th chapter of book "AI Competitions and Benchmarks: the science behind the contests" see: https://sites.google.com/chalearn.org/book/home

We present an approach to estimate the operational distinguishability between an entangled state and any separable state directly from measuring an entanglement witness. We show that this estimation also implies bounds on a variety of other well-known entanglement quantifiers. This approach for entanglement estimation is then extended to to both the measurement-device-independent scenario and the fully device-independent scenario, where we obtain non-trivial but sub-optimal bounds. The procedure requires no numerical optimization and is easy to compute. It offers ways for experimenters to not only detect, but also quantify, entanglement from the standard entanglement witness procedure.

Understanding the quantitative relation between entanglement and Bell nonlocality is a longstanding open problem of both fundamental and practical interest. Here we provide a general approach to address this issue. Starting with an observation that entanglement measures, while defined dramatically different in mathematics, are basically the distances between the state of interest and its closest separable state, we relate this minimal distance between states with distance-based Bell nonlocality, namely, the minimal distance between correlation of interest with respect to the set of classical correlations. This establishes the quantitative relation between entanglement and Bell nonlocality, leading to the bounds for entanglement in various contexts. Our approach enjoys the merits of: (i) generality, it applies to any Bell's scenario without requiring the information of devices and to many entanglement measures, (ii) faithfulness, it gives a non-trivial entanglement estimation from any nonlocal correlation.

Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to overcome the limitations of a given network structure. In this work, we introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories, which at the same time have a clear operational interpretation characterizing the extra resources necessary to prepare a targeted quantum state within a given network. In particular, we define the network communication cost and the network round complexity, which turn out to be intimately related to graph-theoretic parameters. We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement., Comment: 6+20 pages, 8 figures

Vapor sink is an effective strategy to suppress the formation of water vapor condensation around hygroscopic materials, and consequently reduce frosting and icing. However, traditionally used materials, such as salt solutions, fibers, exhibit insufficient condensation inhibition or pose safety concerns, such as corrosiveness. In this study, we highlight the remarkable anti-condensation properties of glycerol droplets, attributed to their strong hygroscopicity. We compared the anti-condensation capabilities of glycerol droplets with commonly used salt solutions and hygroscopic alcohols. The results indicated that glycerol droplets establish a relatively expansive dry zone where the condensation is effectively inhibited, while also offering safety compared to other materials. Furthermore, we conducted a systematic study of the anti-condensation properties of glycerol droplets with experiments and theoretical analysis. We explored the varying trends of the dry zone ratio concerning temperature, cooling time, humidity, and droplet volume on hydrophobic surfaces. To provide a comprehensive understanding, we propose a straightforward yet robust theoretical model that elucidates the relationship between this ratio and temperature, aligning well with the experimental data. Our study not only sheds light on the superior anti-condensation qualities of glycerol but also offers insights and guidelines for the development of effective anti-icing and anti-frost materials.

This paper targets high-fidelity and real-time view synthesis of dynamic 3D scenes at 4K resolution. Recently, some methods on dynamic view synthesis have shown impressive rendering quality. However, their speed is still limited when rendering high-resolution images. To overcome this problem, we propose 4K4D, a 4D point cloud representation that supports hardware rasterization and enables unprecedented rendering speed. Our representation is built on a 4D feature grid so that the points are naturally regularized and can be robustly optimized. In addition, we design a novel hybrid appearance model that significantly boosts the rendering quality while preserving efficiency. Moreover, we develop a differentiable depth peeling algorithm to effectively learn the proposed model from RGB videos. Experiments show that our representation can be rendered at over 400 FPS on the DNA-Rendering dataset at 1080p resolution and 80 FPS on the ENeRF-Outdoor dataset at 4K resolution using an RTX 4090 GPU, which is 30x faster than previous methods and achieves the state-of-the-art rendering quality. Our project page is available at https://zju3dv.github.io/4k4d/., Comment: Project Page: https://zju3dv.github.io/4k4d

This paper aims to tackle the challenge of dynamic view synthesis from multi-view videos. The key observation is that while previous grid-based methods offer consistent rendering, they fall short in capturing appearance details of a complex dynamic scene, a domain where multi-view image-based rendering methods demonstrate the opposite properties. To combine the best of two worlds, we introduce Im4D, a hybrid scene representation that consists of a grid-based geometry representation and a multi-view image-based appearance representation. Specifically, the dynamic geometry is encoded as a 4D density function composed of spatiotemporal feature planes and a small MLP network, which globally models the scene structure and facilitates the rendering consistency. We represent the scene appearance by the original multi-view videos and a network that learns to predict the color of a 3D point from image features, instead of memorizing detailed appearance totally with networks, thereby naturally making the learning of networks easier. Our method is evaluated on five dynamic view synthesis datasets including DyNeRF, ZJU-MoCap, NHR, DNA-Rendering and ENeRF-Outdoor datasets. The results show that Im4D exhibits state-of-the-art performance in rendering quality and can be trained efficiently, while realizing real-time rendering with a speed of 79.8 FPS for 512x512 images, on a single RTX 3090 GPU., Comment: SIGGRAPH Asia 2023; Project page: https://zju3dv.github.io/im4d

We show that some sets of quantum observables are unique up to an isometry and have a contextuality witness that attains the same value for any initial state. We prove that these two properties make it possible to certify any of these sets by looking at the statistics of experiments with sequential measurements and using any initial state of full rank, including thermal and maximally mixed states. We prove that this ``certification with any full-rank state'' (CFR) is possible for any quantum system of finite dimension $d \ge 3$ and is robust and experimentally useful in dimensions 3 and 4. In addition, we prove that complete Kochen-Specker sets can be Bell self-tested if and only if they enable CFR. This establishes a fundamental connection between these two methods of certification, shows that both methods can be combined in the same experiment, and opens new possibilities for certifying quantum devices., Comment: 5+18 pages, 0+2 figures, 1+6 tables

This paper tackles the challenge of creating relightable and animatable neural avatars from sparse-view (or even monocular) videos of dynamic humans under unknown illumination. Compared to studio environments, this setting is more practical and accessible but poses an extremely challenging ill-posed problem. Previous neural human reconstruction methods are able to reconstruct animatable avatars from sparse views using deformed Signed Distance Fields (SDF) but cannot recover material parameters for relighting. While differentiable inverse rendering-based methods have succeeded in material recovery of static objects, it is not straightforward to extend them to dynamic humans as it is computationally intensive to compute pixel-surface intersection and light visibility on deformed SDFs for inverse rendering. To solve this challenge, we propose a Hierarchical Distance Query (HDQ) algorithm to approximate the world space distances under arbitrary human poses. Specifically, we estimate coarse distances based on a parametric human model and compute fine distances by exploiting the local deformation invariance of SDF. Based on the HDQ algorithm, we leverage sphere tracing to efficiently estimate the surface intersection and light visibility. This allows us to develop the first system to recover animatable and relightable neural avatars from sparse view (or monocular) inputs. Experiments demonstrate that our approach is able to produce superior results compared to state-of-the-art methods. Our code will be released for reproducibility., Comment: Project page: https://zju3dv.github.io/relightable_avatar

The interplay between the quantum state space and a specific set of measurements can be effectively captured by examining the set of jointly attainable expectation values. This set is commonly referred to as the (convex) joint numerical range. In this work, we explore geometric properties of this construct for measurements represented by tensor products of Pauli observables, also known as Pauli strings. The structure of pairwise commutation and anticommutation relations among a set of Pauli strings determines a graph $G$, sometimes also called the frustration graph. We investigate the connection between the parameters of this graph and the structure of minimal ellipsoids encompassing the joint numerical range. Such an outer approximation can be very practical since ellipsoids can be handled analytically even in high dimensions. We find counterexamples to a conjecture from [C. de Gois, K. Hansenne and O. G\"uhne, arXiv:2207.02197], and answer an open question in [M. B. Hastings and R. O'Donnell, Proc. STOC 2022, pp. 776-789], which implies a new graph parameter that we call $\beta(G)$. Besides, we develop this approach in different directions, such as comparison with graph-theoretic approaches in other fields, applications in quantum information theory, numerical methods, properties of the new graph parameter, etc. Our approach suggests many open questions that we discuss briefly at the end., Comment: 14+3 pages, 5 figures

Armed with quantum correlations, quantum sensors in a network have shown the potential to outclass their classical counterparts in distributed sensing tasks such as clock synchronization and reference frame alignment. On the other hand, this analysis was done for simple and idealized networks, whereas the correlation shared within a practical quantum network, captured by the notion of network states, is much more complex. Here, we prove a general bound that limits the performance of using quantum network states to estimate a global parameter, establishing the necessity of genuine multipartite entanglement for achieving a quantum advantage. The bound can also serve as an entanglement witness in networks and can be generalized to states generated by shallow circuits. Moreover, while our bound prohibits local network states from achieving the Heisenberg limit, we design a probabilistic protocol that, once successful, attains this ultimate limit of quantum metrology and preserves the privacy of involved parties. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks., Comment: 5 pages, 2 figures + appendix; close to the published version

The projected energy correlator measures the energy deposited in multiple detectors as a function of the largest angular distance $x_L = (1 - \cos\chi_L)/2$ between detectors. The collinear limit $x_L\to 0$ of the projected energy correlator is particularly interesting for understanding the jet-substructures, while the large logarithms of $x_L$ could potentially spoil the perturbation theory and must be resummed. As a necessary ingredient for its resummation at next-to-next-to-leading logarithmic (NNLL) accuracy, we calculate the two-loop jet functions for the projected three-point energy correlator (E3C), using direct integration method and the parameter space Integration-by-Part (IBP) method. We then present the NNLL resummation for $e^+e^-$ annihilation and an approximate NNLL resummation for $pp\rightarrow jj$ process, where the two-loop hard constant is estimated in the latter case. The convergence is improved and the hadronization effect in the collinear limit is suppressed when considering the ratio of E3C distribution to two-point energy-energy correlator (EEC). Our results show potential in precision determination of strong coupling constant using energy correlators from both $e^+e^-$ data and $pp$ data., Comment: 28 pages + appendix, 13 figures

Phase transition is important for understanding the nature and evolution of the black hole thermodynamic system. In this study, the connection between the phase transition of a black hole and the winding number derived by the complex analysis is used to predict the type of the black hole phase transition. For the third-order Lovelock black holes, at the hyperbolic topology in any dimensions and the spherical topology in $7$ dimensions, we arrive at the winding numbers both are $W=3$ which predicts that the system will undergo both the first-order and second-order phase transitions. For the spherical topology in $7