{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZDHTNVL7XUQP4DVUEH5UTHFEMH","short_pith_number":"pith:ZDHTNVL7","schema_version":"1.0","canonical_sha256":"c8cf36d57fbd20fe0eb421fb499ca461c683959eed9725c05a43470ea6371b00","source":{"kind":"arxiv","id":"2401.05975","version":5},"attestation_state":"computed","paper":{"title":"End-to-end Learnable Clustering for Intent Learning in Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jian Ma, Jun Xia, Kejun Zhang, Shengju Yu, Shihao Zhu, Wenliang Zhong, Xinwang Liu, Yingwei Ma, Yue Liu","submitted_at":"2024-01-11T15:22:55Z","abstract_excerpt":"Intent learning, which aims to learn users' intents for user understanding and item recommendation, has become a hot research spot in recent years. However, existing methods suffer from complex and cumbersome alternating optimization, limiting performance and scalability. To this end, we propose a novel intent learning method termed \\underline{ELCRec}, by unifying behavior representation learning into an \\underline{E}nd-to-end \\underline{L}earnable \\underline{C}lustering framework, for effective and efficient \\underline{Rec}ommendation. Concretely, we encode user behavior sequences and initial"},"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":"2401.05975","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-01-11T15:22:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2f8b456b4ccfc671eed958eade3d97635cab56f159f73244533ea99cf082c9c4","abstract_canon_sha256":"ea22e6300cb9d3153274a4f660c595318283111fd8333cbc6732e5ba1cb57f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:07.911094Z","signature_b64":"sX4xfexI8j6BR0VYtszg4l2uurxc/Te0dbKV4avCUKl2Z6teg3tKOU39yc4Q9WRaLK05JKajzZbuRIh0P70EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8cf36d57fbd20fe0eb421fb499ca461c683959eed9725c05a43470ea6371b00","last_reissued_at":"2026-07-05T09:33:07.910003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:07.910003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Learnable Clustering for Intent Learning in Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jian Ma, Jun Xia, Kejun Zhang, Shengju Yu, Shihao Zhu, Wenliang Zhong, Xinwang Liu, Yingwei Ma, Yue Liu","submitted_at":"2024-01-11T15:22:55Z","abstract_excerpt":"Intent learning, which aims to learn users' intents for user understanding and item recommendation, has become a hot research spot in recent years. However, existing methods suffer from complex and cumbersome alternating optimization, limiting performance and scalability. To this end, we propose a novel intent learning method termed \\underline{ELCRec}, by unifying behavior representation learning into an \\underline{E}nd-to-end \\underline{L}earnable \\underline{C}lustering framework, for effective and efficient \\underline{Rec}ommendation. Concretely, we encode user behavior sequences and initial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05975","kind":"arxiv","version":5},"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/2401.05975/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":"2401.05975","created_at":"2026-07-05T09:33:07.910075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.05975v5","created_at":"2026-07-05T09:33:07.910075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05975","created_at":"2026-07-05T09:33:07.910075+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDHTNVL7XUQP","created_at":"2026-07-05T09:33:07.910075+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDHTNVL7XUQP4DVU","created_at":"2026-07-05T09:33:07.910075+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDHTNVL7","created_at":"2026-07-05T09:33:07.910075+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/ZDHTNVL7XUQP4DVUEH5UTHFEMH","json":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH.json","graph_json":"https://pith.science/api/pith-number/ZDHTNVL7XUQP4DVUEH5UTHFEMH/graph.json","events_json":"https://pith.science/api/pith-number/ZDHTNVL7XUQP4DVUEH5UTHFEMH/events.json","paper":"https://pith.science/paper/ZDHTNVL7"},"agent_actions":{"view_html":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH","download_json":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH.json","view_paper":"https://pith.science/paper/ZDHTNVL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.05975&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDHTNVL7XUQP4DVUEH5UTHFEMH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDHTNVL7XUQP4DVUEH5UTHFEMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH/action/storage_attestation","attest_author":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH/action/author_attestation","sign_citation":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH/action/citation_signature","submit_replication":"https://pith.science/pith/ZDHTNVL7XUQP4DVUEH5UTHFEMH/action/replication_record"}},"created_at":"2026-07-05T09:33:07.910075+00:00","updated_at":"2026-07-05T09:33:07.910075+00:00"}