{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BPBQHAVPIEJTSLCQR4AQI3KRHW","short_pith_number":"pith:BPBQHAVP","canonical_record":{"source":{"id":"1905.13476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T09:21:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a7c00a817ea42d53e9fe75d012af70324f9b9a73fae434cd93761b73d66a74d4","abstract_canon_sha256":"3ee07051ac05913b91b2e8aa855f2d159d5b54413d80589cda9451bf723b80e7"},"schema_version":"1.0"},"canonical_sha256":"0bc30382af4113392c508f01046d513dab96202c4ad95126a71b0c14a271c82f","source":{"kind":"arxiv","id":"1905.13476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13476","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13476v2","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13476","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"BPBQHAVPIEJT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BPBQHAVPIEJTSLCQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BPBQHAVP","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BPBQHAVPIEJTSLCQR4AQI3KRHW","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T09:21:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a7c00a817ea42d53e9fe75d012af70324f9b9a73fae434cd93761b73d66a74d4","abstract_canon_sha256":"3ee07051ac05913b91b2e8aa855f2d159d5b54413d80589cda9451bf723b80e7"},"schema_version":"1.0"},"canonical_sha256":"0bc30382af4113392c508f01046d513dab96202c4ad95126a71b0c14a271c82f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:08.086565Z","signature_b64":"cI1vlH2qeg6dHywU+IKeap5pxdXbtZYK1L/ikLAb1DNcG9AIEnfRtFATTWdVJRoGOedROsNR2TTFQ6GfNRomDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bc30382af4113392c508f01046d513dab96202c4ad95126a71b0c14a271c82f","last_reissued_at":"2026-05-17T23:41:08.085946Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:08.085946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13476","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-17T23:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Radk5Me2vNeL7Mp2wQhNTUhb2qSme0mLxvg51QtQtOLCTpAyTNc4nGXpFrqix16yJWRReREBk/b2pl+wwCPzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:15:00.276250Z"},"content_sha256":"6cd0c53e2e931be43a7767c7119f8c15798d0d358074c1fdc0cd9deae460cdf3","schema_version":"1.0","event_id":"sha256:6cd0c53e2e931be43a7767c7119f8c15798d0d358074c1fdc0cd9deae460cdf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BPBQHAVPIEJTSLCQR4AQI3KRHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact sampling of determinantal point processes with sublinear time preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniele Calandriello, Micha{\\l} Derezi\\'nski, Michal Valko","submitted_at":"2019-05-31T09:21:26Z","abstract_excerpt":"We study the complexity of sampling from a distribution over all index subsets of the set $\\{1,...,n\\}$ with the probability of a subset $S$ proportional to the determinant of the submatrix $\\mathbf{L}_S$ of some $n\\times n$ p.s.d. matrix $\\mathbf{L}$, where $\\mathbf{L}_S$ corresponds to the entries of $\\mathbf{L}$ indexed by $S$. Known as a determinantal point process, this distribution is used in machine learning to induce diversity in subset selection. In practice, we often wish to sample multiple subsets $S$ with small expected size $k = E[|S|] \\ll n$ from a very large matrix $\\mathbf{L}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13476","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-17T23:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21splPZlXd5DhHU4XRMgq0iKrBEsXgNo3PXxz5/jB8vCGuQ0aZ9hsXbOGrp/UGqE7qrFuGN0tvEd7DB96hiEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:15:00.276934Z"},"content_sha256":"adf5a9f86af08306a3d0cb8f918c4673f9f4e04869b804e9e54a2b8850fa5821","schema_version":"1.0","event_id":"sha256:adf5a9f86af08306a3d0cb8f918c4673f9f4e04869b804e9e54a2b8850fa5821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/bundle.json","state_url":"https://pith.science/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/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-05-31T20:15:00Z","links":{"resolver":"https://pith.science/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW","bundle":"https://pith.science/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/bundle.json","state":"https://pith.science/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPBQHAVPIEJTSLCQR4AQI3KRHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BPBQHAVPIEJTSLCQR4AQI3KRHW","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":"3ee07051ac05913b91b2e8aa855f2d159d5b54413d80589cda9451bf723b80e7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T09:21:26Z","title_canon_sha256":"a7c00a817ea42d53e9fe75d012af70324f9b9a73fae434cd93761b73d66a74d4"},"schema_version":"1.0","source":{"id":"1905.13476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13476","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13476v2","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13476","created_at":"2026-05-17T23:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"BPBQHAVPIEJT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BPBQHAVPIEJTSLCQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BPBQHAVP","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:adf5a9f86af08306a3d0cb8f918c4673f9f4e04869b804e9e54a2b8850fa5821","target":"graph","created_at":"2026-05-17T23:41:08Z","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":"We study the complexity of sampling from a distribution over all index subsets of the set $\\{1,...,n\\}$ with the probability of a subset $S$ proportional to the determinant of the submatrix $\\mathbf{L}_S$ of some $n\\times n$ p.s.d. matrix $\\mathbf{L}$, where $\\mathbf{L}_S$ corresponds to the entries of $\\mathbf{L}$ indexed by $S$. Known as a determinantal point process, this distribution is used in machine learning to induce diversity in subset selection. In practice, we often wish to sample multiple subsets $S$ with small expected size $k = E[|S|] \\ll n$ from a very large matrix $\\mathbf{L}$,","authors_text":"Daniele Calandriello, Micha{\\l} Derezi\\'nski, Michal Valko","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T09:21:26Z","title":"Exact sampling of determinantal point processes with sublinear time preprocessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13476","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:6cd0c53e2e931be43a7767c7119f8c15798d0d358074c1fdc0cd9deae460cdf3","target":"record","created_at":"2026-05-17T23:41:08Z","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":"3ee07051ac05913b91b2e8aa855f2d159d5b54413d80589cda9451bf723b80e7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T09:21:26Z","title_canon_sha256":"a7c00a817ea42d53e9fe75d012af70324f9b9a73fae434cd93761b73d66a74d4"},"schema_version":"1.0","source":{"id":"1905.13476","kind":"arxiv","version":2}},"canonical_sha256":"0bc30382af4113392c508f01046d513dab96202c4ad95126a71b0c14a271c82f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bc30382af4113392c508f01046d513dab96202c4ad95126a71b0c14a271c82f","first_computed_at":"2026-05-17T23:41:08.085946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:08.085946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cI1vlH2qeg6dHywU+IKeap5pxdXbtZYK1L/ikLAb1DNcG9AIEnfRtFATTWdVJRoGOedROsNR2TTFQ6GfNRomDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:08.086565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd0c53e2e931be43a7767c7119f8c15798d0d358074c1fdc0cd9deae460cdf3","sha256:adf5a9f86af08306a3d0cb8f918c4673f9f4e04869b804e9e54a2b8850fa5821"],"state_sha256":"f12cbae6bdb23cc0c80f1874cdbe1f2afdd7c4ea17c3ffbb4577f227b403ab68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miowUvq1nG2kWU/Px9kDeb699vWjlSO2XebR4F6yslFRXDT9Q0jtoRU3s+ArePHbm7by4PrUU3d5CYG3ub6VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:15:00.280728Z","bundle_sha256":"9ae8485ec714cb88c9845bb47be0fb82b1d0eaea8e8617cf558051a1138e63b7"}}