arXiv subjects

Song Gao

Publications and source records attributed to Song Gao.

At least 55 records · Page 3Linked to original sources

arXiv2025

Analyzing the magnitude of two loop corrections to the muon magnetic dipole moment in the mass insertion approximation

With the development of muon magnetic dipole moment (MDM) experiments, particularly the high-precision measurements at Fermilab National Accelerator Laboratory (FNAL), experimental data have become increasingly precise. Up to now, the deviation of muon MDM between the experimental data and the standard model prediction is still existing, which may be caused by the new physics contribution. The two loop supersymmetric diagrams can produce important corrections to muon MDM. For many two loop diagrams, we analyse the order of the contribution to select the important two loop diagrams and neglect the tiny one, which is in favor of distinguishing the important two loop diagrams from all the two loop diagrams. In our analysis, we use the mass insertion approximation. There is no rotation matrix during the study and the resulting factors become more intuitive, so the mass insertion method is more suitable for this study of ours.

hep-ph↗

arXiv2025

Whose Truth? Pluralistic Geo-Alignment for (Agentic) AI

AI (super) alignment describes the challenge of ensuring (future) AI systems behave in accordance with societal norms and goals. While a quickly evolving literature is addressing biases and inequalities, the geographic variability of alignment remains underexplored. Simply put, what is considered appropriate, truthful, or legal can differ widely across regions due to cultural norms, political realities, and legislation. Alignment measures applied to AI/ML workflows can sometimes produce outcomes that diverge from statistical realities, such as text-to-image models depicting balanced gender ratios in company leadership despite existing imbalances. Crucially, some model outputs are globally acceptable, while others, e.g., questions about Kashmir, depend on knowing the user's location and their context. This geographic sensitivity is not new. For instance, Google Maps renders Kashmir's borders differently based on user location. What is new is the unprecedented scale and automation with which AI now mediates knowledge, expresses opinions, and represents geographic reality to millions of users worldwide, often with little transparency about how context is managed. As we approach Agentic AI, the need for spatio-temporally aware alignment, rather than one-size-fits-all approaches, is increasingly urgent. This paper reviews key geographic research problems, suggests topics for future work, and outlines methods for assessing alignment sensitivity.

cs.AI↗

arXiv2025

One-loop corrections to the neutrino in the N-B-LSSM

In this paper, we study one-loop corrections to the neutrino mass matrix in the N-B-LSSM. We obtain the N-B-LSSM from the $U(1)$ extension of the minimal supersymmetric standard model(MSSM). By adding three generation right-handed neutrino superfields and three Higgs singlets, the model generates tiny neutrino masses at the tree level through the first type seesaw mechanism. However, one-loop corrections are essential for understanding neutrino masses and mixing angles. In our calculations, the one-loop corrections contribute approximately 10\% to the total result. We calculate the neutrino mass variance and mixing angle from both normal order neutrino mass spectrum and inverse order neutrino mass spectrum. Crucially, these corrections are 3-5 times larger than current experimental uncertainties. And they have implications for future neutrino oscillation experiments. This study provides new theoretical support for exploring the mechanism of neutrino mass generation in the supersymmetric model and provides clues for exploring new physics beyond the Standard Model (SM).

hep-ph↗

arXiv2025

A 95 GeV Higgs Boson in the $U(1)_X$SSM

The CMS and ATLAS Collaborations have recently reported their findings based on the comprehensive run 2 dataset, detailing their searches for a light Higgs boson with a mass of approximately 95 GeV. We investigate the excesses observed in the $γγ$ and $b{\bar b}$ data at approximately 95 GeV in the $U(1)_X$ extension of the minimal supersymmetric standard model ($U(1)_X$SSM). Additionally, it also mixes with the SM-like Higgs boson. Research indicates that, in this model, identifying the mixture of the singlet Higgs states as the lightest Higgs boson holds tremendous potential for explaining the excess observed at approximately 95 GeV. In our calculations, we maintain the masses of the lightest and next-to-lightest Higgs bosons at approximately 95 GeV and 125 GeV, respectively. The study finds that the theoretical predictions for the signal strengths $μ(h_{95})_{γγ}$ and $μ(h_{95})_{b{\bar b}}$ in the $U(1)_X$SSM align well with the excesses observed by CMS.

