{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TSUA5ARQZEP3G3XS4RANKELEHR","short_pith_number":"pith:TSUA5ARQ","schema_version":"1.0","canonical_sha256":"9ca80e8230c91fb36ef2e440d511643c41e623ff13e603513195015806dfda6d","source":{"kind":"arxiv","id":"1809.02857","version":1},"attestation_state":"computed","paper":{"title":"Computational Sufficiency, Reflection Groups, and Generalized Lasso Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Vincent Q. Vu","submitted_at":"2018-09-08T19:31:27Z","abstract_excerpt":"We study estimators with generalized lasso penalties within the computational sufficiency framework introduced by Vu (2018, arXiv:1807.05985). By representing these penalties as support functions of zonotopes and more generally Minkowski sums of line segments and rays, we show that there is a natural reflection group associated with the underlying optimization problem. A consequence of this point of view is that for large classes of estimators sharing the same penalty, the penalized least squares estimator is computationally minimal sufficient. This means that all such estimators can be comput"},"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":"1809.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-09-08T19:31:27Z","cross_cats_sorted":["stat.CO","stat.TH"],"title_canon_sha256":"a011217d013e821ff7e9ccb6b50faee10d33ad2e3df3ab2d995659790acffb28","abstract_canon_sha256":"f43a7d262876184574e5e94103da5a19778e54d875136d634ab2ca1d8ca72b08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.105105Z","signature_b64":"TBZ3HjftMHP/5wJxhGXZwZmXG4L0OPVakkV+Jk5GkXoAX4B5OBdhCwJu8yUfp/cJ9wxJC1DsCGzrb2GYIjM4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca80e8230c91fb36ef2e440d511643c41e623ff13e603513195015806dfda6d","last_reissued_at":"2026-05-18T00:06:15.104512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.104512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Sufficiency, Reflection Groups, and Generalized Lasso Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Vincent Q. Vu","submitted_at":"2018-09-08T19:31:27Z","abstract_excerpt":"We study estimators with generalized lasso penalties within the computational sufficiency framework introduced by Vu (2018, arXiv:1807.05985). By representing these penalties as support functions of zonotopes and more generally Minkowski sums of line segments and rays, we show that there is a natural reflection group associated with the underlying optimization problem. A consequence of this point of view is that for large classes of estimators sharing the same penalty, the penalized least squares estimator is computationally minimal sufficient. This means that all such estimators can be comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02857","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.02857","created_at":"2026-05-18T00:06:15.104595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02857v1","created_at":"2026-05-18T00:06:15.104595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02857","created_at":"2026-05-18T00:06:15.104595+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSUA5ARQZEP3","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSUA5ARQZEP3G3XS","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSUA5ARQ","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR","json":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR.json","graph_json":"https://pith.science/api/pith-number/TSUA5ARQZEP3G3XS4RANKELEHR/graph.json","events_json":"https://pith.science/api/pith-number/TSUA5ARQZEP3G3XS4RANKELEHR/events.json","paper":"https://pith.science/paper/TSUA5ARQ"},"agent_actions":{"view_html":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR","download_json":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR.json","view_paper":"https://pith.science/paper/TSUA5ARQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02857&json=true","fetch_graph":"https://pith.science/api/pith-number/TSUA5ARQZEP3G3XS4RANKELEHR/graph.json","fetch_events":"https://pith.science/api/pith-number/TSUA5ARQZEP3G3XS4RANKELEHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR/action/storage_attestation","attest_author":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR/action/author_attestation","sign_citation":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR/action/citation_signature","submit_replication":"https://pith.science/pith/TSUA5ARQZEP3G3XS4RANKELEHR/action/replication_record"}},"created_at":"2026-05-18T00:06:15.104595+00:00","updated_at":"2026-05-18T00:06:15.104595+00:00"}