{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MMOP6F7AKTMM6MQXVDZOWZCETI","short_pith_number":"pith:MMOP6F7A","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"},"canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","source":{"kind":"arxiv","id":"1712.06996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06996","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06996v1","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06996","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"MMOP6F7AKTMM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMOP6F7AKTMM6MQX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMOP6F7A","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MMOP6F7AKTMM6MQXVDZOWZCETI","target":"record","payload":{"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"},"canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","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"},"source_kind":"arxiv","source_id":"1712.06996","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:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYp6giNwywoigPqWxMHqEzlr4PG0iy+6oOJrPEqUpCDLxUg3ph6jseqaEzvnoVGfB4cYyhJkEhNWWcG6GroJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:02:13.052203Z"},"content_sha256":"0a3d43f5662b1cff9fb7df35769fab93570edab342ab9c1e1b20916d37909f14","schema_version":"1.0","event_id":"sha256:0a3d43f5662b1cff9fb7df35769fab93570edab342ab9c1e1b20916d37909f14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MMOP6F7AKTMM6MQXVDZOWZCETI","target":"graph","payload":{"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"},"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:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0uuO3dvufTp2NlN7XpKo1u1L8o3P4vAp9ZVUtvVrQ0kbTpWHPeK0kDfRMKx2Uuhc/5SJ5lPVjnO/rGW2pi1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:02:13.052569Z"},"content_sha256":"83eb8fe41fb4183f746ee63be54150c5b1fac7ab8c31961f34b0a137d585887b","schema_version":"1.0","event_id":"sha256:83eb8fe41fb4183f746ee63be54150c5b1fac7ab8c31961f34b0a137d585887b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/bundle.json","state_url":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/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-06-01T23:02:13Z","links":{"resolver":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI","bundle":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/bundle.json","state":"https://pith.science/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMOP6F7AKTMM6MQXVDZOWZCETI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MMOP6F7AKTMM6MQXVDZOWZCETI","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":"19c816f4b2a3772ec09a79b4b0eceb73c0f8df42f9514d6f4f1e9cd0037f0bd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-18T09:25:14Z","title_canon_sha256":"2ab2eb60caf8f5cd47c6f21450409df782b6b94bea6cc6b0be6a79bff534f1a0"},"schema_version":"1.0","source":{"id":"1712.06996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06996","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06996v1","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06996","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"MMOP6F7AKTMM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMOP6F7AKTMM6MQX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMOP6F7A","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:83eb8fe41fb4183f746ee63be54150c5b1fac7ab8c31961f34b0a137d585887b","target":"graph","created_at":"2026-05-18T00:27:37Z","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 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","authors_text":"Aravind Srinivasan, Jaroslaw Byrka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-18T09:25:14Z","title":"Approximation algorithms for stochastic and risk-averse optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06996","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:0a3d43f5662b1cff9fb7df35769fab93570edab342ab9c1e1b20916d37909f14","target":"record","created_at":"2026-05-18T00:27:37Z","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":"19c816f4b2a3772ec09a79b4b0eceb73c0f8df42f9514d6f4f1e9cd0037f0bd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-18T09:25:14Z","title_canon_sha256":"2ab2eb60caf8f5cd47c6f21450409df782b6b94bea6cc6b0be6a79bff534f1a0"},"schema_version":"1.0","source":{"id":"1712.06996","kind":"arxiv","version":1}},"canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"631cff17e054d8cf3217a8f2eb64449a0a7da421172a33d3dc1ee677f20b6cce","first_computed_at":"2026-05-18T00:27:37.511451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:37.511451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1u3E3KtFQh309lvy4UBRHpj1s/8epgsTOPB2DgKFofMgv/ZWSZ/mw2QR30mKuvsT6EBJDR6zVCYvwcFfyvIGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:37.512304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a3d43f5662b1cff9fb7df35769fab93570edab342ab9c1e1b20916d37909f14","sha256:83eb8fe41fb4183f746ee63be54150c5b1fac7ab8c31961f34b0a137d585887b"],"state_sha256":"8110f1c6fd7e7916c6380bda485946e093238bb167ad98f0a9048c3ca7554d8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ft+avQ5forX8HmByvmOWvcXEXKZYX6yR1Pv3Q6nP5kjhksOORCBdjrGIaJ/mqWmGNBE9/ahpSlY6tenkpGWwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:02:13.054514Z","bundle_sha256":"bd5824d1ef2d728988a2e573422d80fe783304487379fa2ae5854ed2be5622ce"}}