Abstract

The histone methyltransferase ASH1L, first discovered for its role in transcription, has been shown to accelerate the removal of ultraviolet (UV) light-induced cyclobutane pyrimidine dimers (CPDs) by nucleotide excision repair. Previous reports demonstrated that CPD excision is most efficient at transcriptional regulatory elements, including enhancers, relative to other genomic sites. Therefore, we analyzed DNA damage maps in ASH1L-proficient and ASH1L-deficient cells to understand how ASH1L controls enhancer stability. This comparison showed that ASH1L protects enhancer sequences against the induction of CPDs besides stimulating repair activity. ASH1L reduces CPD formation at C–containing but not at TT dinucleotides, and no protection occurs against pyrimidine-(6,4)-pyrimidone photoproducts or cisplatin crosslinks. The diminished CPD induction extends to gene promoters but excludes retrotransposons. This guardian role against CPDs in regulatory elements is associated with the presence of H3K4me3 and H3K27ac histone marks, which are known to interact with the PHD and BRD motifs of ASH1L, respectively. Molecular dynamics simulations identified a DNA-binding AT hook of ASH1L that alters the distance and dihedral angle between neighboring C nucleotides to disfavor dimerization. The loss of this protection results in a higher frequency of C–>T transitions at enhancers of skin cancers carrying ASH1L mutations compared to ASH1L-intact counterparts.

Abstract

The recently proposed Transaction Fee Mechanism (TFM) literature studies the strategic interaction between the miner of a block and the transaction creators (or users) in a blockchain. In a TFM, the miner includes transactions that maximize its utility while users submit fees for a slot in the block. The existing TFM literature focuses on satisfying standard incentive properties – which may limit widespread adoption. We argue that a TFM is “fair" to the transaction creators if it satisfies specific notions, namely Zero-fee Transaction Inclusion and Monotonicity. First, we prove that one generally cannot ensure both these properties and prevent a miner’s strategic manipulation. We also show that existing TFMs either do not satisfy these notions or do so at a high cost to the miners’ utility. As such, we introduce a novel TFM using on-chain randomness – rTFM. We prove that rTFM guarantees incentive compatibility for miners and users while satisfying our novel fairness constraints.

Abstract

Current algorithms for Maximal Frequent Subgraph (MFS) mining do not scale to large databases with more than 300k graphs. Frequency computation is commonly done using numerous subgraph isomorphism operations, which are computationally expensive. This paper explores a partition-based secondary memory algorithm, PMCS, that can make MFS mining for large databases viable. PMCS intelligently avoids redundant computations to perform frequency computation operations optimally. Its intermediate results are also small enough to fit in the main memory. Our results demonstrate that PMCS scales to databases of up to 1000k graphs with an average of 25-30 edges per graph.

Abstract

In this article we present a benchmark for resource characterization in the process of controlled quantum state reconstruction and secret sharing for general three-qubit states. This is achieved by providing a closed expression for the reconstruction fidelity, which relies on the genuine tripartite correlation and the bipartite channel between the dealer and the reconstructor characterized by the respective correlation parameters. We formulate the idea of quantum advantage in approximate state reconstruction as surpassing the classical limit set at 2 3 . This article introduces new interoperability between teleportation and state reconstruction. This is detailed through a case-by-case analysis of relevant correlation matrices. We reformulate the idea of quantum secret sharing by setting up additional constraints on the teleportation capacity of the bipartite channels between dealer and shareholders by ensuring that, individually, the shareholders cannot reconstruct the secret. We believe that this will give us an ideal picture of how quantum secret sharing should be.

Abstract

This work tackles the important task of understanding out-of-distribution behavior in two prominent types of generative models, i.e., GANs and Diffusion models. Understanding this behavior is crucial in understanding their broader utility and risks as these systems are increasingly deployed in our daily lives. Our first contribution is demonstrating that diffusion spaces outperform GANs' latent spaces in inverting high-quality OOD images. We also provide a theoretical analysis attributing this to the lack of prior holes in diffusion spaces. Our second significant contribution is to provide a theoretical hypothesis that diffusion spaces can be projected onto a bounded hypersphere, enabling image manipulation through geodesic traversal between inverted images. Our analysis shows that different geodesics share common attributes for the same manipulation, which we leverage to perform various image manipulations. We conduct thorough empirical evaluations to support and validate our claims. Finally, our third and final contribution introduces a novel approach to the few-shot sampling for out-of-distribution data by inverting a few images to sample from the cluster formed by the inverted latents. The proposed technique achieves state-of-the-art results for the few-shot generation task in terms of image quality. The effectiveness of the generated samples is further validated when used to augment data for underrepresented classes in a classification task, leading to improved performance. Our research underscores the promise of diffusion spaces in out-of-distribution imaging and offers avenues for further exploration.

Abstract

