{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AWRJE5UZPXKDCV63DMAPZBQY4L","short_pith_number":"pith:AWRJE5UZ","canonical_record":{"source":{"id":"2504.19022","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T21:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"e4a06747a87ab92d20836a08036870113072aaee0f00f1c692134e23832ee603","abstract_canon_sha256":"6e3e7fac271e48fed6490f2c54070a2af7dcf4d21366240c5562e5c3fdb77f11"},"schema_version":"1.0"},"canonical_sha256":"05a29276997dd43157db1b00fc8618e2d8ad17c725d9592dbd02c1bf3d98f6f2","source":{"kind":"arxiv","id":"2504.19022","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.19022","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2504.19022v3","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19022","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"AWRJE5UZPXKD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AWRJE5UZPXKDCV63","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AWRJE5UZ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AWRJE5UZPXKDCV63DMAPZBQY4L","target":"record","payload":{"canonical_record":{"source":{"id":"2504.19022","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T21:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"e4a06747a87ab92d20836a08036870113072aaee0f00f1c692134e23832ee603","abstract_canon_sha256":"6e3e7fac271e48fed6490f2c54070a2af7dcf4d21366240c5562e5c3fdb77f11"},"schema_version":"1.0"},"canonical_sha256":"05a29276997dd43157db1b00fc8618e2d8ad17c725d9592dbd02c1bf3d98f6f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.091401Z","signature_b64":"TYA8beA5Ub9ICZpNHBZ9y/5RTCTwhMuJ1DFzsNXscw53uiyYznZH6sv6c4aPcgaqXj/jNUDDltcqz6sz0r8/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a29276997dd43157db1b00fc8618e2d8ad17c725d9592dbd02c1bf3d98f6f2","last_reissued_at":"2026-05-17T23:39:18.090720Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.090720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.19022","source_version":3,"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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SP3szrIuV+SsJM++xlQItpKNLtBzttbblcF5n3dZIO2jFnCTPPUUrHlGo8n34dYKksckRX05AOb/Q+BPBnI9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:53:20.517158Z"},"content_sha256":"03f3875a3888664f038bb59341fcfa9665c46b3600654dcffe04984cc847d7c8","schema_version":"1.0","event_id":"sha256:03f3875a3888664f038bb59341fcfa9665c46b3600654dcffe04984cc847d7c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AWRJE5UZPXKDCV63DMAPZBQY4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Oleg A. Prokopyev, Sergey S. Ketkov","submitted_at":"2025-04-26T21:17:17Z","abstract_excerpt":"We consider a class of stochastic interdiction games between an upper-level decision-maker (the leader) and a lower-level decision-maker (the follower), where uncertainty lies in the follower's objective function coefficients. Specifically, the follower's profits (or costs) in our model comprise a random vector, whose probability distribution is estimated independently by the leader and the follower, based on their own data. To address the distributional uncertainty, we formulate a distributionally robust interdiction (DRI) model, where both decision-makers solve conventional distributionally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19022","kind":"arxiv","version":3},"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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcNU7AgwpREOhJl45reJQIGZQNVTmtp/K+/dx4YAORMIXMMNF7XrEkRU2KgwK52z0Q7Trc6PWi8FAUyfr4kcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:53:20.517602Z"},"content_sha256":"80475eaff14b9d57c89dc1a8861db34d11232fdaaea1ce8e268ef8d67342bc90","schema_version":"1.0","event_id":"sha256:80475eaff14b9d57c89dc1a8861db34d11232fdaaea1ce8e268ef8d67342bc90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/bundle.json","state_url":"https://pith.science/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/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-08-07T06:53:20Z","links":{"resolver":"https://pith.science/pith/AWRJE5UZPXKDCV63DMAPZBQY4L","bundle":"https://pith.science/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/bundle.json","state":"https://pith.science/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWRJE5UZPXKDCV63DMAPZBQY4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AWRJE5UZPXKDCV63DMAPZBQY4L","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":"6e3e7fac271e48fed6490f2c54070a2af7dcf4d21366240c5562e5c3fdb77f11","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T21:17:17Z","title_canon_sha256":"e4a06747a87ab92d20836a08036870113072aaee0f00f1c692134e23832ee603"},"schema_version":"1.0","source":{"id":"2504.19022","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.19022","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2504.19022v3","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19022","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"AWRJE5UZPXKD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AWRJE5UZPXKDCV63","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AWRJE5UZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:80475eaff14b9d57c89dc1a8861db34d11232fdaaea1ce8e268ef8d67342bc90","target":"graph","created_at":"2026-05-17T23:39:18Z","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 stochastic interdiction games between an upper-level decision-maker (the leader) and a lower-level decision-maker (the follower), where uncertainty lies in the follower's objective function coefficients. Specifically, the follower's profits (or costs) in our model comprise a random vector, whose probability distribution is estimated independently by the leader and the follower, based on their own data. To address the distributional uncertainty, we formulate a distributionally robust interdiction (DRI) model, where both decision-makers solve conventional distributionally ","authors_text":"Oleg A. Prokopyev, Sergey S. Ketkov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T21:17:17Z","title":"Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19022","kind":"arxiv","version":3},"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:03f3875a3888664f038bb59341fcfa9665c46b3600654dcffe04984cc847d7c8","target":"record","created_at":"2026-05-17T23:39:18Z","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":"6e3e7fac271e48fed6490f2c54070a2af7dcf4d21366240c5562e5c3fdb77f11","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T21:17:17Z","title_canon_sha256":"e4a06747a87ab92d20836a08036870113072aaee0f00f1c692134e23832ee603"},"schema_version":"1.0","source":{"id":"2504.19022","kind":"arxiv","version":3}},"canonical_sha256":"05a29276997dd43157db1b00fc8618e2d8ad17c725d9592dbd02c1bf3d98f6f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05a29276997dd43157db1b00fc8618e2d8ad17c725d9592dbd02c1bf3d98f6f2","first_computed_at":"2026-05-17T23:39:18.090720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.090720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYA8beA5Ub9ICZpNHBZ9y/5RTCTwhMuJ1DFzsNXscw53uiyYznZH6sv6c4aPcgaqXj/jNUDDltcqz6sz0r8/Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.091401Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.19022","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03f3875a3888664f038bb59341fcfa9665c46b3600654dcffe04984cc847d7c8","sha256:80475eaff14b9d57c89dc1a8861db34d11232fdaaea1ce8e268ef8d67342bc90"],"state_sha256":"0292232c3646c26d546e51e06ead7d46fb231f5b4c4582d6ebabc7fc6aeb4c38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTsSBmQclK9eZdJ4p0MBzYq5P5uqFiwH6oL2r10jwfydnF2QqcGOgHAMBCZ2Jv8Kl74yeaOEVKJrrN6d2nbpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:53:20.521109Z","bundle_sha256":"5a45559db9d5e7dbd060331d94348543a1fad79c782902a1665a0395a5f8b4a1"}}