{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:74SZLNUOLF6FUFXYZFYI26RSI2","short_pith_number":"pith:74SZLNUO","schema_version":"1.0","canonical_sha256":"ff2595b68e597c5a16f8c9708d7a32469d2218a5d89b12efa01d2957792ffed4","source":{"kind":"arxiv","id":"1307.3855","version":1},"attestation_state":"computed","paper":{"title":"GAPfm: Optimal Top-N Recommendations for Graded Relevance Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alan Hanjalic, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, Yue Shi","submitted_at":"2013-07-15T08:55:11Z","abstract_excerpt":"Recommender systems are frequently used in domains in which users express their preferences in the form of graded judgments, such as ratings. If accurate top-N recommendation lists are to be produced for such graded relevance domains, it is critical to generate a ranked list of recommended items directly rather than predicting ratings. Current techniques choose one of two sub-optimal approaches: either they optimize for a binary metric such as Average Precision, which discards information on relevance grades, or they optimize for Normalized Discounted Cumulative Gain (NDCG), which ignores the "},"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":"1307.3855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-15T08:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"55c0804ca6d1c3e815dc29daefe54cf537ba16396dd86eb85ad0c75179788964","abstract_canon_sha256":"eb0d4e9beca117217e8841070df311c25334dd0d80086750d66840770a92e3e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:27.657168Z","signature_b64":"Ap5SxopKIHRT867Xu/MmNGcRNJAc/6o1iRvRKQBkND4dnwQhwsyNmOqZ/mY5aoUkuJeXSO7iFJYjgPrNGDXHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2595b68e597c5a16f8c9708d7a32469d2218a5d89b12efa01d2957792ffed4","last_reissued_at":"2026-05-18T03:18:27.656455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:27.656455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GAPfm: Optimal Top-N Recommendations for Graded Relevance Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alan Hanjalic, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, Yue Shi","submitted_at":"2013-07-15T08:55:11Z","abstract_excerpt":"Recommender systems are frequently used in domains in which users express their preferences in the form of graded judgments, such as ratings. If accurate top-N recommendation lists are to be produced for such graded relevance domains, it is critical to generate a ranked list of recommended items directly rather than predicting ratings. Current techniques choose one of two sub-optimal approaches: either they optimize for a binary metric such as Average Precision, which discards information on relevance grades, or they optimize for Normalized Discounted Cumulative Gain (NDCG), which ignores the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3855","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3855","created_at":"2026-05-18T03:18:27.656564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3855v1","created_at":"2026-05-18T03:18:27.656564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3855","created_at":"2026-05-18T03:18:27.656564+00:00"},{"alias_kind":"pith_short_12","alias_value":"74SZLNUOLF6F","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"74SZLNUOLF6FUFXY","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"74SZLNUO","created_at":"2026-05-18T12:27:36.564083+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/74SZLNUOLF6FUFXYZFYI26RSI2","json":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2.json","graph_json":"https://pith.science/api/pith-number/74SZLNUOLF6FUFXYZFYI26RSI2/graph.json","events_json":"https://pith.science/api/pith-number/74SZLNUOLF6FUFXYZFYI26RSI2/events.json","paper":"https://pith.science/paper/74SZLNUO"},"agent_actions":{"view_html":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2","download_json":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2.json","view_paper":"https://pith.science/paper/74SZLNUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3855&json=true","fetch_graph":"https://pith.science/api/pith-number/74SZLNUOLF6FUFXYZFYI26RSI2/graph.json","fetch_events":"https://pith.science/api/pith-number/74SZLNUOLF6FUFXYZFYI26RSI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2/action/storage_attestation","attest_author":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2/action/author_attestation","sign_citation":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2/action/citation_signature","submit_replication":"https://pith.science/pith/74SZLNUOLF6FUFXYZFYI26RSI2/action/replication_record"}},"created_at":"2026-05-18T03:18:27.656564+00:00","updated_at":"2026-05-18T03:18:27.656564+00:00"}