Pith. sign in

hub

Enforceable Security Policies

4 Pith papers cite this work, alongside 1,266 external citations. Polarity classification is still indexing.

4 Pith papers citing it
1,266 external citations · external index

hub tools

fields

cs.AI 2 cs.CR 2

years

2026 4

verdicts

UNVERDICTED 4

representative citing papers

Analyzing the Narration Gap in LLM-Solver Loops

cs.AI · 2026-06-17 · unverdicted · novelty 8.0

The narration step in LLM-solver loops is vulnerable to prompt injection that inverts verified solver conclusions, and hardened prompts reduce but do not eliminate the risk under adaptive attacks.

Efficient and Sound Probabilistic Verification for AI Agents

cs.CR · 2026-06-18 · unverdicted · novelty 6.0

Presents a distributionally robust optimization method for sound probabilistic verification of Datalog policies in AI agents that bounds violation risk regardless of predicate correlations.

Layer Order Semantics for Automata-Based Cybersecurity

cs.CR · 2026-06-09 · unverdicted · novelty 6.0

Introduces a layer-order automaton model that equates faithful online enforcement to regular prefix-closed languages under causal visibility and shows equivalence to deterministic edit automata while preserving layer-local invariants.

citing papers explorer

Showing 4 of 4 citing papers.

  • Analyzing the Narration Gap in LLM-Solver Loops cs.AI · 2026-06-17 · unverdicted · none · ref 38

    The narration step in LLM-solver loops is vulnerable to prompt injection that inverts verified solver conclusions, and hardened prompts reduce but do not eliminate the risk under adaptive attacks.

  • Efficient and Sound Probabilistic Verification for AI Agents cs.CR · 2026-06-18 · unverdicted · none · ref 29

    Presents a distributionally robust optimization method for sound probabilistic verification of Datalog policies in AI agents that bounds violation risk regardless of predicate correlations.

  • Layer Order Semantics for Automata-Based Cybersecurity cs.CR · 2026-06-09 · unverdicted · none · ref 20

    Introduces a layer-order automaton model that equates faithful online enforcement to regular prefix-closed languages under causal visibility and shows equivalence to deterministic edit automata while preserving layer-local invariants.

  • From Governance Norms to Enforceable Controls: A Layered Translation Method for Runtime Guardrails in Agentic AI cs.AI · 2026-04-06 · unverdicted · none · ref 28

    The paper presents a layered method to translate governance objectives from standards such as ISO/IEC 42001 into four control layers for agentic AI, with runtime guardrails limited to observable, determinate, and time-sensitive controls, shown via a procurement-agent case study.