{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4LQD3MHTVFK2VLPGIHFFKSNAWQ","short_pith_number":"pith:4LQD3MHT","schema_version":"1.0","canonical_sha256":"e2e03db0f3a955aaade641ca5549a0b4087315de2e275244f1a3f3c3460e814e","source":{"kind":"arxiv","id":"2106.04408","version":1},"attestation_state":"computed","paper":{"title":"HieRec: Hierarchical User Interest Modeling for Personalized News Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuhan Wu, Fangzhao Wu, Peiru Yang, Tao Qi, Xing Xie, Yang Yu, Yongfeng Huang","submitted_at":"2021-06-08T14:36:28Z","abstract_excerpt":"User interest modeling is critical for personalized news recommendation. Existing news recommendation methods usually learn a single user embedding for each user from their previous behaviors to represent their overall interest. However, user interest is usually diverse and multi-grained, which is difficult to be accurately modeled by a single user embedding. In this paper, we propose a news recommendation method with hierarchical user interest modeling, named HieRec. Instead of a single user embedding, in our method each user is represented in a hierarchical interest tree to better capture th"},"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":"2106.04408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-06-08T14:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"dc0aad9afa7aa3703c32ff37478dd6a690fe57264a949c68b650591f49da1d3f","abstract_canon_sha256":"68e7a5b639e6b893534881853e084730c96679b1b260fb8a5d9dc05dbbd61eff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:15.222737Z","signature_b64":"x8z3kFL7m1Ph6cmmkCWaf4IE6DzTOOJOP0kfKzRWJo7/50BcSzhx/IPjih/fGYsAa+rgmsbZnav0E24N/ecKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e03db0f3a955aaade641ca5549a0b4087315de2e275244f1a3f3c3460e814e","last_reissued_at":"2026-07-05T02:47:15.222308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:15.222308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HieRec: Hierarchical User Interest Modeling for Personalized News Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuhan Wu, Fangzhao Wu, Peiru Yang, Tao Qi, Xing Xie, Yang Yu, Yongfeng Huang","submitted_at":"2021-06-08T14:36:28Z","abstract_excerpt":"User interest modeling is critical for personalized news recommendation. Existing news recommendation methods usually learn a single user embedding for each user from their previous behaviors to represent their overall interest. However, user interest is usually diverse and multi-grained, which is difficult to be accurately modeled by a single user embedding. In this paper, we propose a news recommendation method with hierarchical user interest modeling, named HieRec. Instead of a single user embedding, in our method each user is represented in a hierarchical interest tree to better capture th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04408","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/2106.04408/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":"2106.04408","created_at":"2026-07-05T02:47:15.222377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04408v1","created_at":"2026-07-05T02:47:15.222377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04408","created_at":"2026-07-05T02:47:15.222377+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LQD3MHTVFK2","created_at":"2026-07-05T02:47:15.222377+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LQD3MHTVFK2VLPG","created_at":"2026-07-05T02:47:15.222377+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LQD3MHT","created_at":"2026-07-05T02:47:15.222377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15905","citing_title":"Generative Long-term User Interest Modeling for Click-Through Rate Prediction","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ","json":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ.json","graph_json":"https://pith.science/api/pith-number/4LQD3MHTVFK2VLPGIHFFKSNAWQ/graph.json","events_json":"https://pith.science/api/pith-number/4LQD3MHTVFK2VLPGIHFFKSNAWQ/events.json","paper":"https://pith.science/paper/4LQD3MHT"},"agent_actions":{"view_html":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ","download_json":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ.json","view_paper":"https://pith.science/paper/4LQD3MHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04408&json=true","fetch_graph":"https://pith.science/api/pith-number/4LQD3MHTVFK2VLPGIHFFKSNAWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4LQD3MHTVFK2VLPGIHFFKSNAWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ/action/storage_attestation","attest_author":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ/action/author_attestation","sign_citation":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ/action/citation_signature","submit_replication":"https://pith.science/pith/4LQD3MHTVFK2VLPGIHFFKSNAWQ/action/replication_record"}},"created_at":"2026-07-05T02:47:15.222377+00:00","updated_at":"2026-07-05T02:47:15.222377+00:00"}