{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3Z5W3U2NIFRQIIRTE7JNJPLHBH","short_pith_number":"pith:3Z5W3U2N","schema_version":"1.0","canonical_sha256":"de7b6dd34d416304223327d2d4bd6709e079e8937ac35d5b30eef86204a9366a","source":{"kind":"arxiv","id":"1703.00539","version":1},"attestation_state":"computed","paper":{"title":"Learning Determinantal Point Processes with Moments and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ankur Moitra, John Urschel, Philippe Rigollet, Victor-Emmanuel Brunel","submitted_at":"2017-03-01T22:53:13Z","abstract_excerpt":"Determinantal Point Processes (DPPs) are a family of probabilistic models that have a repulsive behavior, and lend themselves naturally to many tasks in machine learning where returning a diverse set of objects is important. While there are fast algorithms for sampling, marginalization and conditioning, much less is known about learning the parameters of a DPP. Our contribution is twofold: (i) we establish the optimal sample complexity achievable in this problem and show that it is governed by a natural parameter, which we call the \\emph{cycle sparsity}; (ii) we propose a provably fast combina"},"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":"1703.00539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-01T22:53:13Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"a0cf1997feea9dea056ca529edbb671c196bad341acc8e8faebc9dd8ce72c2f2","abstract_canon_sha256":"adca679697befdce9067f327422262b8bfad8005b4412b1457f4f3644a90f88d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.389351Z","signature_b64":"8egYhaCqw4dwbYiR0rXlxyHOok+1rMJqt8nDB1Ybg9nP0V7Q32+XjqJulsfj1rtqp4dKTmoGJPWNuEBB4E59Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7b6dd34d416304223327d2d4bd6709e079e8937ac35d5b30eef86204a9366a","last_reissued_at":"2026-05-18T00:49:41.388876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.388876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Determinantal Point Processes with Moments and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ankur Moitra, John Urschel, Philippe Rigollet, Victor-Emmanuel Brunel","submitted_at":"2017-03-01T22:53:13Z","abstract_excerpt":"Determinantal Point Processes (DPPs) are a family of probabilistic models that have a repulsive behavior, and lend themselves naturally to many tasks in machine learning where returning a diverse set of objects is important. While there are fast algorithms for sampling, marginalization and conditioning, much less is known about learning the parameters of a DPP. Our contribution is twofold: (i) we establish the optimal sample complexity achievable in this problem and show that it is governed by a natural parameter, which we call the \\emph{cycle sparsity}; (ii) we propose a provably fast combina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00539","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.00539","created_at":"2026-05-18T00:49:41.388946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00539v1","created_at":"2026-05-18T00:49:41.388946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00539","created_at":"2026-05-18T00:49:41.388946+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z5W3U2NIFRQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z5W3U2NIFRQIIRT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z5W3U2N","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13127","citing_title":"State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives","ref_index":172,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH","json":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH.json","graph_json":"https://pith.science/api/pith-number/3Z5W3U2NIFRQIIRTE7JNJPLHBH/graph.json","events_json":"https://pith.science/api/pith-number/3Z5W3U2NIFRQIIRTE7JNJPLHBH/events.json","paper":"https://pith.science/paper/3Z5W3U2N"},"agent_actions":{"view_html":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH","download_json":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH.json","view_paper":"https://pith.science/paper/3Z5W3U2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00539&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z5W3U2NIFRQIIRTE7JNJPLHBH/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z5W3U2NIFRQIIRTE7JNJPLHBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH/action/storage_attestation","attest_author":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH/action/author_attestation","sign_citation":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH/action/citation_signature","submit_replication":"https://pith.science/pith/3Z5W3U2NIFRQIIRTE7JNJPLHBH/action/replication_record"}},"created_at":"2026-05-18T00:49:41.388946+00:00","updated_at":"2026-05-18T00:49:41.388946+00:00"}