{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:77QCCTVAPBED67ZRUP52FAH5XL","short_pith_number":"pith:77QCCTVA","canonical_record":{"source":{"id":"1411.1805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-07T01:09:40Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"9781c3f17f810776f9755112a1187b12addb84b3bd28a2238dd1791259ed0e82","abstract_canon_sha256":"c27ad81600be9a1bd1db6dd33dba22ecc7968721994676a6db16ac257f010478"},"schema_version":"1.0"},"canonical_sha256":"ffe0214ea078483f7f31a3fba280fdbaf63c05077d417076761043ccb95d123c","source":{"kind":"arxiv","id":"1411.1805","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1805","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1805v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1805","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"77QCCTVAPBED","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"77QCCTVAPBED67ZR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"77QCCTVA","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:77QCCTVAPBED67ZRUP52FAH5XL","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-07T01:09:40Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"9781c3f17f810776f9755112a1187b12addb84b3bd28a2238dd1791259ed0e82","abstract_canon_sha256":"c27ad81600be9a1bd1db6dd33dba22ecc7968721994676a6db16ac257f010478"},"schema_version":"1.0"},"canonical_sha256":"ffe0214ea078483f7f31a3fba280fdbaf63c05077d417076761043ccb95d123c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.533309Z","signature_b64":"ZzC6wSc2DX54Itky6LUXm05yrqIurAPQLyC9qFy9WtBA25x5zSoIq+Ep3ZRzPLYXXRfN3AaP4XhLn19Raoj7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffe0214ea078483f7f31a3fba280fdbaf63c05077d417076761043ccb95d123c","last_reissued_at":"2026-05-18T02:34:51.532953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.532953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1805","source_version":2,"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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLf5TT6MPWcMUIXbiP6fD7pRMhebHS1v11rTsmAHz6lrBddb+TXgFMGRp+8OQigbiqO2Y0X3QFtj7LaJxCFnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:25:51.083925Z"},"content_sha256":"eb8139c9d8e6cdcd0757074d09b416247f115284d224f999b3f5c061c5af4aca","schema_version":"1.0","event_id":"sha256:eb8139c9d8e6cdcd0757074d09b416247f115284d224f999b3f5c061c5af4aca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:77QCCTVAPBED67ZRUP52FAH5XL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faithful Variable Screening for High-Dimensional Convex Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"John Lafferty, Minhua Chen, Min Xu","submitted_at":"2014-11-07T01:09:40Z","abstract_excerpt":"We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that estimates a sum of one-dimensional convex functions, followed by one-dimensional concave regression fits on the residuals. In contrast to previous methods for sparse additive models, the optimization is finite dimensional and requires no tuning parameters for smoothness. Under a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1805","kind":"arxiv","version":2},"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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg7+vt0ve+71KGjyz51sAGY17CWZ5o7yccJuS479VK5EbfMoq9/rs9f4oPYze/z7x8ZoIZH2YpNpDHt/Iyg9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:25:51.084619Z"},"content_sha256":"f058e827893149ff9f68b9f6e990e820980e32a81e64772e5dddc9ca523c0c79","schema_version":"1.0","event_id":"sha256:f058e827893149ff9f68b9f6e990e820980e32a81e64772e5dddc9ca523c0c79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77QCCTVAPBED67ZRUP52FAH5XL/bundle.json","state_url":"https://pith.science/pith/77QCCTVAPBED67ZRUP52FAH5XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77QCCTVAPBED67ZRUP52FAH5XL/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-05-25T09:25:51Z","links":{"resolver":"https://pith.science/pith/77QCCTVAPBED67ZRUP52FAH5XL","bundle":"https://pith.science/pith/77QCCTVAPBED67ZRUP52FAH5XL/bundle.json","state":"https://pith.science/pith/77QCCTVAPBED67ZRUP52FAH5XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77QCCTVAPBED67ZRUP52FAH5XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:77QCCTVAPBED67ZRUP52FAH5XL","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":"c27ad81600be9a1bd1db6dd33dba22ecc7968721994676a6db16ac257f010478","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-07T01:09:40Z","title_canon_sha256":"9781c3f17f810776f9755112a1187b12addb84b3bd28a2238dd1791259ed0e82"},"schema_version":"1.0","source":{"id":"1411.1805","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1805","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1805v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1805","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"77QCCTVAPBED","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"77QCCTVAPBED67ZR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"77QCCTVA","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:f058e827893149ff9f68b9f6e990e820980e32a81e64772e5dddc9ca523c0c79","target":"graph","created_at":"2026-05-18T02:34:51Z","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 variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that estimates a sum of one-dimensional convex functions, followed by one-dimensional concave regression fits on the residuals. In contrast to previous methods for sparse additive models, the optimization is finite dimensional and requires no tuning parameters for smoothness. Under a","authors_text":"John Lafferty, Minhua Chen, Min Xu","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-07T01:09:40Z","title":"Faithful Variable Screening for High-Dimensional Convex Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1805","kind":"arxiv","version":2},"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:eb8139c9d8e6cdcd0757074d09b416247f115284d224f999b3f5c061c5af4aca","target":"record","created_at":"2026-05-18T02:34:51Z","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":"c27ad81600be9a1bd1db6dd33dba22ecc7968721994676a6db16ac257f010478","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-07T01:09:40Z","title_canon_sha256":"9781c3f17f810776f9755112a1187b12addb84b3bd28a2238dd1791259ed0e82"},"schema_version":"1.0","source":{"id":"1411.1805","kind":"arxiv","version":2}},"canonical_sha256":"ffe0214ea078483f7f31a3fba280fdbaf63c05077d417076761043ccb95d123c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffe0214ea078483f7f31a3fba280fdbaf63c05077d417076761043ccb95d123c","first_computed_at":"2026-05-18T02:34:51.532953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.532953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZzC6wSc2DX54Itky6LUXm05yrqIurAPQLyC9qFy9WtBA25x5zSoIq+Ep3ZRzPLYXXRfN3AaP4XhLn19Raoj7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.533309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1805","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8139c9d8e6cdcd0757074d09b416247f115284d224f999b3f5c061c5af4aca","sha256:f058e827893149ff9f68b9f6e990e820980e32a81e64772e5dddc9ca523c0c79"],"state_sha256":"7d44f409c7bd09504eac55d3d5805df1b595a95b1b6d9e7af9b169be10bae262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiAeRUpLV7xoOz4tWNxoOeH/J8A6D0WDDrSfQkCLhk1lXV30faKn1iV2+PD6p6AY4XJmz6wDkAmhcz5Ij40/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:25:51.087912Z","bundle_sha256":"94e0959e4abaddf415a857c36a0e03b3e92e52b9ea692f98178ede6cc7fb545f"}}