{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NISZS2WQ2JTO6RCO3QHBLAE66M","short_pith_number":"pith:NISZS2WQ","schema_version":"1.0","canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","source":{"kind":"arxiv","id":"1703.01484","version":2},"attestation_state":"computed","paper":{"title":"Separable Convex Optimization with Nested Lower and Upper Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Gribel, Patrick Jaillet, Thibaut Vidal","submitted_at":"2017-03-04T15:49:27Z","abstract_excerpt":"We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which uses monotonicity arguments to generate valid bounds from the recursive calls, and eliminate linking constraints based on the information from sub-problems. This algorithm does not need strict convexity or "},"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":"1703.01484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-04T15:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"eb46309ed54fc18322c91c25c178c3add308797cb56c5b6c38ca697e68b29085","abstract_canon_sha256":"ae10c095dc4ce4de64e5e0a3a76c105fe8fcff58fa373fdbc7ccc58d299fe7b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:16.412828Z","signature_b64":"EaRjmmb+ieJZJ2kxlDzyaWm/VqZJIc4cbvsypkIENp/vycroKqsFFRynQGvGsYI55vnLQPVs6mzzbvVWZmM9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","last_reissued_at":"2026-05-18T00:06:16.412408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:16.412408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separable Convex Optimization with Nested Lower and Upper Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Gribel, Patrick Jaillet, Thibaut Vidal","submitted_at":"2017-03-04T15:49:27Z","abstract_excerpt":"We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which uses monotonicity arguments to generate valid bounds from the recursive calls, and eliminate linking constraints based on the information from sub-problems. This algorithm does not need strict convexity or "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01484","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1703.01484","created_at":"2026-05-18T00:06:16.412480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01484v2","created_at":"2026-05-18T00:06:16.412480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01484","created_at":"2026-05-18T00:06:16.412480+00:00"},{"alias_kind":"pith_short_12","alias_value":"NISZS2WQ2JTO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NISZS2WQ2JTO6RCO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NISZS2WQ","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M","json":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M.json","graph_json":"https://pith.science/api/pith-number/NISZS2WQ2JTO6RCO3QHBLAE66M/graph.json","events_json":"https://pith.science/api/pith-number/NISZS2WQ2JTO6RCO3QHBLAE66M/events.json","paper":"https://pith.science/paper/NISZS2WQ"},"agent_actions":{"view_html":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M","download_json":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M.json","view_paper":"https://pith.science/paper/NISZS2WQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01484&json=true","fetch_graph":"https://pith.science/api/pith-number/NISZS2WQ2JTO6RCO3QHBLAE66M/graph.json","fetch_events":"https://pith.science/api/pith-number/NISZS2WQ2JTO6RCO3QHBLAE66M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/action/storage_attestation","attest_author":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/action/author_attestation","sign_citation":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/action/citation_signature","submit_replication":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/action/replication_record"}},"created_at":"2026-05-18T00:06:16.412480+00:00","updated_at":"2026-05-18T00:06:16.412480+00:00"}