{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J5ZXQMIKNY3S5EISISGAXGJ7FN","short_pith_number":"pith:J5ZXQMIK","canonical_record":{"source":{"id":"1404.5711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-23T05:50:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"366a6a821ebdefca3e4a93c54a06257861b6b7a8a0fccd138d1d70be9b8a7c44","abstract_canon_sha256":"a9f872cd5d55b1a47bdce56270c4dc4ea6d1ae2065067d318d0d3c0bb41776ae"},"schema_version":"1.0"},"canonical_sha256":"4f7378310a6e372e9112448c0b993f2b789c27a692d839819f11c86d47ec9072","source":{"kind":"arxiv","id":"1404.5711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5711","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5711v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5711","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"J5ZXQMIKNY3S","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J5ZXQMIKNY3S5EIS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J5ZXQMIK","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J5ZXQMIKNY3S5EISISGAXGJ7FN","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-23T05:50:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"366a6a821ebdefca3e4a93c54a06257861b6b7a8a0fccd138d1d70be9b8a7c44","abstract_canon_sha256":"a9f872cd5d55b1a47bdce56270c4dc4ea6d1ae2065067d318d0d3c0bb41776ae"},"schema_version":"1.0"},"canonical_sha256":"4f7378310a6e372e9112448c0b993f2b789c27a692d839819f11c86d47ec9072","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.118689Z","signature_b64":"s+BlUeukr3MEfVj0wKECnrK6WXIo+FBd2vALJSYWv4OTGDOrtIBa2iB9x6t9MY7YK7AUTM2aIBCAok/Q8ESbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7378310a6e372e9112448c0b993f2b789c27a692d839819f11c86d47ec9072","last_reissued_at":"2026-05-18T02:53:28.117971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.117971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5711","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRu2hSrxtNH5u8RqXTzizZDht9WGvvM5FadLLaQq0ImKlgEnQ173U9dQCZVMOXaZaB8fac4kaUmUA+CH7jHgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:21:28.673616Z"},"content_sha256":"ee86916badbac41ed77b125d3852dd743df1d1b7d6ab97c1f3e20c8c98179004","schema_version":"1.0","event_id":"sha256:ee86916badbac41ed77b125d3852dd743df1d1b7d6ab97c1f3e20c8c98179004"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J5ZXQMIKNY3S5EISISGAXGJ7FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling multi-stage decision optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Ronald Hochreiter","submitted_at":"2014-04-23T05:50:11Z","abstract_excerpt":"Multi-stage optimization under uncertainty techniques can be used to solve long-term management problems. Although many optimization modeling language extensions as well as computational environments have been proposed, the acceptance of this technique is generally low, due to the inherent complexity of the modeling and solution process. In this paper a simplification to annotate multi-stage decision problems under uncertainty is presented - this simplification contrasts with the common approach to create an extension on top of an existing optimization modeling language. This leads to the defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5711","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPChrb4Wj4VCSFkphcyIDbDddSB1OJhHk3lZUqt5PWUOap5l7y3zXSvVgjTmfUfg16fvMA9EuUqQ5weSzjndCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:21:28.673967Z"},"content_sha256":"1821f439db4ff23b9b8d41c43dbb34b3ad40b021f9fda5a80cd76c1d6ea88ff3","schema_version":"1.0","event_id":"sha256:1821f439db4ff23b9b8d41c43dbb34b3ad40b021f9fda5a80cd76c1d6ea88ff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/bundle.json","state_url":"https://pith.science/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/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-01T22:21:28Z","links":{"resolver":"https://pith.science/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN","bundle":"https://pith.science/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/bundle.json","state":"https://pith.science/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5ZXQMIKNY3S5EISISGAXGJ7FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J5ZXQMIKNY3S5EISISGAXGJ7FN","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":"a9f872cd5d55b1a47bdce56270c4dc4ea6d1ae2065067d318d0d3c0bb41776ae","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-23T05:50:11Z","title_canon_sha256":"366a6a821ebdefca3e4a93c54a06257861b6b7a8a0fccd138d1d70be9b8a7c44"},"schema_version":"1.0","source":{"id":"1404.5711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5711","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5711v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5711","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"J5ZXQMIKNY3S","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J5ZXQMIKNY3S5EIS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J5ZXQMIK","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:1821f439db4ff23b9b8d41c43dbb34b3ad40b021f9fda5a80cd76c1d6ea88ff3","target":"graph","created_at":"2026-05-18T02:53:28Z","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-stage optimization under uncertainty techniques can be used to solve long-term management problems. Although many optimization modeling language extensions as well as computational environments have been proposed, the acceptance of this technique is generally low, due to the inherent complexity of the modeling and solution process. In this paper a simplification to annotate multi-stage decision problems under uncertainty is presented - this simplification contrasts with the common approach to create an extension on top of an existing optimization modeling language. This leads to the defi","authors_text":"Ronald Hochreiter","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-23T05:50:11Z","title":"Modeling multi-stage decision optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5711","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:ee86916badbac41ed77b125d3852dd743df1d1b7d6ab97c1f3e20c8c98179004","target":"record","created_at":"2026-05-18T02:53:28Z","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":"a9f872cd5d55b1a47bdce56270c4dc4ea6d1ae2065067d318d0d3c0bb41776ae","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-23T05:50:11Z","title_canon_sha256":"366a6a821ebdefca3e4a93c54a06257861b6b7a8a0fccd138d1d70be9b8a7c44"},"schema_version":"1.0","source":{"id":"1404.5711","kind":"arxiv","version":1}},"canonical_sha256":"4f7378310a6e372e9112448c0b993f2b789c27a692d839819f11c86d47ec9072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f7378310a6e372e9112448c0b993f2b789c27a692d839819f11c86d47ec9072","first_computed_at":"2026-05-18T02:53:28.117971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.117971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+BlUeukr3MEfVj0wKECnrK6WXIo+FBd2vALJSYWv4OTGDOrtIBa2iB9x6t9MY7YK7AUTM2aIBCAok/Q8ESbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.118689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee86916badbac41ed77b125d3852dd743df1d1b7d6ab97c1f3e20c8c98179004","sha256:1821f439db4ff23b9b8d41c43dbb34b3ad40b021f9fda5a80cd76c1d6ea88ff3"],"state_sha256":"bc101b6e38fb7f3b5aeb3386944de5a2dd774e56c036154b3952b1f1e4d5728f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMxYytHw1gzrtIeCVt4ti0SyO93bMZxgT8b6Id7B0Be/Vj1TwdB+6bcFxX1J7Pe4EriSiHiNGFMjg9wbCWElBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:21:28.675905Z","bundle_sha256":"95e0335e54ac899bfa3d3b4758d97fb29fef305b13919cce08742e43d7f53b8f"}}