{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FITIRGPXX36J3EVC4ZCKJATHKR","short_pith_number":"pith:FITIRGPX","canonical_record":{"source":{"id":"1806.03165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-07T14:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"a2b56ab38bca90cfbc8483027366dea971971aa6c5a5e51f159bfbd97676fd89","abstract_canon_sha256":"5b9286a989781ac8776c2d0fc6e8d3626ea0f432ac654c77411e8ba2f5f976e7"},"schema_version":"1.0"},"canonical_sha256":"2a268899f7befc9d92a2e644a48267546b6fa29cbe720361c5fb015e2daa767b","source":{"kind":"arxiv","id":"1806.03165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03165","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03165v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03165","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"FITIRGPXX36J","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FITIRGPXX36J3EVC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FITIRGPX","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FITIRGPXX36J3EVC4ZCKJATHKR","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-07T14:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"a2b56ab38bca90cfbc8483027366dea971971aa6c5a5e51f159bfbd97676fd89","abstract_canon_sha256":"5b9286a989781ac8776c2d0fc6e8d3626ea0f432ac654c77411e8ba2f5f976e7"},"schema_version":"1.0"},"canonical_sha256":"2a268899f7befc9d92a2e644a48267546b6fa29cbe720361c5fb015e2daa767b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:49.428366Z","signature_b64":"j3cZufm3b9twE5AB+iAVHqEH3BPfCiqC0GLKqO94aUHuY4h6WcRyRxbIHgc+p6hdTanjFEqC4WTNfNHj+r1ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a268899f7befc9d92a2e644a48267546b6fa29cbe720361c5fb015e2daa767b","last_reissued_at":"2026-05-18T00:13:49.427904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:49.427904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03165","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-18T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcyYw1e9BUn+SmXQdSCozj4S2lyLXBOWhKkwCaDLJmSlFbGtQk6D2jBVS70tywcscjuH/7ORHgGUTkIeWt2dAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:20:22.361921Z"},"content_sha256":"ee473d7ab0200d9050600e133f324f239dfec88072f5d47daefd59a4d30dca1f","schema_version":"1.0","event_id":"sha256:ee473d7ab0200d9050600e133f324f239dfec88072f5d47daefd59a4d30dca1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FITIRGPXX36J3EVC4ZCKJATHKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Matrix Splitting Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Bernard Ghanem, Ganzhao Yuan, Li Shen, Wei-Shi Zheng","submitted_at":"2018-06-07T14:04:47Z","abstract_excerpt":"Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\\ell_1$ norm regularized optimization, and $\\ell_0$ norm regularized optimization as special cases. This paper proposes and analyzes a new Generalized Matrix Splitting Algorithm (GMSA) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Our algorithm is derived from a novel triangle operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03165","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-18T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BisXyfdZ88IK12lpvO5S4J9Yd5kMRiom50wAAjHdR6o9kKTnavL0OEnjp6suWy8epGlJfrhYZ63q2NOpiHGqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:20:22.362665Z"},"content_sha256":"ad7eafa069c5acb89cd15e827f880cd942210c75ace51c4ae66225d23bf0f5f3","schema_version":"1.0","event_id":"sha256:ad7eafa069c5acb89cd15e827f880cd942210c75ace51c4ae66225d23bf0f5f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FITIRGPXX36J3EVC4ZCKJATHKR/bundle.json","state_url":"https://pith.science/pith/FITIRGPXX36J3EVC4ZCKJATHKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FITIRGPXX36J3EVC4ZCKJATHKR/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-05-25T22:20:22Z","links":{"resolver":"https://pith.science/pith/FITIRGPXX36J3EVC4ZCKJATHKR","bundle":"https://pith.science/pith/FITIRGPXX36J3EVC4ZCKJATHKR/bundle.json","state":"https://pith.science/pith/FITIRGPXX36J3EVC4ZCKJATHKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FITIRGPXX36J3EVC4ZCKJATHKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FITIRGPXX36J3EVC4ZCKJATHKR","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":"5b9286a989781ac8776c2d0fc6e8d3626ea0f432ac654c77411e8ba2f5f976e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-07T14:04:47Z","title_canon_sha256":"a2b56ab38bca90cfbc8483027366dea971971aa6c5a5e51f159bfbd97676fd89"},"schema_version":"1.0","source":{"id":"1806.03165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03165","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03165v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03165","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"FITIRGPXX36J","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FITIRGPXX36J3EVC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FITIRGPX","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ad7eafa069c5acb89cd15e827f880cd942210c75ace51c4ae66225d23bf0f5f3","target":"graph","created_at":"2026-05-18T00:13:49Z","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":"Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\\ell_1$ norm regularized optimization, and $\\ell_0$ norm regularized optimization as special cases. This paper proposes and analyzes a new Generalized Matrix Splitting Algorithm (GMSA) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Our algorithm is derived from a novel triangle operat","authors_text":"Bernard Ghanem, Ganzhao Yuan, Li Shen, Wei-Shi Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-07T14:04:47Z","title":"A Generalized Matrix Splitting Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03165","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:ee473d7ab0200d9050600e133f324f239dfec88072f5d47daefd59a4d30dca1f","target":"record","created_at":"2026-05-18T00:13:49Z","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":"5b9286a989781ac8776c2d0fc6e8d3626ea0f432ac654c77411e8ba2f5f976e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-07T14:04:47Z","title_canon_sha256":"a2b56ab38bca90cfbc8483027366dea971971aa6c5a5e51f159bfbd97676fd89"},"schema_version":"1.0","source":{"id":"1806.03165","kind":"arxiv","version":1}},"canonical_sha256":"2a268899f7befc9d92a2e644a48267546b6fa29cbe720361c5fb015e2daa767b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a268899f7befc9d92a2e644a48267546b6fa29cbe720361c5fb015e2daa767b","first_computed_at":"2026-05-18T00:13:49.427904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:49.427904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3cZufm3b9twE5AB+iAVHqEH3BPfCiqC0GLKqO94aUHuY4h6WcRyRxbIHgc+p6hdTanjFEqC4WTNfNHj+r1ODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:49.428366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee473d7ab0200d9050600e133f324f239dfec88072f5d47daefd59a4d30dca1f","sha256:ad7eafa069c5acb89cd15e827f880cd942210c75ace51c4ae66225d23bf0f5f3"],"state_sha256":"727013100d39baedd9edf06c36214930ed2958cf8f68452621febe9047fa4594"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WH9Wsxpm9gJjs4mlC+9QLeLqpFQlMQdI4RU0Iiuzj/nQV0ZuWsZVHI9tTySwLl32oce+DtFI8zx2tfC7HZb+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:20:22.366533Z","bundle_sha256":"f91d8278b424a9a05791c1a07f1769b0f74c8a51e0158ffd7aacf2d165c8c21c"}}