{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XF5WJJT3GEU46TMAL5KEMWZLPG","short_pith_number":"pith:XF5WJJT3","schema_version":"1.0","canonical_sha256":"b97b64a67b3129cf4d805f54465b2b798f1e01a844b18c5be9ebd7a1377427c6","source":{"kind":"arxiv","id":"1302.6088","version":1},"attestation_state":"computed","paper":{"title":"An efficient algorithm for structured sparse quantile regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ignace Loris, Vahid Nassiri","submitted_at":"2013-02-25T13:34:48Z","abstract_excerpt":"Quantile regression is studied in combination with a penalty which promotes structured (or group) sparsity. A mixed $\\ell_{1,\\infty}$-norm on the parameter vector is used to impose structured sparsity on the traditional quantile regression problem. An algorithm is derived to calculate the piece-wise linear solution path of the corresponding minimization problem. A Matlab implementation of the proposed algorithm is provided and some applications of the methods are also studied."},"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":"1302.6088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-25T13:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"d61121ac99893182b03a42bb1c93d5d903a3f6fbc621746a615e7db2d31aa00a","abstract_canon_sha256":"202b566d35808489d4f3a4b134bcf30ce4ce7ed553c47d58c94c0343c1e197ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:32.596874Z","signature_b64":"HinYxI6zShCeBNf2A6m952OzMmDddvBX9DQaWhJJD2l1llZrsV5thfFS70TcMdrtS1W3oK76jz3snKDsAeyvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b97b64a67b3129cf4d805f54465b2b798f1e01a844b18c5be9ebd7a1377427c6","last_reissued_at":"2026-05-18T03:32:32.596103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:32.596103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm for structured sparse quantile regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ignace Loris, Vahid Nassiri","submitted_at":"2013-02-25T13:34:48Z","abstract_excerpt":"Quantile regression is studied in combination with a penalty which promotes structured (or group) sparsity. A mixed $\\ell_{1,\\infty}$-norm on the parameter vector is used to impose structured sparsity on the traditional quantile regression problem. An algorithm is derived to calculate the piece-wise linear solution path of the corresponding minimization problem. A Matlab implementation of the proposed algorithm is provided and some applications of the methods are also studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6088","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":"1302.6088","created_at":"2026-05-18T03:32:32.596227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6088v1","created_at":"2026-05-18T03:32:32.596227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6088","created_at":"2026-05-18T03:32:32.596227+00:00"},{"alias_kind":"pith_short_12","alias_value":"XF5WJJT3GEU4","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XF5WJJT3GEU46TMA","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XF5WJJT3","created_at":"2026-05-18T12:28:06.772260+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/XF5WJJT3GEU46TMAL5KEMWZLPG","json":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG.json","graph_json":"https://pith.science/api/pith-number/XF5WJJT3GEU46TMAL5KEMWZLPG/graph.json","events_json":"https://pith.science/api/pith-number/XF5WJJT3GEU46TMAL5KEMWZLPG/events.json","paper":"https://pith.science/paper/XF5WJJT3"},"agent_actions":{"view_html":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG","download_json":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG.json","view_paper":"https://pith.science/paper/XF5WJJT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6088&json=true","fetch_graph":"https://pith.science/api/pith-number/XF5WJJT3GEU46TMAL5KEMWZLPG/graph.json","fetch_events":"https://pith.science/api/pith-number/XF5WJJT3GEU46TMAL5KEMWZLPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG/action/storage_attestation","attest_author":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG/action/author_attestation","sign_citation":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG/action/citation_signature","submit_replication":"https://pith.science/pith/XF5WJJT3GEU46TMAL5KEMWZLPG/action/replication_record"}},"created_at":"2026-05-18T03:32:32.596227+00:00","updated_at":"2026-05-18T03:32:32.596227+00:00"}