hep-ph↗

arXiv2025

Foundation Models for Geospatial Reasoning: Assessing Capabilities of Large Language Models in Understanding Geometries and Topological Spatial Relations

Applying AI foundation models directly to geospatial datasets remains challenging due to their limited ability to represent and reason with geographical entities, specifically vector-based geometries and natural language descriptions of complex spatial relations. To address these issues, we investigate the extent to which a well-known-text (WKT) representation of geometries and their spatial relations (e.g., topological predicates) are preserved during spatial reasoning when the geospatial vector data are passed to large language models (LLMs) including GPT-3.5-turbo, GPT-4, and DeepSeek-R1-14B. Our workflow employs three distinct approaches to complete the spatial reasoning tasks for comparison, i.e., geometry embedding-based, prompt engineering-based, and everyday language-based evaluation. Our experiment results demonstrate that both the embedding-based and prompt engineering-based approaches to geospatial question-answering tasks with GPT models can achieve an accuracy of over 0.6 on average for the identification of topological spatial relations between two geometries. Among the evaluated models, GPT-4 with few-shot prompting achieved the highest performance with over 0.66 accuracy on topological spatial relation inference. Additionally, GPT-based reasoner is capable of properly comprehending inverse topological spatial relations and including an LLM-generated geometry can enhance the effectiveness for geographic entity retrieval. GPT-4 also exhibits the ability to translate certain vernacular descriptions about places into formal topological relations, and adding the geometry-type or place-type context in prompts may improve inference accuracy, but it varies by instance. The performance of these spatial reasoning tasks offers valuable insights for the refinement of LLMs with geographical knowledge towards the development of geo-foundation models capable of geospatial reasoning.

cs.CL↗

arXiv2025

GIScience in the Era of Artificial Intelligence: A Research Agenda Towards Autonomous GIS

The advent of generative AI exemplified by large language models (LLMs) opens new ways to represent and compute geographic information and transcends the process of geographic knowledge production, driving geographic information systems (GIS) towards autonomous GIS. Leveraging LLMs as the decision core, autonomous GIS can independently generate and execute geoprocessing workflows to perform spatial analysis. In this vision paper, we further elaborate on the concept of autonomous GIS and present a conceptual framework that defines its five autonomous goals, five autonomous levels, five core functions, and three operational scales. We demonstrate how autonomous GIS could perform geospatial data retrieval, spatial analysis, and map making with four proof-of-concept GIS agents. We conclude by identifying critical challenges and future research directions, including fine-tuning and self-growing decision-cores, autonomous modeling, and examining the societal and practical implications of autonomous GIS. By establishing the groundwork for a paradigm shift in GIScience, this paper envisions a future where GIS moves beyond traditional workflows to autonomously reason, derive, innovate, and advance geospatial solutions to pressing global challenges. Meanwhile, as we design and deploy increasingly intelligent geospatial systems, we carry a responsibility to ensure they are developed in socially responsible ways, serve the public good, and support the continued value of human geographic insight in an AI-augmented future.

cs.AI↗

arXiv2025

ScienceAgentBench: Toward Rigorous Assessment of Language Agents for Data-Driven Scientific Discovery

The advancements of large language models (LLMs) have piqued growing interest in developing LLM-based language agents to automate scientific discovery end-to-end, which has sparked both excitement and skepticism about their true capabilities. In this work, we call for rigorous assessment of agents on individual tasks in a scientific workflow before making bold claims on end-to-end automation. To this end, we present ScienceAgentBench, a new benchmark for evaluating language agents for data-driven scientific discovery. To ensure the scientific authenticity and real-world relevance of our benchmark, we extract 102 tasks from 44 peer-reviewed publications in four disciplines and engage nine subject matter experts to validate them. We unify the target output for every task to a self-contained Python program file and employ an array of evaluation metrics to examine the generated programs, execution results, and costs. Each task goes through multiple rounds of manual validation by annotators and subject matter experts to ensure its annotation quality and scientific plausibility. We also propose two effective strategies to mitigate data contamination concerns. Using ScienceAgentBench, we evaluate five open-weight and proprietary LLMs, each with three frameworks: direct prompting, OpenHands CodeAct, and self-debug. Given three attempts for each task, the best-performing agent can only solve 32.4% of the tasks independently and 34.3% with expert-provided knowledge. In addition, we evaluate OpenAI o1-preview with direct prompting and self-debug, which can boost the performance to 42.2%, demonstrating the effectiveness of increasing inference-time compute but with more than 10 times the cost of other LLMs. Still, our results underscore the limitations of current language agents in generating code for data-driven discovery, let alone end-to-end automation for scientific research.

