{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LCVTCCB64BRRDUFJPB2EF3R4W2","short_pith_number":"pith:LCVTCCB6","canonical_record":{"source":{"id":"1306.1970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-06-09T00:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"21b92917ae64c56368033d85f98c3b966b2fcd2c2c78aab36117cbd10de40e68","abstract_canon_sha256":"933128a7e61fb3d16e314c7b301bf2a140a2bb2af37fafdedb0ab66571ef92d8"},"schema_version":"1.0"},"canonical_sha256":"58ab31083ee06311d0a9787442ee3cb6a326a4064e07556920c79743b3c8feb3","source":{"kind":"arxiv","id":"1306.1970","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1970","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1970v3","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1970","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"LCVTCCB64BRR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCVTCCB64BRRDUFJ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCVTCCB6","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LCVTCCB64BRRDUFJPB2EF3R4W2","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-06-09T00:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"21b92917ae64c56368033d85f98c3b966b2fcd2c2c78aab36117cbd10de40e68","abstract_canon_sha256":"933128a7e61fb3d16e314c7b301bf2a140a2bb2af37fafdedb0ab66571ef92d8"},"schema_version":"1.0"},"canonical_sha256":"58ab31083ee06311d0a9787442ee3cb6a326a4064e07556920c79743b3c8feb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:37.719991Z","signature_b64":"DH262m6bQxhA6hsORStD+lOXhLzxvmZgb6IYglLsr/pI5O5Msp7MQiBCkTFtf4GziQDujeIDC1GMS3Dd7iZaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58ab31083ee06311d0a9787442ee3cb6a326a4064e07556920c79743b3c8feb3","last_reissued_at":"2026-05-18T03:04:37.719117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:37.719117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1970","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVCbxb5rFeL6LtAVg1PDjqXoHoz5KHrrtWvrFsW230sqwdWNx5fHakhtgqJ6+au373oODMnaAolbmY49+9jEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:03:39.238743Z"},"content_sha256":"3419e5f63df3c86866733d369d10e0eb3e61c229fa70634b4bedd25010fe94fb","schema_version":"1.0","event_id":"sha256:3419e5f63df3c86866733d369d10e0eb3e61c229fa70634b4bedd25010fe94fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LCVTCCB64BRRDUFJPB2EF3R4W2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional Fused Lasso Regression using Majorization-Minimization and Parallel Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Donghyeon Yu, Johan Lim, Joong-Ho Won, Sungroh Yoon, Taehoon Lee","submitted_at":"2013-06-09T00:56:41Z","abstract_excerpt":"In this paper, we propose a majorization-minimization (MM) algorithm for high-dimensional fused lasso regression (FLR) suitable for parallelization using graphics processing units (GPUs). The MM algorithm is stable and flexible as it can solve the FLR problems with various types of design matrices and penalty structures within a few tens of iterations. We also show that the convergence of the proposed algorithm is guaranteed. We conduct numerical studies to compare our algorithm with other existing algorithms, demonstrating that the proposed MM algorithm is competitive in many settings includi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1970","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/c+2M4O2jnC9AVaoQFF5patGbwuaBBszl0ercmAWLOca546BAGvGUgPbyznMuJScWNNnE2AH2bg3CeEVYh9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:03:39.239452Z"},"content_sha256":"b89d1c587e70e3b04d0ec76386aa3a2357cee0a2e0ca398d94fa0a6fd626eb21","schema_version":"1.0","event_id":"sha256:b89d1c587e70e3b04d0ec76386aa3a2357cee0a2e0ca398d94fa0a6fd626eb21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/bundle.json","state_url":"https://pith.science/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T09:03:39Z","links":{"resolver":"https://pith.science/pith/LCVTCCB64BRRDUFJPB2EF3R4W2","bundle":"https://pith.science/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/bundle.json","state":"https://pith.science/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCVTCCB64BRRDUFJPB2EF3R4W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LCVTCCB64BRRDUFJPB2EF3R4W2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"933128a7e61fb3d16e314c7b301bf2a140a2bb2af37fafdedb0ab66571ef92d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-06-09T00:56:41Z","title_canon_sha256":"21b92917ae64c56368033d85f98c3b966b2fcd2c2c78aab36117cbd10de40e68"},"schema_version":"1.0","source":{"id":"1306.1970","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1970","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1970v3","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1970","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"LCVTCCB64BRR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCVTCCB64BRRDUFJ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCVTCCB6","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:b89d1c587e70e3b04d0ec76386aa3a2357cee0a2e0ca398d94fa0a6fd626eb21","target":"graph","created_at":"2026-05-18T03:04:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a majorization-minimization (MM) algorithm for high-dimensional fused lasso regression (FLR) suitable for parallelization using graphics processing units (GPUs). The MM algorithm is stable and flexible as it can solve the FLR problems with various types of design matrices and penalty structures within a few tens of iterations. We also show that the convergence of the proposed algorithm is guaranteed. We conduct numerical studies to compare our algorithm with other existing algorithms, demonstrating that the proposed MM algorithm is competitive in many settings includi","authors_text":"Donghyeon Yu, Johan Lim, Joong-Ho Won, Sungroh Yoon, Taehoon Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-06-09T00:56:41Z","title":"High-dimensional Fused Lasso Regression using Majorization-Minimization and Parallel Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1970","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3419e5f63df3c86866733d369d10e0eb3e61c229fa70634b4bedd25010fe94fb","target":"record","created_at":"2026-05-18T03:04:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"933128a7e61fb3d16e314c7b301bf2a140a2bb2af37fafdedb0ab66571ef92d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-06-09T00:56:41Z","title_canon_sha256":"21b92917ae64c56368033d85f98c3b966b2fcd2c2c78aab36117cbd10de40e68"},"schema_version":"1.0","source":{"id":"1306.1970","kind":"arxiv","version":3}},"canonical_sha256":"58ab31083ee06311d0a9787442ee3cb6a326a4064e07556920c79743b3c8feb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58ab31083ee06311d0a9787442ee3cb6a326a4064e07556920c79743b3c8feb3","first_computed_at":"2026-05-18T03:04:37.719117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:37.719117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DH262m6bQxhA6hsORStD+lOXhLzxvmZgb6IYglLsr/pI5O5Msp7MQiBCkTFtf4GziQDujeIDC1GMS3Dd7iZaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:37.719991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1970","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3419e5f63df3c86866733d369d10e0eb3e61c229fa70634b4bedd25010fe94fb","sha256:b89d1c587e70e3b04d0ec76386aa3a2357cee0a2e0ca398d94fa0a6fd626eb21"],"state_sha256":"ea109ac9e365fb8e3ea23761c66fba405b695dd3712afac75f6597c722c82f78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE4ElUCBu6mrCjQTs/bWVkq+YRD+WcEwUoxOLPV9cwwRaw8VTMuXYFjUuaorM8TpYmor4YdRMsepujt4njCdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:03:39.243936Z","bundle_sha256":"a901925ded945ae9c1412948b9c917db32a2de051f26eadff7899cc2c7cadd8d"}}