{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O3ODVTDV3GRTPPIUESTZGW6W66","short_pith_number":"pith:O3ODVTDV","canonical_record":{"source":{"id":"1803.01451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T01:22:22Z","cross_cats_sorted":["cs.CE","cs.SY"],"title_canon_sha256":"1fe460caadd27dc8b6682ed04e51e0e62fd0fe46b59d48d195234687febb57cc","abstract_canon_sha256":"e9f735e2d1a4adca593b5845bda2d2ca005d6cc6c5e471b26c7705e0edc36fea"},"schema_version":"1.0"},"canonical_sha256":"76dc3acc75d9a337bd1424a7935bd6f7b04b2bc54c4f47497d9a91216a003b66","source":{"kind":"arxiv","id":"1803.01451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01451","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01451v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01451","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"O3ODVTDV3GRT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3ODVTDV3GRTPPIU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3ODVTDV","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O3ODVTDV3GRTPPIUESTZGW6W66","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T01:22:22Z","cross_cats_sorted":["cs.CE","cs.SY"],"title_canon_sha256":"1fe460caadd27dc8b6682ed04e51e0e62fd0fe46b59d48d195234687febb57cc","abstract_canon_sha256":"e9f735e2d1a4adca593b5845bda2d2ca005d6cc6c5e471b26c7705e0edc36fea"},"schema_version":"1.0"},"canonical_sha256":"76dc3acc75d9a337bd1424a7935bd6f7b04b2bc54c4f47497d9a91216a003b66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:30.259558Z","signature_b64":"b+vBR72BvisRoZ/5pXZzpgUl9pYMYj8gWdpp+OEydT+d2Wlqcu8OZIrWdqnJzxtCcqeSQKnCZSWK4y6tgjnWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76dc3acc75d9a337bd1424a7935bd6f7b04b2bc54c4f47497d9a91216a003b66","last_reissued_at":"2026-05-18T00:04:30.258463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:30.258463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01451","source_version":2,"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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmfMdXRDWNPtp/UL8tn4Lx4eV5/2n9es3nRavDh3Qhn4BgAw5xiWwuxAkq4KQvhhM0t+4ReVV/FGI4xRavv6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:11.727974Z"},"content_sha256":"822c850bfa24badc36ea69e42816043713ddd22a8212d399fc3634a72d72a103","schema_version":"1.0","event_id":"sha256:822c850bfa24badc36ea69e42816043713ddd22a8212d399fc3634a72d72a103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O3ODVTDV3GRTPPIUESTZGW6W66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal planning using approximate dynamic programming to enhance post-hazard community resilience management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.SY"],"primary_cat":"math.OC","authors_text":"Bruce Ellingwood, Edwin K. P. Chong, Hussam Mahmoud, Saeed Nozhati, Yugandhar Sarkale","submitted_at":"2018-03-05T01:22:22Z","abstract_excerpt":"The lack of a comprehensive decision-making approach at the community level is an important problem that warrants immediate attention. Network-level decision-making algorithms need to solve large-scale optimization problems that pose computational challenges. The complexity of the optimization problems increases when various sources of uncertainty are considered. This research introduces a sequential discrete optimization approach, as a decision-making framework at the community level for recovery management. The proposed mathematical approach leverages approximate dynamic programming along wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01451","kind":"arxiv","version":2},"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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNIYCEu14ng0BT+ULSI3fjOyvKotmP3EuHB2+RA4HC/ujXPp3zawBydp/mvTtzaNOmJ3qS3HnzVanu2jf0huBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:11.728673Z"},"content_sha256":"98f2fde112848523e0bb704660f0e5db29f5ca50dc8df1689a2b8ec7badb0c66","schema_version":"1.0","event_id":"sha256:98f2fde112848523e0bb704660f0e5db29f5ca50dc8df1689a2b8ec7badb0c66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3ODVTDV3GRTPPIUESTZGW6W66/bundle.json","state_url":"https://pith.science/pith/O3ODVTDV3GRTPPIUESTZGW6W66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3ODVTDV3GRTPPIUESTZGW6W66/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-05-26T13:56:11Z","links":{"resolver":"https://pith.science/pith/O3ODVTDV3GRTPPIUESTZGW6W66","bundle":"https://pith.science/pith/O3ODVTDV3GRTPPIUESTZGW6W66/bundle.json","state":"https://pith.science/pith/O3ODVTDV3GRTPPIUESTZGW6W66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3ODVTDV3GRTPPIUESTZGW6W66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O3ODVTDV3GRTPPIUESTZGW6W66","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":"e9f735e2d1a4adca593b5845bda2d2ca005d6cc6c5e471b26c7705e0edc36fea","cross_cats_sorted":["cs.CE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T01:22:22Z","title_canon_sha256":"1fe460caadd27dc8b6682ed04e51e0e62fd0fe46b59d48d195234687febb57cc"},"schema_version":"1.0","source":{"id":"1803.01451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01451","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01451v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01451","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"O3ODVTDV3GRT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3ODVTDV3GRTPPIU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3ODVTDV","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:98f2fde112848523e0bb704660f0e5db29f5ca50dc8df1689a2b8ec7badb0c66","target":"graph","created_at":"2026-05-18T00:04:30Z","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":"The lack of a comprehensive decision-making approach at the community level is an important problem that warrants immediate attention. Network-level decision-making algorithms need to solve large-scale optimization problems that pose computational challenges. The complexity of the optimization problems increases when various sources of uncertainty are considered. This research introduces a sequential discrete optimization approach, as a decision-making framework at the community level for recovery management. The proposed mathematical approach leverages approximate dynamic programming along wi","authors_text":"Bruce Ellingwood, Edwin K. P. Chong, Hussam Mahmoud, Saeed Nozhati, Yugandhar Sarkale","cross_cats":["cs.CE","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T01:22:22Z","title":"Near-optimal planning using approximate dynamic programming to enhance post-hazard community resilience management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01451","kind":"arxiv","version":2},"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:822c850bfa24badc36ea69e42816043713ddd22a8212d399fc3634a72d72a103","target":"record","created_at":"2026-05-18T00:04:30Z","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":"e9f735e2d1a4adca593b5845bda2d2ca005d6cc6c5e471b26c7705e0edc36fea","cross_cats_sorted":["cs.CE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T01:22:22Z","title_canon_sha256":"1fe460caadd27dc8b6682ed04e51e0e62fd0fe46b59d48d195234687febb57cc"},"schema_version":"1.0","source":{"id":"1803.01451","kind":"arxiv","version":2}},"canonical_sha256":"76dc3acc75d9a337bd1424a7935bd6f7b04b2bc54c4f47497d9a91216a003b66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76dc3acc75d9a337bd1424a7935bd6f7b04b2bc54c4f47497d9a91216a003b66","first_computed_at":"2026-05-18T00:04:30.258463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:30.258463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b+vBR72BvisRoZ/5pXZzpgUl9pYMYj8gWdpp+OEydT+d2Wlqcu8OZIrWdqnJzxtCcqeSQKnCZSWK4y6tgjnWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:30.259558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:822c850bfa24badc36ea69e42816043713ddd22a8212d399fc3634a72d72a103","sha256:98f2fde112848523e0bb704660f0e5db29f5ca50dc8df1689a2b8ec7badb0c66"],"state_sha256":"6ace11291c4d01953fb1671704a24971df7ff9080764dafa11ada92e8f4878c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrD1+4XKFf6a9Sqlt936wZt9L8/zJLWb103Tlix1IKRvD/ml+nzLhuQ5gQF1Orx+zguIE+HG50Am/lgmf9GLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:56:11.731517Z","bundle_sha256":"8ee8d49b90c41e3f9ac63096f432cfc3c436808336bf420fb36869a095a37723"}}