{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NMX2QO3Q747TWZRZNGT76CT2LM","short_pith_number":"pith:NMX2QO3Q","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"},"canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","source":{"kind":"arxiv","id":"1509.01618","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01618","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01618v2","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01618","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"NMX2QO3Q747T","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NMX2QO3Q747TWZRZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NMX2QO3Q","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NMX2QO3Q747TWZRZNGT76CT2LM","target":"record","payload":{"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"},"canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","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"},"source_kind":"arxiv","source_id":"1509.01618","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:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WzPyUMtGo4AES7xZYNBUhOyxWndgNccNsOlFXzQvGKZ/lKOwa2vkpbmgWLhIgY9rnvNSph7IP+Vg1f2aMm+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:45:29.313493Z"},"content_sha256":"cf4eefd93edaddbbb4b3a987d4b660a9369201482c182fa7b8e10de38f21f44e","schema_version":"1.0","event_id":"sha256:cf4eefd93edaddbbb4b3a987d4b660a9369201482c182fa7b8e10de38f21f44e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NMX2QO3Q747TWZRZNGT76CT2LM","target":"graph","payload":{"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"},"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:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stPajJj7arSqF+CogP37GQA1bkb3W+TD1+hNNe+s4nFwJlczKGHuae2eN1YeG/fvHsyFun2/09Qnr6RO6LbrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:45:29.313848Z"},"content_sha256":"d1cc3d96dbd2c029dabc3e4c5d395f440cd4a1a10059c8698e4cfda7e59b557f","schema_version":"1.0","event_id":"sha256:d1cc3d96dbd2c029dabc3e4c5d395f440cd4a1a10059c8698e4cfda7e59b557f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/bundle.json","state_url":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMX2QO3Q747TWZRZNGT76CT2LM/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-05T10:45:29Z","links":{"resolver":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM","bundle":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/bundle.json","state":"https://pith.science/pith/NMX2QO3Q747TWZRZNGT76CT2LM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMX2QO3Q747TWZRZNGT76CT2LM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NMX2QO3Q747TWZRZNGT76CT2LM","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":"62c8a199dc8b99b408ccf68d7c81f044e44ef92be96a669ca632a12919a59fb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T21:38:17Z","title_canon_sha256":"f5c2214e7151d7cbe60b5f9df484cb4ce531b25e8cfbf688c9a80200e72dd8e8"},"schema_version":"1.0","source":{"id":"1509.01618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01618","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01618v2","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01618","created_at":"2026-05-18T01:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"NMX2QO3Q747T","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NMX2QO3Q747TWZRZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NMX2QO3Q","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:d1cc3d96dbd2c029dabc3e4c5d395f440cd4a1a10059c8698e4cfda7e59b557f","target":"graph","created_at":"2026-05-18T01:13:24Z","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) 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 ","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T21:38:17Z","title":"Efficient Sampling for k-Determinantal Point Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01618","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:cf4eefd93edaddbbb4b3a987d4b660a9369201482c182fa7b8e10de38f21f44e","target":"record","created_at":"2026-05-18T01:13:24Z","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":"62c8a199dc8b99b408ccf68d7c81f044e44ef92be96a669ca632a12919a59fb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T21:38:17Z","title_canon_sha256":"f5c2214e7151d7cbe60b5f9df484cb4ce531b25e8cfbf688c9a80200e72dd8e8"},"schema_version":"1.0","source":{"id":"1509.01618","kind":"arxiv","version":2}},"canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b2fa83b70ff3f3b663969a7ff0a7a5b30267bdce169d6675872501252cc1fec","first_computed_at":"2026-05-18T01:13:24.102033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:24.102033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s1m7c+KW0YL05vwa6MEIP9Hb8/xSDg+n/zK7uRkXGVREv7HSUXKc6p8c5nIj14f4Z3ekuPIiEMxWNrt/tgONBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:24.102464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf4eefd93edaddbbb4b3a987d4b660a9369201482c182fa7b8e10de38f21f44e","sha256:d1cc3d96dbd2c029dabc3e4c5d395f440cd4a1a10059c8698e4cfda7e59b557f"],"state_sha256":"66c32faa72f23c3b9b7e65d0708f89cbad59e91f593fd58c1e20f95528db1261"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnCxutHWQ5oSFsAhgpgFlrAx2sCWcepO/Xr5jYirV2HTiKeTG38JxD+4XNuIS7u/83dyFEz/hZoTdf952D6UAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:45:29.315917Z","bundle_sha256":"b69dad39619524ab9924367ccd81a12e6d498b8a266bd9d4f62909ff7a3f121a"}}