pith. sign in
Pith Number

pith:BWWOF67S

pith:2026:BWWOF67SHFHOEUBCI4DUWORWGZ
not attested not anchored not stored refs resolved

Sheaf-Theoretic Transport and Obstruction for Detecting Scientific Theory Shift in AI Agents

David N. Olivieri, Roque J. Hern\'andez

Sheaf obstruction measures rank the intended theory deformation or extension as the lowest-failure candidate in AI agent transitions.

arxiv:2605.14033 v1 · 2026-05-13 · cs.AI · cs.LG

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{BWWOF67SHFHOEUBCI4DUWORWGZ}

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

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

The main result is direct obstruction ranking: the intended deformation or extension is usually the lowest-obstruction candidate, and transition type is separated in the benchmark.

C2weakest assumption

That the five obstruction components (residual fit, overlap incompatibility, constraint violation, limiting-relation failure, representational cost) can be defined and combined in a way that reliably separates deformation from extension without post-hoc tuning on the benchmark itself.

C3one line summary

A finite sheaf-theoretic framework ranks obstruction measures to identify when an AI agent's theory must deform within its language or extend to a new one, validated on a controlled transition benchmark.

References

43 extracted · 43 resolved · 2 Pith anchors

[1] The sheaf- theoretic structure of non-locality and contextuality.New Journal of Physics, 13(11):113036, November 2011.doi: 10.1088/1367-2630/13/11/113036 2011 · doi:10.1088/1367-2630/13/11/113036
[2] 2025 Sheaf theory: from deep geometry to deep learning 2025
[3] , author Di Giovanni, F 2022
[4] author Borgwardt, K. M. , & author Kriegel, H.-P. ( year 2005 ). title Shortest-path kernels on graphs . In booktitle Proceedings of the Fifth IEEE International Conference on Data Mining \/ (pp. page 2005 · doi:10.1109/icdm.2005.132
[5] Abhimanyu Das, Weihao Kong, Rajat Sen, and Yichen Zhou 2016 · doi:10.1073/pnas.1517384113

Formal links

1 machine-checked theorem link

Receipt and verification
First computed 2026-05-17T23:39:12.819786Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

0dace2fbf2394ee2502247074b3a36366228b0f6274147c86373e432c2ef6b80

Aliases

arxiv: 2605.14033 · arxiv_version: 2605.14033v1 · doi: 10.48550/arxiv.2605.14033 · pith_short_12: BWWOF67SHFHO · pith_short_16: BWWOF67SHFHOEUBC · pith_short_8: BWWOF67S
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/BWWOF67SHFHOEUBCI4DUWORWGZ \
  | 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: 0dace2fbf2394ee2502247074b3a36366228b0f6274147c86373e432c2ef6b80
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "0eb50d1dd0516496337f7c139e8996094237de32feab4765c2cf71101949a8f0",
    "cross_cats_sorted": [
      "cs.LG"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.AI",
    "submitted_at": "2026-05-13T18:46:17Z",
    "title_canon_sha256": "3384d00f6b4da6505d7af19ad85c6ced96f645f1688ffdc3a4e2921c033d169d"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.14033",
    "kind": "arxiv",
    "version": 1
  }
}