{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V6WC2MWXWCSNOUA22HT2KZZIUE","short_pith_number":"pith:V6WC2MWX","canonical_record":{"source":{"id":"1709.00151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-01T04:34:37Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"d3bb07832e2858d2322cfe842065308267b8a65fef328deb4444c3812af193ea","abstract_canon_sha256":"5f6514d602b2fadb6022228cdcd7fce28fef24049618bf0d672a7f40f8087d09"},"schema_version":"1.0"},"canonical_sha256":"afac2d32d7b0a4d7501ad1e7a56728a1251f717adef1181c2ed8afeaf868027b","source":{"kind":"arxiv","id":"1709.00151","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00151","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00151v3","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00151","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"V6WC2MWXWCSN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6WC2MWXWCSNOUA2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6WC2MWX","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V6WC2MWXWCSNOUA22HT2KZZIUE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-01T04:34:37Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"d3bb07832e2858d2322cfe842065308267b8a65fef328deb4444c3812af193ea","abstract_canon_sha256":"5f6514d602b2fadb6022228cdcd7fce28fef24049618bf0d672a7f40f8087d09"},"schema_version":"1.0"},"canonical_sha256":"afac2d32d7b0a4d7501ad1e7a56728a1251f717adef1181c2ed8afeaf868027b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.255339Z","signature_b64":"8nEct3UtbxVZiy2W/z8hqc5CfMg3wvxGCeT1wiZX8Vlmr7YHjOf15GtFJqhJ5TvwEbBt6fbT0H3Bky2R/yGsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afac2d32d7b0a4d7501ad1e7a56728a1251f717adef1181c2ed8afeaf868027b","last_reissued_at":"2026-05-17T23:40:56.254665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.254665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00151","source_version":3,"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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBqWTnRssvrwicddGMIQNRT1GSxCTMztW9MNOZ8d+BExT3hRbw6g0DI9UhXQnQRW8lOG0QbFm8yVNuVeR5CSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:57:43.473753Z"},"content_sha256":"accfc1033b784420971ddc3f74f83864efebde35b17e3e3b007007c1b13a26a0","schema_version":"1.0","event_id":"sha256:accfc1033b784420971ddc3f74f83864efebde35b17e3e3b007007c1b13a26a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V6WC2MWXWCSNOUA22HT2KZZIUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately Optimal Subset Selection for Statistical Design and Modelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"James V. Zidek, Nhu D. Le, Yu Wang","submitted_at":"2017-09-01T04:34:37Z","abstract_excerpt":"We study the problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive definite matrix that characterizes the chosen subset. This problem arises in many domains, such as experimental designs, regression modeling, and environmental statistics. We establish an efficient polynomial-time algorithm using Determinantal Point Process for approximating the optimal solution to the problem. We demonstrate the advantages of our methods by presenting compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00151","kind":"arxiv","version":3},"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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"351SmRRy+0Xe0gBlbc9fPWimsAUZTjzyskwu95gInfZa7C7MolOaJFQoaP/LNvFy4/vh/pN0Q45CrlUZ7FQIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:57:43.474097Z"},"content_sha256":"474b29165340edc02cea1fe7084eff74b4865a3bf098c0134bd3ffd91452ab84","schema_version":"1.0","event_id":"sha256:474b29165340edc02cea1fe7084eff74b4865a3bf098c0134bd3ffd91452ab84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/bundle.json","state_url":"https://pith.science/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/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-21T00:57:43Z","links":{"resolver":"https://pith.science/pith/V6WC2MWXWCSNOUA22HT2KZZIUE","bundle":"https://pith.science/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/bundle.json","state":"https://pith.science/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6WC2MWXWCSNOUA22HT2KZZIUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V6WC2MWXWCSNOUA22HT2KZZIUE","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":"5f6514d602b2fadb6022228cdcd7fce28fef24049618bf0d672a7f40f8087d09","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-01T04:34:37Z","title_canon_sha256":"d3bb07832e2858d2322cfe842065308267b8a65fef328deb4444c3812af193ea"},"schema_version":"1.0","source":{"id":"1709.00151","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00151","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00151v3","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00151","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"V6WC2MWXWCSN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6WC2MWXWCSNOUA2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6WC2MWX","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:474b29165340edc02cea1fe7084eff74b4865a3bf098c0134bd3ffd91452ab84","target":"graph","created_at":"2026-05-17T23:40:56Z","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 problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive definite matrix that characterizes the chosen subset. This problem arises in many domains, such as experimental designs, regression modeling, and environmental statistics. We establish an efficient polynomial-time algorithm using Determinantal Point Process for approximating the optimal solution to the problem. We demonstrate the advantages of our methods by presenting compu","authors_text":"James V. Zidek, Nhu D. Le, Yu Wang","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-01T04:34:37Z","title":"Approximately Optimal Subset Selection for Statistical Design and Modelling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00151","kind":"arxiv","version":3},"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:accfc1033b784420971ddc3f74f83864efebde35b17e3e3b007007c1b13a26a0","target":"record","created_at":"2026-05-17T23:40:56Z","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":"5f6514d602b2fadb6022228cdcd7fce28fef24049618bf0d672a7f40f8087d09","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-01T04:34:37Z","title_canon_sha256":"d3bb07832e2858d2322cfe842065308267b8a65fef328deb4444c3812af193ea"},"schema_version":"1.0","source":{"id":"1709.00151","kind":"arxiv","version":3}},"canonical_sha256":"afac2d32d7b0a4d7501ad1e7a56728a1251f717adef1181c2ed8afeaf868027b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afac2d32d7b0a4d7501ad1e7a56728a1251f717adef1181c2ed8afeaf868027b","first_computed_at":"2026-05-17T23:40:56.254665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.254665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8nEct3UtbxVZiy2W/z8hqc5CfMg3wvxGCeT1wiZX8Vlmr7YHjOf15GtFJqhJ5TvwEbBt6fbT0H3Bky2R/yGsBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.255339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00151","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:accfc1033b784420971ddc3f74f83864efebde35b17e3e3b007007c1b13a26a0","sha256:474b29165340edc02cea1fe7084eff74b4865a3bf098c0134bd3ffd91452ab84"],"state_sha256":"3f00e4781c5e5fe5e1ea9ed16bd59f2565b454ea28ecbf3adb81b663d4eb980f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBTI2j0tn8EjPD/ihBFYG9atQMYRsxcSKVkmq6SBOTkL7ACJy/sbNcG7+zU/FVZ9UN+pr6Mn3EmX8+sMkvTkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T00:57:43.476064Z","bundle_sha256":"25b1647dc9635b374a7449cba58ced939a79f5e8b068879a588909350e53ac25"}}