{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L2OU7VMAOBY33IDEOPGCP2BAKP","short_pith_number":"pith:L2OU7VMA","canonical_record":{"source":{"id":"1411.1088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f7e90a69a0c2de457ca984ccc67636f75bff763447f402cc7e5fdf994dad241","abstract_canon_sha256":"392ee10f9aff5b174ab28bfccc1f1f7cfc6b20a0ed9e0ce6d75ba0d8c4373078"},"schema_version":"1.0"},"canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","source":{"kind":"arxiv","id":"1411.1088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1088","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1088v1","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1088","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"L2OU7VMAOBY3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L2OU7VMAOBY33IDE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L2OU7VMA","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L2OU7VMAOBY33IDEOPGCP2BAKP","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f7e90a69a0c2de457ca984ccc67636f75bff763447f402cc7e5fdf994dad241","abstract_canon_sha256":"392ee10f9aff5b174ab28bfccc1f1f7cfc6b20a0ed9e0ce6d75ba0d8c4373078"},"schema_version":"1.0"},"canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.344096Z","signature_b64":"R5H+Z9vNr3rcqKmfyD0ItlDR5OtIRTMvvEhc5QBcpxhAdRP4JOqLv3CUkXB7nI+FJ9WdlxfAVbVulPAIxv8pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","last_reissued_at":"2026-05-18T02:38:36.343591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.343591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1088","source_version":1,"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-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yn7T+9TTpE8cwlVyTqJmMCIZYRu9aUZLfa5jerAg4j8ftuNOrOqZarSsDvnJV4wzAg0TFZOGhzSIarFxMrCzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:27:28.935780Z"},"content_sha256":"82ea1e0524efc36824839c0eb9a30f837083cc23ceabf76c9f1f4bd82b68d423","schema_version":"1.0","event_id":"sha256:82ea1e0524efc36824839c0eb9a30f837083cc23ceabf76c9f1f4bd82b68d423"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L2OU7VMAOBY33IDEOPGCP2BAKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expectation-Maximization for Learning Determinantal Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Kulesza, Ben Taskar, Emily Fox, Jennifer Gillenwater","submitted_at":"2014-11-04T21:23:35Z","abstract_excerpt":"A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite kernel matrix. To fit a DPP to a given task, we would like to learn the entries of its kernel matrix by maximizing the log-likelihood of the available data. However, log-likelihood is non-convex in the entries of the kernel matrix, and this learning problem is conjectured to be NP-hard. Thus, previous work has instead focused on more restricted convex learning settings: learning only a single weight for each row of the kernel matrix, or learning weights for a linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1088","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"},"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-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7PLCts6k7ojA/4Q93cHimcnWgrNTLQWiuKe1q0N2QxIuMyD3M9i46S2SePswMCeZqRqzf4oAOxde/YH5O9yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:27:28.936485Z"},"content_sha256":"392b6c7e598e5ce67ffe0d61f75f45a1f68a7ff67e79fa1581c5f7016a823d50","schema_version":"1.0","event_id":"sha256:392b6c7e598e5ce67ffe0d61f75f45a1f68a7ff67e79fa1581c5f7016a823d50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/bundle.json","state_url":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/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-05-27T17:27:28Z","links":{"resolver":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP","bundle":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/bundle.json","state":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L2OU7VMAOBY33IDEOPGCP2BAKP","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":"392ee10f9aff5b174ab28bfccc1f1f7cfc6b20a0ed9e0ce6d75ba0d8c4373078","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","title_canon_sha256":"4f7e90a69a0c2de457ca984ccc67636f75bff763447f402cc7e5fdf994dad241"},"schema_version":"1.0","source":{"id":"1411.1088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1088","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1088v1","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1088","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"L2OU7VMAOBY3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L2OU7VMAOBY33IDE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L2OU7VMA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:392b6c7e598e5ce67ffe0d61f75f45a1f68a7ff67e79fa1581c5f7016a823d50","target":"graph","created_at":"2026-05-18T02:38:36Z","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":"A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite kernel matrix. To fit a DPP to a given task, we would like to learn the entries of its kernel matrix by maximizing the log-likelihood of the available data. However, log-likelihood is non-convex in the entries of the kernel matrix, and this learning problem is conjectured to be NP-hard. Thus, previous work has instead focused on more restricted convex learning settings: learning only a single weight for each row of the kernel matrix, or learning weights for a linear","authors_text":"Alex Kulesza, Ben Taskar, Emily Fox, Jennifer Gillenwater","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","title":"Expectation-Maximization for Learning Determinantal Point Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1088","kind":"arxiv","version":1},"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:82ea1e0524efc36824839c0eb9a30f837083cc23ceabf76c9f1f4bd82b68d423","target":"record","created_at":"2026-05-18T02:38:36Z","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":"392ee10f9aff5b174ab28bfccc1f1f7cfc6b20a0ed9e0ce6d75ba0d8c4373078","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","title_canon_sha256":"4f7e90a69a0c2de457ca984ccc67636f75bff763447f402cc7e5fdf994dad241"},"schema_version":"1.0","source":{"id":"1411.1088","kind":"arxiv","version":1}},"canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","first_computed_at":"2026-05-18T02:38:36.343591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:36.343591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R5H+Z9vNr3rcqKmfyD0ItlDR5OtIRTMvvEhc5QBcpxhAdRP4JOqLv3CUkXB7nI+FJ9WdlxfAVbVulPAIxv8pCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:36.344096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ea1e0524efc36824839c0eb9a30f837083cc23ceabf76c9f1f4bd82b68d423","sha256:392b6c7e598e5ce67ffe0d61f75f45a1f68a7ff67e79fa1581c5f7016a823d50"],"state_sha256":"61294207bc84f0f19d2e1f404f8f63ed3f2039a1c323f92e80c4f0f9c3529542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJnJrfGrAEu4OOYJwCJh7/dXMgS2o4WNHJ9TX4yCB24UmhkRSZae+IAWRhF+TS4rtY+LaVzh/nysdZq7qproCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:27:28.940391Z","bundle_sha256":"b8fc2f795a6dc96c1e7bde7ba4ca74c723a8dd4a9093707b4ec479bc5cb9c72e"}}