SearcharxivSearch

arXiv subjects

Aaruni Kaushik

Publications and source records attributed to Aaruni Kaushik.

3 recordsLinked to original sources

Decoding Crystallographic Surface Chirality from Real Space and Momentum Space Images by Machine Learning

Intrinsically chiral metal surfaces, where handedness arises from the asymmetric step-kink-terrace topology of high-Miller index planes, are model systems for enantiospecific catalysis, sensing, and spintronics. Yet no consistent method exists to classify their handedness directly from experimental observables, without prior knowledge of crystallographic indices. Here, we report a dual-domain machine learning framework that recognizes handedness in chiral metal surfaces from two independent image representations: atomic structure models in real space and simulated momentum-resolved photoemission maps of Fermi surface projections in reciprocal space. A ResNet18 model pretrained on general image data is fine-tuned for chirality classification independently on both image representations and achieves meaningful classification accuracy for both real space and reciprocal space images. However, the Fermi surface classifier significantly outperforms the real space classifier. Critically, the reciprocal space classifier, trained only on synthetic images, correctly identifies synchrotron-acquired experimental Angle-Resolved Photoemission Spectroscopy (ARPES) maps of Cu(643)$^R$ and Cu(643)$^S$. The stronger performance in momentum space, as well as the transfer to experimental data, shows that handedness is encoded more globally and robustly in the electronic structure than in the spatially localized kink-site geometry. These results establish ARPES as a quantitative readout of crystallographic surface chirality and suggest a scalable route to identify chiral metal surfaces relevant to spin-selective phenomena.

cond-mat.mtrl-sci

Predefined Software Environment Runtimes As A Measure For Reproducibility

As part of Mathematical Research Data Initiative (MaRDI), we have developed a way to preserve a software package into an easy to deploy and use sandbox environment we call a "runtime", via a program we developed called MaPS : MaRDI Packaging System. The program relies on Linux user namespaces to isolate a library environment from the host system, making the sandboxed software reproducible on other systems, with minimal effort. Moreover an overlay filesystem makes local edits persistent. This project will aid reproducibility efforts of research papers: both mathematical and from other disciplines. As a proof of concept, we provide runtimes for the OSCAR Computer Algebra System, polymake software for research in polyhedral geometry, and VIBRANT Virus Identification By iteRative ANnoTation. The software is in a prerelease state: the interface for creating, deploying, and executing runtimes is final, and an interface for easily publishing runtimes is under active development. We thus propose publishing predefined, distributable software environment runtimes along with research papers in an effort to make research with software based results reproducible.

cs.MS

Using Topological Data Analysis to classify Encrypted Bits

We present a way to apply topological data analysis for classifying encrypted bits into distinct classes. Persistent homology is applied to generate topological features of a point cloud obtained from sets of encryptions. We see that this machine learning pipeline is able to classify our data successfully where classical models of machine learning fail to perform the task. We also see that this pipeline works as a dimensionality reduction method making this approach to classify encrypted data a realistic method to classify the given encryptioned bits.

cs.CR