{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4ASUVKK2GOQVTHLCZYE63RUUGZ","short_pith_number":"pith:4ASUVKK2","canonical_record":{"source":{"id":"1012.4962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T13:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"3ddbcbd497172fdffd385f56247bba065ba9dbb69cc09fccf316bbfaf088099e","abstract_canon_sha256":"0213a52587a68bf0e554a1423df82907132170c158bc7df5d40906470c2581cb"},"schema_version":"1.0"},"canonical_sha256":"e0254aa95a33a1599d62ce09edc694365896771354f78f031c7536d677f9d599","source":{"kind":"arxiv","id":"1012.4962","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4962","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4962v2","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4962","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"4ASUVKK2GOQV","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4ASUVKK2GOQVTHLC","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4ASUVKK2","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4ASUVKK2GOQVTHLCZYE63RUUGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.4962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T13:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"3ddbcbd497172fdffd385f56247bba065ba9dbb69cc09fccf316bbfaf088099e","abstract_canon_sha256":"0213a52587a68bf0e554a1423df82907132170c158bc7df5d40906470c2581cb"},"schema_version":"1.0"},"canonical_sha256":"e0254aa95a33a1599d62ce09edc694365896771354f78f031c7536d677f9d599","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:57.833624Z","signature_b64":"aihbS1c98q0iB+uLTtHOksQAMWNRYk5PRtFPNpInKGAwtZZ37u3Z1s4DfhQhigfrOdzoepcdPuR0+o/Gt+DaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0254aa95a33a1599d62ce09edc694365896771354f78f031c7536d677f9d599","last_reissued_at":"2026-05-18T04:27:57.833002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:57.833002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.4962","source_version":2,"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-18T04:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHMcRhZE690hOJjQbAdYxYP067Av0TMzdNsQH2ZCPHWMAMPOC2VV/UjMMrx54B3Q03nipQNLYVzeuBzddKYtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:05.321278Z"},"content_sha256":"b595bf0bb8ebc88f766b6c0000077527f9de48ea34a0181f8f33f09cf7ed633e","schema_version":"1.0","event_id":"sha256:b595bf0bb8ebc88f766b6c0000077527f9de48ea34a0181f8f33f09cf7ed633e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4ASUVKK2GOQVTHLCZYE63RUUGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, R. Ravi, Viswanath Nagarajan","submitted_at":"2010-12-22T13:05:51Z","abstract_excerpt":"Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: \"which set in I is the most difficult to connect up?\" This is an example of a max-min problem: find the set A in I such that the value of some minimization (covering) problem is as large as possible.\n  In this paper, we show that for certain covering problems which admit good deterministic online algorithms, we can give good algorithms for max-min optimization when the set system I is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4962","kind":"arxiv","version":2},"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-18T04:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+cUgx3X3AInKCN1jACBId3YusI7FDXa+WL9cdKVBtTjFbE+QahgMBfVp7UD46v0rsKYZbEtIf6VxR3YrT7gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:05.321637Z"},"content_sha256":"de34fd4a0bcdc792d536ab4d6e51948fd4a92bad28198e89016c4725d82e495f","schema_version":"1.0","event_id":"sha256:de34fd4a0bcdc792d536ab4d6e51948fd4a92bad28198e89016c4725d82e495f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/bundle.json","state_url":"https://pith.science/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/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-09T14:14:05Z","links":{"resolver":"https://pith.science/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ","bundle":"https://pith.science/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/bundle.json","state":"https://pith.science/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ASUVKK2GOQVTHLCZYE63RUUGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4ASUVKK2GOQVTHLCZYE63RUUGZ","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":"0213a52587a68bf0e554a1423df82907132170c158bc7df5d40906470c2581cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T13:05:51Z","title_canon_sha256":"3ddbcbd497172fdffd385f56247bba065ba9dbb69cc09fccf316bbfaf088099e"},"schema_version":"1.0","source":{"id":"1012.4962","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4962","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4962v2","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4962","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"4ASUVKK2GOQV","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4ASUVKK2GOQVTHLC","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4ASUVKK2","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:de34fd4a0bcdc792d536ab4d6e51948fd4a92bad28198e89016c4725d82e495f","target":"graph","created_at":"2026-05-18T04:27:57Z","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":"Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: \"which set in I is the most difficult to connect up?\" This is an example of a max-min problem: find the set A in I such that the value of some minimization (covering) problem is as large as possible.\n  In this paper, we show that for certain covering problems which admit good deterministic online algorithms, we can give good algorithms for max-min optimization when the set system I is","authors_text":"Anupam Gupta, R. Ravi, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T13:05:51Z","title":"Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4962","kind":"arxiv","version":2},"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:b595bf0bb8ebc88f766b6c0000077527f9de48ea34a0181f8f33f09cf7ed633e","target":"record","created_at":"2026-05-18T04:27:57Z","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":"0213a52587a68bf0e554a1423df82907132170c158bc7df5d40906470c2581cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T13:05:51Z","title_canon_sha256":"3ddbcbd497172fdffd385f56247bba065ba9dbb69cc09fccf316bbfaf088099e"},"schema_version":"1.0","source":{"id":"1012.4962","kind":"arxiv","version":2}},"canonical_sha256":"e0254aa95a33a1599d62ce09edc694365896771354f78f031c7536d677f9d599","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0254aa95a33a1599d62ce09edc694365896771354f78f031c7536d677f9d599","first_computed_at":"2026-05-18T04:27:57.833002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:57.833002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aihbS1c98q0iB+uLTtHOksQAMWNRYk5PRtFPNpInKGAwtZZ37u3Z1s4DfhQhigfrOdzoepcdPuR0+o/Gt+DaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:57.833624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4962","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b595bf0bb8ebc88f766b6c0000077527f9de48ea34a0181f8f33f09cf7ed633e","sha256:de34fd4a0bcdc792d536ab4d6e51948fd4a92bad28198e89016c4725d82e495f"],"state_sha256":"0886ed660bd5120c9e9ef4af4331b4d34c3fa5d3c6cfbfac533bdb1b72add26a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVybsS4tIlYtxCHr+h/ufDeOO8gQybG1HBp33Fye/AQu6yWuboKQZ8SphEP1d/PBwA37wzn3p1eczOPT3+CtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:14:05.323584Z","bundle_sha256":"ce2e2f5e83c5399b31331486de6d76167afc016754b63147bb937f79a04331b6"}}