{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ","short_pith_number":"pith:ZBP3BGY2","canonical_record":{"source":{"id":"1803.00114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-28T22:26:43Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"cd5c4b705af1e5b181decb503938ff751266d6bc0eab90f02555168351259b6c","abstract_canon_sha256":"970fbe9ede460ca764de6d2bec36799088dc6dec1dc31aa27cea8912b27be7ab"},"schema_version":"1.0"},"canonical_sha256":"c85fb09b1a1411e32799a29c3fc73fac3efd91b755097349514924e5a5d61c26","source":{"kind":"arxiv","id":"1803.00114","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00114","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00114v3","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00114","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZBP3BGY2CQI6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBP3BGY2CQI6GJ4Z","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBP3BGY2","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-28T22:26:43Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"cd5c4b705af1e5b181decb503938ff751266d6bc0eab90f02555168351259b6c","abstract_canon_sha256":"970fbe9ede460ca764de6d2bec36799088dc6dec1dc31aa27cea8912b27be7ab"},"schema_version":"1.0"},"canonical_sha256":"c85fb09b1a1411e32799a29c3fc73fac3efd91b755097349514924e5a5d61c26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:34.532500Z","signature_b64":"k2nQ1rCC4KmPX5lpMquf4rEv2dABI+WEcpFwBupJh8ypt2nUMXIq+zUNQ2Z/2s5U8iDyTEfVgNSObDJX2BnOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85fb09b1a1411e32799a29c3fc73fac3efd91b755097349514924e5a5d61c26","last_reissued_at":"2026-05-17T23:54:34.531642Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:34.531642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00114","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-17T23:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD3COxhZzwbQ7s/6tjrMeGZd7X/OV+vgFnIkOy9Fz6LhqhIgfkaqT62vrgNcA67H6eAjlW+irMUubjluvR3iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:31:53.696511Z"},"content_sha256":"84be0f984cc617ae3552002cfbea87ec33d17c64f62a19bf9e5f6cbba927e1e0","schema_version":"1.0","event_id":"sha256:84be0f984cc617ae3552002cfbea87ec33d17c64f62a19bf9e5f6cbba927e1e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SQL-Rank: A Listwise Approach to Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Cho-Jui Hsieh, James Sharpnack, Liwei Wu","submitted_at":"2018-02-28T22:26:43Z","abstract_excerpt":"In this paper, we propose a listwise approach for constructing user-specific rankings in recommendation systems in a collaborative fashion. We contrast the listwise approach to previous pointwise and pairwise approaches, which are based on treating either each rating or each pairwise comparison as an independent instance respectively. By extending the work of (Cao et al. 2007), we cast listwise collaborative ranking as maximum likelihood under a permutation model which applies probability mass to permutations based on a low rank latent score matrix. We present a novel algorithm called SQL-Rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00114","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-17T23:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV15Aq1tm7EaXn5Ts9Q5fg9jQUvBEzq8aoHB+LtKEHvkUE9/vVQE8RsTG/26xrIUelzcmhhQNtHA/X+di209Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:31:53.697238Z"},"content_sha256":"c93dba0dd7d0d843c375f3ada0448b60d94cc9fcab6e953f0213da7d35e2cdf8","schema_version":"1.0","event_id":"sha256:c93dba0dd7d0d843c375f3ada0448b60d94cc9fcab6e953f0213da7d35e2cdf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/bundle.json","state_url":"https://pith.science/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/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-08T18:31:53Z","links":{"resolver":"https://pith.science/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ","bundle":"https://pith.science/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/bundle.json","state":"https://pith.science/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZBP3BGY2CQI6GJ4ZUKOD7RZ7VQ","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":"970fbe9ede460ca764de6d2bec36799088dc6dec1dc31aa27cea8912b27be7ab","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-28T22:26:43Z","title_canon_sha256":"cd5c4b705af1e5b181decb503938ff751266d6bc0eab90f02555168351259b6c"},"schema_version":"1.0","source":{"id":"1803.00114","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00114","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00114v3","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00114","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZBP3BGY2CQI6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBP3BGY2CQI6GJ4Z","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBP3BGY2","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:c93dba0dd7d0d843c375f3ada0448b60d94cc9fcab6e953f0213da7d35e2cdf8","target":"graph","created_at":"2026-05-17T23:54: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":"In this paper, we propose a listwise approach for constructing user-specific rankings in recommendation systems in a collaborative fashion. We contrast the listwise approach to previous pointwise and pairwise approaches, which are based on treating either each rating or each pairwise comparison as an independent instance respectively. By extending the work of (Cao et al. 2007), we cast listwise collaborative ranking as maximum likelihood under a permutation model which applies probability mass to permutations based on a low rank latent score matrix. We present a novel algorithm called SQL-Rank","authors_text":"Cho-Jui Hsieh, James Sharpnack, Liwei Wu","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-28T22:26:43Z","title":"SQL-Rank: A Listwise Approach to Collaborative Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00114","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:84be0f984cc617ae3552002cfbea87ec33d17c64f62a19bf9e5f6cbba927e1e0","target":"record","created_at":"2026-05-17T23:54: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":"970fbe9ede460ca764de6d2bec36799088dc6dec1dc31aa27cea8912b27be7ab","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-28T22:26:43Z","title_canon_sha256":"cd5c4b705af1e5b181decb503938ff751266d6bc0eab90f02555168351259b6c"},"schema_version":"1.0","source":{"id":"1803.00114","kind":"arxiv","version":3}},"canonical_sha256":"c85fb09b1a1411e32799a29c3fc73fac3efd91b755097349514924e5a5d61c26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85fb09b1a1411e32799a29c3fc73fac3efd91b755097349514924e5a5d61c26","first_computed_at":"2026-05-17T23:54:34.531642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:34.531642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k2nQ1rCC4KmPX5lpMquf4rEv2dABI+WEcpFwBupJh8ypt2nUMXIq+zUNQ2Z/2s5U8iDyTEfVgNSObDJX2BnOBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:34.532500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00114","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84be0f984cc617ae3552002cfbea87ec33d17c64f62a19bf9e5f6cbba927e1e0","sha256:c93dba0dd7d0d843c375f3ada0448b60d94cc9fcab6e953f0213da7d35e2cdf8"],"state_sha256":"ded9d5413e850d2d94acf62bb5958b88073916b0599a68a81d454ca6e22a1ad1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6kyqS7EOOIo1nrPr4vhO0k0FTdbBqjmY6Rh6M0pRO7/wCKQtdc55B3w8bKseJcFmpt+NXyG3ouer4Ouw985AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:31:53.701116Z","bundle_sha256":"2ef60f99e084bca415a5e7793eb4784dc4b5d24d90c88a7d0744b221659dae0e"}}