{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMOP6F7AKTMM6MQXVDZOWZCETI","short_pith_number":"pith:MMOP6F7A","schema_version":"1.0","canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","source":{"kind":"arxiv","id":"1712.06996","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for stochastic and risk-averse optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Jaroslaw Byrka","submitted_at":"2017-12-18T09:25:14Z","abstract_excerpt":"We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same approximation algorithms as their standard (non-stochastic) counterparts; this improves upon work of Swamy \\& Shmoys which shows an approximability that depends multiplicatively on the number of stages. We also present approximation algorithms for facility location and some of its variants in the $2$-stage recourse model, improving on previous approximation guarantees. We give a $2"},"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":"1712.06996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-18T09:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"2ab2eb60caf8f5cd47c6f21450409df782b6b94bea6cc6b0be6a79bff534f1a0","abstract_canon_sha256":"19c816f4b2a3772ec09a79b4b0eceb73c0f8df42f9514d6f4f1e9cd0037f0bd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:37.512304Z","signature_b64":"1u3E3KtFQh309lvy4UBRHpj1s/8epgsTOPB2DgKFofMgv/ZWSZ/mw2QR30mKuvsT6EBJDR6zVCYvwcFfyvIGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","last_reissued_at":"2026-05-18T00:27:37.511451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:37.511451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for stochastic and risk-averse optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Jaroslaw Byrka","submitted_at":"2017-12-18T09:25:14Z","abstract_excerpt":"We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same approximation algorithms as their standard (non-stochastic) counterparts; this improves upon work of Swamy \\& Shmoys which shows an approximability that depends multiplicatively on the number of stages. We also present approximation algorithms for facility location and some of its variants in the $2$-stage recourse model, improving on previous approximation guarantees. We give a $2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06996","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":"1712.06996","created_at":"2026-05-18T00:27:37.511605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06996v1","created_at":"2026-05-18T00:27:37.511605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06996","created_at":"2026-05-18T00:27:37.511605+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMOP6F7AKTMM","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMOP6F7AKTMM6MQX","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMOP6F7A","created_at":"2026-05-18T12:31:31.346846+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/MMOP6F7AKTMM6MQXVDZOWZCETI","json":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI.json","graph_json":"https://pith.science/api/pith-number/MMOP6F7AKTMM6MQXVDZOWZCETI/graph.json","events_json":"https://pith.science/api/pith-number/MMOP6F7AKTMM6MQXVDZOWZCETI/events.json","paper":"https://pith.science/paper/MMOP6F7A"},"agent_actions":{"view_html":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI","download_json":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI.json","view_paper":"https://pith.science/paper/MMOP6F7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06996&json=true","fetch_graph":"https://pith.science/api/pith-number/MMOP6F7AKTMM6MQXVDZOWZCETI/graph.json","fetch_events":"https://pith.science/api/pith-number/MMOP6F7AKTMM6MQXVDZOWZCETI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/action/storage_attestation","attest_author":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/action/author_attestation","sign_citation":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/action/citation_signature","submit_replication":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/action/replication_record"}},"created_at":"2026-05-18T00:27:37.511605+00:00","updated_at":"2026-05-18T00:27:37.511605+00:00"}