{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T3V7OMEU6H65654PEDTRYGU6YF","short_pith_number":"pith:T3V7OMEU","canonical_record":{"source":{"id":"1601.02068","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-09T03:05:31Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"fc4f89b1c0c828da44ec1efa80897a84dc6e7a36c6731cc4b476cb004229ccad","abstract_canon_sha256":"8ab6945088f02d45f1bc165b4f9a945f26102837fab6446b37768fb86baa2676"},"schema_version":"1.0"},"canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","source":{"kind":"arxiv","id":"1601.02068","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02068","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02068v6","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02068","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"T3V7OMEU6H65","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3V7OMEU6H65654P","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3V7OMEU","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T3V7OMEU6H65654PEDTRYGU6YF","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02068","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-09T03:05:31Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"fc4f89b1c0c828da44ec1efa80897a84dc6e7a36c6731cc4b476cb004229ccad","abstract_canon_sha256":"8ab6945088f02d45f1bc165b4f9a945f26102837fab6446b37768fb86baa2676"},"schema_version":"1.0"},"canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:36.809085Z","signature_b64":"/oHwz7mZNlc7z4SzKD2YXwxHPOWfoiD82cM+WzHPHx3IFzcd0CezGXTud6Ri3Wf9dqbFCNJDFx2g7Wz0S1+kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","last_reissued_at":"2026-05-18T00:27:36.808373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:36.808373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02068","source_version":6,"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-18T00:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcg4HiiiAPrMUCQ1BMkHkK/zPqWY0Kn3ZI7kkQwxlz/7SX1GxrVmBQ/IPe3IQPbocdN80qV3xtvgjOYOzD4FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:28:31.994327Z"},"content_sha256":"c3a6c427fe3220db701b1d8cc7835ae09029c38eeb1a714b84d2fca92e4b138a","schema_version":"1.0","event_id":"sha256:c3a6c427fe3220db701b1d8cc7835ae09029c38eeb1a714b84d2fca92e4b138a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T3V7OMEU6H65654PEDTRYGU6YF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Adams Wei Yu, Yining Wang","submitted_at":"2016-01-09T03:05:31Z","abstract_excerpt":"We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models and Delta's method (estimating functions of linear regression models) as well. The algorithms are based on a continuous relaxation of an otherwise intractable combinatorial optimization problem, with sampling or greedy procedures as post-processing steps. Formal approximation guarantees are established for both algorithms, and numerical results on both synt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02068","kind":"arxiv","version":6},"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-18T00:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hs7Mm3jArYv5CEh7H7My8V8bebvLzleI21CS8YGi+NQFt8tJ1fY9qp8v0lI96w3D7yA250scviMThmkp0auzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:28:31.994980Z"},"content_sha256":"3a76bfd5f6f900a209335695780b218137e78f2fbe6296dcd4d7be6276255cb7","schema_version":"1.0","event_id":"sha256:3a76bfd5f6f900a209335695780b218137e78f2fbe6296dcd4d7be6276255cb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/bundle.json","state_url":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3V7OMEU6H65654PEDTRYGU6YF/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-08-12T21:28:31Z","links":{"resolver":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF","bundle":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/bundle.json","state":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3V7OMEU6H65654PEDTRYGU6YF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T3V7OMEU6H65654PEDTRYGU6YF","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":"8ab6945088f02d45f1bc165b4f9a945f26102837fab6446b37768fb86baa2676","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-09T03:05:31Z","title_canon_sha256":"fc4f89b1c0c828da44ec1efa80897a84dc6e7a36c6731cc4b476cb004229ccad"},"schema_version":"1.0","source":{"id":"1601.02068","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02068","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02068v6","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02068","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"T3V7OMEU6H65","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3V7OMEU6H65654P","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3V7OMEU","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:3a76bfd5f6f900a209335695780b218137e78f2fbe6296dcd4d7be6276255cb7","target":"graph","created_at":"2026-05-18T00:27:36Z","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 derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models and Delta's method (estimating functions of linear regression models) as well. The algorithms are based on a continuous relaxation of an otherwise intractable combinatorial optimization problem, with sampling or greedy procedures as post-processing steps. Formal approximation guarantees are established for both algorithms, and numerical results on both synt","authors_text":"Aarti Singh, Adams Wei Yu, Yining Wang","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-09T03:05:31Z","title":"On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02068","kind":"arxiv","version":6},"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:c3a6c427fe3220db701b1d8cc7835ae09029c38eeb1a714b84d2fca92e4b138a","target":"record","created_at":"2026-05-18T00:27:36Z","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":"8ab6945088f02d45f1bc165b4f9a945f26102837fab6446b37768fb86baa2676","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-09T03:05:31Z","title_canon_sha256":"fc4f89b1c0c828da44ec1efa80897a84dc6e7a36c6731cc4b476cb004229ccad"},"schema_version":"1.0","source":{"id":"1601.02068","kind":"arxiv","version":6}},"canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","first_computed_at":"2026-05-18T00:27:36.808373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:36.808373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oHwz7mZNlc7z4SzKD2YXwxHPOWfoiD82cM+WzHPHx3IFzcd0CezGXTud6Ri3Wf9dqbFCNJDFx2g7Wz0S1+kAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:36.809085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02068","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a6c427fe3220db701b1d8cc7835ae09029c38eeb1a714b84d2fca92e4b138a","sha256:3a76bfd5f6f900a209335695780b218137e78f2fbe6296dcd4d7be6276255cb7"],"state_sha256":"afef24956e20323dd86c5971f565d2251d340eec9d72cb7b8d01d370b94cf2e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXpMG70Ufvxa8AQSyTymCE793Oynk2589FXycsCOWs8lrPME5gPMN2MNbO3FUd35G6qEaxeBNtsojDSW+L1aDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:28:32.000716Z","bundle_sha256":"d2bb043a4de0eeab90aefd28326cd76faeedc1dc992eb742c4f13a881e29063e"}}