{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IAECNQVYXOBLA3MDUETK227M65","short_pith_number":"pith:IAECNQVY","canonical_record":{"source":{"id":"1908.01792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T18:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"c16b42dde14c0e06af0d24ae21567038a9522b46421c914f17ecd4faec809196","abstract_canon_sha256":"cf2407b4e22d0d4b0b57a7a1ac0ae74f298331a4433ee19b2e0a4af4c74cd968"},"schema_version":"1.0"},"canonical_sha256":"400826c2b8bb82b06d83a126ad6becf773c8bd2ad1a3f4c8cf43dec10076b76e","source":{"kind":"arxiv","id":"1908.01792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01792","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01792v1","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01792","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"IAECNQVYXOBL","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_16","alias_value":"IAECNQVYXOBLA3MD","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_8","alias_value":"IAECNQVY","created_at":"2026-07-04T23:51:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IAECNQVYXOBLA3MDUETK227M65","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T18:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"c16b42dde14c0e06af0d24ae21567038a9522b46421c914f17ecd4faec809196","abstract_canon_sha256":"cf2407b4e22d0d4b0b57a7a1ac0ae74f298331a4433ee19b2e0a4af4c74cd968"},"schema_version":"1.0"},"canonical_sha256":"400826c2b8bb82b06d83a126ad6becf773c8bd2ad1a3f4c8cf43dec10076b76e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:47.534208Z","signature_b64":"g0KAJi1eESckyuawJXfczniucZ6SDC53BZuzfw0Ldp+8EF45gk+/7MfdSZlo9K+Iko0fi1dVvHl7HNBCEKv1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"400826c2b8bb82b06d83a126ad6becf773c8bd2ad1a3f4c8cf43dec10076b76e","last_reissued_at":"2026-07-04T23:51:47.533861Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:47.533861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01792","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-07-04T23:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1ChwiMQ/ByqhE8LvK8HVohqbualAmzzpOo8QeBx8SgbioAUyJ7LpZB9VwyGOmDT6k+TyhHAj88O8vDV3r3/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:47:07.944231Z"},"content_sha256":"2ffe067e6a6c3ef2cac17f40cc2f12e000186f4c461cd7f5002d3d65a98eea39","schema_version":"1.0","event_id":"sha256:2ffe067e6a6c3ef2cac17f40cc2f12e000186f4c461cd7f5002d3d65a98eea39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IAECNQVYXOBLA3MDUETK227M65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph Theoretic Approach to Non-Anticipativity Constraint Generation in Multistage Stochastic Programs with Incomplete Scenario Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Vinel, Brianna Christian, Selen Cremaschi, Zuo Zheng","submitted_at":"2019-08-05T18:13:03Z","abstract_excerpt":"We propose an algorithm for generating a minimum-cardinality set of non-anticipativity constraints (NAC) for scenario-based multistage-stochastic programming (MSSP) problems with both endogenous and exogenous uncertainties which allow for gradual realizations. Recently several authors have considered approaches to generate the minimum cardinality NAC set for MSSPs for various scenario set structures. However, these approaches have been limited to uncertain parameters where the realizations occur instantaneously or the full set of scenarios is required. The proposed algorithm, referred to as Sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01792","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01792/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OGHBZoJj8WrfKUCxSs8UYw0B3m3XGKoHFdXzQQgFDhX8SpAmAcRm2osS+tADpEOmzWPoZgFbSFWl+1AV9O5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:47:07.945123Z"},"content_sha256":"3964fcdba18f78d7276684a4e45cd0b9801051891cf789c6bd720c275e0b1217","schema_version":"1.0","event_id":"sha256:3964fcdba18f78d7276684a4e45cd0b9801051891cf789c6bd720c275e0b1217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAECNQVYXOBLA3MDUETK227M65/bundle.json","state_url":"https://pith.science/pith/IAECNQVYXOBLA3MDUETK227M65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAECNQVYXOBLA3MDUETK227M65/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-08-16T14:47:07Z","links":{"resolver":"https://pith.science/pith/IAECNQVYXOBLA3MDUETK227M65","bundle":"https://pith.science/pith/IAECNQVYXOBLA3MDUETK227M65/bundle.json","state":"https://pith.science/pith/IAECNQVYXOBLA3MDUETK227M65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAECNQVYXOBLA3MDUETK227M65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IAECNQVYXOBLA3MDUETK227M65","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":"cf2407b4e22d0d4b0b57a7a1ac0ae74f298331a4433ee19b2e0a4af4c74cd968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T18:13:03Z","title_canon_sha256":"c16b42dde14c0e06af0d24ae21567038a9522b46421c914f17ecd4faec809196"},"schema_version":"1.0","source":{"id":"1908.01792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01792","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01792v1","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01792","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"IAECNQVYXOBL","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_16","alias_value":"IAECNQVYXOBLA3MD","created_at":"2026-07-04T23:51:47Z"},{"alias_kind":"pith_short_8","alias_value":"IAECNQVY","created_at":"2026-07-04T23:51:47Z"}],"graph_snapshots":[{"event_id":"sha256:3964fcdba18f78d7276684a4e45cd0b9801051891cf789c6bd720c275e0b1217","target":"graph","created_at":"2026-07-04T23:51:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01792/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an algorithm for generating a minimum-cardinality set of non-anticipativity constraints (NAC) for scenario-based multistage-stochastic programming (MSSP) problems with both endogenous and exogenous uncertainties which allow for gradual realizations. Recently several authors have considered approaches to generate the minimum cardinality NAC set for MSSPs for various scenario set structures. However, these approaches have been limited to uncertain parameters where the realizations occur instantaneously or the full set of scenarios is required. The proposed algorithm, referred to as Sa","authors_text":"Alexander Vinel, Brianna Christian, Selen Cremaschi, Zuo Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T18:13:03Z","title":"A Graph Theoretic Approach to Non-Anticipativity Constraint Generation in Multistage Stochastic Programs with Incomplete Scenario Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01792","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:2ffe067e6a6c3ef2cac17f40cc2f12e000186f4c461cd7f5002d3d65a98eea39","target":"record","created_at":"2026-07-04T23:51:47Z","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":"cf2407b4e22d0d4b0b57a7a1ac0ae74f298331a4433ee19b2e0a4af4c74cd968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T18:13:03Z","title_canon_sha256":"c16b42dde14c0e06af0d24ae21567038a9522b46421c914f17ecd4faec809196"},"schema_version":"1.0","source":{"id":"1908.01792","kind":"arxiv","version":1}},"canonical_sha256":"400826c2b8bb82b06d83a126ad6becf773c8bd2ad1a3f4c8cf43dec10076b76e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"400826c2b8bb82b06d83a126ad6becf773c8bd2ad1a3f4c8cf43dec10076b76e","first_computed_at":"2026-07-04T23:51:47.533861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:47.533861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0KAJi1eESckyuawJXfczniucZ6SDC53BZuzfw0Ldp+8EF45gk+/7MfdSZlo9K+Iko0fi1dVvHl7HNBCEKv1Ag==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:47.534208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ffe067e6a6c3ef2cac17f40cc2f12e000186f4c461cd7f5002d3d65a98eea39","sha256:3964fcdba18f78d7276684a4e45cd0b9801051891cf789c6bd720c275e0b1217"],"state_sha256":"89c2413d173e778b0c9074ba1eca86d8c3b4b0f4e4ba7585e329ec602807c24a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVpgrhqKrcXYM0/ajiit048LQRw7BxPw6O8Vp7a7UjCpimWyzndJ0DHOCL29jgjgdeRofmCuoXQAUx+naSLFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:47:07.950434Z","bundle_sha256":"a8bce8594f18241c18a055fd0cb0c0295a6035bf408bd862038951795263ac70"}}