{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HO25TY6MS3QYF3SLOADDX26XKE","short_pith_number":"pith:HO25TY6M","schema_version":"1.0","canonical_sha256":"3bb5d9e3cc96e182ee4b70063bebd7511b9aff8191712074aa4fb3acbea6f54e","source":{"kind":"arxiv","id":"2510.10127","version":3},"attestation_state":"computed","paper":{"title":"Breaking the Likelihood Trap: Consistent Generative Recommendation with Graph-structured Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Qiya Yang, Xiaoxi Liang, Yalong Wang, Ying Cao, Yingjie Deng, Yongqi Liu, Yuxin Ren, Zeping Xiao","submitted_at":"2025-10-11T09:21:01Z","abstract_excerpt":"Reranking, as the final stage of recommender systems, plays a crucial role in determining the final exposure, directly influencing user experience. Recently, generative reranking has gained increasing attention for formulating reranking as a holistic sequence generation task, implicitly modeling complex dependencies among items. However, most existing methods suffer from the likelihood trap, where high-likelihood sequences are often repetitive and perceived as low-quality by humans, thereby limiting user engagement. In this work, we propose Consistent Graph-structured Generative Recommendation"},"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":"2510.10127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-10-11T09:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"f66c1552d352ce23106d87faff14da0ca52a1094c0b23907cb0648af70babce3","abstract_canon_sha256":"7a89e969f9ef5dcaa9db27d41098a3d1a33401ae46357f43b7607bf50385743f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:33.459443Z","signature_b64":"ejGR80r7WnpVkIO2dkj3I/2TvFAoXP1yFfUjTYjLLE3v4GuiPSPR+YjDSR7r94YEAau+kYNzfHuYMxEZC1nkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bb5d9e3cc96e182ee4b70063bebd7511b9aff8191712074aa4fb3acbea6f54e","last_reissued_at":"2026-06-04T01:08:33.457600Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:33.457600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Likelihood Trap: Consistent Generative Recommendation with Graph-structured Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Qiya Yang, Xiaoxi Liang, Yalong Wang, Ying Cao, Yingjie Deng, Yongqi Liu, Yuxin Ren, Zeping Xiao","submitted_at":"2025-10-11T09:21:01Z","abstract_excerpt":"Reranking, as the final stage of recommender systems, plays a crucial role in determining the final exposure, directly influencing user experience. Recently, generative reranking has gained increasing attention for formulating reranking as a holistic sequence generation task, implicitly modeling complex dependencies among items. However, most existing methods suffer from the likelihood trap, where high-likelihood sequences are often repetitive and perceived as low-quality by humans, thereby limiting user engagement. In this work, we propose Consistent Graph-structured Generative Recommendation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.10127","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/2510.10127/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":"2510.10127","created_at":"2026-06-04T01:08:33.457721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.10127v3","created_at":"2026-06-04T01:08:33.457721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.10127","created_at":"2026-06-04T01:08:33.457721+00:00"},{"alias_kind":"pith_short_12","alias_value":"HO25TY6MS3QY","created_at":"2026-06-04T01:08:33.457721+00:00"},{"alias_kind":"pith_short_16","alias_value":"HO25TY6MS3QYF3SL","created_at":"2026-06-04T01:08:33.457721+00:00"},{"alias_kind":"pith_short_8","alias_value":"HO25TY6M","created_at":"2026-06-04T01:08:33.457721+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE","json":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE.json","graph_json":"https://pith.science/api/pith-number/HO25TY6MS3QYF3SLOADDX26XKE/graph.json","events_json":"https://pith.science/api/pith-number/HO25TY6MS3QYF3SLOADDX26XKE/events.json","paper":"https://pith.science/paper/HO25TY6M"},"agent_actions":{"view_html":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE","download_json":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE.json","view_paper":"https://pith.science/paper/HO25TY6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.10127&json=true","fetch_graph":"https://pith.science/api/pith-number/HO25TY6MS3QYF3SLOADDX26XKE/graph.json","fetch_events":"https://pith.science/api/pith-number/HO25TY6MS3QYF3SLOADDX26XKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE/action/storage_attestation","attest_author":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE/action/author_attestation","sign_citation":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE/action/citation_signature","submit_replication":"https://pith.science/pith/HO25TY6MS3QYF3SLOADDX26XKE/action/replication_record"}},"created_at":"2026-06-04T01:08:33.457721+00:00","updated_at":"2026-06-04T01:08:33.457721+00:00"}