{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NQBLPQOL4ZXENM7Y22TCH5LG2V","short_pith_number":"pith:NQBLPQOL","schema_version":"1.0","canonical_sha256":"6c02b7c1cbe66e46b3f8d6a623f566d54bcc2a3e1b7986781c1645f99ddf6159","source":{"kind":"arxiv","id":"1908.07220","version":3},"attestation_state":"computed","paper":{"title":"A Bayesian Lasso based Sparse Learning Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ingvild M. Helg{\\o}y, Yushu Li","submitted_at":"2019-08-20T08:36:14Z","abstract_excerpt":"The Bayesian Lasso is constructed in the linear regression framework and applies the Gibbs sampling to estimate the regression parameters. This paper develops a new sparse learning model, named the Bayesian Lasso Sparse (BLS) model, that takes the hierarchical model formulation of the Bayesian Lasso. The main difference from the original Bayesian Lasso lies in the estimation procedure; the BLS method uses a learning algorithm based on the type-II maximum likelihood procedure. Opposed to the Bayesian Lasso, the BLS provides sparse estimates of the regression parameters. The BLS method is also d"},"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":"1908.07220","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-20T08:36:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5c1b3b88119330502e7f5dd69259c6f7a350869a520b1f4d2007261e9b3d2e73","abstract_canon_sha256":"996d44af0355dc8f4a0c9233a59d1cab4b83512de1375b0f22b715921e96e77b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:05.531493Z","signature_b64":"Xl261eIJ1M9FC+W8WH3sQliGGQyoyn3JP/Yjh6P8CCDz+E/yIiQif+SF+M+SYCbdW0tQO0+8/MrD8dgtTVtxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c02b7c1cbe66e46b3f8d6a623f566d54bcc2a3e1b7986781c1645f99ddf6159","last_reissued_at":"2026-07-05T04:40:05.531034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:05.531034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bayesian Lasso based Sparse Learning Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ingvild M. Helg{\\o}y, Yushu Li","submitted_at":"2019-08-20T08:36:14Z","abstract_excerpt":"The Bayesian Lasso is constructed in the linear regression framework and applies the Gibbs sampling to estimate the regression parameters. This paper develops a new sparse learning model, named the Bayesian Lasso Sparse (BLS) model, that takes the hierarchical model formulation of the Bayesian Lasso. The main difference from the original Bayesian Lasso lies in the estimation procedure; the BLS method uses a learning algorithm based on the type-II maximum likelihood procedure. Opposed to the Bayesian Lasso, the BLS provides sparse estimates of the regression parameters. The BLS method is also d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07220","kind":"arxiv","version":3},"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/1908.07220/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":"1908.07220","created_at":"2026-07-05T04:40:05.531092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07220v3","created_at":"2026-07-05T04:40:05.531092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07220","created_at":"2026-07-05T04:40:05.531092+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQBLPQOL4ZXE","created_at":"2026-07-05T04:40:05.531092+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQBLPQOL4ZXENM7Y","created_at":"2026-07-05T04:40:05.531092+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQBLPQOL","created_at":"2026-07-05T04:40:05.531092+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05726","citing_title":"Proximal Iteration for Nonlinear Adaptive Lasso","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V","json":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V.json","graph_json":"https://pith.science/api/pith-number/NQBLPQOL4ZXENM7Y22TCH5LG2V/graph.json","events_json":"https://pith.science/api/pith-number/NQBLPQOL4ZXENM7Y22TCH5LG2V/events.json","paper":"https://pith.science/paper/NQBLPQOL"},"agent_actions":{"view_html":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V","download_json":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V.json","view_paper":"https://pith.science/paper/NQBLPQOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07220&json=true","fetch_graph":"https://pith.science/api/pith-number/NQBLPQOL4ZXENM7Y22TCH5LG2V/graph.json","fetch_events":"https://pith.science/api/pith-number/NQBLPQOL4ZXENM7Y22TCH5LG2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V/action/storage_attestation","attest_author":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V/action/author_attestation","sign_citation":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V/action/citation_signature","submit_replication":"https://pith.science/pith/NQBLPQOL4ZXENM7Y22TCH5LG2V/action/replication_record"}},"created_at":"2026-07-05T04:40:05.531092+00:00","updated_at":"2026-07-05T04:40:05.531092+00:00"}