{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YLPKCG37VJQMR4JLFNZZERU6I3","short_pith_number":"pith:YLPKCG37","schema_version":"1.0","canonical_sha256":"c2dea11b7faa60c8f12b2b7392469e46ea100e9874c804376f2df5f265e2ebe9","source":{"kind":"arxiv","id":"1811.07186","version":1},"attestation_state":"computed","paper":{"title":"Optimal Allocations for Sample Average Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Harsha Honnappa, Prateek Jaiswal, Raghu Pasupathy","submitted_at":"2018-11-17T16:48:24Z","abstract_excerpt":"We consider a single stage stochastic program without recourse with a strictly convex loss function. We assume a compact decision space and grid it with a finite set of points. In addition, we assume that the decision maker can generate samples of the stochastic variable independently at each grid point and form a sample average approximation (SAA) of the stochastic program. Our objective in this paper is to characterize an asymptotically optimal linear sample allocation rule, given a fixed sampling budget, which maximizes the decay rate of probability of making false decision."},"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":"1811.07186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-11-17T16:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"d19cbb2e0a87e16af22a5bb84814dff8da559c26a71e295d59f8199354dc944f","abstract_canon_sha256":"de92e4d90a09fd9ff3659fa1a9753cdf751ed9595d368c75eb55325e5afa855f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:28.676100Z","signature_b64":"Zo6Yzz8lUMgmMCTxjBk4E5E0nASXF3BmvkMqwKL1xvvIaIPa4LHHz9IooOM/BVk/sjP7Y/6Q7sXpuk6wOTZnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2dea11b7faa60c8f12b2b7392469e46ea100e9874c804376f2df5f265e2ebe9","last_reissued_at":"2026-05-18T00:00:28.675387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:28.675387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Allocations for Sample Average Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Harsha Honnappa, Prateek Jaiswal, Raghu Pasupathy","submitted_at":"2018-11-17T16:48:24Z","abstract_excerpt":"We consider a single stage stochastic program without recourse with a strictly convex loss function. We assume a compact decision space and grid it with a finite set of points. In addition, we assume that the decision maker can generate samples of the stochastic variable independently at each grid point and form a sample average approximation (SAA) of the stochastic program. Our objective in this paper is to characterize an asymptotically optimal linear sample allocation rule, given a fixed sampling budget, which maximizes the decay rate of probability of making false decision."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07186","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":"1811.07186","created_at":"2026-05-18T00:00:28.675506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07186v1","created_at":"2026-05-18T00:00:28.675506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07186","created_at":"2026-05-18T00:00:28.675506+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLPKCG37VJQM","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLPKCG37VJQMR4JL","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLPKCG37","created_at":"2026-05-18T12:33:04.347982+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/YLPKCG37VJQMR4JLFNZZERU6I3","json":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3.json","graph_json":"https://pith.science/api/pith-number/YLPKCG37VJQMR4JLFNZZERU6I3/graph.json","events_json":"https://pith.science/api/pith-number/YLPKCG37VJQMR4JLFNZZERU6I3/events.json","paper":"https://pith.science/paper/YLPKCG37"},"agent_actions":{"view_html":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3","download_json":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3.json","view_paper":"https://pith.science/paper/YLPKCG37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07186&json=true","fetch_graph":"https://pith.science/api/pith-number/YLPKCG37VJQMR4JLFNZZERU6I3/graph.json","fetch_events":"https://pith.science/api/pith-number/YLPKCG37VJQMR4JLFNZZERU6I3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3/action/storage_attestation","attest_author":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3/action/author_attestation","sign_citation":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3/action/citation_signature","submit_replication":"https://pith.science/pith/YLPKCG37VJQMR4JLFNZZERU6I3/action/replication_record"}},"created_at":"2026-05-18T00:00:28.675506+00:00","updated_at":"2026-05-18T00:00:28.675506+00:00"}