{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KVIR67ETIAZV2F4FU277ZEBF7A","short_pith_number":"pith:KVIR67ET","schema_version":"1.0","canonical_sha256":"55511f7c9340335d1785a6bffc9025f819fafc1f6c4b3f7ea143f0e1dab9d5fc","source":{"kind":"arxiv","id":"2605.13849","version":1},"attestation_state":"computed","paper":{"title":"Mixed Integer Goal Programming for Personalized Meal Optimization with User-Defined Serving Granularity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Mixed integer goal programming yields whole-serving meal plans that match continuous nutrient optima for typical meal sizes while guaranteeing feasibility.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francisco Aguilera Moreno","submitted_at":"2026-03-12T14:54:47Z","abstract_excerpt":"Determining what to eat to satisfy nutritional requirements is one of the oldest optimization problems in operations research, yet existing formulations have two persistent limitations: continuous variables produce impractical fractional servings (1.7 eggs, 0.37 bananas), and hard nutrient constraints cause infeasibility when targets conflict. A systematic review of 56 diet optimization papers found that none combine integer programming with goal programming to address both issues. We propose Mixed Integer Goal Programming (MIGP) for personalized meal optimization. The formulation uses integer"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-12T14:54:47Z","cross_cats_sorted":[],"title_canon_sha256":"64beefada933455b2e7e7a85fcfcf228ac78617a2b346ea9e24dac869e2e0348","abstract_canon_sha256":"b092dfc2bb725ce2f3f9bebcafe3a9881d1c00c1725431b2438b51569914fb61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:19.628557Z","signature_b64":"uVNOWsRLJfeCQYveqvtbTcv6SDhF8WcLPPA/uRzXl4vrZXzl1p2NdYHZ0AbCYZyFykRQVNtJS9gzB02OHQg1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55511f7c9340335d1785a6bffc9025f819fafc1f6c4b3f7ea143f0e1dab9d5fc","last_reissued_at":"2026-05-17T23:39:19.627894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:19.627894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Integer Goal Programming for Personalized Meal Optimization with User-Defined Serving Granularity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Mixed integer goal programming yields whole-serving meal plans that match continuous nutrient optima for typical meal sizes while guaranteeing feasibility.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francisco Aguilera Moreno","submitted_at":"2026-03-12T14:54:47Z","abstract_excerpt":"Determining what to eat to satisfy nutritional requirements is one of the oldest optimization problems in operations research, yet existing formulations have two persistent limitations: continuous variables produce impractical fractional servings (1.7 eggs, 0.37 bananas), and hard nutrient constraints cause infeasibility when targets conflict. A systematic review of 56 diet optimization papers found that none combine integer programming with goal programming to address both issues. We propose Mixed Integer Goal Programming (MIGP) for personalized meal optimization. The formulation uses integer"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For meals with 15+ foods, the integer solution matches the continuous optimum in every benchmark instance. MIGP finds strictly better solutions than GP with post-hoc rounding in 66% of cases (never worse) while maintaining 100% feasibility.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That goal-programming deviation variables sufficiently buffer the integrality gap so that requiring integer servings does not degrade solution quality relative to the continuous relaxation, and that inverse-target normalization produces balanced multi-nutrient trade-offs without additional tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MIGP uses integer servings and goal deviations to produce feasible, practical meal plans that outperform post-hoc rounding of continuous solutions in 66% of cases while always succeeding.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Mixed integer goal programming yields whole-serving meal plans that match continuous nutrient optima for typical meal sizes while guaranteeing feasibility.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"007c578cb76e6d0e2c2e243ac6be66eb7d19402afd618d8de52adbe92fb93946"},"source":{"id":"2605.13849","kind":"arxiv","version":1},"verdict":{"id":"9231d261-1738-4a53-817c-b76e036821df","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T12:13:24.057615Z","strongest_claim":"For meals with 15+ foods, the integer solution matches the continuous optimum in every benchmark instance. MIGP finds strictly better solutions than GP with post-hoc rounding in 66% of cases (never worse) while maintaining 100% feasibility.","one_line_summary":"MIGP uses integer servings and goal deviations to produce feasible, practical meal plans that outperform post-hoc rounding of continuous solutions in 66% of cases while always succeeding.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That goal-programming deviation variables sufficiently buffer the integrality gap so that requiring integer servings does not degrade solution quality relative to the continuous relaxation, and that inverse-target normalization produces balanced multi-nutrient trade-offs without additional tuning.","pith_extraction_headline":"Mixed integer goal programming yields whole-serving meal plans that match continuous nutrient optima for typical meal sizes while guaranteeing feasibility."},"references":{"count":21,"sample":[{"doi":"10.3390/nu16030346","year":2024,"title":"Delighting Palates with AI: Reinforcement Learning’s Triumph in Crafting Personalized Meal Plans with High User Acceptance","work_id":"2280fd63-46dc-4025-81eb-6a870a58e7bd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.jclepro.2025.145233","year":2025,"title":"Integrating Multi-Criteria Decision- Making with Multi-Objective Optimization for Sustainable Diet Design","work_id":"dba97fb5-9c1c-48dd-880e-f1ac911a28cf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00186-024-00879-8","year":2024,"title":"Designing Sustainable Diet Plans by Solving Triobjective Integer Programs","work_id":"fd8c40e2-b57e-4501-bdd6-7bb56305726f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1287/opre","year":2009,"title":"An Exact Solution Approach for Portfolio Op- timization Problems Under Stochastic and Integer Constraints","work_id":"0217f174-e3f0-48af-9e8f-5f05c213ab3e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1097/00005176-","year":2003,"title":"Linear Programming: A Mathematical Tool for Analyzing and Op- timizing Children’s Diets During the Complementary Feeding Period","work_id":"bd344bc1-e5fb-4470-a20f-03da82f80f17","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":21,"snapshot_sha256":"d180d6ffb9d29bc214a2e21e3e0ac30d5377a26a440b550ae490e178b5c31b22","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c82f2371664cef11acdef76149ac28a53eace19a5660bfc4eb6112b49a016d08"},"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":"2605.13849","created_at":"2026-05-17T23:39:19.627996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13849v1","created_at":"2026-05-17T23:39:19.627996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13849","created_at":"2026-05-17T23:39:19.627996+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVIR67ETIAZV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVIR67ETIAZV2F4F","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVIR67ET","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A","json":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A.json","graph_json":"https://pith.science/api/pith-number/KVIR67ETIAZV2F4FU277ZEBF7A/graph.json","events_json":"https://pith.science/api/pith-number/KVIR67ETIAZV2F4FU277ZEBF7A/events.json","paper":"https://pith.science/paper/KVIR67ET"},"agent_actions":{"view_html":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A","download_json":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A.json","view_paper":"https://pith.science/paper/KVIR67ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13849&json=true","fetch_graph":"https://pith.science/api/pith-number/KVIR67ETIAZV2F4FU277ZEBF7A/graph.json","fetch_events":"https://pith.science/api/pith-number/KVIR67ETIAZV2F4FU277ZEBF7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A/action/storage_attestation","attest_author":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A/action/author_attestation","sign_citation":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A/action/citation_signature","submit_replication":"https://pith.science/pith/KVIR67ETIAZV2F4FU277ZEBF7A/action/replication_record"}},"created_at":"2026-05-17T23:39:19.627996+00:00","updated_at":"2026-05-17T23:39:19.627996+00:00"}