{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WEJQOZX4SW4AE3DBSKRKRQUCGN","short_pith_number":"pith:WEJQOZX4","canonical_record":{"source":{"id":"1404.6694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-26T23:14:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fe87aebc56ec8249320eb0928d0f9edc40a4146feab62d9af8e4c0b387fc3e1e","abstract_canon_sha256":"f8d72dc83e44bc2dcf5cfe11d2c3b4728f3a4e6d55f6049c68a16a767a97084b"},"schema_version":"1.0"},"canonical_sha256":"b1130766fc95b8026c6192a2a8c282337014aba894e9d32022f131b26da80354","source":{"kind":"arxiv","id":"1404.6694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6694","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6694v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6694","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"WEJQOZX4SW4A","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WEJQOZX4SW4AE3DB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WEJQOZX4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WEJQOZX4SW4AE3DBSKRKRQUCGN","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-26T23:14:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fe87aebc56ec8249320eb0928d0f9edc40a4146feab62d9af8e4c0b387fc3e1e","abstract_canon_sha256":"f8d72dc83e44bc2dcf5cfe11d2c3b4728f3a4e6d55f6049c68a16a767a97084b"},"schema_version":"1.0"},"canonical_sha256":"b1130766fc95b8026c6192a2a8c282337014aba894e9d32022f131b26da80354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:06.282338Z","signature_b64":"xuhxpEtc6VM5hwmTY0gK5gYCRV78erL+qsAymFRERq682/gkmP/glFsdeg6IqjxlOMJ0FJwwdFzxHAJVZpCtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1130766fc95b8026c6192a2a8c282337014aba894e9d32022f131b26da80354","last_reissued_at":"2026-05-18T02:53:06.281801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:06.281801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6694","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-05-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33mmRcxu+91HO9sMh+Tqu9l9SXwjYi0l9moSI6A13+V4NccoblB8LlnTVPju36CktijEkLYgjDxmnz+kw8h7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:13:40.618842Z"},"content_sha256":"f635642d17fbcbf490c7e2213b180354605dd3c9ffce9aa8ff70d88f7ba4585c","schema_version":"1.0","event_id":"sha256:f635642d17fbcbf490c7e2213b180354605dd3c9ffce9aa8ff70d88f7ba4585c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WEJQOZX4SW4AE3DBSKRKRQUCGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Decomposition Algorithm for Nested Resource Allocation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Nelson Maculan, Patrick Jaillet, Thibaut Vidal","submitted_at":"2014-04-26T23:14:35Z","abstract_excerpt":"We propose an exact polynomial algorithm for a resource allocation problem with convex costs and constraints on partial sums of resource consumptions, in the presence of either continuous or integer variables. No assumption of strict convexity or differentiability is needed. The method solves a hierarchy of resource allocation subproblems, whose solutions are used to convert constraints on sums of resources into bounds for separate variables at higher levels. The resulting time complexity for the integer problem is $O(n \\log m \\log (B/n))$, and the complexity of obtaining an $\\epsilon$-approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6694","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":""},"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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2JG8sVSgOHfVUHAYJ+20Ujul0eD4JO9CZ5zryCu7ZqezOFCUWXwP33hKnv+8JnR99aAVn4DbQzZDqUxIV5+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:13:40.619525Z"},"content_sha256":"7f6ccc9191791436974287dd9164e5c35f1e3cf1100633b64e88dbe208f2c38f","schema_version":"1.0","event_id":"sha256:7f6ccc9191791436974287dd9164e5c35f1e3cf1100633b64e88dbe208f2c38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/bundle.json","state_url":"https://pith.science/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/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-26T04:13:40Z","links":{"resolver":"https://pith.science/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN","bundle":"https://pith.science/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/bundle.json","state":"https://pith.science/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEJQOZX4SW4AE3DBSKRKRQUCGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WEJQOZX4SW4AE3DBSKRKRQUCGN","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":"f8d72dc83e44bc2dcf5cfe11d2c3b4728f3a4e6d55f6049c68a16a767a97084b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-26T23:14:35Z","title_canon_sha256":"fe87aebc56ec8249320eb0928d0f9edc40a4146feab62d9af8e4c0b387fc3e1e"},"schema_version":"1.0","source":{"id":"1404.6694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6694","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6694v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6694","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"WEJQOZX4SW4A","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WEJQOZX4SW4AE3DB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WEJQOZX4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:7f6ccc9191791436974287dd9164e5c35f1e3cf1100633b64e88dbe208f2c38f","target":"graph","created_at":"2026-05-18T02:53:06Z","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 propose an exact polynomial algorithm for a resource allocation problem with convex costs and constraints on partial sums of resource consumptions, in the presence of either continuous or integer variables. No assumption of strict convexity or differentiability is needed. The method solves a hierarchy of resource allocation subproblems, whose solutions are used to convert constraints on sums of resources into bounds for separate variables at higher levels. The resulting time complexity for the integer problem is $O(n \\log m \\log (B/n))$, and the complexity of obtaining an $\\epsilon$-approxi","authors_text":"Nelson Maculan, Patrick Jaillet, Thibaut Vidal","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-26T23:14:35Z","title":"A Decomposition Algorithm for Nested Resource Allocation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6694","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:f635642d17fbcbf490c7e2213b180354605dd3c9ffce9aa8ff70d88f7ba4585c","target":"record","created_at":"2026-05-18T02:53:06Z","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":"f8d72dc83e44bc2dcf5cfe11d2c3b4728f3a4e6d55f6049c68a16a767a97084b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-26T23:14:35Z","title_canon_sha256":"fe87aebc56ec8249320eb0928d0f9edc40a4146feab62d9af8e4c0b387fc3e1e"},"schema_version":"1.0","source":{"id":"1404.6694","kind":"arxiv","version":1}},"canonical_sha256":"b1130766fc95b8026c6192a2a8c282337014aba894e9d32022f131b26da80354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1130766fc95b8026c6192a2a8c282337014aba894e9d32022f131b26da80354","first_computed_at":"2026-05-18T02:53:06.281801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.281801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xuhxpEtc6VM5hwmTY0gK5gYCRV78erL+qsAymFRERq682/gkmP/glFsdeg6IqjxlOMJ0FJwwdFzxHAJVZpCtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.282338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f635642d17fbcbf490c7e2213b180354605dd3c9ffce9aa8ff70d88f7ba4585c","sha256:7f6ccc9191791436974287dd9164e5c35f1e3cf1100633b64e88dbe208f2c38f"],"state_sha256":"9db800672f868d2a6abc05fa102c13fac4440d1b35b30e463b021fbadc122616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhvon7fBrG0SnD0wd3uZ+9Ht4QTTNe4J3KM9vQxDZ7YCGUdc7MKB08wbiWcpTcI4cJERLA+vlgSDdfjR+sKRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:13:40.622858Z","bundle_sha256":"5fb0a065b5dce9b774f3a64a5a79a8b7e3024b472c0b96877b493214c1af8862"}}