{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZI6PEBIBDJBJNZTR7FIAV6W7CN","short_pith_number":"pith:ZI6PEBIB","canonical_record":{"source":{"id":"1811.01345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-04T10:08:08Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c0011219834bbc43e0e140a80757777d780f0af91ae73d161030cbbaf4807136","abstract_canon_sha256":"e343907a7ab01c6e66a10ec881fd63c3db96cbbd0cd6adca4c0528ea4edbad1b"},"schema_version":"1.0"},"canonical_sha256":"ca3cf205011a4296e671f9500afadf136710bdd181f2f47f7e656c34b484e2b2","source":{"kind":"arxiv","id":"1811.01345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01345","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01345v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01345","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6PEBIBDJBJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6PEBIBDJBJNZTR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6PEBIB","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZI6PEBIBDJBJNZTR7FIAV6W7CN","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-04T10:08:08Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c0011219834bbc43e0e140a80757777d780f0af91ae73d161030cbbaf4807136","abstract_canon_sha256":"e343907a7ab01c6e66a10ec881fd63c3db96cbbd0cd6adca4c0528ea4edbad1b"},"schema_version":"1.0"},"canonical_sha256":"ca3cf205011a4296e671f9500afadf136710bdd181f2f47f7e656c34b484e2b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.558523Z","signature_b64":"rgpR861V1wCj9z0m99GxeyLYEzyVddO7T8LgIUT6IHb+5kq65moxfVcNZwUgnGmS1SQhnmAyBTBy9r/GXYzrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3cf205011a4296e671f9500afadf136710bdd181f2f47f7e656c34b484e2b2","last_reissued_at":"2026-05-18T00:01:34.557997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.557997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01345","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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMZTREMbEfKYivG5MZiWWhwFzxClmdVSIaWY1nS4XKsbU7liXpIvOiwoCeBSh3Qm96LpSyZPwfj6VnYHnnqQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:19:19.655769Z"},"content_sha256":"abb84e8c4537f2d7d54808853f8b9b572b75fed8d1cc316adacc04b370b032a5","schema_version":"1.0","event_id":"sha256:abb84e8c4537f2d7d54808853f8b9b572b75fed8d1cc316adacc04b370b032a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZI6PEBIBDJBJNZTR7FIAV6W7CN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IteRank: An iterative network-oriented approach to neighbor-based collaborative ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Bita Shams, Saman Haratizadeh","submitted_at":"2018-11-04T10:08:08Z","abstract_excerpt":"Neighbor-based collaborative ranking (NCR) techniques follow three consecutive steps to recommend items to each target user: first they calculate the similarities among users, then they estimate concordance of pairwise preferences to the target user based on the calculated similarities. Finally, they use estimated pairwise preferences to infer the total ranking of items for the target user. This general approach faces some problems as the rank data is usually sparse as users usually have compared only a few pairs of items and consequently, the similarities among users is calculated based on li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01345","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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WO8EmjAdNGqiUdVGzJ33k5nxjetMqx+wEl5mSLnxsNKzV9z5vjSvTy1hhK9dxL5szSl4qBIrmdSE9CNgSTV6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:19:19.656118Z"},"content_sha256":"f736a7b210f3b55e30afcb65b8b2eec256708bc7eb52312340a8c0e30a613a6b","schema_version":"1.0","event_id":"sha256:f736a7b210f3b55e30afcb65b8b2eec256708bc7eb52312340a8c0e30a613a6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/bundle.json","state_url":"https://pith.science/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/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-03T11:19:19Z","links":{"resolver":"https://pith.science/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN","bundle":"https://pith.science/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/bundle.json","state":"https://pith.science/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZI6PEBIBDJBJNZTR7FIAV6W7CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZI6PEBIBDJBJNZTR7FIAV6W7CN","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":"e343907a7ab01c6e66a10ec881fd63c3db96cbbd0cd6adca4c0528ea4edbad1b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-04T10:08:08Z","title_canon_sha256":"c0011219834bbc43e0e140a80757777d780f0af91ae73d161030cbbaf4807136"},"schema_version":"1.0","source":{"id":"1811.01345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01345","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01345v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01345","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6PEBIBDJBJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6PEBIBDJBJNZTR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6PEBIB","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f736a7b210f3b55e30afcb65b8b2eec256708bc7eb52312340a8c0e30a613a6b","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"Neighbor-based collaborative ranking (NCR) techniques follow three consecutive steps to recommend items to each target user: first they calculate the similarities among users, then they estimate concordance of pairwise preferences to the target user based on the calculated similarities. Finally, they use estimated pairwise preferences to infer the total ranking of items for the target user. This general approach faces some problems as the rank data is usually sparse as users usually have compared only a few pairs of items and consequently, the similarities among users is calculated based on li","authors_text":"Bita Shams, Saman Haratizadeh","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-04T10:08:08Z","title":"IteRank: An iterative network-oriented approach to neighbor-based collaborative ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01345","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:abb84e8c4537f2d7d54808853f8b9b572b75fed8d1cc316adacc04b370b032a5","target":"record","created_at":"2026-05-18T00:01:34Z","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":"e343907a7ab01c6e66a10ec881fd63c3db96cbbd0cd6adca4c0528ea4edbad1b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-04T10:08:08Z","title_canon_sha256":"c0011219834bbc43e0e140a80757777d780f0af91ae73d161030cbbaf4807136"},"schema_version":"1.0","source":{"id":"1811.01345","kind":"arxiv","version":1}},"canonical_sha256":"ca3cf205011a4296e671f9500afadf136710bdd181f2f47f7e656c34b484e2b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca3cf205011a4296e671f9500afadf136710bdd181f2f47f7e656c34b484e2b2","first_computed_at":"2026-05-18T00:01:34.557997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.557997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgpR861V1wCj9z0m99GxeyLYEzyVddO7T8LgIUT6IHb+5kq65moxfVcNZwUgnGmS1SQhnmAyBTBy9r/GXYzrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.558523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb84e8c4537f2d7d54808853f8b9b572b75fed8d1cc316adacc04b370b032a5","sha256:f736a7b210f3b55e30afcb65b8b2eec256708bc7eb52312340a8c0e30a613a6b"],"state_sha256":"1137146eb36541058b24c967b8ffd1a218be32e1f09e2e8627484348c6738fc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PjQ1yAI5YiHfvP8E/TCLzj3YOquK0E5LioXGaQM5oR1ZvYTX/vdkNnQ72BzBJIvu5V3KurJkp+Zt68I+nRJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:19:19.658026Z","bundle_sha256":"2749a4c227860720b52fdd322f7827b8e38e9eb627a0825e4c48d0d63d75e8be"}}