{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:O6IRHCDJRJUJXZLTP3WSTQT24I","short_pith_number":"pith:O6IRHCDJ","canonical_record":{"source":{"id":"2112.00874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T22:55:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ea8e5b1e05ed4c2fdef743524e5ef8aed8aaa41434c345c40627d03be784e69b","abstract_canon_sha256":"d66ec42581005531a54fbec64428b85f3f602619d73910c0833a634bcebeb04a"},"schema_version":"1.0"},"canonical_sha256":"77911388698a689be5737eed29c27ae232b4ea5399357e92b0ea4f452715c480","source":{"kind":"arxiv","id":"2112.00874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.00874","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2112.00874v1","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.00874","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"O6IRHCDJRJUJ","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"O6IRHCDJRJUJXZLT","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"O6IRHCDJ","created_at":"2026-07-05T03:37:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:O6IRHCDJRJUJXZLTP3WSTQT24I","target":"record","payload":{"canonical_record":{"source":{"id":"2112.00874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T22:55:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ea8e5b1e05ed4c2fdef743524e5ef8aed8aaa41434c345c40627d03be784e69b","abstract_canon_sha256":"d66ec42581005531a54fbec64428b85f3f602619d73910c0833a634bcebeb04a"},"schema_version":"1.0"},"canonical_sha256":"77911388698a689be5737eed29c27ae232b4ea5399357e92b0ea4f452715c480","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:00.699125Z","signature_b64":"jya7Xom/4rB29W18uWyBH4lJwkkbzR3sRgAQyY5q8Wj1yTi6Q7voiQeofWXr32vxgeYFZ6dq/pnLRFo3Q0XwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77911388698a689be5737eed29c27ae232b4ea5399357e92b0ea4f452715c480","last_reissued_at":"2026-07-05T03:37:00.698713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:00.698713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.00874","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-05T03:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9m6lzOh3MnXbigEj6VTsH3wJzH/azZ0x+Iadc5+lO1HQwfwMitM1B37K/09nEF6RuPk1ATLFgR8ZTvkFej/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:39:11.972837Z"},"content_sha256":"dc9bdea56e1f80f793d4ffcc302981ca513a951728d4514e4e8f6406e76d5262","schema_version":"1.0","event_id":"sha256:dc9bdea56e1f80f793d4ffcc302981ca513a951728d4514e4e8f6406e76d5262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:O6IRHCDJRJUJXZLTP3WSTQT24I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Stochastic Dual Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Dai, Dale Schuurmans, Hanjun Dai, Yuan Xue, Zia Syed","submitted_at":"2021-12-01T22:55:23Z","abstract_excerpt":"Stochastic dual dynamic programming (SDDP) is a state-of-the-art method for solving multi-stage stochastic optimization, widely used for modeling real-world process optimization tasks. Unfortunately, SDDP has a worst-case complexity that scales exponentially in the number of decision variables, which severely limits applicability to only low dimensional problems. To overcome this limitation, we extend SDDP by introducing a trainable neural model that learns to map problem instances to a piece-wise linear value function within intrinsic low-dimension space, which is architected specifically to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.00874","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/2112.00874/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-05T03:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd6iBtXuZtDE/rciUJ5ckpWkukR14Y+WkQGAT730l+LN4Ibyf7ObfdoAkPeVI7iwlzToVYWAtpXs5wqCAo9OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:39:11.973465Z"},"content_sha256":"e4b6ae00054932706b3f4ea7d03b87a9f5d158c263a06de78624cbab385c930a","schema_version":"1.0","event_id":"sha256:e4b6ae00054932706b3f4ea7d03b87a9f5d158c263a06de78624cbab385c930a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/bundle.json","state_url":"https://pith.science/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/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-07-07T04:39:11Z","links":{"resolver":"https://pith.science/pith/O6IRHCDJRJUJXZLTP3WSTQT24I","bundle":"https://pith.science/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/bundle.json","state":"https://pith.science/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6IRHCDJRJUJXZLTP3WSTQT24I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:O6IRHCDJRJUJXZLTP3WSTQT24I","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":"d66ec42581005531a54fbec64428b85f3f602619d73910c0833a634bcebeb04a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T22:55:23Z","title_canon_sha256":"ea8e5b1e05ed4c2fdef743524e5ef8aed8aaa41434c345c40627d03be784e69b"},"schema_version":"1.0","source":{"id":"2112.00874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.00874","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2112.00874v1","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.00874","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"O6IRHCDJRJUJ","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"O6IRHCDJRJUJXZLT","created_at":"2026-07-05T03:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"O6IRHCDJ","created_at":"2026-07-05T03:37:00Z"}],"graph_snapshots":[{"event_id":"sha256:e4b6ae00054932706b3f4ea7d03b87a9f5d158c263a06de78624cbab385c930a","target":"graph","created_at":"2026-07-05T03:37:00Z","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/2112.00874/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic dual dynamic programming (SDDP) is a state-of-the-art method for solving multi-stage stochastic optimization, widely used for modeling real-world process optimization tasks. Unfortunately, SDDP has a worst-case complexity that scales exponentially in the number of decision variables, which severely limits applicability to only low dimensional problems. To overcome this limitation, we extend SDDP by introducing a trainable neural model that learns to map problem instances to a piece-wise linear value function within intrinsic low-dimension space, which is architected specifically to ","authors_text":"Bo Dai, Dale Schuurmans, Hanjun Dai, Yuan Xue, Zia Syed","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T22:55:23Z","title":"Neural Stochastic Dual Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.00874","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:dc9bdea56e1f80f793d4ffcc302981ca513a951728d4514e4e8f6406e76d5262","target":"record","created_at":"2026-07-05T03:37:00Z","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":"d66ec42581005531a54fbec64428b85f3f602619d73910c0833a634bcebeb04a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T22:55:23Z","title_canon_sha256":"ea8e5b1e05ed4c2fdef743524e5ef8aed8aaa41434c345c40627d03be784e69b"},"schema_version":"1.0","source":{"id":"2112.00874","kind":"arxiv","version":1}},"canonical_sha256":"77911388698a689be5737eed29c27ae232b4ea5399357e92b0ea4f452715c480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77911388698a689be5737eed29c27ae232b4ea5399357e92b0ea4f452715c480","first_computed_at":"2026-07-05T03:37:00.698713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:00.698713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jya7Xom/4rB29W18uWyBH4lJwkkbzR3sRgAQyY5q8Wj1yTi6Q7voiQeofWXr32vxgeYFZ6dq/pnLRFo3Q0XwAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:00.699125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.00874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc9bdea56e1f80f793d4ffcc302981ca513a951728d4514e4e8f6406e76d5262","sha256:e4b6ae00054932706b3f4ea7d03b87a9f5d158c263a06de78624cbab385c930a"],"state_sha256":"4c74102905d3e4f8cd397d087b66725dc3876e1dc7df58ef0255c910ce5d5e9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwlokIbf22tA6CDVONQkPwdHtz5vz+MXKAtgQ5OmfnKg7XHhdFEZJCoqQiYrjPD1/ML4lCZINA4aLM+gIN8wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:39:11.976628Z","bundle_sha256":"4d8c1f495d9fd6b62242cbe0d0cc8eb8acc3d0494920eea5a163e4e1685604ce"}}