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

20 results for “induced minors”

CS papers only

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

Want pure semantic search? Try claim verification →

math.COcs.DMTheoreticalRecentJul 8, 2026

Induced Erdős--Pósa property for long holes, long thetas, and beyond

Jadwiga Czyżewska, Tomáš Masařík, Marcin Pilipczuk, Amadeus Reinald +1 more

This paper shows that for every fixed length t, cycles Ct and thetas Θt have the induced Erdős--Pósa property with respect to the induced minor relation in graphs.

View →
cs.DMcs.LOmath.COTheoreticalRecentJul 3, 2026

Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture

Arnar Á. Kristjánsson

The paper shows that an oddomorphism between graphs does not imply graph minor containment and introduces a new structural relation called split-off minor.

View →
cs.CRcs.AIcs.CLNEWEmpiricalJul 28, 2026

Stemma: Induced Decision Regions Reveal LLM Provenance

Keyu Zhang, Vadim Safronov, Andrew Martin

This paper introduces Stemma, a black-box LLM fingerprinting method that abstracts away surface-form variation and measures the inheritance of decision regions for reliable provenance testing.

View →
cs.CRcs.AIRecentMay 19, 2026

Measuring Safety Alignment Effects in Autonomous Security Agents

Isaac David, Arthur Gervais

The study evaluates how safety alignment affects autonomous security agents using a comprehensive trace-based benchmark, finding that while less-restricted models show gains, these effects are not uni…

View →
cs.CCcs.DMTheoreticalRecentJul 21, 2026

The Complexity of Domatic Criticality

Holger Spakowski

This paper investigates the complexity of recognizing domatically critical graphs, which are graphs with maximum dominating sets that cannot be increased by deleting any edge.

View →
cs.CRRecentMar 20, 2026

Constraint Migration: A Formal Theory of Throughput in AI Cybersecurity Pipelines

Surasak Phetmanee

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

View →
cs.CRcs.AIRecentMar 24, 2026

Agent-Sentry: Bounding LLM Agents via Execution Provenance

Rohan Sequeira, Stavros Damianakis, Umar Iqbal, Konstantinos Psounis

Agent-Sentry is a runtime defense system that bounds the execution of LLM agents by learning a profile of benign behavior, effectively blocking malicious injections while maintaining high compatibilit…

View →
cs.AIRecentMay 29, 2026

Formalizing and falsifying causal pathways of rare events

Anahita Haghighat, Dominik Janzing

The paper formalizes the concept of a causal pathway for rare events, showing that testable implications can be derived solely from this pathway abstraction, simplifying complex causal modeling.

View →
cs.PLcs.LOTheoreticalRecentJul 20, 2026

The Because-Calculus: Separating Production, Existence, and Interpretation in Computation

Oscar Perez Mora

This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.

View →
cs.CRcs.AIRecentMay 9, 2026

Few-Shot Truly Benign DPO Attack for Jailbreaking LLMs

Sangyeon Yoon, Wonje Jeung, Yoonjun Cho, Dongjae Jeon +1 more

The paper introduces a truly benign Direct Preference Optimization (DPO) attack that can jailbreak large language models (LLMs) by fine-tuning them with minimal, harmless preference data, thereby supp…

View →
cs.CRcs.HCRecentMay 22, 2026

When Youth Enter the Algorithmic Wild: Discovering and Understanding Potentially Harmful Teen Videos on Douyin and Kwai

Shaoxuan Zhou, Yafei Sun, Jing Zhang, Xianghang Mi

The paper introduces PHTV-Scout, a novel framework that analyzes Douyin and Kwai data, revealing a high prevalence of potentially harmful teen videos, particularly CSE imagery, and demonstrating that…

View →
cs.CRcs.AIcs.SERecentJun 3, 2026

Willing but Unable: Separating Refusal from Capability in Code LLMs via Abliteration

Cristina Carleo, Pietro Liguori, Naghmeh Ivaki, Domenico Cotroneo

The paper introduces 'abliteration,' a weight editing technique that successfully bypasses the refusal mechanism of safety-aligned Code LLMs, enabling scalable synthesis of vulnerable code from safe i…

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 →