{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DJQQZGD3OTR6LOPHPNA5NCIOGM","short_pith_number":"pith:DJQQZGD3","canonical_record":{"source":{"id":"1808.10241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-30T11:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"c7c17a096710141fa60c9aeaa301928b8d3e0fe33cca946e1224cb7f39852034","abstract_canon_sha256":"1fcbe00bbbb623fe21136a0a7181653a6355b3138e350a4d3194742563785f32"},"schema_version":"1.0"},"canonical_sha256":"1a610c987b74e3e5b9e77b41d6890e330b64e8409ead937cfaaba46b9a66e6f6","source":{"kind":"arxiv","id":"1808.10241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10241","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10241v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10241","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"DJQQZGD3OTR6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DJQQZGD3OTR6LOPH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DJQQZGD3","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DJQQZGD3OTR6LOPHPNA5NCIOGM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-30T11:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"c7c17a096710141fa60c9aeaa301928b8d3e0fe33cca946e1224cb7f39852034","abstract_canon_sha256":"1fcbe00bbbb623fe21136a0a7181653a6355b3138e350a4d3194742563785f32"},"schema_version":"1.0"},"canonical_sha256":"1a610c987b74e3e5b9e77b41d6890e330b64e8409ead937cfaaba46b9a66e6f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.419439Z","signature_b64":"tNkXmCRnbkvwIW5zZ2zzGEuMwEQmy2McwZ2kKlg6sWj/IF0GuI3W9+ZUbLOfvDbZ8PaheHgF94ZxJHSd7SR1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a610c987b74e3e5b9e77b41d6890e330b64e8409ead937cfaaba46b9a66e6f6","last_reissued_at":"2026-05-18T00:06:49.418687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.418687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10241","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:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKU2Iv+WSKMPVhdSNb7ThiYkYnPc4UmbXbr0bPv89dZ9f3FoRNNR6DPj3IJn6boAHmU7THvIQpJu4hTmXUWaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:03.865453Z"},"content_sha256":"1edc4df4eb0821c4d29d1562a468018368e1ccae4e0dc18995c4f08249d405a7","schema_version":"1.0","event_id":"sha256:1edc4df4eb0821c4d29d1562a468018368e1ccae4e0dc18995c4f08249d405a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DJQQZGD3OTR6LOPHPNA5NCIOGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Denis A{\\ss}mann, Frauke Liers, Juan C. Vera, Michael Stingl","submitted_at":"2018-08-30T11:50:12Z","abstract_excerpt":"In this paper we study feasibility and infeasibility of nonlinear two-stage fully adjustable robust feasibility problems with an empty first stage. This is equivalent to deciding whether the uncertainty set is contained within the projection of the feasible region onto the uncertainty-space. Moreover, the considered sets are assumed to be described by polynomials. For answering this question, two very general approaches using methods from polynomial optimization are presented - one for showing feasibility and one for showing infeasibility. The developed methods are approximated through sum of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10241","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:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImyLfpiGs+DXe9+ToNd6sAcxVkgMQ5bxa0vZAcLwgHg6cA1kTav4DB72PV/eOG1uI4ZWwg/+sCCTqRCbNI7iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:03.865797Z"},"content_sha256":"eee9dc73a04f5c2487e10e74a17c30eecf44766c778aac7a8c470557022149de","schema_version":"1.0","event_id":"sha256:eee9dc73a04f5c2487e10e74a17c30eecf44766c778aac7a8c470557022149de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/bundle.json","state_url":"https://pith.science/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/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-08T23:47:03Z","links":{"resolver":"https://pith.science/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM","bundle":"https://pith.science/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/bundle.json","state":"https://pith.science/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJQQZGD3OTR6LOPHPNA5NCIOGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DJQQZGD3OTR6LOPHPNA5NCIOGM","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":"1fcbe00bbbb623fe21136a0a7181653a6355b3138e350a4d3194742563785f32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-30T11:50:12Z","title_canon_sha256":"c7c17a096710141fa60c9aeaa301928b8d3e0fe33cca946e1224cb7f39852034"},"schema_version":"1.0","source":{"id":"1808.10241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10241","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10241v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10241","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"DJQQZGD3OTR6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DJQQZGD3OTR6LOPH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DJQQZGD3","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:eee9dc73a04f5c2487e10e74a17c30eecf44766c778aac7a8c470557022149de","target":"graph","created_at":"2026-05-18T00:06:49Z","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":"In this paper we study feasibility and infeasibility of nonlinear two-stage fully adjustable robust feasibility problems with an empty first stage. This is equivalent to deciding whether the uncertainty set is contained within the projection of the feasible region onto the uncertainty-space. Moreover, the considered sets are assumed to be described by polynomials. For answering this question, two very general approaches using methods from polynomial optimization are presented - one for showing feasibility and one for showing infeasibility. The developed methods are approximated through sum of ","authors_text":"Denis A{\\ss}mann, Frauke Liers, Juan C. Vera, Michael Stingl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-30T11:50:12Z","title":"Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10241","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:1edc4df4eb0821c4d29d1562a468018368e1ccae4e0dc18995c4f08249d405a7","target":"record","created_at":"2026-05-18T00:06:49Z","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":"1fcbe00bbbb623fe21136a0a7181653a6355b3138e350a4d3194742563785f32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-30T11:50:12Z","title_canon_sha256":"c7c17a096710141fa60c9aeaa301928b8d3e0fe33cca946e1224cb7f39852034"},"schema_version":"1.0","source":{"id":"1808.10241","kind":"arxiv","version":1}},"canonical_sha256":"1a610c987b74e3e5b9e77b41d6890e330b64e8409ead937cfaaba46b9a66e6f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a610c987b74e3e5b9e77b41d6890e330b64e8409ead937cfaaba46b9a66e6f6","first_computed_at":"2026-05-18T00:06:49.418687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:49.418687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tNkXmCRnbkvwIW5zZ2zzGEuMwEQmy2McwZ2kKlg6sWj/IF0GuI3W9+ZUbLOfvDbZ8PaheHgF94ZxJHSd7SR1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:49.419439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1edc4df4eb0821c4d29d1562a468018368e1ccae4e0dc18995c4f08249d405a7","sha256:eee9dc73a04f5c2487e10e74a17c30eecf44766c778aac7a8c470557022149de"],"state_sha256":"ac0b6acba17b36cfa713edffaf54bbd123802e299637e58581ee8d9346ff618c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/vQu6vlWxhrN9GRbFZW5GkUhqM9Nc79LyEbl1mMhb3wJ/OLVp3eNVoj2yE5zFNayZtQ5l2kavysMou2NHXtNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:47:03.867670Z","bundle_sha256":"77c157b505786dcf633ace4563333f249747e582cc83a82809e05d482cd74f4e"}}