{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JOOFH3U2TVFWXORCEEYL6B3UHV","short_pith_number":"pith:JOOFH3U2","schema_version":"1.0","canonical_sha256":"4b9c53ee9a9d4b6bba222130bf07743d51e8c359f91f2773c8417c039107c00a","source":{"kind":"arxiv","id":"1805.07742","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07742","created_at":"2026-05-18T00:15:32.644530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07742v1","created_at":"2026-05-18T00:15:32.644530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07742","created_at":"2026-05-18T00:15:32.644530+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOOFH3U2TVFW","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOOFH3U2TVFWXORC","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOOFH3U2","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV","json":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV.json","graph_json":"https://pith.science/api/pith-number/JOOFH3U2TVFWXORCEEYL6B3UHV/graph.json","events_json":"https://pith.science/api/pith-number/JOOFH3U2TVFWXORCEEYL6B3UHV/events.json","paper":"https://pith.science/paper/JOOFH3U2"},"agent_actions":{"view_html":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV","download_json":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV.json","view_paper":"https://pith.science/paper/JOOFH3U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07742&json=true","fetch_graph":"https://pith.science/api/pith-number/JOOFH3U2TVFWXORCEEYL6B3UHV/graph.json","fetch_events":"https://pith.science/api/pith-number/JOOFH3U2TVFWXORCEEYL6B3UHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/action/storage_attestation","attest_author":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/action/author_attestation","sign_citation":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/action/citation_signature","submit_replication":"https://pith.science/pith/JOOFH3U2TVFWXORCEEYL6B3UHV/action/replication_record"}},"created_at":"2026-05-18T00:15:32.644530+00:00","updated_at":"2026-05-18T00:15:32.644530+00:00"}