cs.CL↗

arXiv2025

A Survey of Secure Semantic Communications

Semantic communication (SemCom) is regarded as a promising and revolutionary technology in 6G, aiming to transcend the constraints of ``Shannon's trap" by filtering out redundant information and extracting the core of effective data. Compared to traditional communication paradigms, SemCom offers several notable advantages, such as reducing the burden on data transmission, enhancing network management efficiency, and optimizing resource allocation. Numerous researchers have extensively explored SemCom from various perspectives, including network architecture, theoretical analysis, potential technologies, and future applications. However, as SemCom continues to evolve, a multitude of security and privacy concerns have arisen, posing threats to the confidentiality, integrity, and availability of SemCom systems. This paper presents a comprehensive survey of the technologies that can be utilized to secure SemCom. Firstly, we elaborate on the entire life cycle of SemCom, which includes the model training, model transfer, and semantic information transmission phases. Then, we identify the security and privacy issues that emerge during these three stages. Furthermore, we summarize the techniques available to mitigate these security and privacy threats, including data cleaning, robust learning, defensive strategies against backdoor attacks, adversarial training, differential privacy, cryptography, blockchain technology, model compression, and physical-layer security. Lastly, this paper outlines future research directions to guide researchers in related fields.

cs.CR↗

arXiv2025

A Model Fusion Distributed Kalman Filter For Non-Gaussian Observation Noise

Wireless sensor networks (WSNs) represent a critical research domain within the Internet of Things (IoT) technology. The distributed Kalman filter (DKF) has garnered significant attention as an information fusion method for WSNs. However, effectively handling non-Gaussian environments remains a crucial challenge for DKF. This paper proposes a solution by partitioning the noise distribution into multiple Gaussian components, thereby approximating the measurement model with sub-models. We introduce a model fusion distributed Kalman filter (MFDKF) that combines sub-models by assuming independent random processes for the model's transition probabilities. The expectation maximization (EM) algorithm is employed to estimate the relevant parameters. To address specific requirements in WSNs that demand high consensus or have limited communication, two derivative algorithms, namely consensus MFDKF (C-MFDKF) and simplified MFDKF (S-MFDKF), are proposed based on consensus theory. The convergence of MFDKF and its derivative algorithms is analyzed. A series of simulations demonstrate the effectiveness of MFDKF and its derivative algorithms. This paper has been accepted and published in IEEE Internet of Things Journal (Early Access), DOI: https://doi.org/10.1109/JIOT.2025.3526240

eess.SP↗

arXiv2025

Lepton flavor violating decays $l_j\rightarrow l_iγ$, $l_j \rightarrow 3l_i$ and $μ\rightarrow e+ q\bar q$ in the N-B-LSSM

The N-B-LSSM is an extension of the minimal supersymmetric standard model (MSSM) with the addition of three singlet new Higgs superfields and right-handed neutrinos, whose local gauge group is $SU(3)_C\times SU(2)_L\times U(1)_Y\times U(1)_{B-L}$. In the N-B-LSSM, we study lepton flavor violating decays $l_j\rightarrow l_iγ$, $l_j \rightarrow 3l_i$ and $μ\rightarrow e+ q\bar q$ $(j=τ,μ,~i=μ,e$ and $i\neq j)$. Based on the current experimental limitations, we carry out detailed parameter scanning and numerical calculations to analyse the effects of different sensitive parameters on lepton flavor violation (LFV) in the N-B-LSSM. The numerical results show that the non-diagonal elements involving the initial and final leptons are main sensitive parameters and LFV sources. This work can provide a strong basis for exploring new physics (NP) beyond the Standard Model (SM).

hep-ph↗

arXiv2025

