{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RDW355YKE5CQRU2OI6BSAVLQWX","short_pith_number":"pith:RDW355YK","canonical_record":{"source":{"id":"2501.19372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-31T18:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"369de8c0b407bf9b1c3dd54f2b06d820c4d371b39f553ac86e6ca0c4f40fc34a","abstract_canon_sha256":"e16a6ddc1787cf154f2212f701e43787c6f085eaa5f295baa4eb0b7270abf383"},"schema_version":"1.0"},"canonical_sha256":"88edbef70a274508d34e4783205570b5f99de5bd17d0c11640a03353ee32f7ec","source":{"kind":"arxiv","id":"2501.19372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19372","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19372v1","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19372","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"RDW355YKE5CQ","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_16","alias_value":"RDW355YKE5CQRU2O","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_8","alias_value":"RDW355YK","created_at":"2026-07-05T10:08:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RDW355YKE5CQRU2OI6BSAVLQWX","target":"record","payload":{"canonical_record":{"source":{"id":"2501.19372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-31T18:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"369de8c0b407bf9b1c3dd54f2b06d820c4d371b39f553ac86e6ca0c4f40fc34a","abstract_canon_sha256":"e16a6ddc1787cf154f2212f701e43787c6f085eaa5f295baa4eb0b7270abf383"},"schema_version":"1.0"},"canonical_sha256":"88edbef70a274508d34e4783205570b5f99de5bd17d0c11640a03353ee32f7ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:00.220410Z","signature_b64":"qP7ut7BtoawaUU6MysFukR9GBNuG1vhasw3fYL8aHAnqPOyPbEeS5bQggepenCmZtBzUZ72RXGm7RfPLnWqZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88edbef70a274508d34e4783205570b5f99de5bd17d0c11640a03353ee32f7ec","last_reissued_at":"2026-07-05T10:08:00.219946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:00.219946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.19372","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-05T10:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOBLaxtx5yCu9UpQoHiZFBxTBEV+Mdiu4cjq0x5VUcQ9dLH39KDIFA47YzMGXS66TgxtoWh6jobaK/tLAmLfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:17:05.598901Z"},"content_sha256":"404cecb8da1805b18ecb4867203eba62fb4af81e6fd67e24ddad4dc4f6ba7f81","schema_version":"1.0","event_id":"sha256:404cecb8da1805b18ecb4867203eba62fb4af81e6fd67e24ddad4dc4f6ba7f81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RDW355YKE5CQRU2OI6BSAVLQWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global and local approaches for the minimization of a sum of pointwise minima of convex functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois Glineur, Guillaume Van Dessel","submitted_at":"2025-01-31T18:23:08Z","abstract_excerpt":"Numerous machine learning and industrial problems can be modeled as the minimization of a sum of $N$ so-called clipped convex functions (SCC), i.e. each term of the sum stems as the pointwise minimum between a constant and a convex function. In this work, we extend this framework to capture more problems of interest. Specifically, we allow each term of the sum to be a pointwise minimum of an arbitrary number of convex functions, called components, turning the objective into a sum of pointwise minima of convex functions (SMC).\n  Problem (SCC) is NP-hard, highlighting an appeal for scalable loca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19372","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/2501.19372/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-05T10:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWfekYkpPI3ocK4MZauIG6erssxRKlncD+mZVDI1x/tWLgKoslcQsnIxMVFYXuKeQ+9J9uXvSYOI7j2bht6QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:17:05.599398Z"},"content_sha256":"043a23cfa9b35523749d29269f27163d195f532025973a2ed4ce6ce6ebda1f41","schema_version":"1.0","event_id":"sha256:043a23cfa9b35523749d29269f27163d195f532025973a2ed4ce6ce6ebda1f41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDW355YKE5CQRU2OI6BSAVLQWX/bundle.json","state_url":"https://pith.science/pith/RDW355YKE5CQRU2OI6BSAVLQWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDW355YKE5CQRU2OI6BSAVLQWX/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-23T12:17:05Z","links":{"resolver":"https://pith.science/pith/RDW355YKE5CQRU2OI6BSAVLQWX","bundle":"https://pith.science/pith/RDW355YKE5CQRU2OI6BSAVLQWX/bundle.json","state":"https://pith.science/pith/RDW355YKE5CQRU2OI6BSAVLQWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDW355YKE5CQRU2OI6BSAVLQWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RDW355YKE5CQRU2OI6BSAVLQWX","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":"e16a6ddc1787cf154f2212f701e43787c6f085eaa5f295baa4eb0b7270abf383","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-31T18:23:08Z","title_canon_sha256":"369de8c0b407bf9b1c3dd54f2b06d820c4d371b39f553ac86e6ca0c4f40fc34a"},"schema_version":"1.0","source":{"id":"2501.19372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19372","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19372v1","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19372","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"RDW355YKE5CQ","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_16","alias_value":"RDW355YKE5CQRU2O","created_at":"2026-07-05T10:08:00Z"},{"alias_kind":"pith_short_8","alias_value":"RDW355YK","created_at":"2026-07-05T10:08:00Z"}],"graph_snapshots":[{"event_id":"sha256:043a23cfa9b35523749d29269f27163d195f532025973a2ed4ce6ce6ebda1f41","target":"graph","created_at":"2026-07-05T10:08:00Z","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/2501.19372/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Numerous machine learning and industrial problems can be modeled as the minimization of a sum of $N$ so-called clipped convex functions (SCC), i.e. each term of the sum stems as the pointwise minimum between a constant and a convex function. In this work, we extend this framework to capture more problems of interest. Specifically, we allow each term of the sum to be a pointwise minimum of an arbitrary number of convex functions, called components, turning the objective into a sum of pointwise minima of convex functions (SMC).\n  Problem (SCC) is NP-hard, highlighting an appeal for scalable loca","authors_text":"Fran\\c{c}ois Glineur, Guillaume Van Dessel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-31T18:23:08Z","title":"Global and local approaches for the minimization of a sum of pointwise minima of convex functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19372","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:404cecb8da1805b18ecb4867203eba62fb4af81e6fd67e24ddad4dc4f6ba7f81","target":"record","created_at":"2026-07-05T10:08:00Z","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":"e16a6ddc1787cf154f2212f701e43787c6f085eaa5f295baa4eb0b7270abf383","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-31T18:23:08Z","title_canon_sha256":"369de8c0b407bf9b1c3dd54f2b06d820c4d371b39f553ac86e6ca0c4f40fc34a"},"schema_version":"1.0","source":{"id":"2501.19372","kind":"arxiv","version":1}},"canonical_sha256":"88edbef70a274508d34e4783205570b5f99de5bd17d0c11640a03353ee32f7ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88edbef70a274508d34e4783205570b5f99de5bd17d0c11640a03353ee32f7ec","first_computed_at":"2026-07-05T10:08:00.219946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:00.219946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qP7ut7BtoawaUU6MysFukR9GBNuG1vhasw3fYL8aHAnqPOyPbEeS5bQggepenCmZtBzUZ72RXGm7RfPLnWqZBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:00.220410Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.19372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:404cecb8da1805b18ecb4867203eba62fb4af81e6fd67e24ddad4dc4f6ba7f81","sha256:043a23cfa9b35523749d29269f27163d195f532025973a2ed4ce6ce6ebda1f41"],"state_sha256":"700051f8faedc53b1a9bec11e6d7349a232e174d1f33271fee9c0f2cc48a0f1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+nB2jccVPDMARlEI+dPovKtNDAHJZDgRrHXFr6WjSnopc8z5kbT8wpbemfQKKtm5EnRjzT/yGmscmjXDHFkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T12:17:05.603114Z","bundle_sha256":"1c1c3d282976cb742435263a69a7c42c19ddcb057316f91fd470d395506093a2"}}