{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DBQBKWX766CLJ56REMXGYAQ2B6","short_pith_number":"pith:DBQBKWX7","schema_version":"1.0","canonical_sha256":"1860155afff784b4f7d1232e6c021a0fab7c7a9c5b06640a1e0b438369a7adc4","source":{"kind":"arxiv","id":"2510.24668","version":2},"attestation_state":"computed","paper":{"title":"InteractComp: Evaluating Search Agents With Ambiguous Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chenglin Wu, Conghao Hu, Dayi Miao, Fanqi Kong, Fashen Ren, Fengwei Teng, Fuzhen Yang, Haoyu Li, Jiayi Zhang, Jinyi Bai, Lijun Huang, Mingyi Deng, Nan Tang, Qirui Fu, Song Hu, Tai Zhong, Xiangru Tang, Xin Jin, Xinyu Wang, Yanfei Zhang, Yani Fan, Yifan Wu, Yingjia Wan, Yude Li, Yuyu Luo, Zhaoyang Yu","submitted_at":"2025-10-28T17:35:54Z","abstract_excerpt":"Language agents have demonstrated remarkable potential in web search and information retrieval. However, many search-agent benchmarks assume that user queries are complete and unambiguous. This assumption leaves under-tested a practical failure mode: agents may face ambiguous requests where the intended target cannot be identified without clarification. Yet most agents lack interactive mechanisms during the search process, and existing benchmarks cannot assess this capability. To address this gap, we introduce InteractComp, a benchmark designed to evaluate whether search agents can recognize q"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2510.24668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-10-28T17:35:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5edd28d2e406d23d5141b55029cb5c1b4437b2ab52d8e445634817be1d266267","abstract_canon_sha256":"dc7dab8716faff0433aca8d566f79a655265a4295994c7073a853ee1ffe9b199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T01:19:51.736688Z","signature_b64":"yy2D81fDTvqAVp73OGmlCH1Pwm+EWzCBvnb+8Jytx/i32rAod80BXjGM5kJIvZUhDU1B8VzxRns5TgTh09lwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1860155afff784b4f7d1232e6c021a0fab7c7a9c5b06640a1e0b438369a7adc4","last_reissued_at":"2026-07-27T01:19:51.735796Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T01:19:51.735796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"InteractComp: Evaluating Search Agents With Ambiguous Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chenglin Wu, Conghao Hu, Dayi Miao, Fanqi Kong, Fashen Ren, Fengwei Teng, Fuzhen Yang, Haoyu Li, Jiayi Zhang, Jinyi Bai, Lijun Huang, Mingyi Deng, Nan Tang, Qirui Fu, Song Hu, Tai Zhong, Xiangru Tang, Xin Jin, Xinyu Wang, Yanfei Zhang, Yani Fan, Yifan Wu, Yingjia Wan, Yude Li, Yuyu Luo, Zhaoyang Yu","submitted_at":"2025-10-28T17:35:54Z","abstract_excerpt":"Language agents have demonstrated remarkable potential in web search and information retrieval. However, many search-agent benchmarks assume that user queries are complete and unambiguous. This assumption leaves under-tested a practical failure mode: agents may face ambiguous requests where the intended target cannot be identified without clarification. Yet most agents lack interactive mechanisms during the search process, and existing benchmarks cannot assess this capability. To address this gap, we introduce InteractComp, a benchmark designed to evaluate whether search agents can recognize q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.24668","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.24668/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.24668","created_at":"2026-07-27T01:19:51.736233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.24668v2","created_at":"2026-07-27T01:19:51.736233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.24668","created_at":"2026-07-27T01:19:51.736233+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBQBKWX766CL","created_at":"2026-07-27T01:19:51.736233+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBQBKWX766CLJ56R","created_at":"2026-07-27T01:19:51.736233+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBQBKWX7","created_at":"2026-07-27T01:19:51.736233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2605.27882","citing_title":"VibeSearchBench: Benchmarking Long-horizon Proactive Search in the Wild","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2602.16699","citing_title":"Calibrate-Then-Act: Cost-Aware Exploration in LLM Agents","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18181","citing_title":"Scalable Environments Drive Generalizable Agents","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13821","citing_title":"Harnessing Agentic Evolution","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23129","citing_title":"MindTrellis: Co-Creating Knowledge Structures with AI through Interactive Visual Exploration","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6","json":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6.json","graph_json":"https://pith.science/api/pith-number/DBQBKWX766CLJ56REMXGYAQ2B6/graph.json","events_json":"https://pith.science/api/pith-number/DBQBKWX766CLJ56REMXGYAQ2B6/events.json","paper":"https://pith.science/paper/DBQBKWX7"},"agent_actions":{"view_html":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6","download_json":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6.json","view_paper":"https://pith.science/paper/DBQBKWX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.24668&json=true","fetch_graph":"https://pith.science/api/pith-number/DBQBKWX766CLJ56REMXGYAQ2B6/graph.json","fetch_events":"https://pith.science/api/pith-number/DBQBKWX766CLJ56REMXGYAQ2B6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6/action/storage_attestation","attest_author":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6/action/author_attestation","sign_citation":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6/action/citation_signature","submit_replication":"https://pith.science/pith/DBQBKWX766CLJ56REMXGYAQ2B6/action/replication_record"}},"created_at":"2026-07-27T01:19:51.736233+00:00","updated_at":"2026-07-27T01:19:51.736233+00:00"}