Pith. sign in

In: Proceedings of the 44th ACM SIGPLAN Sympo- sium on Principles of Programming Languages (POPL)

8 Pith papers cite this work, alongside 98 external citations. Polarity classification is still indexing.

8 Pith papers citing it
98 external citations · external index

citation-role summary

background 2

citation-polarity summary

years

2026 8

roles

background 2

polarities

background 2

representative citing papers

SuperDP: Differential Privacy Refutation via Supermartingales

cs.PL · 2026-03-27 · unverdicted · novelty 8.0

SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.

Minimization of Streaming Transducers

cs.FL · 2026-05-11 · unverdicted · novelty 7.0 · 2 refs

General criteria for minimal models of streaming transducers are established, yielding effective minimization for variants of streaming string-to-tree transducers that build terms at leaves or roots.

Persistent Amortised Analysis, Operationally

cs.PL · 2026-05-10 · accept · novelty 7.0

Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.

Language-Based Agent Control

cs.PL · 2026-05-13 · unverdicted · novelty 6.0

LBAC is a new programming model that enforces user-specified policies on agentic applications by requiring agent-generated programs to be well-typed in the context of the scaffolding code.

Reformalization of the Jordan Curve Theorem

cs.AI · 2026-07-02 · unverdicted · novelty 5.0

The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.

citing papers explorer

Showing 8 of 8 citing papers.

  • SuperDP: Differential Privacy Refutation via Supermartingales cs.PL · 2026-03-27 · unverdicted · none · ref 25

    SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.

  • Intent-Driven Computing: A Computational Model for Governed Autonomous Systems cs.PL · 2026-05-21 · unverdicted · full · ref 9

    Programs emit intents checked against policies by a governed runtime before effects occur, with formal specification, Rocq verification of 454 theorems, and BEAM implementation.

  • Minimization of Streaming Transducers cs.FL · 2026-05-11 · unverdicted · none · ref 51 · 2 links

    General criteria for minimal models of streaming transducers are established, yielding effective minimization for variants of streaming string-to-tree transducers that build terms at leaves or roots.

  • Persistent Amortised Analysis, Operationally cs.PL · 2026-05-10 · accept · none · ref 18

    Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.

  • Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundaries cs.AI · 2026-05-01 · unverdicted · full · ref 13 · 2 links

    Machine-checked model in Rocq establishes that governance is coterminous with expressibility via four primitive constructors in a symmetric monoidal category with capability bounds and verified coherence.

  • Language-Based Agent Control cs.PL · 2026-05-13 · unverdicted · none · ref 14

    LBAC is a new programming model that enforces user-specified policies on agentic applications by requiring agent-generated programs to be well-typed in the context of the scaffolding code.

  • Reformalization of the Jordan Curve Theorem cs.AI · 2026-07-02 · unverdicted · none · ref 299

    The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.

  • Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing cs.DB · 2026-05-18 · unverdicted · none · ref 14

    Introduces Packed Plan Forest (PPF) as a polynomially bounded structure that encodes feasible ambiguous logical plans while pruning infeasible ones in cross-model NL-to-DB query planning.