{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6J5G7XOFWYKQ4AO2TCYFFYAPGG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06223","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06223v3","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06223","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"6J5G7XOFWYKQ","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"6J5G7XOFWYKQ4AO2","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"6J5G7XOF","created_at":"2026-05-20T00:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:8c056573252d2522213bfd3d9d4964dfb4cc4d37f4c3e27494d04f82f5ba25f6","target":"graph","created_at":"2026-05-20T00:00:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ProCompNav resolves ambiguous navigation queries by asking binary questions that split candidate pools."}],"snapshot_sha256":"bf7d63e25f4010573954691b3b1d951d9f6b3319af364f80a86e1444b8a35a1c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8c2f9db37d08160d8bf4f0986d1159da9923633bc6641927efc00802c1758511"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.118285Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:53:36.665498Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06223/integrity.json","findings":[],"snapshot_sha256":"40a7a3b6f12e050f3b039f68c62b78c9677fc0862cf16487da3fd831624bac16","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Natural-language instance navigation becomes challenging when the initial user request does not uniquely specify the target instance. A practical agent should reduce the user's burden by actively asking only the information needed to distinguish the target from similar distractors, rather than requiring a detailed description upfront. Existing approaches often fall short of this goal: they may stop at the first plausible candidate before sufficiently exploring alternatives, or, even after collecting multiple candidates, ask about the target's attributes derived from individual candidates rathe","authors_text":"Hyejin Park, Jungseul Ok, Junhyuk Kwon, Kyle Min, Seungjoon Lee","cross_cats":["cs.RO"],"headline":"ProCompNav resolves ambiguous navigation queries by asking binary questions that split candidate pools.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-07T13:19:03Z","title":"ProCompNav: Proactive Instance Navigation with Comparative Judgment for Ambiguous User Queries"},"references":{"count":49,"internal_anchors":4,"resolved_work":49,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"FirstName Alpher , title =","work_id":"42297990-8783-41a1-b0fa-8ccdbf630852","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Journal of Foo , volume = 13, number = 1, pages =","work_id":"65a8b3d0-af84-4f68-87eb-101c85ab18b2","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of Foo , volume = 14, number = 1, pages =","work_id":"b3089947-bd36-4a24-9199-cc535e299537","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"FirstName Alpher and FirstName Gamow , title =","work_id":"caed320b-7cdc-41ca-bb08-00fb14feec62","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Computer Vision -- ECCV 2022 , year =","work_id":"ed75d4d8-3228-4ebf-8e21-c1feb9ce9cae","year":2022}],"snapshot_sha256":"b19fa386be84b38899124552eff90755e1d4cc41b5979fbac7310a7ae69d3e4b"},"source":{"id":"2605.06223","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-19T16:56:40.611075Z","id":"aab0c92d-00a6-4f11-9a94-cb37597b1af5","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ProCompNav resolves ambiguous navigation queries by asking binary questions that split candidate pools.","strongest_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.","weakest_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."}},"verdict_id":"aab0c92d-00a6-4f11-9a94-cb37597b1af5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:020ae3afdcbab818fab8dd04944624791bdcee74e81c3cd5d576ddf49f288f30","target":"record","created_at":"2026-05-20T00:00:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"f27a6fddc5b6150e01da98b052e00f318eb97a3d1389aeddb6fb7184d0c57358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f27a6fddc5b6150e01da98b052e00f318eb97a3d1389aeddb6fb7184d0c57358","first_computed_at":"2026-05-20T00:00:41.013082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:41.013082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1sTrfRYPYX7aPofURKWq7iXAaOE4Zojb/YBd7T61SxE10IWgYtZkRULC+PXItq6sEPOKAOk77DavfCT8itmaAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:41.013892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06223","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:020ae3afdcbab818fab8dd04944624791bdcee74e81c3cd5d576ddf49f288f30","sha256:8c056573252d2522213bfd3d9d4964dfb4cc4d37f4c3e27494d04f82f5ba25f6"],"state_sha256":"b2505573e8f92fe1d4c189f40c9029630d14d5ba93c6f88849e1496aa4c38503"}