{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UNSEYU434UQQGRMDLTMIYEHNK2","short_pith_number":"pith:UNSEYU43","canonical_record":{"source":{"id":"2505.23294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"76fc598fd255e8bbd711081bc23ebb4660f7890da1ec22b4e4579703096af027","abstract_canon_sha256":"aa18f79e09050bef68e9cd392999f0ae9e19d333e5560435b36eda06b7d2a6ce"},"schema_version":"1.0"},"canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","source":{"kind":"arxiv","id":"2505.23294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23294","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23294v1","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23294","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"UNSEYU434UQQ","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"UNSEYU434UQQGRMD","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"UNSEYU43","created_at":"2026-07-05T11:11:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UNSEYU434UQQGRMDLTMIYEHNK2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.23294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"76fc598fd255e8bbd711081bc23ebb4660f7890da1ec22b4e4579703096af027","abstract_canon_sha256":"aa18f79e09050bef68e9cd392999f0ae9e19d333e5560435b36eda06b7d2a6ce"},"schema_version":"1.0"},"canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:59.006876Z","signature_b64":"tviqPL5F5N4TGgwiDXj/rwiuMoM7lX8G8M1ZAa5eX2OP1ueX1oQzkp4e9Fe0crblz+qTbhkw+VCoP/ck2remCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","last_reissued_at":"2026-07-05T11:11:59.006364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:59.006364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.23294","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-07-05T11:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvxKFg/LBclYYVHndiWrCzBRJArdBTuczngrMAhVT5rnDAvYULIxtiHFkMUgmVSbrHcksy40t/S5sjHtEAcrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:47:47.242966Z"},"content_sha256":"dcf4bc4f96debd3b1ecc27565077c078cc7cb53b24a5803444ce0b4e94547d8b","schema_version":"1.0","event_id":"sha256:dcf4bc4f96debd3b1ecc27565077c078cc7cb53b24a5803444ce0b4e94547d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UNSEYU434UQQGRMDLTMIYEHNK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ling Liang, Shujun Bi","submitted_at":"2025-05-29T09:46:25Z","abstract_excerpt":"This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of equivalent Difference-of-Convex (DC) surrogate optimization problems. First, we present the core principles and iterative framework of the PMM method. Under the Kurdyka-{\\L}ojasiewicz (KL) property assumption of the potential function, we establish the global convergence of the algorithm and characterize its local (sub)linear convergence rate. Furthermore, for linear observation models with design matrices satisfying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23294","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.23294/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kC8irwPw42ILn5pMIrFLaio2cUEg4/yLcrnTDV6WRmSjWp94MAZxXYTQ845tnAfiUXIBlSPpbfVt/LSJFOaaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:47:47.243484Z"},"content_sha256":"638c04c08e2072beee1f5d2827957936cc8d14fd12bc6f687d3107e63b9aa2cf","schema_version":"1.0","event_id":"sha256:638c04c08e2072beee1f5d2827957936cc8d14fd12bc6f687d3107e63b9aa2cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/bundle.json","state_url":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNSEYU434UQQGRMDLTMIYEHNK2/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-08-10T01:47:47Z","links":{"resolver":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2","bundle":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/bundle.json","state":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNSEYU434UQQGRMDLTMIYEHNK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UNSEYU434UQQGRMDLTMIYEHNK2","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":"aa18f79e09050bef68e9cd392999f0ae9e19d333e5560435b36eda06b7d2a6ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","title_canon_sha256":"76fc598fd255e8bbd711081bc23ebb4660f7890da1ec22b4e4579703096af027"},"schema_version":"1.0","source":{"id":"2505.23294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23294","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23294v1","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23294","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"UNSEYU434UQQ","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"UNSEYU434UQQGRMD","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"UNSEYU43","created_at":"2026-07-05T11:11:59Z"}],"graph_snapshots":[{"event_id":"sha256:638c04c08e2072beee1f5d2827957936cc8d14fd12bc6f687d3107e63b9aa2cf","target":"graph","created_at":"2026-07-05T11:11:59Z","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/2505.23294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of equivalent Difference-of-Convex (DC) surrogate optimization problems. First, we present the core principles and iterative framework of the PMM method. Under the Kurdyka-{\\L}ojasiewicz (KL) property assumption of the potential function, we establish the global convergence of the algorithm and characterize its local (sub)linear convergence rate. Furthermore, for linear observation models with design matrices satisfying ","authors_text":"Ling Liang, Shujun Bi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","title":"Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23294","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:dcf4bc4f96debd3b1ecc27565077c078cc7cb53b24a5803444ce0b4e94547d8b","target":"record","created_at":"2026-07-05T11:11:59Z","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":"aa18f79e09050bef68e9cd392999f0ae9e19d333e5560435b36eda06b7d2a6ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","title_canon_sha256":"76fc598fd255e8bbd711081bc23ebb4660f7890da1ec22b4e4579703096af027"},"schema_version":"1.0","source":{"id":"2505.23294","kind":"arxiv","version":1}},"canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","first_computed_at":"2026-07-05T11:11:59.006364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:59.006364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tviqPL5F5N4TGgwiDXj/rwiuMoM7lX8G8M1ZAa5eX2OP1ueX1oQzkp4e9Fe0crblz+qTbhkw+VCoP/ck2remCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:59.006876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.23294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcf4bc4f96debd3b1ecc27565077c078cc7cb53b24a5803444ce0b4e94547d8b","sha256:638c04c08e2072beee1f5d2827957936cc8d14fd12bc6f687d3107e63b9aa2cf"],"state_sha256":"9935cd973ad97fc15b5293999fb2aaa8b0edd3f16eabcdf3bf4e688cbff6dad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8EouduRxE8Lq1UiL53y7XZ8yHiIr/DAxsg/EdM0xU2QtY9co0QkKIgn9jzjh/syc9VpIynZIZ94dLaUudP8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:47:47.248941Z","bundle_sha256":"3d276ac1a48e01c9401b2fc5aa8a0904f58ff8146393b96e02ae787325e1ad94"}}