{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VD6LDZH44AZS433UW55VFYV5YO","short_pith_number":"pith:VD6LDZH4","canonical_record":{"source":{"id":"1604.03147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-11T21:05:16Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"f9f71f74b2a99c7cfd6cff49ade5343e641a8b17c060db1547e2b570fc94692e","abstract_canon_sha256":"4542100e631a352f71986a1f2cf99aff7a4113d2eb83136a394eff9e0fabb23d"},"schema_version":"1.0"},"canonical_sha256":"a8fcb1e4fce0332e6f74b77b52e2bdc38b21cb7d0c6e82ebcb103cfbe4913d52","source":{"kind":"arxiv","id":"1604.03147","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03147","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03147v3","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03147","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"VD6LDZH44AZS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VD6LDZH44AZS433U","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VD6LDZH4","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VD6LDZH44AZS433UW55VFYV5YO","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-11T21:05:16Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"f9f71f74b2a99c7cfd6cff49ade5343e641a8b17c060db1547e2b570fc94692e","abstract_canon_sha256":"4542100e631a352f71986a1f2cf99aff7a4113d2eb83136a394eff9e0fabb23d"},"schema_version":"1.0"},"canonical_sha256":"a8fcb1e4fce0332e6f74b77b52e2bdc38b21cb7d0c6e82ebcb103cfbe4913d52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:51.396667Z","signature_b64":"Z9WUvATamkQK3oo+gbCdYfHshOG7wxOJJDfS6vIkyc93U31Pv+eokKAq06p1B/9qE/8wTLmVgOJ7W/N82ANmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fcb1e4fce0332e6f74b77b52e2bdc38b21cb7d0c6e82ebcb103cfbe4913d52","last_reissued_at":"2026-05-18T00:51:51.396151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:51.396151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03147","source_version":3,"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-18T00:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsxEPS8m+iRmfhEkFHkbqW9Ul2OGJmbQBmThi8arWOMm640iL7P2VSwzT8PO+8WFcKdoOaKeb1FCWzz2RSGLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:21.302035Z"},"content_sha256":"09407653643a240d0a2892635737c71ca3959a5cb5afd285c75f775cf515cd6f","schema_version":"1.0","event_id":"sha256:09407653643a240d0a2892635737c71ca3959a5cb5afd285c75f775cf515cd6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VD6LDZH44AZS433UW55VFYV5YO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.SI","authors_text":"Bita Shams, Saman Haratizadeh","submitted_at":"2016-04-11T21:05:16Z","abstract_excerpt":"Data sparsity, that is a common problem in neighbor-based collaborative filtering domain, usually complicates the process of item recommendation. This problem is more serious in collaborative ranking domain, in which calculating the users similarities and recommending items are based on ranking data. Some graph-based approaches have been proposed to address the data sparsity problem, but they suffer from two flaws. First, they fail to correctly model the users priorities, and second, they cannot be used when the only available data is a set of ranking instead of rating values. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03147","kind":"arxiv","version":3},"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-18T00:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IFsNsZ4Edtj8J2k6SXHE4/fPaZyZDDkxUp07h7y6Vjn38wuby9U+7txw4SNOwBJUx5hDgzmgshApDKsuX4mDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:21.302408Z"},"content_sha256":"ccf88f45e1d0ddfba8d6e667bc4a96da84486a1ba8aec175a278bbb699000d7a","schema_version":"1.0","event_id":"sha256:ccf88f45e1d0ddfba8d6e667bc4a96da84486a1ba8aec175a278bbb699000d7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VD6LDZH44AZS433UW55VFYV5YO/bundle.json","state_url":"https://pith.science/pith/VD6LDZH44AZS433UW55VFYV5YO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VD6LDZH44AZS433UW55VFYV5YO/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-03T02:25:21Z","links":{"resolver":"https://pith.science/pith/VD6LDZH44AZS433UW55VFYV5YO","bundle":"https://pith.science/pith/VD6LDZH44AZS433UW55VFYV5YO/bundle.json","state":"https://pith.science/pith/VD6LDZH44AZS433UW55VFYV5YO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VD6LDZH44AZS433UW55VFYV5YO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VD6LDZH44AZS433UW55VFYV5YO","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":"4542100e631a352f71986a1f2cf99aff7a4113d2eb83136a394eff9e0fabb23d","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-11T21:05:16Z","title_canon_sha256":"f9f71f74b2a99c7cfd6cff49ade5343e641a8b17c060db1547e2b570fc94692e"},"schema_version":"1.0","source":{"id":"1604.03147","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03147","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03147v3","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03147","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"VD6LDZH44AZS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VD6LDZH44AZS433U","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VD6LDZH4","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:ccf88f45e1d0ddfba8d6e667bc4a96da84486a1ba8aec175a278bbb699000d7a","target":"graph","created_at":"2026-05-18T00:51:51Z","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":"Data sparsity, that is a common problem in neighbor-based collaborative filtering domain, usually complicates the process of item recommendation. This problem is more serious in collaborative ranking domain, in which calculating the users similarities and recommending items are based on ranking data. Some graph-based approaches have been proposed to address the data sparsity problem, but they suffer from two flaws. First, they fail to correctly model the users priorities, and second, they cannot be used when the only available data is a set of ranking instead of rating values. In this paper, w","authors_text":"Bita Shams, Saman Haratizadeh","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-11T21:05:16Z","title":"Graph-based Collaborative Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03147","kind":"arxiv","version":3},"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:09407653643a240d0a2892635737c71ca3959a5cb5afd285c75f775cf515cd6f","target":"record","created_at":"2026-05-18T00:51:51Z","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":"4542100e631a352f71986a1f2cf99aff7a4113d2eb83136a394eff9e0fabb23d","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-11T21:05:16Z","title_canon_sha256":"f9f71f74b2a99c7cfd6cff49ade5343e641a8b17c060db1547e2b570fc94692e"},"schema_version":"1.0","source":{"id":"1604.03147","kind":"arxiv","version":3}},"canonical_sha256":"a8fcb1e4fce0332e6f74b77b52e2bdc38b21cb7d0c6e82ebcb103cfbe4913d52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8fcb1e4fce0332e6f74b77b52e2bdc38b21cb7d0c6e82ebcb103cfbe4913d52","first_computed_at":"2026-05-18T00:51:51.396151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:51.396151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z9WUvATamkQK3oo+gbCdYfHshOG7wxOJJDfS6vIkyc93U31Pv+eokKAq06p1B/9qE/8wTLmVgOJ7W/N82ANmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:51.396667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03147","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09407653643a240d0a2892635737c71ca3959a5cb5afd285c75f775cf515cd6f","sha256:ccf88f45e1d0ddfba8d6e667bc4a96da84486a1ba8aec175a278bbb699000d7a"],"state_sha256":"5cebe3bb24303d7f562ee74b88330123faf3fa1e8d9317adfc6caab70d772554"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fewAEhvCov0TlZKW0Yz5Ov9EEkx40jiZ4KdsGWo/2Yo3ynRkDW/AQI37abDmYGVLK+h9qiDhhysYPcgyNdPKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:25:21.304558Z","bundle_sha256":"8e6bf542cdb07ead0f1604c3dfe6597fa6ba655a8be9391ac4e4fe66a51fcfc5"}}