{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CU4WAFWGMBGRFRR3UGKLBB5OG2","short_pith_number":"pith:CU4WAFWG","schema_version":"1.0","canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","source":{"kind":"arxiv","id":"1709.05135","version":2},"attestation_state":"computed","paper":{"title":"Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Guoxin Zhang, Hanning Zhou, Laming Chen","submitted_at":"2017-09-15T09:52:06Z","abstract_excerpt":"The determinantal point process (DPP) is an elegant probabilistic model of repulsion with applications in various machine learning tasks including summarization and search. However, the maximum a posteriori (MAP) inference for DPP which plays an important role in many applications is NP-hard, and even the popular greedy algorithm can still be too computationally expensive to be used in large-scale real-time scenarios. To overcome the computational challenge, in this paper, we propose a novel algorithm to greatly accelerate the greedy MAP inference for DPP. In addition, our algorithm also adapt"},"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":"1709.05135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-09-15T09:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"0a9969962454140b6adffa550d6b36dd6f179e50bc3c0d56952f70b141abeb09","abstract_canon_sha256":"1309df4b08286d5cef1abef9d4f9ee85b2e877969f052f8d58a74d7602bd3cd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:54.544339Z","signature_b64":"vCkSnPqAsQkVS3+HNwyziP2sU0vvJM/ofs67gnV4Sbb+AiuQt+9G2fGgib1C3464wE9+zdB0Hqu8/6LUTdttDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","last_reissued_at":"2026-05-18T00:14:54.543638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:54.543638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Guoxin Zhang, Hanning Zhou, Laming Chen","submitted_at":"2017-09-15T09:52:06Z","abstract_excerpt":"The determinantal point process (DPP) is an elegant probabilistic model of repulsion with applications in various machine learning tasks including summarization and search. However, the maximum a posteriori (MAP) inference for DPP which plays an important role in many applications is NP-hard, and even the popular greedy algorithm can still be too computationally expensive to be used in large-scale real-time scenarios. To overcome the computational challenge, in this paper, we propose a novel algorithm to greatly accelerate the greedy MAP inference for DPP. In addition, our algorithm also adapt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05135","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":"1709.05135","created_at":"2026-05-18T00:14:54.543716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05135v2","created_at":"2026-05-18T00:14:54.543716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05135","created_at":"2026-05-18T00:14:54.543716+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU4WAFWGMBGR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU4WAFWGMBGRFRR3","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU4WAFWG","created_at":"2026-05-18T12:31:10.602751+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/CU4WAFWGMBGRFRR3UGKLBB5OG2","json":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2.json","graph_json":"https://pith.science/api/pith-number/CU4WAFWGMBGRFRR3UGKLBB5OG2/graph.json","events_json":"https://pith.science/api/pith-number/CU4WAFWGMBGRFRR3UGKLBB5OG2/events.json","paper":"https://pith.science/paper/CU4WAFWG"},"agent_actions":{"view_html":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2","download_json":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2.json","view_paper":"https://pith.science/paper/CU4WAFWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05135&json=true","fetch_graph":"https://pith.science/api/pith-number/CU4WAFWGMBGRFRR3UGKLBB5OG2/graph.json","fetch_events":"https://pith.science/api/pith-number/CU4WAFWGMBGRFRR3UGKLBB5OG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/action/storage_attestation","attest_author":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/action/author_attestation","sign_citation":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/action/citation_signature","submit_replication":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/action/replication_record"}},"created_at":"2026-05-18T00:14:54.543716+00:00","updated_at":"2026-05-18T00:14:54.543716+00:00"}