{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BJ3XKRFWU3MPYSYSARJQAVBCZD","short_pith_number":"pith:BJ3XKRFW","canonical_record":{"source":{"id":"1812.09771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-23T20:23:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8af4aaa69335e92fc54b35d7d275ac5732eddf8ed68a0c480f456095883353ec","abstract_canon_sha256":"87fdb15bb725d712a7fc45fa5d081ec290099376e4efbcb887a563f33d437482"},"schema_version":"1.0"},"canonical_sha256":"0a777544b6a6d8fc4b120453005422c8e409bca40855b22987d97420314944b7","source":{"kind":"arxiv","id":"1812.09771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09771","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09771v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09771","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"BJ3XKRFWU3MP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BJ3XKRFWU3MPYSYS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BJ3XKRFW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BJ3XKRFWU3MPYSYSARJQAVBCZD","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-23T20:23:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8af4aaa69335e92fc54b35d7d275ac5732eddf8ed68a0c480f456095883353ec","abstract_canon_sha256":"87fdb15bb725d712a7fc45fa5d081ec290099376e4efbcb887a563f33d437482"},"schema_version":"1.0"},"canonical_sha256":"0a777544b6a6d8fc4b120453005422c8e409bca40855b22987d97420314944b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.852514Z","signature_b64":"JhiUuWQgVLGYgQb8dXjCQfrw4NzR8OSZHngGNEKdE6xzT3yRtqbqTng1GTcb/ov2fmYFtD1emGUrWZqH4hERDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a777544b6a6d8fc4b120453005422c8e409bca40855b22987d97420314944b7","last_reissued_at":"2026-05-17T23:57:26.851787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.851787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09771","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3RICkF8DThnhnvc6QylRGbN7xYqfxWG0FA3rgPHtwr4j4R8TuyScw0L5biSk2Q4+C4gK1UH+fISVC+IBcxHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:50:14.798427Z"},"content_sha256":"57e9787629df610bae73f800eb86be0be2bfb03197e8146dd79ff4876397ec96","schema_version":"1.0","event_id":"sha256:57e9787629df610bae73f800eb86be0be2bfb03197e8146dd79ff4876397ec96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BJ3XKRFWU3MPYSYSARJQAVBCZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A determinantal point process for column subset selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ayoub Belhadji, Pierre Chainais, R\\'emi Bardenet","submitted_at":"2018-12-23T20:23:00Z","abstract_excerpt":"Dimensionality reduction is a first step of many machine learning pipelines. Two popular approaches are principal component analysis, which projects onto a small number of well chosen but non-interpretable directions, and feature selection, which selects a small number of the original features. Feature selection can be abstracted as a numerical linear algebra problem called the column subset selection problem (CSSP). CSSP corresponds to selecting the best subset of columns of a matrix $X \\in \\mathbb{R}^{N \\times d}$, where \\emph{best} is often meant in the sense of minimizing the approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09771","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6049+JVQTVsiNH7nhMTTQTZMJi3i8ZN9FovFgaxGBpsGA44hSoRM0+ZVSqRP0FW5pQzaWcCAP2x4hEk61X8RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:50:14.799158Z"},"content_sha256":"769313f748f48d77282226200db3fe5fd8348ae7ce260848b44206e978e6bb63","schema_version":"1.0","event_id":"sha256:769313f748f48d77282226200db3fe5fd8348ae7ce260848b44206e978e6bb63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/bundle.json","state_url":"https://pith.science/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/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-10T06:50:14Z","links":{"resolver":"https://pith.science/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD","bundle":"https://pith.science/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/bundle.json","state":"https://pith.science/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJ3XKRFWU3MPYSYSARJQAVBCZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BJ3XKRFWU3MPYSYSARJQAVBCZD","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":"87fdb15bb725d712a7fc45fa5d081ec290099376e4efbcb887a563f33d437482","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-23T20:23:00Z","title_canon_sha256":"8af4aaa69335e92fc54b35d7d275ac5732eddf8ed68a0c480f456095883353ec"},"schema_version":"1.0","source":{"id":"1812.09771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09771","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09771v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09771","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"BJ3XKRFWU3MP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BJ3XKRFWU3MPYSYS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BJ3XKRFW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:769313f748f48d77282226200db3fe5fd8348ae7ce260848b44206e978e6bb63","target":"graph","created_at":"2026-05-17T23:57:26Z","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":"Dimensionality reduction is a first step of many machine learning pipelines. Two popular approaches are principal component analysis, which projects onto a small number of well chosen but non-interpretable directions, and feature selection, which selects a small number of the original features. Feature selection can be abstracted as a numerical linear algebra problem called the column subset selection problem (CSSP). CSSP corresponds to selecting the best subset of columns of a matrix $X \\in \\mathbb{R}^{N \\times d}$, where \\emph{best} is often meant in the sense of minimizing the approximation","authors_text":"Ayoub Belhadji, Pierre Chainais, R\\'emi Bardenet","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-23T20:23:00Z","title":"A determinantal point process for column subset selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09771","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:57e9787629df610bae73f800eb86be0be2bfb03197e8146dd79ff4876397ec96","target":"record","created_at":"2026-05-17T23:57:26Z","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":"87fdb15bb725d712a7fc45fa5d081ec290099376e4efbcb887a563f33d437482","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-23T20:23:00Z","title_canon_sha256":"8af4aaa69335e92fc54b35d7d275ac5732eddf8ed68a0c480f456095883353ec"},"schema_version":"1.0","source":{"id":"1812.09771","kind":"arxiv","version":1}},"canonical_sha256":"0a777544b6a6d8fc4b120453005422c8e409bca40855b22987d97420314944b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a777544b6a6d8fc4b120453005422c8e409bca40855b22987d97420314944b7","first_computed_at":"2026-05-17T23:57:26.851787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:26.851787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JhiUuWQgVLGYgQb8dXjCQfrw4NzR8OSZHngGNEKdE6xzT3yRtqbqTng1GTcb/ov2fmYFtD1emGUrWZqH4hERDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:26.852514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57e9787629df610bae73f800eb86be0be2bfb03197e8146dd79ff4876397ec96","sha256:769313f748f48d77282226200db3fe5fd8348ae7ce260848b44206e978e6bb63"],"state_sha256":"c2ae479c1c8c98acaf5a79d50a4bdce54e5cd2f0867cc7695120bb55e3cab19d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvOYca+Kw5L6jdA+NWGLXhxYhtrNHWMffgdqT/Sk1yW1FesK/AO/VYUoZijcRTqqqoc+xVHp5HUF7lmINOFWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:50:14.803349Z","bundle_sha256":"dd679c5743e55d77a5b4941295515b04477dad5b5979b9a46e89bafd6191389e"}}