On the Expansion of Group-Based Lifts

A $k$-lift of an $n$-vertex base graph $G$ is a graph $H$ on $n\times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_1,\cdots{},v_k$ and each edge $(u,v)$ in $G$ is replaced by a matching representing a bijection $\pi_{uv}$ so that the edges of $H$ are of the form $(u_i,v_{\pi_{uv}(i)})$. Lifts have been studied as a means to efficiently construct expanders. In this work, we study lifts obtained from groups and group actions. We derive the spectrum of such lifts via the representation theory principles of the underlying group. Our main results are: (1) There is a constant $c_1$ such that for every $k\geq 2^{c_1nd}$, there does not exist an abelian $k$-lift $H$ of any $n$-vertex $d$-regular base graph with $H$ being almost Ramanujan (nontrivial eigenvalues of the adjacency matrix at most $O(\sqrt{d})$ in magnitude). This can be viewed as an analogue of the well-known no-expansion result for abelian Cayley graphs. (2) A uniform random lift in a cyclic group of order $k$ of any $n$-vertex $d$-regular base graph $G$, with the nontrivial eigenvalues of the adjacency matrix of $G$ bounded by $\lambda$ in magnitude, has the new nontrivial eigenvalues also bounded by $\lambda+O(\sqrt{d})$ in magnitude with probability $1-ke^{-\Omega(n/d^2)}$. In particular, there is a constant $c_2$ such that for every $k\leq 2^{c_2n/d^2}$, there exists a lift $H$ of every Ramanujan graph in a cyclic group of order $k$ with $H$ being almost Ramanujan. We use this to design a quasi-polynomial time algorithm to construct almost Ramanujan expanders deterministically. The existence of expanding lifts in cyclic groups of order $k=2^{O(n/d^2)}$ can be viewed as a lower bound on the order $k_0$ of the largest abelian group that produces expanding lifts. Our results show that the lower bound matches the upper bound for $k_0$ (upto $d^3$ in the exponent)

Improving the integrality gap for multiway cut

