{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HN6OWFRDDY3CZ7QP7JJEOJFYMA","short_pith_number":"pith:HN6OWFRD","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"},"canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","source":{"kind":"arxiv","id":"1612.02317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02317","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02317v1","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02317","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"HN6OWFRDDY3C","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HN6OWFRDDY3CZ7QP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HN6OWFRD","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HN6OWFRDDY3CZ7QP7JJEOJFYMA","target":"record","payload":{"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"},"canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","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"},"source_kind":"arxiv","source_id":"1612.02317","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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSpd6FPyvhrq7urVHblBtOMuDYVj07VfVYvPgzcPqbq/K2qNMc0EkUutXc/fulJECPeZv6BOViIurTqIA5+PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:11:26.682345Z"},"content_sha256":"57bd8dea27a8746981e3f10ebfa811dd3b02aa8828c0657eedcaec0850ee8587","schema_version":"1.0","event_id":"sha256:57bd8dea27a8746981e3f10ebfa811dd3b02aa8828c0657eedcaec0850ee8587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HN6OWFRDDY3CZ7QP7JJEOJFYMA","target":"graph","payload":{"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"},"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FObPpIHvcoi4C9/qCr8i/2/V6WObjnU/VKruB/jYPGCmleNR3mwJmj9PbYmIplkjgv9rI/6dIsxYNQB780zKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:11:26.683008Z"},"content_sha256":"aba9c45db58501b5750fd70f69f2a1eb2103e092edcb79302aafe604a764864f","schema_version":"1.0","event_id":"sha256:aba9c45db58501b5750fd70f69f2a1eb2103e092edcb79302aafe604a764864f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/bundle.json","state_url":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/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-27T13:11:26Z","links":{"resolver":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA","bundle":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/bundle.json","state":"https://pith.science/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HN6OWFRDDY3CZ7QP7JJEOJFYMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HN6OWFRDDY3CZ7QP7JJEOJFYMA","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":"0a222a26cab250baf924de0614cbee276620231334a91adeef32382d1a663d6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T16:29:18Z","title_canon_sha256":"80d6a7409969910e0f4b6422b8cd7c45cc83846dc5d4434cc72f4d1f43ad9aff"},"schema_version":"1.0","source":{"id":"1612.02317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02317","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02317v1","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02317","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"HN6OWFRDDY3C","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HN6OWFRDDY3CZ7QP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HN6OWFRD","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:aba9c45db58501b5750fd70f69f2a1eb2103e092edcb79302aafe604a764864f","target":"graph","created_at":"2026-05-18T00:55:34Z","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 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","authors_text":"Bernard Ghanem, Ganzhao Yuan, Wei-Shi Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T16:29:18Z","title":"A Matrix Splitting Method for Composite Function Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02317","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:57bd8dea27a8746981e3f10ebfa811dd3b02aa8828c0657eedcaec0850ee8587","target":"record","created_at":"2026-05-18T00:55:34Z","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":"0a222a26cab250baf924de0614cbee276620231334a91adeef32382d1a663d6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T16:29:18Z","title_canon_sha256":"80d6a7409969910e0f4b6422b8cd7c45cc83846dc5d4434cc72f4d1f43ad9aff"},"schema_version":"1.0","source":{"id":"1612.02317","kind":"arxiv","version":1}},"canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b7ceb16231e362cfe0ffa524724b86005b09615aae5ae9e3d4294ebc4c87ba1","first_computed_at":"2026-05-18T00:55:34.956491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:34.956491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gACE+YfrDCnj15uOshRYjR2d3NnC9pIuA8NRTiNODAamsl2iRiU5fsBNEZlvwUev7d1yBriQCpyK2h4hZhGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:34.956936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57bd8dea27a8746981e3f10ebfa811dd3b02aa8828c0657eedcaec0850ee8587","sha256:aba9c45db58501b5750fd70f69f2a1eb2103e092edcb79302aafe604a764864f"],"state_sha256":"f0931d39485ee6b9099f3bafa93fc6a2a7c0a9ebe8e2c63e70539e9d670c9da5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hk18QEwP/GdTXBFlD8Bu857v99P1vUOO4yS9fO9SAL1jeZMGlL0gBE5FqjKb3vDGX4FSgiBh8x3X0XV6pE5ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:11:26.686567Z","bundle_sha256":"e88b4f3a684e82ae59ce70f2003904187f4b847556ecea528c92c9dd43a42bf6"}}