{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T3V7OMEU6H65654PEDTRYGU6YF","short_pith_number":"pith:T3V7OMEU","schema_version":"1.0","canonical_sha256":"9eebf73094f1fddf778f20e71c1a9ec170e76b1b869fdf1719766a404c51ae90","source":{"kind":"arxiv","id":"1601.02068","version":6},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.02068","created_at":"2026-05-18T00:27:36.808487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02068v6","created_at":"2026-05-18T00:27:36.808487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02068","created_at":"2026-05-18T00:27:36.808487+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3V7OMEU6H65","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3V7OMEU6H65654P","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3V7OMEU","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05468","citing_title":"Hardness of A/E-Design under Partition Constraints","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF","json":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF.json","graph_json":"https://pith.science/api/pith-number/T3V7OMEU6H65654PEDTRYGU6YF/graph.json","events_json":"https://pith.science/api/pith-number/T3V7OMEU6H65654PEDTRYGU6YF/events.json","paper":"https://pith.science/paper/T3V7OMEU"},"agent_actions":{"view_html":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF","download_json":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF.json","view_paper":"https://pith.science/paper/T3V7OMEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02068&json=true","fetch_graph":"https://pith.science/api/pith-number/T3V7OMEU6H65654PEDTRYGU6YF/graph.json","fetch_events":"https://pith.science/api/pith-number/T3V7OMEU6H65654PEDTRYGU6YF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/action/storage_attestation","attest_author":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/action/author_attestation","sign_citation":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/action/citation_signature","submit_replication":"https://pith.science/pith/T3V7OMEU6H65654PEDTRYGU6YF/action/replication_record"}},"created_at":"2026-05-18T00:27:36.808487+00:00","updated_at":"2026-05-18T00:27:36.808487+00:00"}