{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2KGPM75MTLYNOLFX3IOZYGLNLI","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":"9f9b09cac58cfe1503a132de8e0df0eafa4bb084cdc1d9bf542fa6b71861ceea","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T08:11:47Z","title_canon_sha256":"2da22e02e15dc2c848e758a061ba0a429926a7979d254e80ac22ae514c223615"},"schema_version":"1.0","source":{"id":"1905.11031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11031","created_at":"2026-06-04T20:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11031v2","created_at":"2026-06-04T20:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11031","created_at":"2026-06-04T20:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"2KGPM75MTLYN","created_at":"2026-06-04T20:14:33Z"},{"alias_kind":"pith_short_16","alias_value":"2KGPM75MTLYNOLFX","created_at":"2026-06-04T20:14:33Z"},{"alias_kind":"pith_short_8","alias_value":"2KGPM75M","created_at":"2026-06-04T20:14:33Z"}],"graph_snapshots":[{"event_id":"sha256:e60744f000ee50f5f65ead211e0041a16533acbb963d4ff2819ca5d0c08fce6b","target":"graph","created_at":"2026-06-04T20:14:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.11031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse optimization is a central problem in machine learning and computer vision. However, this problem is inherently NP-hard and thus difficult to solve in general. Combinatorial search methods find the global optimal solution but are confined to small-sized problems, while coordinate descent methods are efficient but often suffer from poor local minima. This paper considers a new block decomposition algorithm that combines the effectiveness of combinatorial search methods and the efficiency of coordinate descent methods. Specifically, we consider a random strategy or/and a greedy strategy to","authors_text":"Ganzhao Yuan, Li Shen, Wei-Shi Zheng","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T08:11:47Z","title":"A Block Decomposition Algorithm for Sparse Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11031","kind":"arxiv","version":2},"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:4046d9d7ebfb6d25d243b3434f29d9e4a61b4a2cdd69fbdfa1c5c25092509ebc","target":"record","created_at":"2026-06-04T20:14:33Z","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":"9f9b09cac58cfe1503a132de8e0df0eafa4bb084cdc1d9bf542fa6b71861ceea","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T08:11:47Z","title_canon_sha256":"2da22e02e15dc2c848e758a061ba0a429926a7979d254e80ac22ae514c223615"},"schema_version":"1.0","source":{"id":"1905.11031","kind":"arxiv","version":2}},"canonical_sha256":"d28cf67fac9af0d72cb7da1d9c196d5a12ea28e0077d3899ce9ac68a54585e30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d28cf67fac9af0d72cb7da1d9c196d5a12ea28e0077d3899ce9ac68a54585e30","first_computed_at":"2026-06-04T20:14:33.195682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:33.195682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IK2LTmI/5KX75pvzt+tWd76PORUzUCyUTrglAb68ZRqR+GKug2FTT471hHCjMcM1LpAjuvVqZDcIfzG6NtxhCQ==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:33.196194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4046d9d7ebfb6d25d243b3434f29d9e4a61b4a2cdd69fbdfa1c5c25092509ebc","sha256:e60744f000ee50f5f65ead211e0041a16533acbb963d4ff2819ca5d0c08fce6b"],"state_sha256":"e5396bbe19c900ae1f29a7edc785e13c7731aa2cac6a7e2e41da7e77870518f6"}