{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:264VHWBAPHGHG6SYFSJYDMN5Z3","short_pith_number":"pith:264VHWBA","schema_version":"1.0","canonical_sha256":"d7b953d82079cc737a582c9381b1bdcec01ec2f09bfd37de168fd08ba2f047b3","source":{"kind":"arxiv","id":"2408.12599","version":1},"attestation_state":"computed","paper":{"title":"Controllable Text Generation for Large Language Models: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dan Liu, Feiyu Xiong, Hanyu Wang, Jiawei Yang, Jie Hu, Shichao Song, Shunyu Yao, Simin Niu, Xun Liang, Yezhaohui Wang, Zhiyu Li","submitted_at":"2024-08-22T17:59:04Z","abstract_excerpt":"In Natural Language Processing (NLP), Large Language Models (LLMs) have demonstrated high text generation quality. However, in real-world applications, LLMs must meet increasingly complex requirements. Beyond avoiding misleading or inappropriate content, LLMs are also expected to cater to specific user needs, such as imitating particular writing styles or generating text with poetic richness. These varied demands have driven the development of Controllable Text Generation (CTG) techniques, which ensure that outputs adhere to predefined control conditions--such as safety, sentiment, thematic co"},"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":"2408.12599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-22T17:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"01a96f2b6ed7209f406999e5da961004315415eac70b27a47dbf2df09ca38175","abstract_canon_sha256":"d06a90c85c916f80cd3e9e9f893bcf8f86b93c3701ffa1cf3fbf70ce9e8a886d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:17.228766Z","signature_b64":"ssCcKTtKJJqMFRqSgqMW5saoTkjj0knB+OBdf7iD4PD2bFbomkvfTy41mM+80mV2YdwRmtfmCyBnopng9LMuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b953d82079cc737a582c9381b1bdcec01ec2f09bfd37de168fd08ba2f047b3","last_reissued_at":"2026-07-05T08:58:17.228272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:17.228272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controllable Text Generation for Large Language Models: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dan Liu, Feiyu Xiong, Hanyu Wang, Jiawei Yang, Jie Hu, Shichao Song, Shunyu Yao, Simin Niu, Xun Liang, Yezhaohui Wang, Zhiyu Li","submitted_at":"2024-08-22T17:59:04Z","abstract_excerpt":"In Natural Language Processing (NLP), Large Language Models (LLMs) have demonstrated high text generation quality. However, in real-world applications, LLMs must meet increasingly complex requirements. Beyond avoiding misleading or inappropriate content, LLMs are also expected to cater to specific user needs, such as imitating particular writing styles or generating text with poetic richness. These varied demands have driven the development of Controllable Text Generation (CTG) techniques, which ensure that outputs adhere to predefined control conditions--such as safety, sentiment, thematic co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12599","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.12599/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":"2408.12599","created_at":"2026-07-05T08:58:17.228334+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12599v1","created_at":"2026-07-05T08:58:17.228334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12599","created_at":"2026-07-05T08:58:17.228334+00:00"},{"alias_kind":"pith_short_12","alias_value":"264VHWBAPHGH","created_at":"2026-07-05T08:58:17.228334+00:00"},{"alias_kind":"pith_short_16","alias_value":"264VHWBAPHGHG6SY","created_at":"2026-07-05T08:58:17.228334+00:00"},{"alias_kind":"pith_short_8","alias_value":"264VHWBA","created_at":"2026-07-05T08:58:17.228334+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22803","citing_title":"Towards Fast Domain Adaptation and Fine-Grained User Simulation for Evaluating Conversational Recommender Systems","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22994","citing_title":"Do Sparse Autoencoders Learn Meaningful Concept Hierarchies?","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.21121","citing_title":"Answer Engineering: Local Trajectory Editing for Protocol-Constrained Decision Making in Large Language Models","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01392","citing_title":"Multi-Objective Exploration and Preference Optimization via Mutual Information","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27117","citing_title":"Position: AI Safety Requires Effective Controllability","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07731","citing_title":"Benchmarking EngGPT2-16B-A3B against Comparable Italian and International Open-source LLMs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14087","citing_title":"Measuring and Mitigating Toxicity in Large Language Models: A Comprehensive Replication Study","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14087","citing_title":"Measuring and Mitigating Toxicity in Large Language Models: A Comprehensive Replication Study","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24178","citing_title":"Meta-Aligner: Bidirectional Preference-Policy Optimization for Multi-Objective LLMs Alignment","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21510","citing_title":"OptiVerse: A Comprehensive Benchmark towards Optimization Problem Solving","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20183","citing_title":"Dual-Cluster Memory Agent: Resolving Multi-Paradigm Ambiguity in Optimization Problem Solving","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20006","citing_title":"From Recall to Forgetting: Benchmarking Long-Term Memory for Personalized Agents","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07731","citing_title":"Benchmarking EngGPT2-16B-A3B against Comparable Italian and International Open-source LLMs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05782","citing_title":"When Models Meet Users: An Empirical Study of Perceptions of General LLMs and Multimodal LLMs on Hugging Face","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04708","citing_title":"BiST: A Gold Standard Bangla-English Bilingual Corpus for Sentence Structure and Tense Classification with Inter-Annotator Agreement","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18264","citing_title":"Universally Empowering Zeroth-Order Optimization via Adaptive Layer-wise Sampling","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3","json":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3.json","graph_json":"https://pith.science/api/pith-number/264VHWBAPHGHG6SYFSJYDMN5Z3/graph.json","events_json":"https://pith.science/api/pith-number/264VHWBAPHGHG6SYFSJYDMN5Z3/events.json","paper":"https://pith.science/paper/264VHWBA"},"agent_actions":{"view_html":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3","download_json":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3.json","view_paper":"https://pith.science/paper/264VHWBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12599&json=true","fetch_graph":"https://pith.science/api/pith-number/264VHWBAPHGHG6SYFSJYDMN5Z3/graph.json","fetch_events":"https://pith.science/api/pith-number/264VHWBAPHGHG6SYFSJYDMN5Z3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3/action/storage_attestation","attest_author":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3/action/author_attestation","sign_citation":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3/action/citation_signature","submit_replication":"https://pith.science/pith/264VHWBAPHGHG6SYFSJYDMN5Z3/action/replication_record"}},"created_at":"2026-07-05T08:58:17.228334+00:00","updated_at":"2026-07-05T08:58:17.228334+00:00"}