{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YILF5BJZT5MDKMCIX6FFMPRRBS","short_pith_number":"pith:YILF5BJZ","canonical_record":{"source":{"id":"1811.03717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T23:35:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9d9bb2703fb4519f243ae39eacdb8998fbb24d13f3a2271785a209ff4bc9d0f1","abstract_canon_sha256":"d0bdeb1b32e2fc71edb40c8d12dcdbec5ded55de0730dcdce9c2f2de3ab64f92"},"schema_version":"1.0"},"canonical_sha256":"c2165e85399f58353048bf8a563e310ca7ee365f1a9af183c435c7b15bea22bd","source":{"kind":"arxiv","id":"1811.03717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03717","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03717v2","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03717","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"YILF5BJZT5MD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YILF5BJZT5MDKMCI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YILF5BJZ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YILF5BJZT5MDKMCIX6FFMPRRBS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T23:35:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9d9bb2703fb4519f243ae39eacdb8998fbb24d13f3a2271785a209ff4bc9d0f1","abstract_canon_sha256":"d0bdeb1b32e2fc71edb40c8d12dcdbec5ded55de0730dcdce9c2f2de3ab64f92"},"schema_version":"1.0"},"canonical_sha256":"c2165e85399f58353048bf8a563e310ca7ee365f1a9af183c435c7b15bea22bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:58.576308Z","signature_b64":"2/QJVDbgiSQBnr2Z4uYN6Pk9k1PTJ0WCJ3JXZkqwxl7MxiBhtlF+TLdZyyx2MtZ1hQN8SpUHRhFDzFSFkEtkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2165e85399f58353048bf8a563e310ca7ee365f1a9af183c435c7b15bea22bd","last_reissued_at":"2026-05-17T23:52:58.575566Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:58.575566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03717","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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iW7nXAPWwPqQTd/rTt3jSYhmsLWvWJUXywwEwuVk/LKel66uTZd7Em8QqNbtiiGkpA37gVrYV+J5jzVR4GMaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:16:55.382443Z"},"content_sha256":"fe94db0c53f2532b1fa3713d11c57a0fac601ee3de8a0534a131705416ff5c39","schema_version":"1.0","event_id":"sha256:fe94db0c53f2532b1fa3713d11c57a0fac601ee3de8a0534a131705416ff5c39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YILF5BJZT5MDKMCIX6FFMPRRBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast determinantal point processes via distortion-free intermediate sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Micha{\\l} Derezi\\'nski","submitted_at":"2018-11-08T23:35:29Z","abstract_excerpt":"Given a fixed $n\\times d$ matrix $\\mathbf{X}$, where $n\\gg d$, we study the complexity of sampling from a distribution over all subsets of rows where the probability of a subset is proportional to the squared volume of the parallelepiped spanned by the rows (a.k.a. a determinantal point process). In this task, it is important to minimize the preprocessing cost of the procedure (performed once) as well as the sampling cost (performed repeatedly). To that end, we propose a new determinantal point process algorithm which has the following two properties, both of which are novel: (1) a preprocessi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03717","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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijq6rDGdcrNUbjRL79zuzJsBumb8nwu08t5QHT0pehoCyxdCeNCm1NK/unVvR0ivapW1+dOeQCJwIIFxaWL8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:16:55.383112Z"},"content_sha256":"8733cb586537d1189d6ffa130fcd02b69bb345bd07c2366d3a7567c1d7daf123","schema_version":"1.0","event_id":"sha256:8733cb586537d1189d6ffa130fcd02b69bb345bd07c2366d3a7567c1d7daf123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/bundle.json","state_url":"https://pith.science/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/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-07T18:16:55Z","links":{"resolver":"https://pith.science/pith/YILF5BJZT5MDKMCIX6FFMPRRBS","bundle":"https://pith.science/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/bundle.json","state":"https://pith.science/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YILF5BJZT5MDKMCIX6FFMPRRBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YILF5BJZT5MDKMCIX6FFMPRRBS","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":"d0bdeb1b32e2fc71edb40c8d12dcdbec5ded55de0730dcdce9c2f2de3ab64f92","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T23:35:29Z","title_canon_sha256":"9d9bb2703fb4519f243ae39eacdb8998fbb24d13f3a2271785a209ff4bc9d0f1"},"schema_version":"1.0","source":{"id":"1811.03717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03717","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03717v2","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03717","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"YILF5BJZT5MD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YILF5BJZT5MDKMCI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YILF5BJZ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:8733cb586537d1189d6ffa130fcd02b69bb345bd07c2366d3a7567c1d7daf123","target":"graph","created_at":"2026-05-17T23:52:58Z","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":"Given a fixed $n\\times d$ matrix $\\mathbf{X}$, where $n\\gg d$, we study the complexity of sampling from a distribution over all subsets of rows where the probability of a subset is proportional to the squared volume of the parallelepiped spanned by the rows (a.k.a. a determinantal point process). In this task, it is important to minimize the preprocessing cost of the procedure (performed once) as well as the sampling cost (performed repeatedly). To that end, we propose a new determinantal point process algorithm which has the following two properties, both of which are novel: (1) a preprocessi","authors_text":"Micha{\\l} Derezi\\'nski","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T23:35:29Z","title":"Fast determinantal point processes via distortion-free intermediate sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03717","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:fe94db0c53f2532b1fa3713d11c57a0fac601ee3de8a0534a131705416ff5c39","target":"record","created_at":"2026-05-17T23:52:58Z","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":"d0bdeb1b32e2fc71edb40c8d12dcdbec5ded55de0730dcdce9c2f2de3ab64f92","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T23:35:29Z","title_canon_sha256":"9d9bb2703fb4519f243ae39eacdb8998fbb24d13f3a2271785a209ff4bc9d0f1"},"schema_version":"1.0","source":{"id":"1811.03717","kind":"arxiv","version":2}},"canonical_sha256":"c2165e85399f58353048bf8a563e310ca7ee365f1a9af183c435c7b15bea22bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2165e85399f58353048bf8a563e310ca7ee365f1a9af183c435c7b15bea22bd","first_computed_at":"2026-05-17T23:52:58.575566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:58.575566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/QJVDbgiSQBnr2Z4uYN6Pk9k1PTJ0WCJ3JXZkqwxl7MxiBhtlF+TLdZyyx2MtZ1hQN8SpUHRhFDzFSFkEtkBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:58.576308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe94db0c53f2532b1fa3713d11c57a0fac601ee3de8a0534a131705416ff5c39","sha256:8733cb586537d1189d6ffa130fcd02b69bb345bd07c2366d3a7567c1d7daf123"],"state_sha256":"1b8d926abb2561a501a25e85fa33c759475caa43f8deb0fb4c7341c7eb87dedc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQvujFfjju0sk4vv1IC6oDdlaqRDUsZCriKdxZu9MqjRd+hSQQjVuZXMM8fSnP3BklaNysAa6H3yCwRvAavfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:16:55.387586Z","bundle_sha256":"e33e4b590ce66d8b102c3724875d209223c49035dfe2124ddb507884e824a020"}}