{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y7BBX7MIL6BCSJZ55ODYIRLQJC","short_pith_number":"pith:Y7BBX7MI","schema_version":"1.0","canonical_sha256":"c7c21bfd885f8229273deb87844570488460284240b14bb5d4d1d2bd118cd1ab","source":{"kind":"arxiv","id":"2505.04993","version":1},"attestation_state":"computed","paper":{"title":"Latent Preference Coding: Aligning Large Language Models via Discrete Latent Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dongyan Zhao, Huishuai Zhang, Jian Guan, Wei Wu, Zhuocheng Gong","submitted_at":"2025-05-08T06:59:06Z","abstract_excerpt":"Large language models (LLMs) have achieved remarkable success, yet aligning their generations with human preferences remains a critical challenge. Existing approaches to preference modeling often rely on an explicit or implicit reward function, overlooking the intricate and multifaceted nature of human preferences that may encompass conflicting factors across diverse tasks and populations. To address this limitation, we introduce Latent Preference Coding (LPC), a novel framework that models the implicit factors as well as their combinations behind holistic preferences using discrete latent cod"},"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":"2505.04993","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-08T06:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"0aacd7116a4e27462aff018c38863c1a7512532866b47665c56b1e14ad98a897","abstract_canon_sha256":"7d6eff8f9cfb1636345f61b64f958107f21649e4b59c3b289b107ca10fd64834"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:17.495517Z","signature_b64":"MuWFqKn5BjD4s+6r0n24sK0RlsENuH31x/4lYmMisf5yzfJauBJ198YJEWVlNNMHOXpteocByYHSxCHax3g8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7c21bfd885f8229273deb87844570488460284240b14bb5d4d1d2bd118cd1ab","last_reissued_at":"2026-07-05T11:00:17.494900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:17.494900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent Preference Coding: Aligning Large Language Models via Discrete Latent Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dongyan Zhao, Huishuai Zhang, Jian Guan, Wei Wu, Zhuocheng Gong","submitted_at":"2025-05-08T06:59:06Z","abstract_excerpt":"Large language models (LLMs) have achieved remarkable success, yet aligning their generations with human preferences remains a critical challenge. Existing approaches to preference modeling often rely on an explicit or implicit reward function, overlooking the intricate and multifaceted nature of human preferences that may encompass conflicting factors across diverse tasks and populations. To address this limitation, we introduce Latent Preference Coding (LPC), a novel framework that models the implicit factors as well as their combinations behind holistic preferences using discrete latent cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04993","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/2505.04993/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":"2505.04993","created_at":"2026-07-05T11:00:17.494967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04993v1","created_at":"2026-07-05T11:00:17.494967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04993","created_at":"2026-07-05T11:00:17.494967+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7BBX7MIL6BC","created_at":"2026-07-05T11:00:17.494967+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7BBX7MIL6BCSJZ5","created_at":"2026-07-05T11:00:17.494967+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7BBX7MI","created_at":"2026-07-05T11:00:17.494967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11679","citing_title":"Explaining and Breaking the Safety-Helpfulness Ceiling via Preference Dimensional Expansion","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11679","citing_title":"Explaining and Breaking the Safety-Helpfulness Ceiling via Preference Dimensional Expansion","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21027","citing_title":"HypEHR: Hyperbolic Modeling of Electronic Health Records for Efficient Question Answering","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC","json":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC.json","graph_json":"https://pith.science/api/pith-number/Y7BBX7MIL6BCSJZ55ODYIRLQJC/graph.json","events_json":"https://pith.science/api/pith-number/Y7BBX7MIL6BCSJZ55ODYIRLQJC/events.json","paper":"https://pith.science/paper/Y7BBX7MI"},"agent_actions":{"view_html":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC","download_json":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC.json","view_paper":"https://pith.science/paper/Y7BBX7MI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04993&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7BBX7MIL6BCSJZ55ODYIRLQJC/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7BBX7MIL6BCSJZ55ODYIRLQJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC/action/storage_attestation","attest_author":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC/action/author_attestation","sign_citation":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC/action/citation_signature","submit_replication":"https://pith.science/pith/Y7BBX7MIL6BCSJZ55ODYIRLQJC/action/replication_record"}},"created_at":"2026-07-05T11:00:17.494967+00:00","updated_at":"2026-07-05T11:00:17.494967+00:00"}