{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HJ7PRFDD6YVRJJ4KAQ3TJEUYHW","short_pith_number":"pith:HJ7PRFDD","schema_version":"1.0","canonical_sha256":"3a7ef89463f62b14a78a04373492983dac9259c431b7f3f8b33c79051a4f4fbc","source":{"kind":"arxiv","id":"2106.01300","version":2},"attestation_state":"computed","paper":{"title":"PP-Rec: News Recommendation with Personalized User Interest and Time-aware News Popularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuhan Wu, Fangzhao Wu, Tao Qi, Yongfeng Huang","submitted_at":"2021-06-02T17:15:57Z","abstract_excerpt":"Personalized news recommendation methods are widely used in online news services. These methods usually recommend news based on the matching between news content and user interest inferred from historical behaviors. However, these methods usually have difficulties in making accurate recommendations to cold-start users, and tend to recommend similar news with those users have read. In general, popular news usually contain important information and can attract users with different interests. Besides, they are usually diverse in content and topic. Thus, in this paper we propose to incorporate new"},"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.01300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-06-02T17:15:57Z","cross_cats_sorted":[],"title_canon_sha256":"6ee220b6196d181108e149b8831968e4ec936246b07d0d09acf0dbf53b6bfb8e","abstract_canon_sha256":"546fb02683fff9adaf909fbd48dde79a6492632cadcfdf3b5505e2fc959d0446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:00.319829Z","signature_b64":"2a5/VaQcLNPj4tOj9mxZCGYTzzb8MFvk8b5ioEhshrY5POyA/pe9673Y8N4PZiNKyRTrmRr8+h28jxj+294MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a7ef89463f62b14a78a04373492983dac9259c431b7f3f8b33c79051a4f4fbc","last_reissued_at":"2026-07-05T02:48:00.319357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:00.319357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PP-Rec: News Recommendation with Personalized User Interest and Time-aware News Popularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuhan Wu, Fangzhao Wu, Tao Qi, Yongfeng Huang","submitted_at":"2021-06-02T17:15:57Z","abstract_excerpt":"Personalized news recommendation methods are widely used in online news services. These methods usually recommend news based on the matching between news content and user interest inferred from historical behaviors. However, these methods usually have difficulties in making accurate recommendations to cold-start users, and tend to recommend similar news with those users have read. In general, popular news usually contain important information and can attract users with different interests. Besides, they are usually diverse in content and topic. Thus, in this paper we propose to incorporate new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01300","kind":"arxiv","version":2},"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.01300/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.01300","created_at":"2026-07-05T02:48:00.319419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01300v2","created_at":"2026-07-05T02:48:00.319419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01300","created_at":"2026-07-05T02:48:00.319419+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJ7PRFDD6YVR","created_at":"2026-07-05T02:48:00.319419+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJ7PRFDD6YVRJJ4K","created_at":"2026-07-05T02:48:00.319419+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJ7PRFDD","created_at":"2026-07-05T02:48:00.319419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21572","citing_title":"NewsReX: A More Efficient Approach to News Recommendation with Keras 3 and JAX","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW","json":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW.json","graph_json":"https://pith.science/api/pith-number/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/graph.json","events_json":"https://pith.science/api/pith-number/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/events.json","paper":"https://pith.science/paper/HJ7PRFDD"},"agent_actions":{"view_html":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW","download_json":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW.json","view_paper":"https://pith.science/paper/HJ7PRFDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01300&json=true","fetch_graph":"https://pith.science/api/pith-number/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/graph.json","fetch_events":"https://pith.science/api/pith-number/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/action/storage_attestation","attest_author":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/action/author_attestation","sign_citation":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/action/citation_signature","submit_replication":"https://pith.science/pith/HJ7PRFDD6YVRJJ4KAQ3TJEUYHW/action/replication_record"}},"created_at":"2026-07-05T02:48:00.319419+00:00","updated_at":"2026-07-05T02:48:00.319419+00:00"}