{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D7KBIG3K2KCB3LMW4GZGQ3PQIA","short_pith_number":"pith:D7KBIG3K","schema_version":"1.0","canonical_sha256":"1fd4141b6ad2841dad96e1b2686df0401f3bad55d88e02bbade011a314c659e6","source":{"kind":"arxiv","id":"1904.05325","version":2},"attestation_state":"computed","paper":{"title":"Risk Aware Ranking for Top-$k$ Recommendations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Nishant Vijayakumar, Sanjay Chawla, Shameem A Puthiya Parambath","submitted_at":"2019-03-17T08:01:26Z","abstract_excerpt":"Given an incomplete ratings data over a set of users and items, the preference completion problem aims to estimate a personalized total preference order over a subset of the items. In practical settings, a ranked list of top-$k$ items from the estimated preference order is recommended to the end user in the decreasing order of preference for final consumption. We analyze this model and observe that such a ranking model results in suboptimal performance when the payoff associated with the recommended items is different. We propose a novel and very efficient algorithm for the preference ranking "},"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":"1904.05325","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2019-03-17T08:01:26Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3e58bd672247e1b3ed0072cc8b5348498b0cff54216a95ac1f9dfcc6fe419b75","abstract_canon_sha256":"3863a3f7efe8de40b618e9d68c07929d42bc65007c97d6fff674354bb0d353d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:41.534010Z","signature_b64":"MLGpgyq7Ea+0hPzG/64+zkJbVB8ailsGMbAaVVtEkTucj61ScymH3JtjKJY6yI3v8l2bpdEMFCYioWD6bjuaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fd4141b6ad2841dad96e1b2686df0401f3bad55d88e02bbade011a314c659e6","last_reissued_at":"2026-05-17T23:48:41.533474Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:41.533474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk Aware Ranking for Top-$k$ Recommendations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Nishant Vijayakumar, Sanjay Chawla, Shameem A Puthiya Parambath","submitted_at":"2019-03-17T08:01:26Z","abstract_excerpt":"Given an incomplete ratings data over a set of users and items, the preference completion problem aims to estimate a personalized total preference order over a subset of the items. In practical settings, a ranked list of top-$k$ items from the estimated preference order is recommended to the end user in the decreasing order of preference for final consumption. We analyze this model and observe that such a ranking model results in suboptimal performance when the payoff associated with the recommended items is different. We propose a novel and very efficient algorithm for the preference ranking "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05325","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":"1904.05325","created_at":"2026-05-17T23:48:41.533570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05325v2","created_at":"2026-05-17T23:48:41.533570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05325","created_at":"2026-05-17T23:48:41.533570+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7KBIG3K2KCB","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7KBIG3K2KCB3LMW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7KBIG3K","created_at":"2026-05-18T12:33:15.570797+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/D7KBIG3K2KCB3LMW4GZGQ3PQIA","json":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA.json","graph_json":"https://pith.science/api/pith-number/D7KBIG3K2KCB3LMW4GZGQ3PQIA/graph.json","events_json":"https://pith.science/api/pith-number/D7KBIG3K2KCB3LMW4GZGQ3PQIA/events.json","paper":"https://pith.science/paper/D7KBIG3K"},"agent_actions":{"view_html":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA","download_json":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA.json","view_paper":"https://pith.science/paper/D7KBIG3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05325&json=true","fetch_graph":"https://pith.science/api/pith-number/D7KBIG3K2KCB3LMW4GZGQ3PQIA/graph.json","fetch_events":"https://pith.science/api/pith-number/D7KBIG3K2KCB3LMW4GZGQ3PQIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA/action/storage_attestation","attest_author":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA/action/author_attestation","sign_citation":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA/action/citation_signature","submit_replication":"https://pith.science/pith/D7KBIG3K2KCB3LMW4GZGQ3PQIA/action/replication_record"}},"created_at":"2026-05-17T23:48:41.533570+00:00","updated_at":"2026-05-17T23:48:41.533570+00:00"}