Identifying rich clubs in spatiotemporal interaction networks

Spatial networks are widely used in various fields to represent and analyze interactions or relationships between locations or spatially distributed entities.There is a network science concept known as the 'rich club' phenomenon, which describes the tendency of 'rich' nodes to form densely interconnected sub-networks. Although there are established methods to quantify topological, weighted, and temporal rich clubs individually, there is limited research on measuring the rich club effect in spatially-weighted temporal networks, which could be particularly useful for studying dynamic spatial interaction networks. To address this gap, we introduce the spatially-weighted temporal rich club (WTRC), a metric that quantifies the strength and consistency of connections between rich nodes in a spatiotemporal network. Additionally, we present a unified rich club framework that distinguishes the WTRC effect from other rich club effects, providing a way to measure topological, weighted, and temporal rich club effects together. Through two case studies of human mobility networks at different spatial scales, we demonstrate how the WTRC is able to identify significant weighted temporal rich club effects, whereas the unweighted equivalent in the same network either fails to detect a rich club effect or inaccurately estimates its significance. In each case study, we explore the spatial layout and temporal variations revealed by the WTRC analysis, showcasing its particular value in studying spatiotemporal interaction networks. This research offers new insights into the study of spatiotemporal networks, with critical implications for applications such as transportation, redistricting, and epidemiology.

cs.SI↗

arXiv2025

Atomic-scale observation of $d$-$π$-$d$ spin coupling in coordination structures

Spin coupling between magnetic metal atoms and organic radicals plays a pivotal role in high-performance magnetic materials. The complex interaction involving multi-spin centers in bulk materials makes it challenging to study spin coupling at the atomic scale. Here, we investigate the $d$-$π$-$d$ spin interaction in well-defined metal-organic coordinated structures composed of two iron (Fe) atoms and four all-trans retinoic acid (ReA) molecules, using low-temperature scanning tunneling microscopy and atomic force microscopy. The ReA molecule is turned into a spin-$1/2$ radical state by dehydrogenation, facilitating strong magnetic coupling with the coordinated Fe atoms. Comprehensive theoretical analysis, based on density functional theory and valence bond theory, further elucidates the intrinsic mechanism of ferrimagnetic spin coupling in the coordination structure. Specifically, simultaneous antiferromagnetic coupling of Fe dimer to ReA radicals parallelizes the dimer spin orientation. This work contributes to the fundamental understanding of spin interaction in metal-organic coordination structures and provides microscopic insights for designing advanced magnetic materials.

cond-mat.mtrl-sci↗

arXiv2024

Context-aware knowledge graph framework for traffic speed forecasting using graph neural network

Human mobility is intricately influenced by urban contexts spatially and temporally, constituting essential domain knowledge in understanding traffic systems. While existing traffic forecasting models primarily rely on raw traffic data and advanced deep learning techniques, incorporating contextual information remains underexplored due to insufficient integration frameworks and the complexity of urban contexts. This study proposes a novel context-aware knowledge graph (CKG) framework to enhance traffic speed forecasting by effectively modeling spatial and temporal contexts. Employing a relation-dependent integration strategy, the framework generates context-aware representations from the spatial and temporal units of CKG to capture spatio-temporal dependencies of urban contexts. A CKG-GNN model, combining the CKG, dual-view multi-head self-attention (MHSA), and graph neural network (GNN), is then designed to predict traffic speed utilizing these context-aware representations. Our experiments demonstrate that CKG's configuration significantly influences embedding performance, with ComplEx and KG2E emerging as optimal for embedding spatial and temporal units, respectively. The CKG-GNN model establishes a benchmark for 10-120 min predictions, achieving average MAE, MAPE, and RMSE of $3.46\pm0.01$, $14.76\pm0.09\%$, and $5.08\pm0.01$, respectively. Compared to the baseline DCRNN model, integrating the spatial unit improves the MAE by 0.04 and the temporal unit by 0.13, while integrating both units further reduces it by 0.18. The dual-view MHSA analysis reveals the crucial role of relation-dependent features from the context-based view and the model's ability to prioritize recent time slots in prediction from the sequence-based view. Overall, this study underscores the importance of merging context-aware knowledge graphs with graph neural networks to improve traffic forecasting.

