Search

Discovering gene-disease associations is crucial for understanding disease mechanisms, yet identifying these associations remains challenging due to the time and cost of biological experiments. Computational methods are increasingly vital for efficient and scalable gene-disease association prediction. Graph-based learning models, which leverage node features and network relationships, are commonly employed for biomolecular predictions. However, existing methods often struggle to effectively integrate node features, heterogeneous structures, and semantic information. To address these challenges, we propose COmprehensive MEtapath-based heterogeneous graph Transformer(COMET) for predicting gene-disease associations. COMET integrates diverse datasets to construct comprehensive heterogeneous networks, initializing node features with BioGPT. We define seven Metapaths and utilize a transformer framework to aggregate Metapath instances, capturing global contexts and long-distance dependencies. Through intra- and inter-metapath aggregation using attention mechanisms, COMET fuses latent vectors from multiple Metapaths to enhance GDA prediction accuracy. Our method demonstrates superior robustness compared to state-of-the-art approaches. Ablation studies and visualizations validate COMET's effectiveness, providing valuable insights for advancing human health research., Comment: 6 pages

Large-scale "pre-train and prompt learning" paradigms have demonstrated remarkable adaptability, enabling broad applications across diverse domains such as question answering, image recognition, and multimodal retrieval. This approach fully leverages the potential of large-scale pre-trained models, reducing downstream data requirements and computational costs while enhancing model applicability across various tasks. Graphs, as versatile data structures that capture relationships between entities, play pivotal roles in fields such as social network analysis, recommender systems, and biological graphs. Despite the success of pre-train and prompt learning paradigms in Natural Language Processing (NLP) and Computer Vision (CV), their application in graph domains remains nascent. In graph-structured data, not only do the node and edge features often have disparate distributions, but the topological structures also differ significantly. This diversity in graph data can lead to incompatible patterns or gaps between pre-training and fine-tuning on downstream graphs. We aim to bridge this gap by summarizing methods for alleviating these disparities. This includes exploring prompt design methodologies, comparing related techniques, assessing application scenarios and datasets, and identifying unresolved problems and challenges. This survey categorizes over 100 relevant works in this field, summarizing general design principles and the latest applications, including text-attributed graphs, molecules, proteins, and recommendation systems. Through this extensive review, we provide a foundational understanding of graph prompt learning, aiming to impact not only the graph mining community but also the broader Artificial General Intelligence (AGI) community., Comment: I have decided to temporarily withdraw this draft as I am in the process of making further revisions to improve its content

We report on recent progress and next steps in the design of the proposed MATHUSLA Long Lived Particle (LLP) detector for the HL-LHC as part of the Snowmass 2021 process. Our understanding of backgrounds has greatly improved, aided by detailed simulation studies, and significant R&D has been performed on designing the scintillator detectors and understanding their performance. The collaboration is on track to complete a Technical Design Report, and there are many opportunities for interested new members to contribute towards the goal of designing and constructing MATHUSLA in time for HL-LHC collisions, which would increase the sensitivity to a large variety of highly motivated LLP signals by orders of magnitude., Comment: Contribution to Snowmass 2021 (EF09, EF10, IF6, IF9), 18 pages, 12 figures. v2: included additional endorsers. v3: updated affiliations. v4: added missing contributors as authors

We report on recent progress in the design of the proposed MATHUSLA Long Lived Particle (LLP) detector for the HL-LHC, updating the information in the original Letter of Intent (LoI), see CDS:LHCC-I-031, arXiv:1811.00927. A suitable site has been identified at LHC Point 5 that is closer to the CMS Interaction Point (IP) than assumed in the LoI. The decay volume has been increased from 20 m to 25 m in height. Engineering studies have been made in order to locate much of the decay volume below ground, bringing the detector even closer to the IP. With these changes, a 100 m x 100 m detector has the same physics reach for large c$\tau$ as the 200 m x 200 m detector described in the LoI and other studies. The performance for small c$\tau$ is improved because of the proximity to the IP. Detector technology has also evolved while retaining the strip-like sensor geometry in Resistive Plate Chambers (RPC) described in the LoI. The present design uses extruded scintillator bars read out using wavelength shifting fibers and silicon photomultipliers (SiPM). Operations will be simpler and more robust with much lower operating voltages and without the use of greenhouse gases. Manufacturing is straightforward and should result in cost savings. Understanding of backgrounds has also significantly advanced, thanks to new simulation studies and measurements taken at the MATHUSLA test stand operating above ATLAS in 2018. We discuss next steps for the MATHUSLA collaboration, and identify areas where new members can make particularly important contributions., Comment: 22 pages + references, 12 Figures