{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JOOFH3U2TVFWXORCEEYL6B3UHV","short_pith_number":"pith:JOOFH3U2","canonical_record":{"source":{"id":"1805.07742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T09:18:59Z","cross_cats_sorted":[],"title_canon_sha256":"24c234829f998fbbc6c514822d63638eecd8e39610cd52f30214254b05209fd4","abstract_canon_sha256":"ce8957a1c8dfb6014e87ec174d80844409c5d987f5501a0e0a4af7e1f558f56b"},"schema_version":"1.0"},"canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","source":{"kind":"arxiv","id":"1805.07742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07742","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07742v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07742","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"JOOFH3U2TVFW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JOOFH3U2TVFWXORC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JOOFH3U2","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JOOFH3U2TVFWXORCEEYL6B3UHV","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T09:18:59Z","cross_cats_sorted":[],"title_canon_sha256":"24c234829f998fbbc6c514822d63638eecd8e39610cd52f30214254b05209fd4","abstract_canon_sha256":"ce8957a1c8dfb6014e87ec174d80844409c5d987f5501a0e0a4af7e1f558f56b"},"schema_version":"1.0"},"canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.645160Z","signature_b64":"73RRpXVLjhyLohkWA21zGJCLblvDb0OcvTNkcufAF/hicqidUa4iu9QiYLcIRPlfsEqJqor1dfH7TUH2lv9/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","last_reissued_at":"2026-05-18T00:15:32.644444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.644444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07742","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdTFYMBJ/UWOu08fRKkx2/5DITvvBDIm3i4PucbhCfOztqOoPNZJ5Uo7qr4LkQGSCNh0kWGCohNUlRgS5wRiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:27:32.054979Z"},"content_sha256":"c0ab7acc924d4488cafe67dcc04fe8b6066212333482da7424635b977c6aed3c","schema_version":"1.0","event_id":"sha256:c0ab7acc924d4488cafe67dcc04fe8b6066212333482da7424635b977c6aed3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JOOFH3U2TVFWXORCEEYL6B3UHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A PTAS for a Class of Stochastic Dynamic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hao Fu, Jian Li, Pan Xu","submitted_at":"2018-05-20T09:18:59Z","abstract_excerpt":"We develop a framework for obtaining polynomial time approximation schemes (PTAS) for a class of stochastic dynamic programs. Using our framework, we obtain the first PTAS for the following stochastic combinatorial optimization problems: \\probemax: We are given a set of $n$ items, each item $i\\in [n]$ has a value $X_i$ which is an independent random variable with a known (discrete) distribution $\\pi_i$. We can {\\em probe} a subset $P\\subseteq [n]$ of items sequentially. Each time after {probing} an item $i$, we observe its value realization, which follows the distribution $\\pi_i$. We can {\\em "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07742","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twJnhkB5NM6zrFK3LakWkhQvG9bxuCV0ZddGYpqJS+6RtjNA5Y20646d4T+G3WplxA5dXQI8d5KoCNoMhr58CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:27:32.055343Z"},"content_sha256":"0b2561d3f805d30785e23a7d286ede9b14adaa7c47d3b266a6a6466c2ebbcb84","schema_version":"1.0","event_id":"sha256:0b2561d3f805d30785e23a7d286ede9b14adaa7c47d3b266a6a6466c2ebbcb84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/bundle.json","state_url":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/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-20T19:27:32Z","links":{"resolver":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV","bundle":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/bundle.json","state":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JOOFH3U2TVFWXORCEEYL6B3UHV","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":"ce8957a1c8dfb6014e87ec174d80844409c5d987f5501a0e0a4af7e1f558f56b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T09:18:59Z","title_canon_sha256":"24c234829f998fbbc6c514822d63638eecd8e39610cd52f30214254b05209fd4"},"schema_version":"1.0","source":{"id":"1805.07742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07742","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07742v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07742","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"JOOFH3U2TVFW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JOOFH3U2TVFWXORC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JOOFH3U2","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:0b2561d3f805d30785e23a7d286ede9b14adaa7c47d3b266a6a6466c2ebbcb84","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"We develop a framework for obtaining polynomial time approximation schemes (PTAS) for a class of stochastic dynamic programs. Using our framework, we obtain the first PTAS for the following stochastic combinatorial optimization problems: \\probemax: We are given a set of $n$ items, each item $i\\in [n]$ has a value $X_i$ which is an independent random variable with a known (discrete) distribution $\\pi_i$. We can {\\em probe} a subset $P\\subseteq [n]$ of items sequentially. Each time after {probing} an item $i$, we observe its value realization, which follows the distribution $\\pi_i$. We can {\\em ","authors_text":"Hao Fu, Jian Li, Pan Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T09:18:59Z","title":"A PTAS for a Class of Stochastic Dynamic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07742","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:c0ab7acc924d4488cafe67dcc04fe8b6066212333482da7424635b977c6aed3c","target":"record","created_at":"2026-05-18T00:15:32Z","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":"ce8957a1c8dfb6014e87ec174d80844409c5d987f5501a0e0a4af7e1f558f56b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T09:18:59Z","title_canon_sha256":"24c234829f998fbbc6c514822d63638eecd8e39610cd52f30214254b05209fd4"},"schema_version":"1.0","source":{"id":"1805.07742","kind":"arxiv","version":1}},"canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","first_computed_at":"2026-05-18T00:15:32.644444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.644444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"73RRpXVLjhyLohkWA21zGJCLblvDb0OcvTNkcufAF/hicqidUa4iu9QiYLcIRPlfsEqJqor1dfH7TUH2lv9/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.645160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0ab7acc924d4488cafe67dcc04fe8b6066212333482da7424635b977c6aed3c","sha256:0b2561d3f805d30785e23a7d286ede9b14adaa7c47d3b266a6a6466c2ebbcb84"],"state_sha256":"c64589d607d2c6b7dced4d0b716ff5012af9b6430f89f91a0d0c724a3e9abd4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTwiesaCnFidAFKXHDG/RFkScO9FnRFw9LJWRqQNJpPelMobDqkzV/zV2OztLaFDSI3Iy9kUyQisd/cjOLmZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T19:27:32.057304Z","bundle_sha256":"6b68583211ad9ab2da86fc94446545dfc7200b30d76fd7ed5c195c2d5c8dc50d"}}