{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EGCE7R2FH4YZAXBV2M23I3J3KL","short_pith_number":"pith:EGCE7R2F","schema_version":"1.0","canonical_sha256":"21844fc7453f31905c35d335b46d3b52d3d400e3a9ed64092817b7f27a266f20","source":{"kind":"arxiv","id":"1907.07502","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cynthia Rush, Jason Klusowski, Weijie Su, Zhiqi Bu","submitted_at":"2019-07-17T13:21:51Z","abstract_excerpt":"SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the SLOPE solution. In this paper, we develop an asymptotically exact characterization of the SLOPE solution under Gaussian random designs through solving the SLOPE problem using approximate message passing (AMP). This algorithmic approach allows us to approximate the SLOPE solution via the much more amenable"},"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":"1907.07502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-17T13:21:51Z","cross_cats_sorted":["cs.LG","eess.SP","math.ST","stat.TH"],"title_canon_sha256":"c108bc35e81d9fdef76cf42f048f40c4c13201f66e53a90d7560c822dd472ced","abstract_canon_sha256":"bb31ba87a8a866dfb6c313d045165d779841bc47d2a608762ee74bf743323d0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.000931Z","signature_b64":"l/ycR7o9aBHpYDamb2FWnh904+NVqz8ZmXz2vumpn0nOV0T1WgtMlrDNYGFF2/5ilWTiVBACaCc/HXLRA/VWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21844fc7453f31905c35d335b46d3b52d3d400e3a9ed64092817b7f27a266f20","last_reissued_at":"2026-05-17T23:40:22.000270Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.000270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cynthia Rush, Jason Klusowski, Weijie Su, Zhiqi Bu","submitted_at":"2019-07-17T13:21:51Z","abstract_excerpt":"SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the SLOPE solution. In this paper, we develop an asymptotically exact characterization of the SLOPE solution under Gaussian random designs through solving the SLOPE problem using approximate message passing (AMP). This algorithmic approach allows us to approximate the SLOPE solution via the much more amenable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07502","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":"1907.07502","created_at":"2026-05-17T23:40:22.000373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07502v1","created_at":"2026-05-17T23:40:22.000373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07502","created_at":"2026-05-17T23:40:22.000373+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGCE7R2FH4YZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGCE7R2FH4YZAXBV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGCE7R2F","created_at":"2026-05-18T12:33:15.570797+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/EGCE7R2FH4YZAXBV2M23I3J3KL","json":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL.json","graph_json":"https://pith.science/api/pith-number/EGCE7R2FH4YZAXBV2M23I3J3KL/graph.json","events_json":"https://pith.science/api/pith-number/EGCE7R2FH4YZAXBV2M23I3J3KL/events.json","paper":"https://pith.science/paper/EGCE7R2F"},"agent_actions":{"view_html":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL","download_json":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL.json","view_paper":"https://pith.science/paper/EGCE7R2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07502&json=true","fetch_graph":"https://pith.science/api/pith-number/EGCE7R2FH4YZAXBV2M23I3J3KL/graph.json","fetch_events":"https://pith.science/api/pith-number/EGCE7R2FH4YZAXBV2M23I3J3KL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL/action/storage_attestation","attest_author":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL/action/author_attestation","sign_citation":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL/action/citation_signature","submit_replication":"https://pith.science/pith/EGCE7R2FH4YZAXBV2M23I3J3KL/action/replication_record"}},"created_at":"2026-05-17T23:40:22.000373+00:00","updated_at":"2026-05-17T23:40:22.000373+00:00"}