{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T4IT3NJYREZRTJIEWJ4HMF7TZE","short_pith_number":"pith:T4IT3NJY","canonical_record":{"source":{"id":"1508.04805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T21:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"20c40c697761aceaa925725606ab05096e08f2dffa07651837842de58c04f58f","abstract_canon_sha256":"60e6db80248601183f04881e86ddb251b26d2327cc15dcbffa4ae1377e70a19d"},"schema_version":"1.0"},"canonical_sha256":"9f113db538893319a504b2787617f3c90b738289d501527cbfca760d13cdf302","source":{"kind":"arxiv","id":"1508.04805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04805","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04805v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04805","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"T4IT3NJYREZR","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4IT3NJYREZRTJIE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4IT3NJY","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T4IT3NJYREZRTJIEWJ4HMF7TZE","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T21:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"20c40c697761aceaa925725606ab05096e08f2dffa07651837842de58c04f58f","abstract_canon_sha256":"60e6db80248601183f04881e86ddb251b26d2327cc15dcbffa4ae1377e70a19d"},"schema_version":"1.0"},"canonical_sha256":"9f113db538893319a504b2787617f3c90b738289d501527cbfca760d13cdf302","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.518972Z","signature_b64":"P7fLjBD/S9QWbUaIdas7OgWz8yB7dsHuQvqoYlAYoxUUiSPSEFj7s6hsGNj4ReGe5Ac7EJnHkFFjVD4rlVl4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f113db538893319a504b2787617f3c90b738289d501527cbfca760d13cdf302","last_reissued_at":"2026-05-18T01:35:01.518371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.518371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04805","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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywW6ELVpaYz74y1/iENAzXfgRNo/TbVBkSazsXouMgQGs5+fBP2XcEWTxPTqkFE+yb4URYCyp8QBAP2Yt4DCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T06:17:08.698454Z"},"content_sha256":"639ebcdc6170eed337b4e7437062a66020c0a3cc02d957f0ed7aaeec54d624e5","schema_version":"1.0","event_id":"sha256:639ebcdc6170eed337b4e7437062a66020c0a3cc02d957f0ed7aaeec54d624e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T4IT3NJYREZRTJIEWJ4HMF7TZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust fractional programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bram L. Gorissen","submitted_at":"2015-08-19T21:26:09Z","abstract_excerpt":"We extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust Optimization. Our contribution is threefold. First, we provide conditions to guarantee that either a globally optimal solution, or a sequence converging to the globally optimal solution, can be found by solving one or more convex optimization problems. Second, we identify two cases for which an exact solution can be obtained by solving a single optimization p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04805","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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0gLuO1kJUqK4ItSgTKgLOBbTIroH4MPB86kJJhsv3w7V7SwwcOa+wbpy77FUgTRicFWOiIJQBE70obgSIiZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T06:17:08.698809Z"},"content_sha256":"6277370b388bf026723d11f5a7d7d268fb6aacfe714a71dc40dc56e007aee9b6","schema_version":"1.0","event_id":"sha256:6277370b388bf026723d11f5a7d7d268fb6aacfe714a71dc40dc56e007aee9b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/bundle.json","state_url":"https://pith.science/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/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-07-04T06:17:08Z","links":{"resolver":"https://pith.science/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE","bundle":"https://pith.science/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/bundle.json","state":"https://pith.science/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4IT3NJYREZRTJIEWJ4HMF7TZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4IT3NJYREZRTJIEWJ4HMF7TZE","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":"60e6db80248601183f04881e86ddb251b26d2327cc15dcbffa4ae1377e70a19d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T21:26:09Z","title_canon_sha256":"20c40c697761aceaa925725606ab05096e08f2dffa07651837842de58c04f58f"},"schema_version":"1.0","source":{"id":"1508.04805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04805","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04805v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04805","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"T4IT3NJYREZR","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4IT3NJYREZRTJIE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4IT3NJY","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6277370b388bf026723d11f5a7d7d268fb6aacfe714a71dc40dc56e007aee9b6","target":"graph","created_at":"2026-05-18T01:35:01Z","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 extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust Optimization. Our contribution is threefold. First, we provide conditions to guarantee that either a globally optimal solution, or a sequence converging to the globally optimal solution, can be found by solving one or more convex optimization problems. Second, we identify two cases for which an exact solution can be obtained by solving a single optimization p","authors_text":"Bram L. Gorissen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T21:26:09Z","title":"Robust fractional programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04805","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:639ebcdc6170eed337b4e7437062a66020c0a3cc02d957f0ed7aaeec54d624e5","target":"record","created_at":"2026-05-18T01:35:01Z","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":"60e6db80248601183f04881e86ddb251b26d2327cc15dcbffa4ae1377e70a19d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T21:26:09Z","title_canon_sha256":"20c40c697761aceaa925725606ab05096e08f2dffa07651837842de58c04f58f"},"schema_version":"1.0","source":{"id":"1508.04805","kind":"arxiv","version":1}},"canonical_sha256":"9f113db538893319a504b2787617f3c90b738289d501527cbfca760d13cdf302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f113db538893319a504b2787617f3c90b738289d501527cbfca760d13cdf302","first_computed_at":"2026-05-18T01:35:01.518371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:01.518371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P7fLjBD/S9QWbUaIdas7OgWz8yB7dsHuQvqoYlAYoxUUiSPSEFj7s6hsGNj4ReGe5Ac7EJnHkFFjVD4rlVl4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:01.518972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:639ebcdc6170eed337b4e7437062a66020c0a3cc02d957f0ed7aaeec54d624e5","sha256:6277370b388bf026723d11f5a7d7d268fb6aacfe714a71dc40dc56e007aee9b6"],"state_sha256":"bdecaeec58f35fbe978206d6a546c6e208096d7be82ef7318445613c850618cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfIX5m6lBgoyJEY+efqaiTKvadon/J0W2jfkyjP+7Kpsd2U5fEtt7vur6Six2+XEOXLZlOrAFa+0fWyR98YgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T06:17:08.701655Z","bundle_sha256":"5de9d94646898020f956d0feb46b4c4d7e89d540f3f37778683fafe3caa0c693"}}