The evolving landscape of gig labor, particularly within food delivery platforms, has been influenced by a shift towards algorithmic management, emphasizing performance metrics as a daily burden to be carried through delivery work. Through a study of Indian food delivery agents, our paper suggests an emerging gamification culture between delivery platforms and workers. Agents gradually yet consistently adapt to stringent algorithmic management to overcome everyday work's precarity. Despite the challenges of performance pressure on food delivery labor, we capture the daily rhythms and routines of delivery work punctuated by flashes of agenting, revealing small capacities to make choices and influence work outcomes. By employing a qualitative research framework, we uncover the mechanisms through which delivery platforms manipulate labor, simultaneously exploring delivery agents' tactics to extract agency and exploit the platforms' rules. We develop the notion of 'agency’ to disentangle the idea of `gamification by agents’ as a socio-technical derivative governing food delivery agents in urban India. The findings highlight the potential of platform work empowering, albeit with limits, delivery agents with agency and decision-making authority.

Abstract

-

Abstract

The understanding of spatio-temporal variation in land use and land cover (LULC) patterns is crucial for managing catchment land use planning, as it directly influences of tropical reservoir water quality and the subsequent Nutrient Contamination (NC) of unmonitored water bodies. The current research attempts to accurately measure the influence of LULC and its associated determinants on the quantities of NC loads by using Chl-a as a proxy, within tropical reservoirs, i.e. Bhadra and Tungabhadra, located in same river catchment. This Chl-a spread calculated by the Maximum Chlorophyll Index (MCI) derived from Sentinel 2 satellite data products covering the period from July 2016 to June 2021 were done using Google Earth Engine (GEE) platform. The validation analysis confirms the robustness of the methodology with a strong correlation between MCI-calculated values and EOMAP (Earth Observation and Environmental Services Mapping) Chl-a (μg/L) data points for both reservoirs, Bhadra (R2 = 0.64) and Tungabhadra (R2 = 0.68). The findings reveal that, Tungabhadra reservoir consistently exhibits an excessive spatial distribution of Chl-a spread area (17 km2 to 335 km2 ), reflecting nutrient-rich water inflows, particularly evident during the post-monsoon period. This notable rise could be linked to harvesting the Kharif crop, resulting in elevated nutrient concentrations. In contrast Bhadra reservoir, dominated by forested areas, maintains relatively lower Chl-a spread areas (<20 km2 ), highlighting its pivotal role in maintaining water cleanliness and serves as a riparian boundary. In addition, the changes in LULC classes show a strong relationship with variation in Chl-a during the studied period, for the Bhadra Reservoir R2 = 0.51 (F- statistics = 3.983, p = 0.021), and the Tungabhadra Reservoir R2 = 0.802 (F- statistics = 7.489, p = 0.0143). This highlights how changes in land use significantly shape contamination dynamics, deepening our understanding of nutrient inputs and contamination drivers in tropical reservoirs.

Abstract

Proof-of-Work is a consensus algorithm where miners solve cryptographic puzzles to mine blocks and obtain a reward through some Block Reward Mechanism (BRM). PoW blockchain faces the problem of centralization due to the formation of mining pools, where miners mine blocks as a group and distribute rewards. The rationale is to reduce the risk (variance) in reward while obtaining the same expected block reward. In this work, we address the problem of centralization due to mining pools in PoW blockchain. We propose a two-player game between the new miner joining the system and the PoW blockchain system. We model the utility for the incoming miner as a combination of (i) expected block reward, (ii) risk, and (iii) cost of switching between different mining pools. With this utility structure, we analyze the equilibrium strategy of the incoming miner for different BRMs: (a) memoryless -- block reward is history independent (e.g., Bitcoin) (b) retentive: block reward is history-dependent (e.g., Fruitchains). For memoryless BRMs, we show that depending on the coefficient of switching cost c, the protocol is decentralized when c=0 and centralized when c>c–. In addition, we show the impossibility of constructing a memoryless BRM where solo mining gives a higher payoff than forming/joining mining pools. While retentive BRM in Fruitchains reduces risk in solo mining, the equilibrium strategy for incoming miners is still to join mining pools, leading to centralization. We then propose our novel retentive BRM -- Decent-BRM. We show that under Decent-BRM, incoming miners obtain higher utility in solo mining than joining mining pools. Therefore, no mining pools are formed, and the Pow blockchain using Decent-BRM is decentralized.

Abstract

Proof-of-stake (PoS) has emerged as a natural alternative to the resource-intensive Proof-of-Work (PoW) blockchain, as was recently seen with the Ethereum Merge. PoS-based blockchains require an initial stake distribution among the participants. Typically, this initial stake distribution is called bootstrapping. This paper argues that existing bootstrapping protocols are prone to centralization. To address centralization due to bootstrapping, we propose a novel game Γbootstrap. Next, we define three conditions: (i) Individual Rationality (IR), (ii) Incentive Compatibility (IC), and (iii) (τ,δ,ϵ)− Decentralization that an emph{ideal} bootstrapping protocol must satisfy. (τ,δ,ϵ) are certain parameters to quantify decentralization. Towards this, we propose a novel centralization metric, C-NORM, to measure centralization in a PoS System. We define a centralization game -- Γcent, to analyze the efficacy of centralization metrics. We show that C-NORM effectively captures centralization in the presence of strategic players capable of launching Sybil attacks. With C-NORM, we analyze popular bootstrapping protocols such as Airdrop and Proof-of-Burn (PoB) and prove that they do not satisfy IC and IR, respectively. Motivated by the Ethereum Merge, we study W2SB (a PoW-based bootstrapping protocol) and prove it is ideal. In addition, we conduct synthetic simulations to empirically validate that W2SB bootstrapped PoS is decentralized.