{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GXTLUZOPBTH6IBJW7YFAFMOK4R","short_pith_number":"pith:GXTLUZOP","schema_version":"1.0","canonical_sha256":"35e6ba65cf0ccfe40536fe0a02b1cae451f30331f3e0f6ce776311d7d81da3d5","source":{"kind":"arxiv","id":"1112.2388","version":1},"attestation_state":"computed","paper":{"title":"Information Filtering via Implicit Trust-based Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"physics.data-an","authors_text":"Jian-Guo Liu, Zhan Li, Zhao-Guo Xuan","submitted_at":"2011-12-11T19:37:24Z","abstract_excerpt":"Based on the user-item bipartite network, collaborative filtering (CF) recommender systems predict users' interests according to their history collections, which is a promising way to solve the information exploration problem. However, CF algorithm encounters cold start and sparsity problems. The trust-based CF algorithm is implemented by collecting the users' trust statements, which is time-consuming and must use users' private friendship information. In this paper, we present a novel measurement to calculate users' implicit trust-based correlation by taking into account their average ratings"},"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":"1112.2388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-12-11T19:37:24Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"5c6f820057cb92f939f1914013f71991178e6792fa62b0ef519c8815069e092d","abstract_canon_sha256":"09f7cc258cd2757d1d1b2e8f42130b5bba526fdf6f8c823b7e595007b265607d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:34.565232Z","signature_b64":"5tylhZpy2v/tmlyt26/H+og3QvlKjl4fEC64nMuvgb12KqgnreBJAWvt8xMugycokuuyOiUt/N1jrSwCHKrICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35e6ba65cf0ccfe40536fe0a02b1cae451f30331f3e0f6ce776311d7d81da3d5","last_reissued_at":"2026-05-18T04:06:34.564487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:34.564487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Filtering via Implicit Trust-based Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"physics.data-an","authors_text":"Jian-Guo Liu, Zhan Li, Zhao-Guo Xuan","submitted_at":"2011-12-11T19:37:24Z","abstract_excerpt":"Based on the user-item bipartite network, collaborative filtering (CF) recommender systems predict users' interests according to their history collections, which is a promising way to solve the information exploration problem. However, CF algorithm encounters cold start and sparsity problems. The trust-based CF algorithm is implemented by collecting the users' trust statements, which is time-consuming and must use users' private friendship information. In this paper, we present a novel measurement to calculate users' implicit trust-based correlation by taking into account their average ratings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2388","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.2388","created_at":"2026-05-18T04:06:34.564608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2388v1","created_at":"2026-05-18T04:06:34.564608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2388","created_at":"2026-05-18T04:06:34.564608+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXTLUZOPBTH6","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXTLUZOPBTH6IBJW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXTLUZOP","created_at":"2026-05-18T12:26:30.835961+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/GXTLUZOPBTH6IBJW7YFAFMOK4R","json":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R.json","graph_json":"https://pith.science/api/pith-number/GXTLUZOPBTH6IBJW7YFAFMOK4R/graph.json","events_json":"https://pith.science/api/pith-number/GXTLUZOPBTH6IBJW7YFAFMOK4R/events.json","paper":"https://pith.science/paper/GXTLUZOP"},"agent_actions":{"view_html":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R","download_json":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R.json","view_paper":"https://pith.science/paper/GXTLUZOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2388&json=true","fetch_graph":"https://pith.science/api/pith-number/GXTLUZOPBTH6IBJW7YFAFMOK4R/graph.json","fetch_events":"https://pith.science/api/pith-number/GXTLUZOPBTH6IBJW7YFAFMOK4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R/action/storage_attestation","attest_author":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R/action/author_attestation","sign_citation":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R/action/citation_signature","submit_replication":"https://pith.science/pith/GXTLUZOPBTH6IBJW7YFAFMOK4R/action/replication_record"}},"created_at":"2026-05-18T04:06:34.564608+00:00","updated_at":"2026-05-18T04:06:34.564608+00:00"}