{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LLK5JVCZO4FSS3V6XFE4KNBCJM","short_pith_number":"pith:LLK5JVCZ","schema_version":"1.0","canonical_sha256":"5ad5d4d459770b296ebeb949c534224b10271538ae98d70cab342efb8e0d885b","source":{"kind":"arxiv","id":"2406.14900","version":3},"attestation_state":"computed","paper":{"title":"Decoding Matters: Addressing Amplification Bias and Homogeneity Issue for LLM-based Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chong Chen, Fuli Feng, Jizhi Zhang, Keqin Bao, Xinyue Huo, Yang Zhang","submitted_at":"2024-06-21T06:47:28Z","abstract_excerpt":"Adapting Large Language Models (LLMs) for recommendation requires careful consideration of the decoding process, given the inherent differences between generating items and natural language. Existing approaches often directly apply LLMs' original decoding methods. However, we find these methods encounter significant challenges: 1) amplification bias -- where standard length normalization inflates scores for items containing tokens with generation probabilities close to 1 (termed ghost tokens), and 2) homogeneity issue -- generating multiple similar or repetitive items for a user. To tackle the"},"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":"2406.14900","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-06-21T06:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"da797bbf262b756a03d20a7f79607b8e9edb66c973ada1212f246d9cfcd8e326","abstract_canon_sha256":"920f03aecbd744a03b495e93d17e211af2401b8e0f1d95039e81a9632dd9a2be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:04.673766Z","signature_b64":"8Tno7tezl/4DZAr1UTSr8J6d1Pwol6taUHHpp0SoNJ1w8ir0nwrOSTJNZD4N/kCJWBYaGaLZGfQfaSaFmtjrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad5d4d459770b296ebeb949c534224b10271538ae98d70cab342efb8e0d885b","last_reissued_at":"2026-07-05T09:31:04.673198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:04.673198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Matters: Addressing Amplification Bias and Homogeneity Issue for LLM-based Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chong Chen, Fuli Feng, Jizhi Zhang, Keqin Bao, Xinyue Huo, Yang Zhang","submitted_at":"2024-06-21T06:47:28Z","abstract_excerpt":"Adapting Large Language Models (LLMs) for recommendation requires careful consideration of the decoding process, given the inherent differences between generating items and natural language. Existing approaches often directly apply LLMs' original decoding methods. However, we find these methods encounter significant challenges: 1) amplification bias -- where standard length normalization inflates scores for items containing tokens with generation probabilities close to 1 (termed ghost tokens), and 2) homogeneity issue -- generating multiple similar or repetitive items for a user. To tackle the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14900","kind":"arxiv","version":3},"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/2406.14900/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":"2406.14900","created_at":"2026-07-05T09:31:04.673264+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14900v3","created_at":"2026-07-05T09:31:04.673264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14900","created_at":"2026-07-05T09:31:04.673264+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLK5JVCZO4FS","created_at":"2026-07-05T09:31:04.673264+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLK5JVCZO4FSS3V6","created_at":"2026-07-05T09:31:04.673264+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLK5JVCZ","created_at":"2026-07-05T09:31:04.673264+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21967","citing_title":"Reinforced Preference Optimization for Reasoning-Augmented Recommendations","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16345","citing_title":"Goal-Conditioned Supervised Learning for LLM Fine-Tuning","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22504","citing_title":"Objective Shaping with Hard Negatives: Windowed Partial AUC Optimization for RL-based LLM Recommenders","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20490","citing_title":"Break the Optimization Barrier of LLM-Enhanced Recommenders: A Theoretical Analysis and Practical Framework","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07129","citing_title":"RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM","json":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM.json","graph_json":"https://pith.science/api/pith-number/LLK5JVCZO4FSS3V6XFE4KNBCJM/graph.json","events_json":"https://pith.science/api/pith-number/LLK5JVCZO4FSS3V6XFE4KNBCJM/events.json","paper":"https://pith.science/paper/LLK5JVCZ"},"agent_actions":{"view_html":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM","download_json":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM.json","view_paper":"https://pith.science/paper/LLK5JVCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14900&json=true","fetch_graph":"https://pith.science/api/pith-number/LLK5JVCZO4FSS3V6XFE4KNBCJM/graph.json","fetch_events":"https://pith.science/api/pith-number/LLK5JVCZO4FSS3V6XFE4KNBCJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM/action/storage_attestation","attest_author":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM/action/author_attestation","sign_citation":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM/action/citation_signature","submit_replication":"https://pith.science/pith/LLK5JVCZO4FSS3V6XFE4KNBCJM/action/replication_record"}},"created_at":"2026-07-05T09:31:04.673264+00:00","updated_at":"2026-07-05T09:31:04.673264+00:00"}