ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “ChronoID”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.IRcs.AIEmpiricalRecentJun 12, 2026

ChronoID: Infusing Explicit Temporal Signals into Semantic IDs for Generative Recommendation

Dongdong Nian, Dongqi Fu, Chenliang Xu, Yinglong Xia +3 more

This paper proposes ChronoID, a framework for time-aware semantic ID learning in generative recommendation.

View →
cs.LGcs.AIRecentMay 31, 2026

ChronosAD: Leveraging Time Series Foundation Models for Accurate Anomaly Detection

Uzair Khan, Luigi Capogrosso, Francesco Biondani, Michele Magno +3 more

ChronosAD introduces a novel architecture that uses time series foundation models and a custom Temporal Block to achieve robust and highly accurate anomaly detection across diverse domains.

View →
cs.CRcs.DCRecentApr 21, 2026

CHRONOS: A Hardware-Assisted Phase-Decoupled Framework for Secure Federated Learning in IoT

Hung Dang

CHRONOS is a hardware-assisted framework that significantly reduces the latency of secure federated learning by decoupling cryptographic key setup from the active training phase, while maintaining hig…

View →
cs.DBcs.AIcs.CRRecentMay 22, 2026

CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces

Joydeep Chandra

CHRONOS is a novel three-layer architecture designed to address coupled failures in temporal data marketplaces by integrating temporal decay, changepoint-aware pricing, and differential privacy for ro…

View →
cs.DMmath.COmath.DSTheoreticalRecentJun 11, 2026

The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

Enrico Formenti, Supreeti Kamylia

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

View →
astro-ph.EPastro-ph.IMcs.AIRecentMay 28, 2026

DELOS: Detecting Shallow Transits in Kepler Photometry Using a Contrastive-Learning Framework

Qingtian Liu, Jian Ge, XingChen Yan, Kevin Willis +3 more

DELOS is a novel contrastive-learning framework that efficiently and sensitively detects shallow, intermediate-to-long-period exoplanet transits in Kepler photometry, significantly outperforming tradi…

View →
cs.DScs.DMTheoreticalRecentJun 11, 2026

(Un)ranking Permutation Classes

Nathanaël Hassler, Vincent Vajnovszki

This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.

View →
math.ATcs.CGmath-phRecentMay 27, 2026

Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis

Satoshi Kanno, Rei Nishimura, Hiroshi Yamauchi, Yoshi-aki Shimada

The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…

View →
math.AGcs.AIcs.NERecentMay 27, 2026

Real-rootedness of the Poincaré polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

Gergely Bérczi, Young-Hoon Kiem

The paper proves the real-rootedness and ultra-log-concavity of the Poincaré polynomials for the moduli space $\overline{\mathcal M}_{0,n}$ and the Fulton--MacPherson space $\mathbb{P}^1[n]$ using a n…

View →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
cs.CLcs.AIRecentMay 31, 2026

TimeSage-MT: A Multi-Turn Benchmark for Evaluating Agentic Time Series Reasoning

Yaxuan Kong, Qingren Yao, Yuqi Nie, Yichen Li +6 more

The paper introduces TimeSage-MT, a comprehensive multi-turn benchmark designed to rigorously test an LLM agent's ability to perform complex, evolving time series analysis, revealing critical gaps in…

View →
math.NTcs.CRRecentMar 26, 2026

Second order Recurrences, quadratic number fields and cyclic codes

Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim +1 more

The paper investigates generalized Wall-Sun-Sun primes, $WSS(d)$, and uses them to study the weight distributions of specific cyclic codes defined over $ ext{F}_p$ and $ ext{Z}_{p^2}$.

View →
cs.FLcs.CRRecentMar 27, 2026

Evolution-Based Timed Opacity under a Universal Observation Model

Zhe Zhang, Martijn Goorden, Michel Reniers

The paper establishes a unified framework for timed opacity by introducing a universal observation model and defining evolution-based timed opacity, proving its relationship to existing opacity defini…

View →
cs.LGastro-ph.IMcs.CVRecentJun 3, 2026

Identifying Gems from Roman RAPIDly

Karan Gandhi, Ashish A. Mahabal, Jacob E. Jencson, Russ R. Laher +5 more

This paper introduces a machine learning model, RuBR, and a methodology to reliably distinguish genuine astronomical transients from spurious detections for the upcoming Roman Space Telescope's data p…

View →
cs.ARcs.CRRecentMay 13, 2026

PoisonCap: Efficient Hierarchical Temporal Safety for CHERI

Yuecheng Wang, Jonathan Woodruff, Alfredo Mazzinghi, Peter Rugg +4 more

PoisonCap introduces a new 'poison' capability format for CHERI systems to provide efficient, strict use-after-free and initialization safety, surpassing existing temporal safety solutions.

View →
cs.CRRecentMay 11, 2026

Security Analysis of Time-of-Arrival Estimation via Cross-Correlation under Narrow-Band Conditions

Claudio Anliker, Daniele Coppola, Giovanni Camurati, Srdjan Čapkun

This paper analyzes two novel, symbol-agnostic attacks—signal multiplication and negative group delay (NGD) filtering—that compromise cross-correlation-based Time-of-Arrival (ToA) estimation in narrow…

View →
cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

View →
cs.CRcs.FLcs.MSRecentMar 20, 2026

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators

Bhuvaneswari A, Kamalika Bhattacharjee

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

View →
math.LOcs.CCTheoreticalRecentJun 11, 2026

Extended Frege proofs, circuits and rewriting

Jan Krajicek

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

View →