{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4TQAJLSE52XYUQGSTQQ4C3ZPMA","short_pith_number":"pith:4TQAJLSE","schema_version":"1.0","canonical_sha256":"e4e004ae44eeaf8a40d29c21c16f2f60170ef777ddfcca1d29212a72275d8cb7","source":{"kind":"arxiv","id":"2310.17922","version":2},"attestation_state":"computed","paper":{"title":"Chain-of-Choice Hierarchical Policy Learning for Conversational Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hao Liu, Wei Fan, Weijia Zhang, Weiqi Wang, Yangqiu Song","submitted_at":"2023-10-27T06:36:31Z","abstract_excerpt":"Conversational Recommender Systems (CRS) illuminate user preferences via multi-round interactive dialogues, ultimately navigating towards precise and satisfactory recommendations. However, contemporary CRS are limited to inquiring binary or multi-choice questions based on a single attribute type (e.g., color) per round, which causes excessive rounds of interaction and diminishes the user's experience. To address this, we propose a more realistic and efficient conversational recommendation problem setting, called Multi-Type-Attribute Multi-round Conversational Recommendation (MTAMCR), which ena"},"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":"2310.17922","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-10-27T06:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"ffe1470202284b5316551e12b0bb9b38f5daa3b44f8fec2d0146e4459f60b6bb","abstract_canon_sha256":"2d72a23a188c0a29e69decd938245e231b9c284a5557464fbe3b397a32bdc73a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:45.189906Z","signature_b64":"EoGqD7BQSfnkF1h/iptHIMcfkDQFEIC5gnypAk4RVbdq4F9PRtxEN+3UwWSgpnxAk2rCB7c3M0Lyxz3sOPThCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e004ae44eeaf8a40d29c21c16f2f60170ef777ddfcca1d29212a72275d8cb7","last_reissued_at":"2026-07-05T08:03:45.189445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:45.189445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chain-of-Choice Hierarchical Policy Learning for Conversational Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hao Liu, Wei Fan, Weijia Zhang, Weiqi Wang, Yangqiu Song","submitted_at":"2023-10-27T06:36:31Z","abstract_excerpt":"Conversational Recommender Systems (CRS) illuminate user preferences via multi-round interactive dialogues, ultimately navigating towards precise and satisfactory recommendations. However, contemporary CRS are limited to inquiring binary or multi-choice questions based on a single attribute type (e.g., color) per round, which causes excessive rounds of interaction and diminishes the user's experience. To address this, we propose a more realistic and efficient conversational recommendation problem setting, called Multi-Type-Attribute Multi-round Conversational Recommendation (MTAMCR), which ena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17922","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/2310.17922/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":"2310.17922","created_at":"2026-07-05T08:03:45.189505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.17922v2","created_at":"2026-07-05T08:03:45.189505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17922","created_at":"2026-07-05T08:03:45.189505+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TQAJLSE52XY","created_at":"2026-07-05T08:03:45.189505+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TQAJLSE52XYUQGS","created_at":"2026-07-05T08:03:45.189505+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TQAJLSE","created_at":"2026-07-05T08:03:45.189505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00021","citing_title":"Ustnlp16 at SemEval-2025 Task 9: Improving Model Performance through Imbalance Handling and Focal Loss","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA","json":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA.json","graph_json":"https://pith.science/api/pith-number/4TQAJLSE52XYUQGSTQQ4C3ZPMA/graph.json","events_json":"https://pith.science/api/pith-number/4TQAJLSE52XYUQGSTQQ4C3ZPMA/events.json","paper":"https://pith.science/paper/4TQAJLSE"},"agent_actions":{"view_html":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA","download_json":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA.json","view_paper":"https://pith.science/paper/4TQAJLSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.17922&json=true","fetch_graph":"https://pith.science/api/pith-number/4TQAJLSE52XYUQGSTQQ4C3ZPMA/graph.json","fetch_events":"https://pith.science/api/pith-number/4TQAJLSE52XYUQGSTQQ4C3ZPMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA/action/storage_attestation","attest_author":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA/action/author_attestation","sign_citation":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA/action/citation_signature","submit_replication":"https://pith.science/pith/4TQAJLSE52XYUQGSTQQ4C3ZPMA/action/replication_record"}},"created_at":"2026-07-05T08:03:45.189505+00:00","updated_at":"2026-07-05T08:03:45.189505+00:00"}