{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CUYVE2S3PXUHGXKKUQJUZQJ6K4","short_pith_number":"pith:CUYVE2S3","canonical_record":{"source":{"id":"1508.00792","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T14:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"87672a62b63f9041dd19a0caf9f890e7085a793d548d0576a57ce3bc79b570dc","abstract_canon_sha256":"466715f068357eff01c69e201d9bc97dd8a092833a0602645586105f1770b08e"},"schema_version":"1.0"},"canonical_sha256":"1531526a5b7de8735d4aa4134cc13e5716305a94f83e3d4f5d9ee43793a3463e","source":{"kind":"arxiv","id":"1508.00792","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00792","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00792v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00792","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"CUYVE2S3PXUH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUYVE2S3PXUHGXKK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUYVE2S3","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CUYVE2S3PXUHGXKKUQJUZQJ6K4","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00792","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T14:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"87672a62b63f9041dd19a0caf9f890e7085a793d548d0576a57ce3bc79b570dc","abstract_canon_sha256":"466715f068357eff01c69e201d9bc97dd8a092833a0602645586105f1770b08e"},"schema_version":"1.0"},"canonical_sha256":"1531526a5b7de8735d4aa4134cc13e5716305a94f83e3d4f5d9ee43793a3463e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.615954Z","signature_b64":"HjgDE2H9HtcSj2MflMHoUYKMu85E1m2B4HA2wWoVXDvWqHMGktBjsE0ckRnZ+NQBiPuaHYfbZZc30GC6a3QwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1531526a5b7de8735d4aa4134cc13e5716305a94f83e3d4f5d9ee43793a3463e","last_reissued_at":"2026-05-18T01:30:42.615382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.615382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00792","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHYeLAXvZZyQqZMJcQp51X+S4HOUwnxTGhDbGveOjeBSGxaiPpYtPaW5nvdxCIyuUu7QcO5WhyG6ds6+8Gm7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:20.236498Z"},"content_sha256":"bbe38b99fd08c2c115af3a9851cc2dcea4ec02cc6315eb3fb9ac3251c0fa50f2","schema_version":"1.0","event_id":"sha256:bbe38b99fd08c2c115af3a9851cc2dcea4ec02cc6315eb3fb9ac3251c0fa50f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CUYVE2S3PXUHGXKKUQJUZQJ6K4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-point algorithms for learning determinantal point processes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Suvrit Sra, Zelda Mariet","submitted_at":"2015-08-04T14:58:45Z","abstract_excerpt":"Determinantal point processes (DPPs) offer an elegant tool for encoding probabilities over subsets of a ground set. Discrete DPPs are parametrized by a positive semidefinite matrix (called the DPP kernel), and estimating this kernel is key to learning DPPs from observed data. We consider the task of learning the DPP kernel, and develop for it a surprisingly simple yet effective new algorithm. Our algorithm offers the following benefits over previous approaches: (a) it is much simpler; (b) it yields equally good and sometimes even better local maxima; and (c) it runs an order of magnitude faste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00792","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWpwssGz/bfg4N+2sxRhk1UVCtT4Dyr7VgtFI6zbItAuGo/es/ikvdq2ynb/9+ZPZHVzsRGCFauScVm45zQBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:20.236878Z"},"content_sha256":"18b081dccd23f1f1f458b8f5c6f84a3ee7b1981ace56f4f88a70fe2b865691bf","schema_version":"1.0","event_id":"sha256:18b081dccd23f1f1f458b8f5c6f84a3ee7b1981ace56f4f88a70fe2b865691bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/bundle.json","state_url":"https://pith.science/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/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-02T17:49:20Z","links":{"resolver":"https://pith.science/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4","bundle":"https://pith.science/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/bundle.json","state":"https://pith.science/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUYVE2S3PXUHGXKKUQJUZQJ6K4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CUYVE2S3PXUHGXKKUQJUZQJ6K4","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":"466715f068357eff01c69e201d9bc97dd8a092833a0602645586105f1770b08e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T14:58:45Z","title_canon_sha256":"87672a62b63f9041dd19a0caf9f890e7085a793d548d0576a57ce3bc79b570dc"},"schema_version":"1.0","source":{"id":"1508.00792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00792","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00792v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00792","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"CUYVE2S3PXUH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUYVE2S3PXUHGXKK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUYVE2S3","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:18b081dccd23f1f1f458b8f5c6f84a3ee7b1981ace56f4f88a70fe2b865691bf","target":"graph","created_at":"2026-05-18T01:30:42Z","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":"Determinantal point processes (DPPs) offer an elegant tool for encoding probabilities over subsets of a ground set. Discrete DPPs are parametrized by a positive semidefinite matrix (called the DPP kernel), and estimating this kernel is key to learning DPPs from observed data. We consider the task of learning the DPP kernel, and develop for it a surprisingly simple yet effective new algorithm. Our algorithm offers the following benefits over previous approaches: (a) it is much simpler; (b) it yields equally good and sometimes even better local maxima; and (c) it runs an order of magnitude faste","authors_text":"Suvrit Sra, Zelda Mariet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T14:58:45Z","title":"Fixed-point algorithms for learning determinantal point processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00792","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:bbe38b99fd08c2c115af3a9851cc2dcea4ec02cc6315eb3fb9ac3251c0fa50f2","target":"record","created_at":"2026-05-18T01:30:42Z","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":"466715f068357eff01c69e201d9bc97dd8a092833a0602645586105f1770b08e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T14:58:45Z","title_canon_sha256":"87672a62b63f9041dd19a0caf9f890e7085a793d548d0576a57ce3bc79b570dc"},"schema_version":"1.0","source":{"id":"1508.00792","kind":"arxiv","version":2}},"canonical_sha256":"1531526a5b7de8735d4aa4134cc13e5716305a94f83e3d4f5d9ee43793a3463e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1531526a5b7de8735d4aa4134cc13e5716305a94f83e3d4f5d9ee43793a3463e","first_computed_at":"2026-05-18T01:30:42.615382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:42.615382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HjgDE2H9HtcSj2MflMHoUYKMu85E1m2B4HA2wWoVXDvWqHMGktBjsE0ckRnZ+NQBiPuaHYfbZZc30GC6a3QwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:42.615954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe38b99fd08c2c115af3a9851cc2dcea4ec02cc6315eb3fb9ac3251c0fa50f2","sha256:18b081dccd23f1f1f458b8f5c6f84a3ee7b1981ace56f4f88a70fe2b865691bf"],"state_sha256":"2bef04397c9a1a58cee11b77c03c63273ba3bd26d7ccb876185348b065bb4a33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YywHqmC1b9Nh++e7qXl1Pt9UI9JAfyFCR41dyVRB6M7CjQ4KneQ512HelsNlfNtaniRy5U0QluQ1C4O1I7UUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:49:20.239055Z","bundle_sha256":"3b18a21bc80b4733f867fdb9c6971c66be00715d8956d32a0b50aea628a59c0a"}}