{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5A3MJJVT5AV3TRCEEOB62A362L","short_pith_number":"pith:5A3MJJVT","canonical_record":{"source":{"id":"1702.00063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-26T04:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"f8e919452b5febe99950c5a2072d6b096d623c9fe6d09fe23738ebd494ab9bb6","abstract_canon_sha256":"61e0d755277c7d6ead1265b48b085ca94482e8a8984782ad74fde4f0aadf021a"},"schema_version":"1.0"},"canonical_sha256":"e836c4a6b3e82bb9c4442383ed037ed2c8c353dfc3dad9b10da3e3330fb9470c","source":{"kind":"arxiv","id":"1702.00063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00063","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00063v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00063","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"5A3MJJVT5AV3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5A3MJJVT5AV3TRCE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5A3MJJVT","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5A3MJJVT5AV3TRCEEOB62A362L","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-26T04:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"f8e919452b5febe99950c5a2072d6b096d623c9fe6d09fe23738ebd494ab9bb6","abstract_canon_sha256":"61e0d755277c7d6ead1265b48b085ca94482e8a8984782ad74fde4f0aadf021a"},"schema_version":"1.0"},"canonical_sha256":"e836c4a6b3e82bb9c4442383ed037ed2c8c353dfc3dad9b10da3e3330fb9470c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.276769Z","signature_b64":"sp9/FVvQLHBy+yqb9UJbZvlMQrQOdTqzHYjATUSgBMHqcZXVrUT/ScDCRM0gRZsuVtBj4CS+cDiXCjnBk7BYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e836c4a6b3e82bb9c4442383ed037ed2c8c353dfc3dad9b10da3e3330fb9470c","last_reissued_at":"2026-05-18T00:51:35.276288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.276288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00063","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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpO2vtcPlTOfCZiWV0wAUQWPcKEkIHkWUVbd5YlodV3C4OkLm0EiWHqCAZ5/Q/+FC01cN7TSm66L9F22AQR6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:34:55.116419Z"},"content_sha256":"9c3cb90733933ed3e7b4cdef36ba0542ab7b05faa9b53635c0e603d21dcc7222","schema_version":"1.0","event_id":"sha256:9c3cb90733933ed3e7b4cdef36ba0542ab7b05faa9b53635c0e603d21dcc7222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5A3MJJVT5AV3TRCEEOB62A362L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Convex Programming for the Efficient Verification of Parametric MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hasan A. Poonawala, Ivan Papusha, Joost-Pieter Katoen, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Ufuk Topcu","submitted_at":"2017-01-26T04:20:54Z","abstract_excerpt":"Multi-objective verification problems of parametric Markov decision processes under optimality criteria can be naturally expressed as nonlinear programs. We observe that many of these computationally demanding problems belong to the subclass of signomial programs. This insight allows for a sequential optimization algorithm to efficiently compute sound but possibly suboptimal solutions. Each stage of this algorithm solves a geometric programming problem. These geometric programs are obtained by convexifying the nonconvex constraints of the original problem. Direct applications of the encodings "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00063","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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7l8tij1Cb3G32YaVIG6XDAAl8nlCzhj6LrEvs0m6i8AsROF4Tv9L0E/hGfRAZif1Tgn/HSMk8He2H3R+4MWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:34:55.116809Z"},"content_sha256":"acaa5b3a5a14531c02776e93e4a8581ce4b8acab75cc20179984fe1bc082e29e","schema_version":"1.0","event_id":"sha256:acaa5b3a5a14531c02776e93e4a8581ce4b8acab75cc20179984fe1bc082e29e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5A3MJJVT5AV3TRCEEOB62A362L/bundle.json","state_url":"https://pith.science/pith/5A3MJJVT5AV3TRCEEOB62A362L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5A3MJJVT5AV3TRCEEOB62A362L/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-23T15:34:55Z","links":{"resolver":"https://pith.science/pith/5A3MJJVT5AV3TRCEEOB62A362L","bundle":"https://pith.science/pith/5A3MJJVT5AV3TRCEEOB62A362L/bundle.json","state":"https://pith.science/pith/5A3MJJVT5AV3TRCEEOB62A362L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5A3MJJVT5AV3TRCEEOB62A362L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5A3MJJVT5AV3TRCEEOB62A362L","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":"61e0d755277c7d6ead1265b48b085ca94482e8a8984782ad74fde4f0aadf021a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-26T04:20:54Z","title_canon_sha256":"f8e919452b5febe99950c5a2072d6b096d623c9fe6d09fe23738ebd494ab9bb6"},"schema_version":"1.0","source":{"id":"1702.00063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00063","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00063v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00063","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"5A3MJJVT5AV3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5A3MJJVT5AV3TRCE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5A3MJJVT","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:acaa5b3a5a14531c02776e93e4a8581ce4b8acab75cc20179984fe1bc082e29e","target":"graph","created_at":"2026-05-18T00:51:35Z","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":"Multi-objective verification problems of parametric Markov decision processes under optimality criteria can be naturally expressed as nonlinear programs. We observe that many of these computationally demanding problems belong to the subclass of signomial programs. This insight allows for a sequential optimization algorithm to efficiently compute sound but possibly suboptimal solutions. Each stage of this algorithm solves a geometric programming problem. These geometric programs are obtained by convexifying the nonconvex constraints of the original problem. Direct applications of the encodings ","authors_text":"Hasan A. Poonawala, Ivan Papusha, Joost-Pieter Katoen, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Ufuk Topcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-26T04:20:54Z","title":"Sequential Convex Programming for the Efficient Verification of Parametric MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00063","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:9c3cb90733933ed3e7b4cdef36ba0542ab7b05faa9b53635c0e603d21dcc7222","target":"record","created_at":"2026-05-18T00:51:35Z","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":"61e0d755277c7d6ead1265b48b085ca94482e8a8984782ad74fde4f0aadf021a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-26T04:20:54Z","title_canon_sha256":"f8e919452b5febe99950c5a2072d6b096d623c9fe6d09fe23738ebd494ab9bb6"},"schema_version":"1.0","source":{"id":"1702.00063","kind":"arxiv","version":1}},"canonical_sha256":"e836c4a6b3e82bb9c4442383ed037ed2c8c353dfc3dad9b10da3e3330fb9470c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e836c4a6b3e82bb9c4442383ed037ed2c8c353dfc3dad9b10da3e3330fb9470c","first_computed_at":"2026-05-18T00:51:35.276288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.276288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sp9/FVvQLHBy+yqb9UJbZvlMQrQOdTqzHYjATUSgBMHqcZXVrUT/ScDCRM0gRZsuVtBj4CS+cDiXCjnBk7BYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.276769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c3cb90733933ed3e7b4cdef36ba0542ab7b05faa9b53635c0e603d21dcc7222","sha256:acaa5b3a5a14531c02776e93e4a8581ce4b8acab75cc20179984fe1bc082e29e"],"state_sha256":"26122643467e137505c93f004e03fb20fc3fddd08ff68882370d522fe99f32c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ILADkFryURxP8Spe/xuJCTO3scYoi4rzZ46by2okxwFyaG0Bu2JU1tC63WUVqPm8NIo4eDj1FNIP2k0wUHaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:34:55.119936Z","bundle_sha256":"9ba0416eac2905ab6f4858f1d92fd1220c79cf3b2f5e8ca791fd61d7422fa75f"}}