{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NMX2QO3Q747TWZRZNGT76CT2LM","short_pith_number":"pith:NMX2QO3Q","schema_version":"1.0","canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","source":{"kind":"arxiv","id":"1509.01618","version":2},"attestation_state":"computed","paper":{"title":"Efficient Sampling for k-Determinantal Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2015-09-04T21:38:17Z","abstract_excerpt":"Determinantal Point Processes (DPPs) are elegant probabilistic models of repulsion and diversity over discrete sets of items. But their applicability to large sets is hindered by expensive cubic-complexity matrix operations for basic tasks such as sampling. In light of this, we propose a new method for approximate sampling from discrete $k$-DPPs. Our method takes advantage of the diversity property of subsets sampled from a DPP, and proceeds in two stages: first it constructs coresets for the ground set of items; thereafter, it efficiently samples subsets based on the constructed coresets. As "},"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":"1509.01618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T21:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"f5c2214e7151d7cbe60b5f9df484cb4ce531b25e8cfbf688c9a80200e72dd8e8","abstract_canon_sha256":"62c8a199dc8b99b408ccf68d7c81f044e44ef92be96a669ca632a12919a59fb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:24.102464Z","signature_b64":"s1m7c+KW0YL05vwa6MEIP9Hb8/xSDg+n/zK7uRkXGVREv7HSUXKc6p8c5nIj14f4Z3ekuPIiEMxWNrt/tgONBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","last_reissued_at":"2026-05-18T01:13:24.102033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:24.102033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sampling for k-Determinantal Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2015-09-04T21:38:17Z","abstract_excerpt":"Determinantal Point Processes (DPPs) are elegant probabilistic models of repulsion and diversity over discrete sets of items. But their applicability to large sets is hindered by expensive cubic-complexity matrix operations for basic tasks such as sampling. In light of this, we propose a new method for approximate sampling from discrete $k$-DPPs. Our method takes advantage of the diversity property of subsets sampled from a DPP, and proceeds in two stages: first it constructs coresets for the ground set of items; thereafter, it efficiently samples subsets based on the constructed coresets. As "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01618","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":"1509.01618","created_at":"2026-05-18T01:13:24.102097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01618v2","created_at":"2026-05-18T01:13:24.102097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01618","created_at":"2026-05-18T01:13:24.102097+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMX2QO3Q747T","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMX2QO3Q747TWZRZ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMX2QO3Q","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00159","citing_title":"E$^2$DT: Efficient and Effective Decision Transformer with Experience-Aware Sampling for Robotic Manipulation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM","json":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM.json","graph_json":"https://pith.science/api/pith-number/NMX2QO3Q747TWZRZNGT76CT2LM/graph.json","events_json":"https://pith.science/api/pith-number/NMX2QO3Q747TWZRZNGT76CT2LM/events.json","paper":"https://pith.science/paper/NMX2QO3Q"},"agent_actions":{"view_html":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM","download_json":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM.json","view_paper":"https://pith.science/paper/NMX2QO3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01618&json=true","fetch_graph":"https://pith.science/api/pith-number/NMX2QO3Q747TWZRZNGT76CT2LM/graph.json","fetch_events":"https://pith.science/api/pith-number/NMX2QO3Q747TWZRZNGT76CT2LM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/action/storage_attestation","attest_author":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/action/author_attestation","sign_citation":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/action/citation_signature","submit_replication":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/action/replication_record"}},"created_at":"2026-05-18T01:13:24.102097+00:00","updated_at":"2026-05-18T01:13:24.102097+00:00"}