{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HN6OWFRDDY3CZ7QP7JJEOJFYMA","short_pith_number":"pith:HN6OWFRD","schema_version":"1.0","canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","source":{"kind":"arxiv","id":"1612.02317","version":1},"attestation_state":"computed","paper":{"title":"A Matrix Splitting Method for Composite Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard Ghanem, Ganzhao Yuan, Wei-Shi Zheng","submitted_at":"2016-12-07T16:29:18Z","abstract_excerpt":"Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) 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. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art perfor"},"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":"1612.02317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T16:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"80d6a7409969910e0f4b6422b8cd7c45cc83846dc5d4434cc72f4d1f43ad9aff","abstract_canon_sha256":"0a222a26cab250baf924de0614cbee276620231334a91adeef32382d1a663d6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:34.956936Z","signature_b64":"2gACE+YfrDCnj15uOshRYjR2d3NnC9pIuA8NRTiNODAamsl2iRiU5fsBNEZlvwUev7d1yBriQCpyK2h4hZhGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","last_reissued_at":"2026-05-18T00:55:34.956491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:34.956491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Matrix Splitting Method for Composite Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard Ghanem, Ganzhao Yuan, Wei-Shi Zheng","submitted_at":"2016-12-07T16:29:18Z","abstract_excerpt":"Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) 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. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02317","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02317","created_at":"2026-05-18T00:55:34.956556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02317v1","created_at":"2026-05-18T00:55:34.956556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02317","created_at":"2026-05-18T00:55:34.956556+00:00"},{"alias_kind":"pith_short_12","alias_value":"HN6OWFRDDY3C","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HN6OWFRDDY3CZ7QP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HN6OWFRD","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA","json":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA.json","graph_json":"https://pith.science/api/pith-number/HN6OWFRDDY3CZ7QP7JJEOJFYMA/graph.json","events_json":"https://pith.science/api/pith-number/HN6OWFRDDY3CZ7QP7JJEOJFYMA/events.json","paper":"https://pith.science/paper/HN6OWFRD"},"agent_actions":{"view_html":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA","download_json":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA.json","view_paper":"https://pith.science/paper/HN6OWFRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02317&json=true","fetch_graph":"https://pith.science/api/pith-number/HN6OWFRDDY3CZ7QP7JJEOJFYMA/graph.json","fetch_events":"https://pith.science/api/pith-number/HN6OWFRDDY3CZ7QP7JJEOJFYMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/action/storage_attestation","attest_author":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/action/author_attestation","sign_citation":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/action/citation_signature","submit_replication":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/action/replication_record"}},"created_at":"2026-05-18T00:55:34.956556+00:00","updated_at":"2026-05-18T00:55:34.956556+00:00"}