{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FCKYWM3TGADSN7TELDO3MFO63J","short_pith_number":"pith:FCKYWM3T","canonical_record":{"source":{"id":"1905.01990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-01T06:47:36Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SI"],"title_canon_sha256":"7712ac819aa18100be5a450cfa51c10a28e4e8410f8148ca47f52fbe67eef9a7","abstract_canon_sha256":"7c25e32e186b5b0afefe1911e6eb989fd43dff48563b40e6af76a0cc631597e1"},"schema_version":"1.0"},"canonical_sha256":"28958b3373300726fe6458ddb615deda7001e47bbbe5783860387eb6b057fc8a","source":{"kind":"arxiv","id":"1905.01990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01990","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01990v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01990","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"FCKYWM3TGADS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCKYWM3TGADSN7TE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCKYWM3T","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FCKYWM3TGADSN7TELDO3MFO63J","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-01T06:47:36Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SI"],"title_canon_sha256":"7712ac819aa18100be5a450cfa51c10a28e4e8410f8148ca47f52fbe67eef9a7","abstract_canon_sha256":"7c25e32e186b5b0afefe1911e6eb989fd43dff48563b40e6af76a0cc631597e1"},"schema_version":"1.0"},"canonical_sha256":"28958b3373300726fe6458ddb615deda7001e47bbbe5783860387eb6b057fc8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:56.765708Z","signature_b64":"Z0WsvLLu80kvYytbNtQGLzEC++PQE+CK1vTknWdlP2rtbYpIz1dfPCxvnSFyBLyMYO7BB0bS7IT6sXMUuwRrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28958b3373300726fe6458ddb615deda7001e47bbbe5783860387eb6b057fc8a","last_reissued_at":"2026-05-17T23:46:56.765010Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:56.765010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01990","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qY2YbGTF3kFR8p7wNm6pcZ67lVO/3tpWrPKdPEKLnP7pPuFbxgI3ZbmW+bFVKc3WmbCanIUYR5xtvkglX58bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:01:53.131721Z"},"content_sha256":"5257582e2111518721cd16559616873604f106124cb8fe2ed95191ad03f8b936","schema_version":"1.0","event_id":"sha256:5257582e2111518721cd16559616873604f106124cb8fe2ed95191ad03f8b936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FCKYWM3TGADSN7TELDO3MFO63J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SI"],"primary_cat":"cs.IR","authors_text":"Cong Tran, Jang-Young Kim, Sang-Wook Kim, Won-Yong Shin","submitted_at":"2019-05-01T06:47:36Z","abstract_excerpt":"Giving or recommending appropriate content based on the quality of experience is the most important and challenging issue in recommender systems. As collaborative filtering (CF) is one of the most prominent and popular techniques used for recommender systems, we propose a new clustering-based CF (CBCF) method using an incentivized/penalized user (IPU) model only with ratings given by users, which is thus easy to implement. We aim to design such a simple clustering-based approach with no further prior information while improving the recommendation accuracy. To be precise, the purpose of CBCF wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01990","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQFaMKSF4+HLeOvOyUTOar91N5FbUYB2WQaBSr8uNx8CMKHomQ4VudNElRORGC+wVzY3nijru7yluVf8bCPbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:01:53.132512Z"},"content_sha256":"e51613637c8950c3dba291d6a0b011e71001d9ff9f245f52dc51cd3167a9a2ce","schema_version":"1.0","event_id":"sha256:e51613637c8950c3dba291d6a0b011e71001d9ff9f245f52dc51cd3167a9a2ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCKYWM3TGADSN7TELDO3MFO63J/bundle.json","state_url":"https://pith.science/pith/FCKYWM3TGADSN7TELDO3MFO63J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCKYWM3TGADSN7TELDO3MFO63J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T21:01:53Z","links":{"resolver":"https://pith.science/pith/FCKYWM3TGADSN7TELDO3MFO63J","bundle":"https://pith.science/pith/FCKYWM3TGADSN7TELDO3MFO63J/bundle.json","state":"https://pith.science/pith/FCKYWM3TGADSN7TELDO3MFO63J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCKYWM3TGADSN7TELDO3MFO63J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FCKYWM3TGADSN7TELDO3MFO63J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c25e32e186b5b0afefe1911e6eb989fd43dff48563b40e6af76a0cc631597e1","cross_cats_sorted":["cs.LG","cs.MA","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-01T06:47:36Z","title_canon_sha256":"7712ac819aa18100be5a450cfa51c10a28e4e8410f8148ca47f52fbe67eef9a7"},"schema_version":"1.0","source":{"id":"1905.01990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01990","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01990v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01990","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"FCKYWM3TGADS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCKYWM3TGADSN7TE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCKYWM3T","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e51613637c8950c3dba291d6a0b011e71001d9ff9f245f52dc51cd3167a9a2ce","target":"graph","created_at":"2026-05-17T23:46:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Giving or recommending appropriate content based on the quality of experience is the most important and challenging issue in recommender systems. As collaborative filtering (CF) is one of the most prominent and popular techniques used for recommender systems, we propose a new clustering-based CF (CBCF) method using an incentivized/penalized user (IPU) model only with ratings given by users, which is thus easy to implement. We aim to design such a simple clustering-based approach with no further prior information while improving the recommendation accuracy. To be precise, the purpose of CBCF wi","authors_text":"Cong Tran, Jang-Young Kim, Sang-Wook Kim, Won-Yong Shin","cross_cats":["cs.LG","cs.MA","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-01T06:47:36Z","title":"Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01990","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5257582e2111518721cd16559616873604f106124cb8fe2ed95191ad03f8b936","target":"record","created_at":"2026-05-17T23:46:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7c25e32e186b5b0afefe1911e6eb989fd43dff48563b40e6af76a0cc631597e1","cross_cats_sorted":["cs.LG","cs.MA","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-01T06:47:36Z","title_canon_sha256":"7712ac819aa18100be5a450cfa51c10a28e4e8410f8148ca47f52fbe67eef9a7"},"schema_version":"1.0","source":{"id":"1905.01990","kind":"arxiv","version":1}},"canonical_sha256":"28958b3373300726fe6458ddb615deda7001e47bbbe5783860387eb6b057fc8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28958b3373300726fe6458ddb615deda7001e47bbbe5783860387eb6b057fc8a","first_computed_at":"2026-05-17T23:46:56.765010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:56.765010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0WsvLLu80kvYytbNtQGLzEC++PQE+CK1vTknWdlP2rtbYpIz1dfPCxvnSFyBLyMYO7BB0bS7IT6sXMUuwRrBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:56.765708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5257582e2111518721cd16559616873604f106124cb8fe2ed95191ad03f8b936","sha256:e51613637c8950c3dba291d6a0b011e71001d9ff9f245f52dc51cd3167a9a2ce"],"state_sha256":"49b2b8b9adc32bb1d7d21afef2addb78e01a9ebce08afff880421cff3b2aeb6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S53mr6X8p1n4DqPhjUZbpQpSaMfuEmgnC/xjSt3BDR6GR35WUQ3fXRbJa4Cjkj25d5D3xMeDlcp14onaDJnhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:01:53.136920Z","bundle_sha256":"edc77833c9389942b2ebe4c70054331d08f9282fae882448c97ca7e2b1d86dab"}}