{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CU4WAFWGMBGRFRR3UGKLBB5OG2","short_pith_number":"pith:CU4WAFWG","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"},"canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","source":{"kind":"arxiv","id":"1709.05135","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05135","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05135v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05135","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"CU4WAFWGMBGR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CU4WAFWGMBGRFRR3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CU4WAFWG","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CU4WAFWGMBGRFRR3UGKLBB5OG2","target":"record","payload":{"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"},"canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","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"},"source_kind":"arxiv","source_id":"1709.05135","source_version":2,"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-18T00:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhlSwhxYXoduC/ARkMXrxvvzZX6tatGI6E1NKBCuetyvU8NFveCJ0zCLkr9+a8SeivHchoadRSlI6bB4g1q2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:47:49.688904Z"},"content_sha256":"a8cae086f5eccaae8e03068147a496e47c2456d7aafe24578ba58c60af895a1f","schema_version":"1.0","event_id":"sha256:a8cae086f5eccaae8e03068147a496e47c2456d7aafe24578ba58c60af895a1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CU4WAFWGMBGRFRR3UGKLBB5OG2","target":"graph","payload":{"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"},"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-18T00:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+EYucXlgHKVjNRIH9/37GG+XONFddVPNauIpTM92jKXnOwOVpZ9eOqSIcMZ+qVv5MorFcHE59zLNgj8pQJKwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:47:49.689247Z"},"content_sha256":"f272ddd377d1b71efd41beeef130b498258e184f7e977c3600aad21907ae5d6a","schema_version":"1.0","event_id":"sha256:f272ddd377d1b71efd41beeef130b498258e184f7e977c3600aad21907ae5d6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/bundle.json","state_url":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/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-20T03:47:49Z","links":{"resolver":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2","bundle":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/bundle.json","state":"https://pith.science/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CU4WAFWGMBGRFRR3UGKLBB5OG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CU4WAFWGMBGRFRR3UGKLBB5OG2","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":"1309df4b08286d5cef1abef9d4f9ee85b2e877969f052f8d58a74d7602bd3cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-09-15T09:52:06Z","title_canon_sha256":"0a9969962454140b6adffa550d6b36dd6f179e50bc3c0d56952f70b141abeb09"},"schema_version":"1.0","source":{"id":"1709.05135","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05135","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05135v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05135","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"CU4WAFWGMBGR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CU4WAFWGMBGRFRR3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CU4WAFWG","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f272ddd377d1b71efd41beeef130b498258e184f7e977c3600aad21907ae5d6a","target":"graph","created_at":"2026-05-18T00:14:54Z","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":"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","authors_text":"Guoxin Zhang, Hanning Zhou, Laming Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-09-15T09:52:06Z","title":"Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05135","kind":"arxiv","version":2},"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:a8cae086f5eccaae8e03068147a496e47c2456d7aafe24578ba58c60af895a1f","target":"record","created_at":"2026-05-18T00:14:54Z","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":"1309df4b08286d5cef1abef9d4f9ee85b2e877969f052f8d58a74d7602bd3cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-09-15T09:52:06Z","title_canon_sha256":"0a9969962454140b6adffa550d6b36dd6f179e50bc3c0d56952f70b141abeb09"},"schema_version":"1.0","source":{"id":"1709.05135","kind":"arxiv","version":2}},"canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15396016c6604d12c63ba194b087ae368d219072bcd393be7569269a6bb69415","first_computed_at":"2026-05-18T00:14:54.543638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:54.543638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCkSnPqAsQkVS3+HNwyziP2sU0vvJM/ofs67gnV4Sbb+AiuQt+9G2fGgib1C3464wE9+zdB0Hqu8/6LUTdttDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:54.544339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05135","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8cae086f5eccaae8e03068147a496e47c2456d7aafe24578ba58c60af895a1f","sha256:f272ddd377d1b71efd41beeef130b498258e184f7e977c3600aad21907ae5d6a"],"state_sha256":"a5024de1b4b0aed14344c63e288c68dfbc3ef31095cb337f33499c8a78034c52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjDIawfwndmCwbsB3hGrcUy5eYuOxT/Aii/JhHASeisniZuJJyqYmcSOhrWzMpoGxikoqxaVMdb/Xo5M9M26Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:47:49.691204Z","bundle_sha256":"b4144376584577ca3ab33b1b6f588da15278a67a72e47e40999719bb04b1bc6c"}}