{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PTJOGIU6KACHCZAHCCZ2FBVMLF","short_pith_number":"pith:PTJOGIU6","schema_version":"1.0","canonical_sha256":"7cd2e3229e500471640710b3a286ac59495d6ed73658466a3764e5eef6d896cf","source":{"kind":"arxiv","id":"1207.6083","version":4},"attestation_state":"computed","paper":{"title":"Determinantal point processes for machine learning","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Kulesza, Ben Taskar","submitted_at":"2012-07-25T18:45:43Z","abstract_excerpt":"Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficient and exact algorithms for sampling, marginalization, conditioning, and other inference tasks. We provide a gentle introduction to DPPs, focusing on the intuitions, algorithms, and extensions that are most relevant to the machine learning community, and show how DPPs can be appl"},"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":"1207.6083","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2012-07-25T18:45:43Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"afd667abd1d2305fe8cb61545c88aeaac373f32a9696ea0044687d7e8e5d0be5","abstract_canon_sha256":"c33cdbec42edaeb9024ed1ff1bfd006693524c6883c47f36829186e3f7e952b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:47.938815Z","signature_b64":"vYl7u+WPuvLtwA2szmHZtnpBzAyo01xUzjH5nvIVtmf+SE0jolSLWWGIz/m42ddsADaCs0HYi1vnu6hoIWK5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cd2e3229e500471640710b3a286ac59495d6ed73658466a3764e5eef6d896cf","last_reissued_at":"2026-05-18T03:36:47.938234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:47.938234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determinantal point processes for machine learning","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Kulesza, Ben Taskar","submitted_at":"2012-07-25T18:45:43Z","abstract_excerpt":"Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficient and exact algorithms for sampling, marginalization, conditioning, and other inference tasks. We provide a gentle introduction to DPPs, focusing on the intuitions, algorithms, and extensions that are most relevant to the machine learning community, and show how DPPs can be appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6083","kind":"arxiv","version":4},"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":"1207.6083","created_at":"2026-05-18T03:36:47.938311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6083v4","created_at":"2026-05-18T03:36:47.938311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6083","created_at":"2026-05-18T03:36:47.938311+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTJOGIU6KACH","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTJOGIU6KACHCZAH","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTJOGIU6","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20713","citing_title":"SAVER: Selective As-Needed Vision Evidence for Multimodal Information Extraction","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19698","citing_title":"On two ways to use determinantal point processes for Monte Carlo integration","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF","json":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF.json","graph_json":"https://pith.science/api/pith-number/PTJOGIU6KACHCZAHCCZ2FBVMLF/graph.json","events_json":"https://pith.science/api/pith-number/PTJOGIU6KACHCZAHCCZ2FBVMLF/events.json","paper":"https://pith.science/paper/PTJOGIU6"},"agent_actions":{"view_html":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF","download_json":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF.json","view_paper":"https://pith.science/paper/PTJOGIU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6083&json=true","fetch_graph":"https://pith.science/api/pith-number/PTJOGIU6KACHCZAHCCZ2FBVMLF/graph.json","fetch_events":"https://pith.science/api/pith-number/PTJOGIU6KACHCZAHCCZ2FBVMLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF/action/storage_attestation","attest_author":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF/action/author_attestation","sign_citation":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF/action/citation_signature","submit_replication":"https://pith.science/pith/PTJOGIU6KACHCZAHCCZ2FBVMLF/action/replication_record"}},"created_at":"2026-05-18T03:36:47.938311+00:00","updated_at":"2026-05-18T03:36:47.938311+00:00"}