{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DE7R27L2KNOMHJXVHD7FQ63OPW","short_pith_number":"pith:DE7R27L2","schema_version":"1.0","canonical_sha256":"193f1d7d7a535cc3a6f538fe587b6e7d9ff98b5b354bb581223e0b84521fdf66","source":{"kind":"arxiv","id":"2412.04047","version":1},"attestation_state":"computed","paper":{"title":"Pathwise optimization for bridge-type estimators and its applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alessandro De Gregorio, Francesco Iafrate","submitted_at":"2024-12-05T10:38:29Z","abstract_excerpt":"Sparse parametric models are of great interest in statistical learning and are often analyzed by means of regularized estimators. Pathwise methods allow to efficiently compute the full solution path for penalized estimators, for any possible value of the penalization parameter $\\lambda$. In this paper we deal with the pathwise optimization for bridge-type problems; i.e. we are interested in the minimization of a loss function, such as negative log-likelihood or residual sum of squares, plus the sum of $\\ell^q$ norms with $q\\in(0,1]$ involving adpative coefficients. For some loss functions this"},"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":"2412.04047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-12-05T10:38:29Z","cross_cats_sorted":["cs.LG","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"8fb254f16e29a0061cdb6524437688edcdbc6cfe1f2f4e09da387dad4b53c4df","abstract_canon_sha256":"31f2fc80a5de8b5ad4c16279d76e16e0f1551b68c2bdae65d729efd3670638ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:58.448706Z","signature_b64":"oVhg/ndOH8wZLxjHqURdTrTHHDu6SjZVAW9cMFI4YOEm7+0+Bwu1/BTh5ZKZk/Ge3ALcVX1KwUJkqAfg1+S9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"193f1d7d7a535cc3a6f538fe587b6e7d9ff98b5b354bb581223e0b84521fdf66","last_reissued_at":"2026-07-05T09:44:58.448223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:58.448223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pathwise optimization for bridge-type estimators and its applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alessandro De Gregorio, Francesco Iafrate","submitted_at":"2024-12-05T10:38:29Z","abstract_excerpt":"Sparse parametric models are of great interest in statistical learning and are often analyzed by means of regularized estimators. Pathwise methods allow to efficiently compute the full solution path for penalized estimators, for any possible value of the penalization parameter $\\lambda$. In this paper we deal with the pathwise optimization for bridge-type problems; i.e. we are interested in the minimization of a loss function, such as negative log-likelihood or residual sum of squares, plus the sum of $\\ell^q$ norms with $q\\in(0,1]$ involving adpative coefficients. For some loss functions this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.04047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.04047","created_at":"2026-07-05T09:44:58.448301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04047v1","created_at":"2026-07-05T09:44:58.448301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04047","created_at":"2026-07-05T09:44:58.448301+00:00"},{"alias_kind":"pith_short_12","alias_value":"DE7R27L2KNOM","created_at":"2026-07-05T09:44:58.448301+00:00"},{"alias_kind":"pith_short_16","alias_value":"DE7R27L2KNOMHJXV","created_at":"2026-07-05T09:44:58.448301+00:00"},{"alias_kind":"pith_short_8","alias_value":"DE7R27L2","created_at":"2026-07-05T09:44:58.448301+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17779","citing_title":"Ergodic Network Stochastic Differential Equations","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW","json":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW.json","graph_json":"https://pith.science/api/pith-number/DE7R27L2KNOMHJXVHD7FQ63OPW/graph.json","events_json":"https://pith.science/api/pith-number/DE7R27L2KNOMHJXVHD7FQ63OPW/events.json","paper":"https://pith.science/paper/DE7R27L2"},"agent_actions":{"view_html":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW","download_json":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW.json","view_paper":"https://pith.science/paper/DE7R27L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04047&json=true","fetch_graph":"https://pith.science/api/pith-number/DE7R27L2KNOMHJXVHD7FQ63OPW/graph.json","fetch_events":"https://pith.science/api/pith-number/DE7R27L2KNOMHJXVHD7FQ63OPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW/action/storage_attestation","attest_author":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW/action/author_attestation","sign_citation":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW/action/citation_signature","submit_replication":"https://pith.science/pith/DE7R27L2KNOMHJXVHD7FQ63OPW/action/replication_record"}},"created_at":"2026-07-05T09:44:58.448301+00:00","updated_at":"2026-07-05T09:44:58.448301+00:00"}