{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EROL7BUA7DXLTLJHCBY2BJPDNI","short_pith_number":"pith:EROL7BUA","canonical_record":{"source":{"id":"1703.06128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-17T17:45:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"182fd8e84e7fbdc5bb2908150993bcc5127ea73e984091ed5f8be4e943f004a0","abstract_canon_sha256":"4fac3f1eb4f11bd8a8b394912baa41d1b86d8786ee1102eb960f569e9601f121"},"schema_version":"1.0"},"canonical_sha256":"245cbf8680f8eeb9ad271071a0a5e36a1af93e9eb364c697f2bf9366e45c5bef","source":{"kind":"arxiv","id":"1703.06128","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06128","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06128v3","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06128","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"EROL7BUA7DXL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EROL7BUA7DXLTLJH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EROL7BUA","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EROL7BUA7DXLTLJHCBY2BJPDNI","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-17T17:45:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"182fd8e84e7fbdc5bb2908150993bcc5127ea73e984091ed5f8be4e943f004a0","abstract_canon_sha256":"4fac3f1eb4f11bd8a8b394912baa41d1b86d8786ee1102eb960f569e9601f121"},"schema_version":"1.0"},"canonical_sha256":"245cbf8680f8eeb9ad271071a0a5e36a1af93e9eb364c697f2bf9366e45c5bef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.131554Z","signature_b64":"i6kIoobgMihr28yq+M27tVxlSfB2BBO37z7voPd5HYWx6GQ182eLtD7I/qIwkUfJhvcAHUzbI3biG0givcn0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245cbf8680f8eeb9ad271071a0a5e36a1af93e9eb364c697f2bf9366e45c5bef","last_reissued_at":"2026-05-17T23:59:18.131047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.131047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06128","source_version":3,"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDm26HwzgQ05aqSDbUIDUWyeZAW68J30BuF4+7trSrbHRmXx5CW0gSBeyfCc7iKy7BRpHSBYtx8v1szfEEn2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:44:18.052520Z"},"content_sha256":"fa7283dac8b3eecc359d77fbc8acfd352b0687a5157a28bd75455552b385265d","schema_version":"1.0","event_id":"sha256:fa7283dac8b3eecc359d77fbc8acfd352b0687a5157a28bd75455552b385265d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EROL7BUA7DXLTLJHCBY2BJPDNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimization of Convex Functionals of Probability Distributions Under Band Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdelhak M. Zoubir, Michael Fauss","submitted_at":"2017-03-17T17:45:21Z","abstract_excerpt":"The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality conditions as well as a bound on the optimality gap of feasible candidate solutions are derived. Based on these results, two numerical algorithms are proposed that iteratively solve the system of optimality conditions on a grid of discrete points. Both algorithms use a block coordinate descent strategy and terminate once the optimality gap falls below the desir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06128","kind":"arxiv","version":3},"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmL6YmLlktCBTNwleX8XgfSUrUOjdmHuVQXOMSpqEwuzR6+ZK+5APvVky5NILMAQJr5X/zS96QXK4pn5C7mvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:44:18.052865Z"},"content_sha256":"f54f9bbba7eae83ea1e60519177d2aaff5815ec02703cb8b569d9894451503ee","schema_version":"1.0","event_id":"sha256:f54f9bbba7eae83ea1e60519177d2aaff5815ec02703cb8b569d9894451503ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/bundle.json","state_url":"https://pith.science/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/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-06-29T20:44:18Z","links":{"resolver":"https://pith.science/pith/EROL7BUA7DXLTLJHCBY2BJPDNI","bundle":"https://pith.science/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/bundle.json","state":"https://pith.science/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EROL7BUA7DXLTLJHCBY2BJPDNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EROL7BUA7DXLTLJHCBY2BJPDNI","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":"4fac3f1eb4f11bd8a8b394912baa41d1b86d8786ee1102eb960f569e9601f121","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-17T17:45:21Z","title_canon_sha256":"182fd8e84e7fbdc5bb2908150993bcc5127ea73e984091ed5f8be4e943f004a0"},"schema_version":"1.0","source":{"id":"1703.06128","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06128","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06128v3","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06128","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"EROL7BUA7DXL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EROL7BUA7DXLTLJH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EROL7BUA","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f54f9bbba7eae83ea1e60519177d2aaff5815ec02703cb8b569d9894451503ee","target":"graph","created_at":"2026-05-17T23:59:18Z","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":"The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality conditions as well as a bound on the optimality gap of feasible candidate solutions are derived. Based on these results, two numerical algorithms are proposed that iteratively solve the system of optimality conditions on a grid of discrete points. Both algorithms use a block coordinate descent strategy and terminate once the optimality gap falls below the desir","authors_text":"Abdelhak M. Zoubir, Michael Fauss","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-17T17:45:21Z","title":"On the Minimization of Convex Functionals of Probability Distributions Under Band Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06128","kind":"arxiv","version":3},"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:fa7283dac8b3eecc359d77fbc8acfd352b0687a5157a28bd75455552b385265d","target":"record","created_at":"2026-05-17T23:59:18Z","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":"4fac3f1eb4f11bd8a8b394912baa41d1b86d8786ee1102eb960f569e9601f121","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-17T17:45:21Z","title_canon_sha256":"182fd8e84e7fbdc5bb2908150993bcc5127ea73e984091ed5f8be4e943f004a0"},"schema_version":"1.0","source":{"id":"1703.06128","kind":"arxiv","version":3}},"canonical_sha256":"245cbf8680f8eeb9ad271071a0a5e36a1af93e9eb364c697f2bf9366e45c5bef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"245cbf8680f8eeb9ad271071a0a5e36a1af93e9eb364c697f2bf9366e45c5bef","first_computed_at":"2026-05-17T23:59:18.131047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.131047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6kIoobgMihr28yq+M27tVxlSfB2BBO37z7voPd5HYWx6GQ182eLtD7I/qIwkUfJhvcAHUzbI3biG0givcn0Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.131554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06128","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa7283dac8b3eecc359d77fbc8acfd352b0687a5157a28bd75455552b385265d","sha256:f54f9bbba7eae83ea1e60519177d2aaff5815ec02703cb8b569d9894451503ee"],"state_sha256":"389165f73031133381b30a5d1c0f7cac597680ecca494ed2d2732ce9d1158a2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"En03KdxD39aeJfZbfJS+0mSNBBfi6+PAiRuDl6IINV7JWDWwJEy/+kyFz+XnDZNLEN/PEA512lThiQmQmydqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:44:18.054785Z","bundle_sha256":"245b04ceb23d928d4ebd1f66dd66c3bddfdebd59a63e0708db323ed444f5fe0d"}}