Pith Number

pith:GSRUJ57A

pith:2026:GSRUJ57AQLJWAVAXAHFGNZ3CLY

not attested not anchored not stored refs pending

PRISM: Pareto-Efficient Retrieval over Intent-Aware Structured Memory for Long-Horizon Agents

Jingyi Peng, Qiuzhuang Sun, Weiting Liu, Zhongwei Wan

PRISM retrieves evidence from graph-structured memory via intent-aware min-cost path selection and compression, achieving higher accuracy than baselines at an order-of-magnitude smaller context budget.

arxiv:2605.12260 v2 · 2026-05-12 · cs.CL

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{GSRUJ57AQLJWAVAXAHFGNZ3CLY}

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

PRISM delivers substantially higher LLM-judge accuracy than every same-protocol baseline at an order-of-magnitude smaller context budget, occupying a previously empty corner of the accuracy-context-cost frontier.

C2weakest assumption

That the upstream ingestion pipeline already supplies a clean graph-structured memory with typed relations and that query intent can be detected reliably enough to guide edge costing without any training or fine-tuning.

C3one line summary

PRISM achieves higher accuracy than baselines on long-horizon agent tasks at an order-of-magnitude smaller context budget by combining hierarchical bundle search, query-sensitive costing, evidence compression, and adaptive intent routing over structured memory.

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-25T02:02:16.642994Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

34a344f7e082d360541701ca66e7625e061413d48cef33a7425c63e2968204a6

Aliases

arxiv: 2605.12260 · arxiv_version: 2605.12260v2 · doi: 10.48550/arxiv.2605.12260 · pith_short_12: GSRUJ57AQLJW · pith_short_16: GSRUJ57AQLJWAVAX · pith_short_8: GSRUJ57A

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/GSRUJ57AQLJWAVAXAHFGNZ3CLY \
  | 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: 34a344f7e082d360541701ca66e7625e061413d48cef33a7425c63e2968204a6

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "db75e1f32b4c8967b1f70c26ed3bee66e560ac6231564feb1f4d6c88d2ffea34",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.CL",
    "submitted_at": "2026-05-12T15:28:30Z",
    "title_canon_sha256": "f7a4e6e27d92c7546ed72d25dc50b4f9a8c0adde89e0b0827533ceda3e5f89fc"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12260",
    "kind": "arxiv",
    "version": 2
  }
}