{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ONHS2L24JRLAPOLYDTJSESU2YH","short_pith_number":"pith:ONHS2L24","schema_version":"1.0","canonical_sha256":"734f2d2f5c4c5607b9781cd3224a9ac1f521ca52e6e7cd4cb3412d794b86dc6d","source":{"kind":"arxiv","id":"1601.05575","version":2},"attestation_state":"computed","paper":{"title":"SibRank: Signed Bipartite Network Analysis for Neighbor-based Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bita Shams, Saman Haratizadeh","submitted_at":"2016-01-21T10:01:35Z","abstract_excerpt":"Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks."},"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":"1601.05575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-21T10:01:35Z","cross_cats_sorted":[],"title_canon_sha256":"1290c7fc75a17f7f7b71d5b6848d8c4fd30df151ed059216f3365cb57e8a2eed","abstract_canon_sha256":"d651a390965d9ae42379d02f1f4ddd88c05f0493de450c58e1835ae376950e95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:30.137110Z","signature_b64":"3CkT/ln8j2gpAiuQQS99hoMm734o3w1Y9kBjoj12zhVNldw70+Qidros+PFXShnwWRRVU+3Yk4xTHVpBvijfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"734f2d2f5c4c5607b9781cd3224a9ac1f521ca52e6e7cd4cb3412d794b86dc6d","last_reissued_at":"2026-05-18T01:12:30.136773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:30.136773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SibRank: Signed Bipartite Network Analysis for Neighbor-based Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bita Shams, Saman Haratizadeh","submitted_at":"2016-01-21T10:01:35Z","abstract_excerpt":"Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05575","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":""},"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":"1601.05575","created_at":"2026-05-18T01:12:30.136834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05575v2","created_at":"2026-05-18T01:12:30.136834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05575","created_at":"2026-05-18T01:12:30.136834+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONHS2L24JRLA","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONHS2L24JRLAPOLY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONHS2L24","created_at":"2026-05-18T12:30:36.002864+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/ONHS2L24JRLAPOLYDTJSESU2YH","json":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH.json","graph_json":"https://pith.science/api/pith-number/ONHS2L24JRLAPOLYDTJSESU2YH/graph.json","events_json":"https://pith.science/api/pith-number/ONHS2L24JRLAPOLYDTJSESU2YH/events.json","paper":"https://pith.science/paper/ONHS2L24"},"agent_actions":{"view_html":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH","download_json":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH.json","view_paper":"https://pith.science/paper/ONHS2L24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05575&json=true","fetch_graph":"https://pith.science/api/pith-number/ONHS2L24JRLAPOLYDTJSESU2YH/graph.json","fetch_events":"https://pith.science/api/pith-number/ONHS2L24JRLAPOLYDTJSESU2YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH/action/storage_attestation","attest_author":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH/action/author_attestation","sign_citation":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH/action/citation_signature","submit_replication":"https://pith.science/pith/ONHS2L24JRLAPOLYDTJSESU2YH/action/replication_record"}},"created_at":"2026-05-18T01:12:30.136834+00:00","updated_at":"2026-05-18T01:12:30.136834+00:00"}