cs.LG↗

arXiv2024

Right-handed neutrino dark matter in $U(1)_X$SSM

There is strong evidence for the existence of dark matter in a number of current experiments. We study dark matter using the $U(1)_X$SSM obtained from the $U(1)_X$ extension of the minimal supersymmetric standard model (MSSM). In the $U(1)_X$SSM, we use the right-handed neutrino as a dark matter candidate, whose lightest mass eigenstate has cold dark matter features. In this paper, the relic density of right-handed neutrino as dark matter is investigated. For dark matter scattering, both spin-independent and spin-dependent cross sections are studied. In the final numerical results obtained, some parameter spaces can satisfy the constraints of the relic density and dark matter direct detection experiments.

hep-ph↗

arXiv2024

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62% and 99.18%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately $6.4\times 10^9$ years to replicate the task. This leap in processing power places the classical simulation cost six orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Nature 634, 328(2024)], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

quant-ph↗

arXiv2024

GeoAI-Enhanced Community Detection on Spatial Networks with Graph Deep Learning

Spatial networks are useful for modeling geographic phenomena where spatial interaction plays an important role. To analyze the spatial networks and their internal structures, graph-based methods such as community detection have been widely used. Community detection aims to extract strongly connected components from the network and reveal the hidden relationships between nodes, but they usually do not involve the attribute information. To consider edge-based interactions and node attributes together, this study proposed a family of GeoAI-enhanced unsupervised community detection methods called region2vec based on Graph Attention Networks (GAT) and Graph Convolutional Networks (GCN). The region2vec methods generate node neural embeddings based on attribute similarity, geographic adjacency and spatial interactions, and then extract network communities based on node embeddings using agglomerative clustering. The proposed GeoAI-based methods are compared with multiple baselines and perform the best when one wants to maximize node attribute similarity and spatial interaction intensity simultaneously within the spatial network communities. It is further applied in the shortage area delineation problem in public health and demonstrates its promise in regionalization problems.

cs.SI↗

arXiv2024

Impacts of packed bed polydispersity and deformation on fine particle transport

Static granular packings play a central role in numerous industrial applications and natural settings. In these situations, fluid or fine particle flow through a bed of static particles is heavily influenced by the narrowest passage connecting the pores of the packing, commonly referred to as pore throats or constrictions. Existing studies predominantly assume monodisperse rigid particles, but this is an oversimplification of the problem. In this work, we illustrate the connection between pore throat size, polydispersity, and particle deformation. Simple analytical expressions are provided to link these properties of the packing, followed by examples from Discrete Element Method (DEM) simulations of fine particle percolation demonstrating the impact of polydispersity and particle deformation. Our intent is to emphasize the substantial impact of polydispersity and particle deformation on constriction size, underscoring the importance of accounting for these effects in particle transport in granular packings.

cond-mat.soft↗

arXiv2024

Fine-Tuning is Fine, if Calibrated

Fine-tuning is arguably the most straightforward way to tailor a pre-trained model (e.g., a foundation model) to downstream applications, but it also comes with the risk of losing valuable knowledge the model had learned in pre-training. For example, fine-tuning a pre-trained classifier capable of recognizing a large number of classes to master a subset of classes at hand is shown to drastically degrade the model's accuracy in the other classes it had previously learned. As such, it is hard to further use the fine-tuned model when it encounters classes beyond the fine-tuning data. In this paper, we systematically dissect the issue, aiming to answer the fundamental question, "What has been damaged in the fine-tuned model?" To our surprise, we find that the fine-tuned model neither forgets the relationship among the other classes nor degrades the features to recognize these classes. Instead, the fine-tuned model often produces more discriminative features for these other classes, even if they were missing during fine-tuning! {What really hurts the accuracy is the discrepant logit scales between the fine-tuning classes and the other classes}, implying that a simple post-processing calibration would bring back the pre-trained model's capability and at the same time unveil the feature improvement over all classes. We conduct an extensive empirical study to demonstrate the robustness of our findings and provide preliminary explanations underlying them, suggesting new directions for future theoretical analysis. Our code is available at https://github.com/OSU-MLB/Fine-Tuning-Is-Fine-If-Calibrated.

cs.LG↗