{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NAFMLRCGTMRC2IM52NSUZKFR56","short_pith_number":"pith:NAFMLRCG","schema_version":"1.0","canonical_sha256":"680ac5c4469b222d219dd3654ca8b1efb1bc57db25ba1607ff6b177ec7a8e5da","source":{"kind":"arxiv","id":"2412.04625","version":1},"attestation_state":"computed","paper":{"title":"Global minimization of a minimum of a finite collection of 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":"2024-12-05T21:38:54Z","abstract_excerpt":"We consider the global minimization of a particular type of minimum structured optimization problems wherein the variables must belong to some basic set, the feasible domain is described by the intersection of a large number of functional constraints and the objective stems as the pointwise minimum of a collection of functional pieces. Among others, this setting includes all non-convex piecewise linear problems. The global minimum of a minimum structured problem can be computed using a simple enumeration scheme by solving a sequence of individual problems involving each a single piece and then"},"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":"2412.04625","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-05T21:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"53f36a52c0b9e0b3a613e51492a57449bc399b6736ecda6f8cc4a4bf1495530c","abstract_canon_sha256":"1ceedf8dbabfd22f367a141fc00bee786945591234e514f090d026f74afe5c3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:20.913631Z","signature_b64":"ZQT9Z6c/EP7kzuHoNk/e2hypXMOL4X8O5JQLeETFeI3VGULnF1G17yTlyk290UIryg5xKM8sbW2fWJktfsoBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680ac5c4469b222d219dd3654ca8b1efb1bc57db25ba1607ff6b177ec7a8e5da","last_reissued_at":"2026-07-05T09:45:20.913050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:20.913050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global minimization of a minimum of a finite collection of 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":"2024-12-05T21:38:54Z","abstract_excerpt":"We consider the global minimization of a particular type of minimum structured optimization problems wherein the variables must belong to some basic set, the feasible domain is described by the intersection of a large number of functional constraints and the objective stems as the pointwise minimum of a collection of functional pieces. Among others, this setting includes all non-convex piecewise linear problems. The global minimum of a minimum structured problem can be computed using a simple enumeration scheme by solving a sequence of individual problems involving each a single piece and then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04625","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/2412.04625/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.04625","created_at":"2026-07-05T09:45:20.913116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04625v1","created_at":"2026-07-05T09:45:20.913116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04625","created_at":"2026-07-05T09:45:20.913116+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAFMLRCGTMRC","created_at":"2026-07-05T09:45:20.913116+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAFMLRCGTMRC2IM5","created_at":"2026-07-05T09:45:20.913116+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAFMLRCG","created_at":"2026-07-05T09:45:20.913116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19372","citing_title":"Global and local approaches for the minimization of a sum of pointwise minima of convex functions","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56","json":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56.json","graph_json":"https://pith.science/api/pith-number/NAFMLRCGTMRC2IM52NSUZKFR56/graph.json","events_json":"https://pith.science/api/pith-number/NAFMLRCGTMRC2IM52NSUZKFR56/events.json","paper":"https://pith.science/paper/NAFMLRCG"},"agent_actions":{"view_html":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56","download_json":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56.json","view_paper":"https://pith.science/paper/NAFMLRCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04625&json=true","fetch_graph":"https://pith.science/api/pith-number/NAFMLRCGTMRC2IM52NSUZKFR56/graph.json","fetch_events":"https://pith.science/api/pith-number/NAFMLRCGTMRC2IM52NSUZKFR56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56/action/storage_attestation","attest_author":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56/action/author_attestation","sign_citation":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56/action/citation_signature","submit_replication":"https://pith.science/pith/NAFMLRCGTMRC2IM52NSUZKFR56/action/replication_record"}},"created_at":"2026-07-05T09:45:20.913116+00:00","updated_at":"2026-07-05T09:45:20.913116+00:00"}