{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3MH6UTCNM5UXU4SUKFY3P5FLT2","short_pith_number":"pith:3MH6UTCN","schema_version":"1.0","canonical_sha256":"db0fea4c4d67697a72545171b7f4ab9eafafcdf663a83da3f8677decc92d0496","source":{"kind":"arxiv","id":"2603.04946","version":2},"attestation_state":"computed","paper":{"title":"LocalSUG: City-Preference-Enhanced LLM for Query Suggestion in Local-Life Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Haibo Zhou, Hainan Zhang, Jinwen Chen, Lingxiang Wang, Shiwen Zhang, Shuai Gong, Wei Lin, Yachao Zhao, Zheng Zhang","submitted_at":"2026-03-05T08:42:27Z","abstract_excerpt":"In local-life service platforms, query suggestion reduces user effort by generating candidate queries from input prefixes. Traditional multi-stage systems rely heavily on historical popular queries, limiting their ability to capture long-tail and emerging demand. Although LLMs provide strong semantic generalization, their deployment in local-life services faces three challenges: insufficient city-preference awareness, exposure bias in preference optimization, and strict online latency constraints. We propose LocalSUG, an LLM-based query suggestion framework for local-life services. LocalSUG mi"},"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":"2603.04946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-03-05T08:42:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebc454ffb6b1115677d1964a825221aa007c1e19974ca9681ae1c2a901901bf9","abstract_canon_sha256":"95c824e336695d7720159d71afd5cc1061c7edc98d2b0cb14d0192d1175c811b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:36.243916Z","signature_b64":"LLa9MsYpMAj4RdXRnQyJhOh6SaU7ZoWYNR0fzYcjA4MmZ5mWEUd3vQUQxJvoCPSJamMgodogo2f8a3GMrUvRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db0fea4c4d67697a72545171b7f4ab9eafafcdf663a83da3f8677decc92d0496","last_reissued_at":"2026-06-01T01:02:36.242818Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:36.242818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LocalSUG: City-Preference-Enhanced LLM for Query Suggestion in Local-Life Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Haibo Zhou, Hainan Zhang, Jinwen Chen, Lingxiang Wang, Shiwen Zhang, Shuai Gong, Wei Lin, Yachao Zhao, Zheng Zhang","submitted_at":"2026-03-05T08:42:27Z","abstract_excerpt":"In local-life service platforms, query suggestion reduces user effort by generating candidate queries from input prefixes. Traditional multi-stage systems rely heavily on historical popular queries, limiting their ability to capture long-tail and emerging demand. Although LLMs provide strong semantic generalization, their deployment in local-life services faces three challenges: insufficient city-preference awareness, exposure bias in preference optimization, and strict online latency constraints. We propose LocalSUG, an LLM-based query suggestion framework for local-life services. LocalSUG mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.04946","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/2603.04946/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":"2603.04946","created_at":"2026-06-01T01:02:36.242977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.04946v2","created_at":"2026-06-01T01:02:36.242977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.04946","created_at":"2026-06-01T01:02:36.242977+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MH6UTCNM5UX","created_at":"2026-06-01T01:02:36.242977+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MH6UTCNM5UXU4SU","created_at":"2026-06-01T01:02:36.242977+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MH6UTCN","created_at":"2026-06-01T01:02:36.242977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23668","citing_title":"OnePred: Next-Query Prediction via Recursive Intent Memory in Multi-Turn Conversations","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2","json":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2.json","graph_json":"https://pith.science/api/pith-number/3MH6UTCNM5UXU4SUKFY3P5FLT2/graph.json","events_json":"https://pith.science/api/pith-number/3MH6UTCNM5UXU4SUKFY3P5FLT2/events.json","paper":"https://pith.science/paper/3MH6UTCN"},"agent_actions":{"view_html":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2","download_json":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2.json","view_paper":"https://pith.science/paper/3MH6UTCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.04946&json=true","fetch_graph":"https://pith.science/api/pith-number/3MH6UTCNM5UXU4SUKFY3P5FLT2/graph.json","fetch_events":"https://pith.science/api/pith-number/3MH6UTCNM5UXU4SUKFY3P5FLT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2/action/storage_attestation","attest_author":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2/action/author_attestation","sign_citation":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2/action/citation_signature","submit_replication":"https://pith.science/pith/3MH6UTCNM5UXU4SUKFY3P5FLT2/action/replication_record"}},"created_at":"2026-06-01T01:02:36.242977+00:00","updated_at":"2026-06-01T01:02:36.242977+00:00"}