In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal so that the total weight of the edges crossing the partition is minimized. The multiway cut problem for $k\ge 3$ is APX-hard. For arbitrary $k$, the best-known approximation factor is $1.2965$ due to [Sharma and Vondr\'{a}k, 2014] while the best known inapproximability factor is $1.2$ due to [Angelidakis, Makarychev and Manurangsi, 2017]. In this work, we improve on the lower bound to $1.20016$ by constructing an integrality gap instance for the CKR relaxation. A technical challenge in improving the gap has been the lack of geometric tools to understand higher-dimensional simplices. Our instance is a non-trivial $3$-dimensional instance that overcomes this technical challenge. We analyze the gap of the instance by viewing it as a convex combination of $2$-dimensional instances and a uniform 3-dimensional instance. We believe that this technique could be exploited further to construct instances with larger integrality gap. One of the ingredients of our proof technique is a generalization of a result on \emph{Sperner admissible labelings} due to [Mirzakhani and Vondr\'{a}k, 2015] that might be of independent combinatorial interest.Comment: 28 page

Examining public sentiments and attitudes toward COVID-19 vaccination: infoveillance study using Twitter posts

Background: A global rollout of vaccinations is currently underway to mitigate and protect people from the COVID-19 pandemic. Several individuals have been using social media platforms such as Twitter as an outlet to express their feelings, concerns, and opinions about COVID-19 vaccines and vaccination programs. This study examined COVID-19 vaccine–related tweets from January 1, 2020, to April 30, 2021, to uncover the topics, themes, and variations in sentiments of public Twitter users. Objective: The aim of this study was to examine key themes and topics from COVID-19 vaccine–related English tweets posted by individuals, and to explore the trends and variations in public opinions and sentiments. Methods: We gathered and assessed a corpus of 2.94 million COVID-19 vaccine–related tweets made by 1.2 million individuals. We used CoreX topic modeling to explore the themes and topics underlying the tweets, and used VADER sentiment analysis to compute sentiment scores and examine weekly trends. We also performed qualitative content analysis of the top three topics pertaining to COVID-19 vaccination. Results: Topic modeling yielded 16 topics that were grouped into 6 broader themes underlying the COVID-19 vaccination tweets. The most tweeted topic about COVID-19 vaccination was related to vaccination policy, specifically whether vaccines needed to be mandated or optional (13.94%), followed by vaccine hesitancy (12.63%) and postvaccination symptoms and effects (10.44%) Average compound sentiment scores were negative throughout the 16 weeks for the topics postvaccination symptoms and side effects and hoax/conspiracy. However, consistent positive sentiment scores were observed for the topics vaccination disclosure, vaccine efficacy, clinical trials and approvals, affordability, regulation, distribution and shortage, travel, appointment and scheduling, vaccination sites, advocacy, opinion leaders and endorsement, and gratitude toward health care workers. Reversal in sentiment scores in a few weeks was observed for the topics vaccination eligibility and hesitancy. Conclusions: Identification of dominant themes, topics, sentiments, and changing trends about COVID-19 vaccination can aid governments and health care agencies to frame appropriate vaccination programs, policies, and rollouts. [Abstract copyright: ©Ranganathan Chandrasekaran, Rashi Desai, Harsh Shah, Vivek Kumar, Evangelos Moustakas. Originally published in JMIR Infodemiology (https://infodemiology.jmir.org), 15.04.2022.

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

This paper puts forward a new efficient construction for Multi-Receiver Signcryption in the Identity-based setting. We consider a scenario where a user wants to securely send a message to a dynamically changing subset of the receivers in such a way that non-members of the of this subset cannot learn the message. The obvious solution is to transmit an individually signcrypted message to every member of the subset. This requires a very long transmission (the number of receivers times the length of the message) and high computation cost. Another simple solution is to provide every possible subset of receivers with a key. This requires every user to store a huge number of keys. In this case, the storage efficiency is compromised. The goal of this paper is to provide solutions which are efficient in all three measures i.e. transmission length, storage of keys and computation at both ends. We propose a new scheme that achieve both confidentiality and authenticity simultaneously in this setting and is the most efficient scheme to date, in the parameters described above. It breaks the barrier of ciphertext length of linear order in the number of receivers, and achieves constant sized ciphertext, independent of the size of the receiver set. This is the first Multi-receiver Signcryption scheme to do so. We support the scheme with security proofs under a precisely defined formal security mode

Cryptanalysis of Li et al.\u27s Identity-Based Threshold Signcryption Scheme

Signcryption is a cryptographic primitive that aims at providing confidentiality and authentication simultaneously. Recently in May 2008, a scheme for identity based threshold signcryption was proposed by Fagen Li and Yong Yu. They have proved the confidentiality of their scheme and have also claimed the unforgeability without providing satisfactory proof. In this paper, we show that in their signcryption scheme the secret key of the sender is exposed(total break) to the clerk during sincryption and hence insecure in the presence of malicious clerks. Further, we propose a corrected version of the scheme and formally prove its security under the existing security model for signcryption

Cryptanalysis of Bohio et al.\u27s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-hoc Networks

Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. [4] proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.\u27s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three in [4]

Signal transducer and activator of transcription 1 (STAT1) gain-of-function mutations and disseminated coccidioidomycosis and histoplasmosis

Background: Impaired signaling in the IFN-g/IL-12 pathway causes susceptibility to severe disseminated infections with mycobacteria and dimorphic yeasts. Dominant gain-of-function mutations in signal transducer and activator of transcription 1 (STAT1) have been associated with chronic mucocutaneous candidiasis. Objective: We sought to identify the molecular defect in patients with disseminated dimorphic yeast infections. Methods: PBMCs, EBV-transformed B cells, and transfected U3A cell lines were studied for IFN-g/IL-12 pathway function. STAT1 was sequenced in probands and available relatives. Interferon-induced STAT1 phosphorylation, transcriptional responses, protein-protein interactions, target gene activation, and function were investigated. Results: We identified 5 patients with disseminated Coccidioides immitis or Histoplasma capsulatum with heterozygous missense mutations in the STAT1 coiled-coil or DNA-binding domains. These are dominant gain-of-function mutations causing enhanced STAT1 phosphorylation, delayed dephosphorylation, enhanced DNA binding and transactivation, and enhanced interaction with protein inhibitor of activated STAT1. The mutations caused enhanced IFN-g–induced gene expression, but we found impaired responses to IFN-g restimulation. Conclusion: Gain-of-function mutations in STAT1 predispose to invasive, severe, disseminated dimorphic yeast infections, likely through aberrant regulation of IFN-g–mediated inflammationFil: Sampaio, Elizabeth P.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados Unidos. Instituto Oswaldo Cruz. Laboratorio de Leprologia; BrasilFil: Hsu, Amy P.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Pechacek, Joseph. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Hannelore I.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados Unidos. Erasmus Medical Center. Department of Medical Microbiology and Infectious Disease; Países BajosFil: Dias, Dalton L.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Paulson, Michelle L.. Clinical Research Directorate/CMRP; Estados UnidosFil: Chandrasekaran, Prabha. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Rosen, Lindsey B.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Carvalho, Daniel S.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados Unidos. Instituto Oswaldo Cruz, Laboratorio de Leprologia; BrasilFil: Ding, Li. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Vinh, Donald C.. McGill University Health Centre. Division of Infectious Diseases; CanadáFil: Browne, Sarah K.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Datta, Shrimati. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Allergic Diseases. Allergic Inflammation Unit; Estados UnidosFil: Milner, Joshua D.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Allergic Diseases. Allergic Inflammation Unit; Estados UnidosFil: Kuhns, Douglas B.. Clinical Services Program; Estados UnidosFil: Long Priel, Debra A.. Clinical Services Program; Estados UnidosFil: Sadat, Mohammed A.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Host Defenses. Infectious Diseases Susceptibility Unit; Estados UnidosFil: Shiloh, Michael. University of Texas. Southwestern Medical Center. Division of Infectious Diseases; Estados UnidosFil: De Marco, Brendan. University of Texas. Southwestern Medical Center. Division of Infectious Diseases; Estados UnidosFil: Alvares, Michael. University of Texas. Southwestern Medical Center. Division of Allergy and Immunology; Estados UnidosFil: Gillman, Jason W.. University of Texas. Southwestern Medical Center. Division of Infectious Diseases; Estados UnidosFil: Ramarathnam, Vivek. University of Texas. Southwestern Medical Center. Division of Infectious Diseases; Estados UnidosFil: de la Morena, Maite. University of Texas. Southwestern Medical Center. Division of Allergy and Immunology; Estados UnidosFil: Bezrodnik, Liliana. Gobierno de la Ciudad de Buenos Aires. Hospital General de Niños "Ricardo Gutierrez"; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Moreira, Ileana. Gobierno de la Ciudad de Buenos Aires. Hospital General de Niños "Ricardo Gutierrez"; ArgentinaFil: Uzel, Gulbu. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Johnson, Daniel. University of Chicago. Comer Children; Estados UnidosFil: Spalding, Christine. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Zerbe, Christa S.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados UnidosFil: Wiley, Henry. National Eye Institute. Clinical Trials Branch; Estados UnidosFil: Greenberg, David E.. University of Texas. Southwestern Medical Center. Division of Infectious Diseases; Estados UnidosFil: Hoover, Susan E.. University of Arizona. College of Medicine. Valley Fever Center for Excellence; Estados UnidosFil: Rosenzweig, Sergio D.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Host Defenses Infectious Diseases Susceptibility Unit; Estados Unidos. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Primary Immunodeficiency Clinic; Estados UnidosFil: Galgiani, John N.. University of Arizona. College of Medicine. Valley Fever Center for Excellence; Estados UnidosFil: Holland, Steven M.. National Institutes of Health. National Institute of Allergy and Infectious Diseases. Laboratory of Clinical Infectious Diseases. Immunopathogenesis Section; Estados Unido

Large expert-curated database for benchmarking document similarity detection in biomedical literature search

Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency-Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research.Peer reviewe