{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6L5HQH5BW5EZS4LK7MAPERZREH","short_pith_number":"pith:6L5HQH5B","canonical_record":{"source":{"id":"2606.02469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T16:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"25c2736518a9df6c30bc5bf2b91bb3755b7b6331ef8bbc39715fe6521ac39a0a","abstract_canon_sha256":"b77c8a683796aeb4e9938022342e7e301e77564b3af729baa65de1673a8c26e1"},"schema_version":"1.0"},"canonical_sha256":"f2fa781fa1b74999716afb00f2473121eab8ea0d4942d57998ec549b2224b23a","source":{"kind":"arxiv","id":"2606.02469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02469","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02469v1","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02469","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"6L5HQH5BW5EZ","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"6L5HQH5BW5EZS4LK","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"6L5HQH5B","created_at":"2026-06-02T03:05:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6L5HQH5BW5EZS4LK7MAPERZREH","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T16:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"25c2736518a9df6c30bc5bf2b91bb3755b7b6331ef8bbc39715fe6521ac39a0a","abstract_canon_sha256":"b77c8a683796aeb4e9938022342e7e301e77564b3af729baa65de1673a8c26e1"},"schema_version":"1.0"},"canonical_sha256":"f2fa781fa1b74999716afb00f2473121eab8ea0d4942d57998ec549b2224b23a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:07.058573Z","signature_b64":"HICkRj9uZ87se9hAevV7zYoFI8qBI2siWdwbTBySCJOJdFfHYTkqGBygEQCMhucoh7RuIi7pjVSuAwyqaIBLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2fa781fa1b74999716afb00f2473121eab8ea0d4942d57998ec549b2224b23a","last_reissued_at":"2026-06-02T03:05:07.058230Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:07.058230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02469","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-06-02T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ary2lmBmkHgQavYkjKnjoI7sf/hL552TTXc4paigq9xir7qK22rlo8A2RL5RPvNT7YCIJ96iN/hqXdln0x7PAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:18:35.339563Z"},"content_sha256":"53da65d75047336d2335a2fbeb2c13993c10ba2442fc529acaf5babbaddbef0b","schema_version":"1.0","event_id":"sha256:53da65d75047336d2335a2fbeb2c13993c10ba2442fc529acaf5babbaddbef0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6L5HQH5BW5EZS4LK7MAPERZREH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Spinelli, Francesca Maggioni, Mike Hewitt","submitted_at":"2026-06-01T16:41:09Z","abstract_excerpt":"This paper introduces the L-shaped refinement chain cuts method, a novel approach for solving two-stage stochastic programs. The proposed method integrates the refinement chain of scenarios within the classical L-shaped decomposition framework. In the proposed approach, the full scenario set is partitioned into subgroups at each level of the refinement chain, and one subproblem is solved for each subgroup rather than for each individual scenario as in the classical L-shaped method. The proposed framework generalizes both the classical multi-cut and single-cut L-shaped formulations. Theoretical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02469","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/2606.02469/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-06-02T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptHs2hZ56CT26s0bVmMSUUl9sgghjZW8eqj6STlzeo1tTAEOq+oXJLTTxxHh93LihdxfvkJSQKiZzGgX33ZgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:18:35.339948Z"},"content_sha256":"15539e57f5871a5e8ff71b9195d0fe1f8a0a00cf4a83d67a2468be2695e07ce2","schema_version":"1.0","event_id":"sha256:15539e57f5871a5e8ff71b9195d0fe1f8a0a00cf4a83d67a2468be2695e07ce2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6L5HQH5BW5EZS4LK7MAPERZREH/bundle.json","state_url":"https://pith.science/pith/6L5HQH5BW5EZS4LK7MAPERZREH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6L5HQH5BW5EZS4LK7MAPERZREH/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-03T22:18:35Z","links":{"resolver":"https://pith.science/pith/6L5HQH5BW5EZS4LK7MAPERZREH","bundle":"https://pith.science/pith/6L5HQH5BW5EZS4LK7MAPERZREH/bundle.json","state":"https://pith.science/pith/6L5HQH5BW5EZS4LK7MAPERZREH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6L5HQH5BW5EZS4LK7MAPERZREH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6L5HQH5BW5EZS4LK7MAPERZREH","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":"b77c8a683796aeb4e9938022342e7e301e77564b3af729baa65de1673a8c26e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T16:41:09Z","title_canon_sha256":"25c2736518a9df6c30bc5bf2b91bb3755b7b6331ef8bbc39715fe6521ac39a0a"},"schema_version":"1.0","source":{"id":"2606.02469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02469","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02469v1","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02469","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"6L5HQH5BW5EZ","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"6L5HQH5BW5EZS4LK","created_at":"2026-06-02T03:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"6L5HQH5B","created_at":"2026-06-02T03:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:15539e57f5871a5e8ff71b9195d0fe1f8a0a00cf4a83d67a2468be2695e07ce2","target":"graph","created_at":"2026-06-02T03:05:07Z","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/2606.02469/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces the L-shaped refinement chain cuts method, a novel approach for solving two-stage stochastic programs. The proposed method integrates the refinement chain of scenarios within the classical L-shaped decomposition framework. In the proposed approach, the full scenario set is partitioned into subgroups at each level of the refinement chain, and one subproblem is solved for each subgroup rather than for each individual scenario as in the classical L-shaped method. The proposed framework generalizes both the classical multi-cut and single-cut L-shaped formulations. Theoretical","authors_text":"Andrea Spinelli, Francesca Maggioni, Mike Hewitt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02469","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:53da65d75047336d2335a2fbeb2c13993c10ba2442fc529acaf5babbaddbef0b","target":"record","created_at":"2026-06-02T03:05:07Z","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":"b77c8a683796aeb4e9938022342e7e301e77564b3af729baa65de1673a8c26e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T16:41:09Z","title_canon_sha256":"25c2736518a9df6c30bc5bf2b91bb3755b7b6331ef8bbc39715fe6521ac39a0a"},"schema_version":"1.0","source":{"id":"2606.02469","kind":"arxiv","version":1}},"canonical_sha256":"f2fa781fa1b74999716afb00f2473121eab8ea0d4942d57998ec549b2224b23a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2fa781fa1b74999716afb00f2473121eab8ea0d4942d57998ec549b2224b23a","first_computed_at":"2026-06-02T03:05:07.058230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:05:07.058230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HICkRj9uZ87se9hAevV7zYoFI8qBI2siWdwbTBySCJOJdFfHYTkqGBygEQCMhucoh7RuIi7pjVSuAwyqaIBLDQ==","signature_status":"signed_v1","signed_at":"2026-06-02T03:05:07.058573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53da65d75047336d2335a2fbeb2c13993c10ba2442fc529acaf5babbaddbef0b","sha256:15539e57f5871a5e8ff71b9195d0fe1f8a0a00cf4a83d67a2468be2695e07ce2"],"state_sha256":"cd957b4c3743d71815fd29a4caa0f73c651977965e9ecfc599443197c47d7c90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZs51RAM9cEioikV1030YKYq2apjD2FgWqpq5UPV5nooRpI5wA0MmIBP6Fjn0VnWgTtjVFnj1bGhp5j3A63pBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:18:35.342043Z","bundle_sha256":"fd6df961c26cdcc93ae017f3968ebb8f9bba82abf39ffba1bfb0060fa1cf8005"}}