pith. sign in
Pith Number

pith:6J5G7XOF

pith:2026:6J5G7XOFWYKQ4AO2TCYFFYAPGG
not attested not anchored not stored refs resolved

ProCompNav: Proactive Instance Navigation with Comparative Judgment for Ambiguous User Queries

Hyejin Park, Jungseul Ok, Junhyuk Kwon, Kyle Min, Seungjoon Lee

ProCompNav resolves ambiguous navigation queries by asking binary questions that split candidate pools.

arxiv:2605.06223 v3 · 2026-05-07 · cs.AI · cs.RO

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{6J5G7XOFWYKQ4AO2TCYFFYAPGG}

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

On CoIN-Bench, ProCompNav improves Success Rate over interactive baselines with the same minimal input and non-interactive baselines with detailed descriptions, while substantially reducing Response Length; it also achieves state-of-the-art Success Rate on TextNav.

C2weakest assumption

The framework assumes that attribute-value pairs can be reliably extracted from candidates and that binary answers will correctly and completely prune the pool without introducing new errors or requiring follow-up clarification.

C3one line summary

ProCompNav builds a candidate pool from ambiguous queries then uses pool-splitting binary questions for disambiguation, improving success rate and shortening responses on CoIN-Bench and TextNav.

References

49 extracted · 49 resolved · 4 Pith anchors

[1] FirstName Alpher , title =
[2] Journal of Foo , volume = 13, number = 1, pages =
[3] Journal of Foo , volume = 14, number = 1, pages =
[4] FirstName Alpher and FirstName Gamow , title =
[5] Computer Vision -- ECCV 2022 , year = 2022

Formal links

2 machine-checked theorem links

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

Canonical hash

f27a6fddc5b6150e01da98b052e00f318eb97a3d1389aeddb6fb7184d0c57358

Aliases

arxiv: 2605.06223 · arxiv_version: 2605.06223v3 · doi: 10.48550/arxiv.2605.06223 · pith_short_12: 6J5G7XOFWYKQ · pith_short_16: 6J5G7XOFWYKQ4AO2 · pith_short_8: 6J5G7XOF
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/6J5G7XOFWYKQ4AO2TCYFFYAPGG \
  | 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: f27a6fddc5b6150e01da98b052e00f318eb97a3d1389aeddb6fb7184d0c57358
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "8dc51f089bf0234f1009c4be3fb0bc743de3ff7b6034e1b2492fba6b474502af",
    "cross_cats_sorted": [
      "cs.RO"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.AI",
    "submitted_at": "2026-05-07T13:19:03Z",
    "title_canon_sha256": "f4f5734a13072fe2da564fc341952c006ed68dc0037391891eab8536bcc76adc"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.06223",
    "kind": "arxiv",
    "version": 3
  }
}