{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZVXSS4XXUDJMTK5ESIQCRKJYIS","short_pith_number":"pith:ZVXSS4XX","canonical_record":{"source":{"id":"1610.06701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T08:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"4500b33d8a04a91c9bbea965741ed74d219b0f42e3a8b27194c2f434aa86c51d","abstract_canon_sha256":"39659559eee3ce560322ca069b548c5611e52b8d59183e689befa12c8b8f151a"},"schema_version":"1.0"},"canonical_sha256":"cd6f2972f7a0d2c9aba4922028a938448ab9a23c577de73d9b680662b66dfaee","source":{"kind":"arxiv","id":"1610.06701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06701","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06701v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06701","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZVXSS4XXUDJM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZVXSS4XXUDJMTK5E","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZVXSS4XX","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZVXSS4XXUDJMTK5ESIQCRKJYIS","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T08:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"4500b33d8a04a91c9bbea965741ed74d219b0f42e3a8b27194c2f434aa86c51d","abstract_canon_sha256":"39659559eee3ce560322ca069b548c5611e52b8d59183e689befa12c8b8f151a"},"schema_version":"1.0"},"canonical_sha256":"cd6f2972f7a0d2c9aba4922028a938448ab9a23c577de73d9b680662b66dfaee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.951550Z","signature_b64":"vFrvSiH9fuX6CR9tmh6EZtfpaaMDFm476l2mDZu1JOsxSo5AX/3zWTuBCzbYuQbE/QrKrovGMeCLM3r45e40Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd6f2972f7a0d2c9aba4922028a938448ab9a23c577de73d9b680662b66dfaee","last_reissued_at":"2026-05-18T01:01:36.950944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.950944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06701","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyqBm53fONDgIfpbNgRbx5MwbACcnRjiR1gHDdclLU9JSKMSwf4iUsCq7OzSi7SnnFYDAAD8hhWstZJJPim9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:13:26.656649Z"},"content_sha256":"cab0a6820fa980384e5504d3b3cdbc2b4c6cb9432ff356678df491bb7fae4f7e","schema_version":"1.0","event_id":"sha256:cab0a6820fa980384e5504d3b3cdbc2b4c6cb9432ff356678df491bb7fae4f7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZVXSS4XXUDJMTK5ESIQCRKJYIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two Stage Optimization with Recourse and Revocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haotian Jiang","submitted_at":"2016-10-21T08:46:45Z","abstract_excerpt":"Two-stage optimization with recourse model is an important and widely used model, which has been studied extensively these years. In this article, we will look at a new variant of it, called the two-stage optimization with recourse and revocation model. This new model differs from the traditional one in that one is allowed to revoke some of his earlier decisions and withdraw part of the earlier costs, which is not unlikely in many real applications, and is therefore considered to be more realistic under many situations. We will adopt several approaches to study this model. In fact, we will dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06701","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sz/est39rb8mraRjO0Ki3GvpUCLZ/1neqJxor6GgydIUiqiCrx0LpF4wZSNMwAPMPibcKG1UrhksL36JKs9IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:13:26.657337Z"},"content_sha256":"a175ca93a681ebb74bcd1df63dc67ba19f13c3f8ded0cbd062061a1155add047","schema_version":"1.0","event_id":"sha256:a175ca93a681ebb74bcd1df63dc67ba19f13c3f8ded0cbd062061a1155add047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/bundle.json","state_url":"https://pith.science/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/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-05-29T18:13:26Z","links":{"resolver":"https://pith.science/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS","bundle":"https://pith.science/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/bundle.json","state":"https://pith.science/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVXSS4XXUDJMTK5ESIQCRKJYIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZVXSS4XXUDJMTK5ESIQCRKJYIS","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":"39659559eee3ce560322ca069b548c5611e52b8d59183e689befa12c8b8f151a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T08:46:45Z","title_canon_sha256":"4500b33d8a04a91c9bbea965741ed74d219b0f42e3a8b27194c2f434aa86c51d"},"schema_version":"1.0","source":{"id":"1610.06701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06701","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06701v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06701","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZVXSS4XXUDJM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZVXSS4XXUDJMTK5E","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZVXSS4XX","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:a175ca93a681ebb74bcd1df63dc67ba19f13c3f8ded0cbd062061a1155add047","target":"graph","created_at":"2026-05-18T01:01:36Z","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":"Two-stage optimization with recourse model is an important and widely used model, which has been studied extensively these years. In this article, we will look at a new variant of it, called the two-stage optimization with recourse and revocation model. This new model differs from the traditional one in that one is allowed to revoke some of his earlier decisions and withdraw part of the earlier costs, which is not unlikely in many real applications, and is therefore considered to be more realistic under many situations. We will adopt several approaches to study this model. In fact, we will dev","authors_text":"Haotian Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T08:46:45Z","title":"Two Stage Optimization with Recourse and Revocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06701","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:cab0a6820fa980384e5504d3b3cdbc2b4c6cb9432ff356678df491bb7fae4f7e","target":"record","created_at":"2026-05-18T01:01:36Z","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":"39659559eee3ce560322ca069b548c5611e52b8d59183e689befa12c8b8f151a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T08:46:45Z","title_canon_sha256":"4500b33d8a04a91c9bbea965741ed74d219b0f42e3a8b27194c2f434aa86c51d"},"schema_version":"1.0","source":{"id":"1610.06701","kind":"arxiv","version":1}},"canonical_sha256":"cd6f2972f7a0d2c9aba4922028a938448ab9a23c577de73d9b680662b66dfaee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd6f2972f7a0d2c9aba4922028a938448ab9a23c577de73d9b680662b66dfaee","first_computed_at":"2026-05-18T01:01:36.950944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.950944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vFrvSiH9fuX6CR9tmh6EZtfpaaMDFm476l2mDZu1JOsxSo5AX/3zWTuBCzbYuQbE/QrKrovGMeCLM3r45e40Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.951550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab0a6820fa980384e5504d3b3cdbc2b4c6cb9432ff356678df491bb7fae4f7e","sha256:a175ca93a681ebb74bcd1df63dc67ba19f13c3f8ded0cbd062061a1155add047"],"state_sha256":"987a15bc843de30ae5452f2345ab101e2069d59eccda06615f469a003d9b29b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMGGzTt8Pk/S9xXChhhJmfUTwfRW8xn+DExdxWfDEeiCgZoYQahWeVtm4ggqBkI5Bb/FAD+dytGz3wCpgvBYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:13:26.661166Z","bundle_sha256":"6b2dea899e9dd8d4675d0de3fc0cbd424a6c6ac6e525e3acaceb60c243ca23c9"}}