{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V2X2HOTHNFYR5MLNNUEHLT2PJ7","short_pith_number":"pith:V2X2HOTH","canonical_record":{"source":{"id":"1812.08954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-21T05:23:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"64b1ee041c4994266930a835cdde307a613d87c9ed40494227ab3115cd9d7216","abstract_canon_sha256":"52bfc4ef876eef1389ba881f08f5ad7970c82dcf58fa4d3502ba702afc410289"},"schema_version":"1.0"},"canonical_sha256":"aeafa3ba6769711eb16d6d0875cf4f4fda1118e24f51c81adeab5956c37db595","source":{"kind":"arxiv","id":"1812.08954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08954","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08954v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08954","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"V2X2HOTHNFYR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V2X2HOTHNFYR5MLN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V2X2HOTH","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V2X2HOTHNFYR5MLNNUEHLT2PJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-21T05:23:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"64b1ee041c4994266930a835cdde307a613d87c9ed40494227ab3115cd9d7216","abstract_canon_sha256":"52bfc4ef876eef1389ba881f08f5ad7970c82dcf58fa4d3502ba702afc410289"},"schema_version":"1.0"},"canonical_sha256":"aeafa3ba6769711eb16d6d0875cf4f4fda1118e24f51c81adeab5956c37db595","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:45.789173Z","signature_b64":"H+PCKYsc3W7uf3XtBFjTbiQnSC1vvWFy5Ij7ofGE73ZAWL5BDSDaehKdROKJlGeNAdNLFTSjfgY79xSmzPICCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeafa3ba6769711eb16d6d0875cf4f4fda1118e24f51c81adeab5956c37db595","last_reissued_at":"2026-05-17T23:57:45.788582Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:45.788582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08954","source_version":1,"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-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33g1wfrZQUghpiRt5oO59a+MXaJ4uGEAR/fiyELCkIjYRUWdFKgtex+7BPn6FjHUSNs4zXDDGCTh435uXZGmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:16:54.302935Z"},"content_sha256":"7a2fc647806a761dcebf9c111b8f7338036020149abec41e4db337b5d2ae962e","schema_version":"1.0","event_id":"sha256:7a2fc647806a761dcebf9c111b8f7338036020149abec41e4db337b5d2ae962e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V2X2HOTHNFYR5MLNNUEHLT2PJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal path algorithm for compositional data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hosik Choi, Jong-June Jeon, Sungho Won, Yongdai Kim","submitted_at":"2018-12-21T05:23:36Z","abstract_excerpt":"Compositional data have two unique characteristics compared to typical multivariate data: the observed values are nonnegative and their summand is exactly one. To reflect these characteristics, a specific regularized regression model with linear constraints is commonly used. However, linear constraints incur additional computational time, which becomes severe in high-dimensional cases. As such, we propose an efficient solution path algorithm for a $l_1$ regularized regression with compositional data. The algorithm is then extended to a classification model with compositional predictors. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08954","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"},"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-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmHfFH+R8ljG4z7Jn74jcfkthLcnlz/qsLZxeCaxFqd7UDnNwBfhWMgPpoJX2qcYsM2sF6MzC72B2lKFo89oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:16:54.303655Z"},"content_sha256":"0a954a591b42373070affdeaa112a50045428aeca0bc5d13fc15d97cd37925a1","schema_version":"1.0","event_id":"sha256:0a954a591b42373070affdeaa112a50045428aeca0bc5d13fc15d97cd37925a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/bundle.json","state_url":"https://pith.science/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/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-08T21:16:54Z","links":{"resolver":"https://pith.science/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7","bundle":"https://pith.science/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/bundle.json","state":"https://pith.science/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2X2HOTHNFYR5MLNNUEHLT2PJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V2X2HOTHNFYR5MLNNUEHLT2PJ7","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":"52bfc4ef876eef1389ba881f08f5ad7970c82dcf58fa4d3502ba702afc410289","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-21T05:23:36Z","title_canon_sha256":"64b1ee041c4994266930a835cdde307a613d87c9ed40494227ab3115cd9d7216"},"schema_version":"1.0","source":{"id":"1812.08954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08954","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08954v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08954","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"V2X2HOTHNFYR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V2X2HOTHNFYR5MLN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V2X2HOTH","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:0a954a591b42373070affdeaa112a50045428aeca0bc5d13fc15d97cd37925a1","target":"graph","created_at":"2026-05-17T23:57:45Z","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":"Compositional data have two unique characteristics compared to typical multivariate data: the observed values are nonnegative and their summand is exactly one. To reflect these characteristics, a specific regularized regression model with linear constraints is commonly used. However, linear constraints incur additional computational time, which becomes severe in high-dimensional cases. As such, we propose an efficient solution path algorithm for a $l_1$ regularized regression with compositional data. The algorithm is then extended to a classification model with compositional predictors. We als","authors_text":"Hosik Choi, Jong-June Jeon, Sungho Won, Yongdai Kim","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-21T05:23:36Z","title":"Primal path algorithm for compositional data analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08954","kind":"arxiv","version":1},"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:7a2fc647806a761dcebf9c111b8f7338036020149abec41e4db337b5d2ae962e","target":"record","created_at":"2026-05-17T23:57:45Z","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":"52bfc4ef876eef1389ba881f08f5ad7970c82dcf58fa4d3502ba702afc410289","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-21T05:23:36Z","title_canon_sha256":"64b1ee041c4994266930a835cdde307a613d87c9ed40494227ab3115cd9d7216"},"schema_version":"1.0","source":{"id":"1812.08954","kind":"arxiv","version":1}},"canonical_sha256":"aeafa3ba6769711eb16d6d0875cf4f4fda1118e24f51c81adeab5956c37db595","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeafa3ba6769711eb16d6d0875cf4f4fda1118e24f51c81adeab5956c37db595","first_computed_at":"2026-05-17T23:57:45.788582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:45.788582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+PCKYsc3W7uf3XtBFjTbiQnSC1vvWFy5Ij7ofGE73ZAWL5BDSDaehKdROKJlGeNAdNLFTSjfgY79xSmzPICCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:45.789173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a2fc647806a761dcebf9c111b8f7338036020149abec41e4db337b5d2ae962e","sha256:0a954a591b42373070affdeaa112a50045428aeca0bc5d13fc15d97cd37925a1"],"state_sha256":"4954a5a04e28509df200676504489269f3bb085582ba2d9d90aa79b94f6cff47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9UNvdKj39niN6k5tkEWMhsGFLou4apOp29haP7MfFTRZ07On5+saM3V9jc6yxrLfl8X/Dd601YIJEhG53zKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:16:54.308043Z","bundle_sha256":"e40abd98a804a7c305b4f46f643ce608b0f42aaeeea0976d00cbb47999909c74"}}