{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RWEWD3ADMIEFTTQENWNVAJ63T7","short_pith_number":"pith:RWEWD3AD","canonical_record":{"source":{"id":"1302.5445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T22:34:33Z","cross_cats_sorted":[],"title_canon_sha256":"dcce8a2b9d39348b8175d139f26c6e129e5cf5838b4caf35d10b26a91a740f22","abstract_canon_sha256":"e17f03689ed92c3d2b7e6d9f6cb0bfa1939b0a64e270ad79603303b657e1ebf3"},"schema_version":"1.0"},"canonical_sha256":"8d8961ec03620859ce046d9b5027db9fd6cce375d7158b72a8d61c2f39fbca20","source":{"kind":"arxiv","id":"1302.5445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5445","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5445v1","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5445","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"RWEWD3ADMIEF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RWEWD3ADMIEFTTQE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RWEWD3AD","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RWEWD3ADMIEFTTQENWNVAJ63T7","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T22:34:33Z","cross_cats_sorted":[],"title_canon_sha256":"dcce8a2b9d39348b8175d139f26c6e129e5cf5838b4caf35d10b26a91a740f22","abstract_canon_sha256":"e17f03689ed92c3d2b7e6d9f6cb0bfa1939b0a64e270ad79603303b657e1ebf3"},"schema_version":"1.0"},"canonical_sha256":"8d8961ec03620859ce046d9b5027db9fd6cce375d7158b72a8d61c2f39fbca20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:46.853499Z","signature_b64":"/sogAGqYXS8LFOavD99xn9KExE+3aiIAjBeNj4icfNhSAtrjLPEbONEYj+aBgHYi134+yrOKQ5zA62nIf4sCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d8961ec03620859ce046d9b5027db9fd6cce375d7158b72a8d61c2f39fbca20","last_reissued_at":"2026-05-18T03:32:46.852767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:46.852767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5445","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-18T03:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E67eSgJDPRTlmnRea+OI3tbw2dGsf0tBUcBCpb+5tv9Y1PesnWbyqc6g4d6egV/S+ZhRWlMp2WSBXHpI5ZzZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:56:27.600232Z"},"content_sha256":"f89cc4ff191b38bc99649384d449da079fcacbd8ba40ea4f841e6d823cb782a9","schema_version":"1.0","event_id":"sha256:f89cc4ff191b38bc99649384d449da079fcacbd8ba40ea4f841e6d823cb782a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RWEWD3ADMIEFTTQENWNVAJ63T7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thrifty Algorithms for Multistage Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Vijay V. Vazirani, Viswanath Nagarajan","submitted_at":"2013-02-21T22:34:33Z","abstract_excerpt":"We consider a class of multi-stage robust covering problems, where additional information is revealed about the problem instance in each stage, but the cost of taking actions increases. The dilemma for the decision-maker is whether to wait for additional information and risk the inflation, or to take early actions to hedge against rising costs. We study the \"k-robust\" uncertainty model: in each stage i = 0, 1,...,T, the algorithm is shown some subset of size k_i that completely contains the eventual demands to be covered; here k_1 > k_2 >...> k_T which ensures increasing information over time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5445","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-18T03:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlE5ClYUn4PO1Ph31Eie2BTAqh0uJaIaDq3DS3QsxgRiaVer0T/VzAWhSHbGRZOw6zORdhFm/5DJOHG/jd8nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:56:27.600595Z"},"content_sha256":"4743b0a36bf5be1dddc38f741d9c4722f5be45d989153faab841f309f53d9d4e","schema_version":"1.0","event_id":"sha256:4743b0a36bf5be1dddc38f741d9c4722f5be45d989153faab841f309f53d9d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/bundle.json","state_url":"https://pith.science/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/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-09T12:56:27Z","links":{"resolver":"https://pith.science/pith/RWEWD3ADMIEFTTQENWNVAJ63T7","bundle":"https://pith.science/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/bundle.json","state":"https://pith.science/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWEWD3ADMIEFTTQENWNVAJ63T7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RWEWD3ADMIEFTTQENWNVAJ63T7","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":"e17f03689ed92c3d2b7e6d9f6cb0bfa1939b0a64e270ad79603303b657e1ebf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T22:34:33Z","title_canon_sha256":"dcce8a2b9d39348b8175d139f26c6e129e5cf5838b4caf35d10b26a91a740f22"},"schema_version":"1.0","source":{"id":"1302.5445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5445","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5445v1","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5445","created_at":"2026-05-18T03:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"RWEWD3ADMIEF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RWEWD3ADMIEFTTQE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RWEWD3AD","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4743b0a36bf5be1dddc38f741d9c4722f5be45d989153faab841f309f53d9d4e","target":"graph","created_at":"2026-05-18T03:32:46Z","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 consider a class of multi-stage robust covering problems, where additional information is revealed about the problem instance in each stage, but the cost of taking actions increases. The dilemma for the decision-maker is whether to wait for additional information and risk the inflation, or to take early actions to hedge against rising costs. We study the \"k-robust\" uncertainty model: in each stage i = 0, 1,...,T, the algorithm is shown some subset of size k_i that completely contains the eventual demands to be covered; here k_1 > k_2 >...> k_T which ensures increasing information over time.","authors_text":"Anupam Gupta, Vijay V. Vazirani, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T22:34:33Z","title":"Thrifty Algorithms for Multistage Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5445","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:f89cc4ff191b38bc99649384d449da079fcacbd8ba40ea4f841e6d823cb782a9","target":"record","created_at":"2026-05-18T03:32:46Z","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":"e17f03689ed92c3d2b7e6d9f6cb0bfa1939b0a64e270ad79603303b657e1ebf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T22:34:33Z","title_canon_sha256":"dcce8a2b9d39348b8175d139f26c6e129e5cf5838b4caf35d10b26a91a740f22"},"schema_version":"1.0","source":{"id":"1302.5445","kind":"arxiv","version":1}},"canonical_sha256":"8d8961ec03620859ce046d9b5027db9fd6cce375d7158b72a8d61c2f39fbca20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d8961ec03620859ce046d9b5027db9fd6cce375d7158b72a8d61c2f39fbca20","first_computed_at":"2026-05-18T03:32:46.852767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:46.852767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/sogAGqYXS8LFOavD99xn9KExE+3aiIAjBeNj4icfNhSAtrjLPEbONEYj+aBgHYi134+yrOKQ5zA62nIf4sCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:46.853499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f89cc4ff191b38bc99649384d449da079fcacbd8ba40ea4f841e6d823cb782a9","sha256:4743b0a36bf5be1dddc38f741d9c4722f5be45d989153faab841f309f53d9d4e"],"state_sha256":"7c3cf9167a34bd2d372aec58f084c9e5d9118042a4d81eec1a6f7a3f6e2f1292"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NuPeRQO5dtPmJ6Dv8AkB9GmlvVkKAOuUAXjzQi1UvIPzLbAbs7cmA4m+KjOs1tLrJsbHd8X5VlXuYuMqmfqoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:56:27.602440Z","bundle_sha256":"4c153d9741768ce1589c6eaea1d9eb2388361c48631de7317e4c24666c900313"}}