{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NISZS2WQ2JTO6RCO3QHBLAE66M","short_pith_number":"pith:NISZS2WQ","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"},"canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","source":{"kind":"arxiv","id":"1703.01484","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01484","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01484v2","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01484","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"NISZS2WQ2JTO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NISZS2WQ2JTO6RCO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NISZS2WQ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NISZS2WQ2JTO6RCO3QHBLAE66M","target":"record","payload":{"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"},"canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","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"},"source_kind":"arxiv","source_id":"1703.01484","source_version":2,"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-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1fRjY4vomC8k2nESvzSVNgcpXLtO666KDxg9Biejhdn6ORzXalmZkQQ3E/EprPkGCT9QviXnRnOKtxAIVzPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:19:55.908744Z"},"content_sha256":"4730daba94f9326129753fb0e423e1fcc97be14eeed0ff7a384e89c2db8a9b34","schema_version":"1.0","event_id":"sha256:4730daba94f9326129753fb0e423e1fcc97be14eeed0ff7a384e89c2db8a9b34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NISZS2WQ2JTO6RCO3QHBLAE66M","target":"graph","payload":{"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"},"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-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElC8bOMmbubC27jKbibutIt7KkGPinkXIvztuT6vVouOeqd5P3mFns+RQt/Rq5tZxLzih0Rt57JO7HH9+Cc6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:19:55.909330Z"},"content_sha256":"92d0e32f3ad3d80207bb288db914622fac57bfbb2942ac360d60d082005fc8e1","schema_version":"1.0","event_id":"sha256:92d0e32f3ad3d80207bb288db914622fac57bfbb2942ac360d60d082005fc8e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/bundle.json","state_url":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/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-05-26T00:19:55Z","links":{"resolver":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M","bundle":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/bundle.json","state":"https://pith.science/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NISZS2WQ2JTO6RCO3QHBLAE66M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NISZS2WQ2JTO6RCO3QHBLAE66M","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":"ae10c095dc4ce4de64e5e0a3a76c105fe8fcff58fa373fdbc7ccc58d299fe7b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-04T15:49:27Z","title_canon_sha256":"eb46309ed54fc18322c91c25c178c3add308797cb56c5b6c38ca697e68b29085"},"schema_version":"1.0","source":{"id":"1703.01484","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01484","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01484v2","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01484","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"NISZS2WQ2JTO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NISZS2WQ2JTO6RCO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NISZS2WQ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:92d0e32f3ad3d80207bb288db914622fac57bfbb2942ac360d60d082005fc8e1","target":"graph","created_at":"2026-05-18T00:06:16Z","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"},"paper":{"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 ","authors_text":"Daniel Gribel, Patrick Jaillet, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-04T15:49:27Z","title":"Separable Convex Optimization with Nested Lower and Upper Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01484","kind":"arxiv","version":2},"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:4730daba94f9326129753fb0e423e1fcc97be14eeed0ff7a384e89c2db8a9b34","target":"record","created_at":"2026-05-18T00:06:16Z","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":"ae10c095dc4ce4de64e5e0a3a76c105fe8fcff58fa373fdbc7ccc58d299fe7b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-04T15:49:27Z","title_canon_sha256":"eb46309ed54fc18322c91c25c178c3add308797cb56c5b6c38ca697e68b29085"},"schema_version":"1.0","source":{"id":"1703.01484","kind":"arxiv","version":2}},"canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a25996ad0d266ef444edc0e15809ef33c3a33d022ca78c8b9e85e818b9c5d60","first_computed_at":"2026-05-18T00:06:16.412408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:16.412408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EaRjmmb+ieJZJ2kxlDzyaWm/VqZJIc4cbvsypkIENp/vycroKqsFFRynQGvGsYI55vnLQPVs6mzzbvVWZmM9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:16.412828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01484","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4730daba94f9326129753fb0e423e1fcc97be14eeed0ff7a384e89c2db8a9b34","sha256:92d0e32f3ad3d80207bb288db914622fac57bfbb2942ac360d60d082005fc8e1"],"state_sha256":"69e3570fdfe2089e2b837fc6b2e64001fbcfa4d9d07bdc47331beaa0200d0176"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ioxk87P0GRCZac1GkYhWXDAEX5vf2AMEzR5ELaYT+UvGNXX2yhCSn+ysOLxPrJQLfT7bmWzeQvzOLnWTPOlHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:19:55.912764Z","bundle_sha256":"a47d0f8bd1188674390498fbf12185963292c49c3b427c52b459ef09570a14c8"}}