{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:22PKT3XRB25ANAX3NK5ON3YP4B","short_pith_number":"pith:22PKT3XR","schema_version":"1.0","canonical_sha256":"d69ea9eef10eba0682fb6abae6ef0fe07d0abe6c829ec55b4208e7d84718a402","source":{"kind":"arxiv","id":"1905.07089","version":1},"attestation_state":"computed","paper":{"title":"Exact-K Recommendation via Maximal Clique Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Fei Sun, Kenny Q. Zhu, Lu Duan, Qingwen Liu, Wenwu Ou, Yu Gong, Yu Zhu, Ziyu Guan","submitted_at":"2019-05-17T02:02:59Z","abstract_excerpt":"This paper targets to a novel but practical recommendation problem named exact-K recommendation. It is different from traditional top-K recommendation, as it focuses more on (constrained) combinatorial optimization which will optimize to recommend a whole set of K items called card, rather than ranking optimization which assumes that \"better\" items should be put into top positions. Thus we take the first step to give a formal problem definition, and innovatively reduce it to Maximum Clique Optimization based on graph. To tackle this specific combinatorial optimization problem which is NP-hard,"},"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":"1905.07089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-17T02:02:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f6581746ca2b1d0b1502e6108b3043d76329d3a16b7c44fb03f0c20484caf18e","abstract_canon_sha256":"86ceb18c709af26ad155572233171f4e92faa60601bbf618227a3e7ad43f5e3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.332474Z","signature_b64":"uyIo7Dg3YEFbju1WnWcF0rLxQ9CR+FUfcZH9pDtz6ApS9RDlNHZLNN8eMrs9hfqiS/uxsY2Fxi+LeiZJ37RcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69ea9eef10eba0682fb6abae6ef0fe07d0abe6c829ec55b4208e7d84718a402","last_reissued_at":"2026-05-17T23:45:57.331640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.331640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact-K Recommendation via Maximal Clique Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Fei Sun, Kenny Q. Zhu, Lu Duan, Qingwen Liu, Wenwu Ou, Yu Gong, Yu Zhu, Ziyu Guan","submitted_at":"2019-05-17T02:02:59Z","abstract_excerpt":"This paper targets to a novel but practical recommendation problem named exact-K recommendation. It is different from traditional top-K recommendation, as it focuses more on (constrained) combinatorial optimization which will optimize to recommend a whole set of K items called card, rather than ranking optimization which assumes that \"better\" items should be put into top positions. Thus we take the first step to give a formal problem definition, and innovatively reduce it to Maximum Clique Optimization based on graph. To tackle this specific combinatorial optimization problem which is NP-hard,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07089","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":"1905.07089","created_at":"2026-05-17T23:45:57.331718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07089v1","created_at":"2026-05-17T23:45:57.331718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07089","created_at":"2026-05-17T23:45:57.331718+00:00"},{"alias_kind":"pith_short_12","alias_value":"22PKT3XRB25A","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"22PKT3XRB25ANAX3","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"22PKT3XR","created_at":"2026-05-18T12:33:07.085635+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/22PKT3XRB25ANAX3NK5ON3YP4B","json":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B.json","graph_json":"https://pith.science/api/pith-number/22PKT3XRB25ANAX3NK5ON3YP4B/graph.json","events_json":"https://pith.science/api/pith-number/22PKT3XRB25ANAX3NK5ON3YP4B/events.json","paper":"https://pith.science/paper/22PKT3XR"},"agent_actions":{"view_html":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B","download_json":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B.json","view_paper":"https://pith.science/paper/22PKT3XR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07089&json=true","fetch_graph":"https://pith.science/api/pith-number/22PKT3XRB25ANAX3NK5ON3YP4B/graph.json","fetch_events":"https://pith.science/api/pith-number/22PKT3XRB25ANAX3NK5ON3YP4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B/action/storage_attestation","attest_author":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B/action/author_attestation","sign_citation":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B/action/citation_signature","submit_replication":"https://pith.science/pith/22PKT3XRB25ANAX3NK5ON3YP4B/action/replication_record"}},"created_at":"2026-05-17T23:45:57.331718+00:00","updated_at":"2026-05-17T23:45:57.331718+00:00"}