{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IJBWUSH5EWB7EU4B4VDXMXCDEB","short_pith_number":"pith:IJBWUSH5","canonical_record":{"source":{"id":"1612.00104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-01T01:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"7edd1c52a49ad09035ca2bf661070603c17a803fe4e962483e72811bb6d326b0","abstract_canon_sha256":"083320d8904aa53f9b6cf5895e91f6dad93e543c801e444e1b86dbd100c2eb2f"},"schema_version":"1.0"},"canonical_sha256":"42436a48fd2583f25381e547765c43206bb5b19687841b2a3cfb1e6aa26371ac","source":{"kind":"arxiv","id":"1612.00104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00104","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00104v1","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00104","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"IJBWUSH5EWB7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJBWUSH5EWB7EU4B","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJBWUSH5","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IJBWUSH5EWB7EU4B4VDXMXCDEB","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-01T01:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"7edd1c52a49ad09035ca2bf661070603c17a803fe4e962483e72811bb6d326b0","abstract_canon_sha256":"083320d8904aa53f9b6cf5895e91f6dad93e543c801e444e1b86dbd100c2eb2f"},"schema_version":"1.0"},"canonical_sha256":"42436a48fd2583f25381e547765c43206bb5b19687841b2a3cfb1e6aa26371ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:06.806974Z","signature_b64":"KP5+shPy54SztwVp2hXDeMR3uTHsjntb1JSB+r2Ry9zdZaP5oNjeWANVfJLH8+JAmqy0DTzMtdguNFMRvbVvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42436a48fd2583f25381e547765c43206bb5b19687841b2a3cfb1e6aa26371ac","last_reissued_at":"2026-05-18T00:56:06.806553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:06.806553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00104","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:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WEyE0q916kLf81fWZeCWIegVdfP/eLmz6mT/tqHfa9CXiI1JbuOX6bQh9DbW5aSTnV5DHE+F8Hdjz7GgeT+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:39.175432Z"},"content_sha256":"fa4aaa83782bab4c4cca5db7c25e0378bc371b9b6f6702ae9ef5addbbf6a4c03","schema_version":"1.0","event_id":"sha256:fa4aaa83782bab4c4cca5db7c25e0378bc371b9b6f6702ae9ef5addbbf6a4c03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IJBWUSH5EWB7EU4B4VDXMXCDEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Optimization for Tree-Structured Stochastic Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein, Xiaojian Wu","submitted_at":"2016-12-01T01:21:21Z","abstract_excerpt":"Stochastic network design is a general framework for optimizing network connectivity. It has several applications in computational sustainability including spatial conservation planning, pre-disaster network preparation, and river network optimization. A common assumption in previous work has been made that network parameters (e.g., probability of species colonization) are precisely known, which is unrealistic in real- world settings. We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers. We assume t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00104","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:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxL1eOHgJ4bdrEuKWlHcsM4z5eaK6y5BIb/x45RRaLONlE1fk9kB5vEsaX9CUL5jTugS04Fh7LQext2uOFTjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:39.175789Z"},"content_sha256":"20d4c927b5aa56ef07734df3920987eecb9baf1d4d9885111eae5db7ebfc80b0","schema_version":"1.0","event_id":"sha256:20d4c927b5aa56ef07734df3920987eecb9baf1d4d9885111eae5db7ebfc80b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/bundle.json","state_url":"https://pith.science/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/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-03T18:41:39Z","links":{"resolver":"https://pith.science/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB","bundle":"https://pith.science/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/bundle.json","state":"https://pith.science/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJBWUSH5EWB7EU4B4VDXMXCDEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IJBWUSH5EWB7EU4B4VDXMXCDEB","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":"083320d8904aa53f9b6cf5895e91f6dad93e543c801e444e1b86dbd100c2eb2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-01T01:21:21Z","title_canon_sha256":"7edd1c52a49ad09035ca2bf661070603c17a803fe4e962483e72811bb6d326b0"},"schema_version":"1.0","source":{"id":"1612.00104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00104","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00104v1","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00104","created_at":"2026-05-18T00:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"IJBWUSH5EWB7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJBWUSH5EWB7EU4B","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJBWUSH5","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:20d4c927b5aa56ef07734df3920987eecb9baf1d4d9885111eae5db7ebfc80b0","target":"graph","created_at":"2026-05-18T00:56:06Z","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":"Stochastic network design is a general framework for optimizing network connectivity. It has several applications in computational sustainability including spatial conservation planning, pre-disaster network preparation, and river network optimization. A common assumption in previous work has been made that network parameters (e.g., probability of species colonization) are precisely known, which is unrealistic in real- world settings. We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers. We assume t","authors_text":"Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein, Xiaojian Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-01T01:21:21Z","title":"Robust Optimization for Tree-Structured Stochastic Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00104","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:fa4aaa83782bab4c4cca5db7c25e0378bc371b9b6f6702ae9ef5addbbf6a4c03","target":"record","created_at":"2026-05-18T00:56:06Z","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":"083320d8904aa53f9b6cf5895e91f6dad93e543c801e444e1b86dbd100c2eb2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-01T01:21:21Z","title_canon_sha256":"7edd1c52a49ad09035ca2bf661070603c17a803fe4e962483e72811bb6d326b0"},"schema_version":"1.0","source":{"id":"1612.00104","kind":"arxiv","version":1}},"canonical_sha256":"42436a48fd2583f25381e547765c43206bb5b19687841b2a3cfb1e6aa26371ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42436a48fd2583f25381e547765c43206bb5b19687841b2a3cfb1e6aa26371ac","first_computed_at":"2026-05-18T00:56:06.806553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:06.806553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KP5+shPy54SztwVp2hXDeMR3uTHsjntb1JSB+r2Ry9zdZaP5oNjeWANVfJLH8+JAmqy0DTzMtdguNFMRvbVvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:06.806974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4aaa83782bab4c4cca5db7c25e0378bc371b9b6f6702ae9ef5addbbf6a4c03","sha256:20d4c927b5aa56ef07734df3920987eecb9baf1d4d9885111eae5db7ebfc80b0"],"state_sha256":"e38f5fe53a0a29622093218702f303381f089f42d79df603aea08ff23c18cd08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZsDZfp8gqmgK16meW/MSltweZmH1nq9ajgBITEip6eyDUF4SWkYKjBiaKugkXGe6sUySx9QXTVYRGfm0rv4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:41:39.177797Z","bundle_sha256":"c4d0a9582e2c145caaa265ce44e011dd5b0ac132590ed51e57da89f451f2bc00"}}