Pith Number

pith:P6H2ATK4

pith:2026:P6H2ATK43NNYQNW5I62TJV3WXY

not attested not anchored not stored refs resolved

Compositionality in Coalgebraic Trace Semantics

Henning Urbat, Jonas Forster, Robin Jourde, Sergey Goncharov, Stelios Tsampas

De Simone laws over Kleisli categories ensure operational models are compositional for coalgebraic trace equivalence.

arxiv:2605.18285 v1 · 2026-05-18 · cs.LO

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{P6H2ATK43NNYQNW5I62TJV3WXY}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We introduce De Simone laws, a type of GSOS laws over Kleisli categories, and prove that their operational models are compositional for coalgebraic trace equivalence.

C2weakest assumption

The refined naturality conditions on GSOS laws are sufficient to make abstract GSOS applicable over Kleisli categories for trace semantics.

C3one line summary

Introduces De Simone laws over Kleisli categories that guarantee compositionality of coalgebraic trace equivalence and recovers the classical De Simone format while adding a probabilistic variant.

References

14 extracted · 14 resolved · 0 Pith anchors

[1] 2 Faris Abou-Saleh.A coalgebraic semantics for imperative programming languages 2013 · doi:10.1016/j.ic.2013.04.001

[3] Proceedings, volume 7794 ofLecture Notes in Computer Science, pages 129–144. Springer, 2013.doi:10.1007/978-3-642-37075-5\_9. 5 Luca Aceto, Wan J. Fokkink, and Chris Verhoef. Structural operational se 2013 · doi:10.1007/978-3-642-37075-5

[4] GSOS for probabilistic transition systems 2002 · doi:10.1016/s1571-0661(04)80358-x

[5] When is partial trace equivalence adequate? 6(3):317–338, 1994.doi:10.1007/ BF01215409 1994 · doi:10.1145/200836.200876

[6] 16 Valentina Castiglioni, Ruggero Lanotte, and Simone Tini 2015 · doi:10.1016/j.jlamp.2015.09.002

Formal links

1 machine-checked theorem link

Receipt and verification

First computed	2026-05-20T00:05:53.432589Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

7f8fa04d5cdb5b8836dd47b534d776be2a13830dc10e6b9c2b8d72c0a10cdbb6

Aliases

arxiv: 2605.18285 · arxiv_version: 2605.18285v1 · doi: 10.48550/arxiv.2605.18285 · pith_short_12: P6H2ATK43NNY · pith_short_16: P6H2ATK43NNYQNW5 · pith_short_8: P6H2ATK4

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/P6H2ATK43NNYQNW5I62TJV3WXY \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 7f8fa04d5cdb5b8836dd47b534d776be2a13830dc10e6b9c2b8d72c0a10cdbb6

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "f31e686d9e3f0b4c34caed803c54deb5341ae1b0731298574ea77e05b3185938",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.LO",
    "submitted_at": "2026-05-18T12:14:45Z",
    "title_canon_sha256": "4739325348ec11c9750bde486ef17361b2bbdde33465743ed0d669caa9b6125b"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.18285",
    "kind": "arxiv",
    "version": 1
  }
}