{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3FQJ5LRGTTDHJXNE74MX7C5VQ7","short_pith_number":"pith:3FQJ5LRG","canonical_record":{"source":{"id":"1901.02051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-07T20:42:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9e26a90c4a37bd2981cc5e2f186433d7c85f0cb1bc176abd43f11e285bbb0949","abstract_canon_sha256":"94194589f59b9df6330d9f8c6dcc7a12a36144969742a809edabba9a66484fb1"},"schema_version":"1.0"},"canonical_sha256":"d9609eae269cc674dda4ff197f8bb587c4940a21ad293d061141b7def42dcaf3","source":{"kind":"arxiv","id":"1901.02051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02051","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02051v1","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02051","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"3FQJ5LRGTTDH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FQJ5LRGTTDHJXNE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FQJ5LRG","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3FQJ5LRGTTDHJXNE74MX7C5VQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-07T20:42:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9e26a90c4a37bd2981cc5e2f186433d7c85f0cb1bc176abd43f11e285bbb0949","abstract_canon_sha256":"94194589f59b9df6330d9f8c6dcc7a12a36144969742a809edabba9a66484fb1"},"schema_version":"1.0"},"canonical_sha256":"d9609eae269cc674dda4ff197f8bb587c4940a21ad293d061141b7def42dcaf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:44.109721Z","signature_b64":"/Q53Pr6i6MP/ujvXNVLp6KXo2MJxvYGCiVWti94kz79gA+nmCcekRvnMCi2qbAJQaVo6+nK/ZBARAZwf+p4mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9609eae269cc674dda4ff197f8bb587c4940a21ad293d061141b7def42dcaf3","last_reissued_at":"2026-05-17T23:56:44.109345Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:44.109345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02051","source_version":1,"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:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wv89yvnoMMJFM0SJb57eELc8S0Gbsi9Y5bXRSArLLc33qZDUipEPbc1zynRwstCrnwzFMLil1TPubbY2iG+IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:45.758393Z"},"content_sha256":"5e032dba350711854a4e88a864bbfdcba14b3a5abd6ad267363861e4c4f4b7d3","schema_version":"1.0","event_id":"sha256:5e032dba350711854a4e88a864bbfdcba14b3a5abd6ad267363861e4c4f4b7d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3FQJ5LRGTTDHJXNE74MX7C5VQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DPPNet: Approximating Determinantal Point Processes with Deep Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jasper Snoek, Yaniv Ovadia, Zelda Mariet","submitted_at":"2019-01-07T20:42:13Z","abstract_excerpt":"Determinantal Point Processes (DPPs) provide an elegant and versatile way to sample sets of items that balance the point-wise quality with the set-wise diversity of selected items. For this reason, they have gained prominence in many machine learning applications that rely on subset selection. However, sampling from a DPP over a ground set of size $N$ is a costly operation, requiring in general an $O(N^3)$ preprocessing cost and an $O(Nk^3)$ sampling cost for subsets of size $k$. We approach this problem by introducing DPPNets: generative deep models that produce DPP-like samples for arbitrary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02051","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"},"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:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmNbXm9tdcgmaOzVBx71atZgPNid1u4zv4RcHas6rx5HdcRpDOdc+YjqQoc2troErnaadybn3yy6hYfGst8kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:45.758732Z"},"content_sha256":"0b7e29f6ddbddcd3b9e609b84ab5b0313aa0c6e2f67c7a785f1d00138d98b683","schema_version":"1.0","event_id":"sha256:0b7e29f6ddbddcd3b9e609b84ab5b0313aa0c6e2f67c7a785f1d00138d98b683"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/bundle.json","state_url":"https://pith.science/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/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-01T18:41:45Z","links":{"resolver":"https://pith.science/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7","bundle":"https://pith.science/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/bundle.json","state":"https://pith.science/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FQJ5LRGTTDHJXNE74MX7C5VQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3FQJ5LRGTTDHJXNE74MX7C5VQ7","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":"94194589f59b9df6330d9f8c6dcc7a12a36144969742a809edabba9a66484fb1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-07T20:42:13Z","title_canon_sha256":"9e26a90c4a37bd2981cc5e2f186433d7c85f0cb1bc176abd43f11e285bbb0949"},"schema_version":"1.0","source":{"id":"1901.02051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02051","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02051v1","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02051","created_at":"2026-05-17T23:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"3FQJ5LRGTTDH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FQJ5LRGTTDHJXNE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FQJ5LRG","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0b7e29f6ddbddcd3b9e609b84ab5b0313aa0c6e2f67c7a785f1d00138d98b683","target":"graph","created_at":"2026-05-17T23:56:44Z","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) provide an elegant and versatile way to sample sets of items that balance the point-wise quality with the set-wise diversity of selected items. For this reason, they have gained prominence in many machine learning applications that rely on subset selection. However, sampling from a DPP over a ground set of size $N$ is a costly operation, requiring in general an $O(N^3)$ preprocessing cost and an $O(Nk^3)$ sampling cost for subsets of size $k$. We approach this problem by introducing DPPNets: generative deep models that produce DPP-like samples for arbitrary","authors_text":"Jasper Snoek, Yaniv Ovadia, Zelda Mariet","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-07T20:42:13Z","title":"DPPNet: Approximating Determinantal Point Processes with Deep Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02051","kind":"arxiv","version":1},"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:5e032dba350711854a4e88a864bbfdcba14b3a5abd6ad267363861e4c4f4b7d3","target":"record","created_at":"2026-05-17T23:56:44Z","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":"94194589f59b9df6330d9f8c6dcc7a12a36144969742a809edabba9a66484fb1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-07T20:42:13Z","title_canon_sha256":"9e26a90c4a37bd2981cc5e2f186433d7c85f0cb1bc176abd43f11e285bbb0949"},"schema_version":"1.0","source":{"id":"1901.02051","kind":"arxiv","version":1}},"canonical_sha256":"d9609eae269cc674dda4ff197f8bb587c4940a21ad293d061141b7def42dcaf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9609eae269cc674dda4ff197f8bb587c4940a21ad293d061141b7def42dcaf3","first_computed_at":"2026-05-17T23:56:44.109345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:44.109345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Q53Pr6i6MP/ujvXNVLp6KXo2MJxvYGCiVWti94kz79gA+nmCcekRvnMCi2qbAJQaVo6+nK/ZBARAZwf+p4mAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:44.109721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e032dba350711854a4e88a864bbfdcba14b3a5abd6ad267363861e4c4f4b7d3","sha256:0b7e29f6ddbddcd3b9e609b84ab5b0313aa0c6e2f67c7a785f1d00138d98b683"],"state_sha256":"286dd9338ae55797e1b8c6280451b6ad125975aec39e4acc0fe04bcfae1ee5c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0wMXYeXyY2/Urs8V9yEAsZ2/I7Kk9E5I5CE0G6wu4yTx7fmoiW6B0fMP7bxKvk/zxISI7wQipjTN7pVWAlNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:41:45.760534Z","bundle_sha256":"e03cd140a4de54dd2dac24e6c5062c5f9883592d322aafb5e3f117a594e9e88c"}}