{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4VRBN7FMKTUIL55IS25E4KIYCZ","short_pith_number":"pith:4VRBN7FM","schema_version":"1.0","canonical_sha256":"e56216fcac54e885f7a896ba4e2918164cf28c4acf9aa3dcecd0f8a2164d6f23","source":{"kind":"arxiv","id":"1802.07997","version":1},"attestation_state":"computed","paper":{"title":"Generating High-Quality Query Suggestion Candidates for Task-Based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.IR","authors_text":"Dar\\'io Garigliotti, Heng Ding, Krisztian Balog, Shuo Zhang","submitted_at":"2018-02-22T11:55:28Z","abstract_excerpt":"We address the task of generating query suggestions for task-based search. The current state of the art relies heavily on suggestions provided by a major search engine. In this paper, we solve the task without reliance on search engines. Specifically, we focus on the first step of a two-stage pipeline approach, which is dedicated to the generation of query suggestion candidates. We present three methods for generating candidate suggestions and apply them on multiple information sources. Using a purpose-built test collection, we find that these methods are able to generate high-quality suggesti"},"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":"1802.07997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-22T11:55:28Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"9cb2e65d962919006406a8ee577cdcd1d3df95d9432dac18cfc45b412f794777","abstract_canon_sha256":"136eb9fc289b5d2fd0d73cf1fdb3a55d7475bd315473de4cf80a2df92be7e502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.851854Z","signature_b64":"jhJaqM/xfqPRmxf/Ct6ybZR8DnX3LYnqJlNUJqNR+UKszFx0AAwa3zeD7L++B71HnP5XXa/fT/PQAWI92U/1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56216fcac54e885f7a896ba4e2918164cf28c4acf9aa3dcecd0f8a2164d6f23","last_reissued_at":"2026-05-18T00:20:23.851294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.851294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating High-Quality Query Suggestion Candidates for Task-Based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.IR","authors_text":"Dar\\'io Garigliotti, Heng Ding, Krisztian Balog, Shuo Zhang","submitted_at":"2018-02-22T11:55:28Z","abstract_excerpt":"We address the task of generating query suggestions for task-based search. The current state of the art relies heavily on suggestions provided by a major search engine. In this paper, we solve the task without reliance on search engines. Specifically, we focus on the first step of a two-stage pipeline approach, which is dedicated to the generation of query suggestion candidates. We present three methods for generating candidate suggestions and apply them on multiple information sources. Using a purpose-built test collection, we find that these methods are able to generate high-quality suggesti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07997","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1802.07997","created_at":"2026-05-18T00:20:23.851389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07997v1","created_at":"2026-05-18T00:20:23.851389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07997","created_at":"2026-05-18T00:20:23.851389+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VRBN7FMKTUI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VRBN7FMKTUIL55I","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VRBN7FM","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ","json":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ.json","graph_json":"https://pith.science/api/pith-number/4VRBN7FMKTUIL55IS25E4KIYCZ/graph.json","events_json":"https://pith.science/api/pith-number/4VRBN7FMKTUIL55IS25E4KIYCZ/events.json","paper":"https://pith.science/paper/4VRBN7FM"},"agent_actions":{"view_html":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ","download_json":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ.json","view_paper":"https://pith.science/paper/4VRBN7FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07997&json=true","fetch_graph":"https://pith.science/api/pith-number/4VRBN7FMKTUIL55IS25E4KIYCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4VRBN7FMKTUIL55IS25E4KIYCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ/action/storage_attestation","attest_author":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ/action/author_attestation","sign_citation":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ/action/citation_signature","submit_replication":"https://pith.science/pith/4VRBN7FMKTUIL55IS25E4KIYCZ/action/replication_record"}},"created_at":"2026-05-18T00:20:23.851389+00:00","updated_at":"2026-05-18T00:20:23.851389+00:00"}