{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NLJLH3RZOCUF7ERDGJZYZD5NAD","short_pith_number":"pith:NLJLH3RZ","canonical_record":{"source":{"id":"2103.15788","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-29T17:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"1d0b6a388c61730710c3bef7718c59401488940ca1f7088ed7ab28d295f1e98c","abstract_canon_sha256":"b5cff6c9d00677b4422d62146ae0d670ed7baf20e92ca04812a34083d7d79b88"},"schema_version":"1.0"},"canonical_sha256":"6ad2b3ee3970a85f922332738c8fad00ca348650d9cd12f918d3004004ec9d8b","source":{"kind":"arxiv","id":"2103.15788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15788","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15788v1","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15788","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"NLJLH3RZOCUF","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_16","alias_value":"NLJLH3RZOCUF7ERD","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_8","alias_value":"NLJLH3RZ","created_at":"2026-07-05T05:53:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NLJLH3RZOCUF7ERDGJZYZD5NAD","target":"record","payload":{"canonical_record":{"source":{"id":"2103.15788","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-29T17:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"1d0b6a388c61730710c3bef7718c59401488940ca1f7088ed7ab28d295f1e98c","abstract_canon_sha256":"b5cff6c9d00677b4422d62146ae0d670ed7baf20e92ca04812a34083d7d79b88"},"schema_version":"1.0"},"canonical_sha256":"6ad2b3ee3970a85f922332738c8fad00ca348650d9cd12f918d3004004ec9d8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:53:46.209479Z","signature_b64":"ZNnaBV/5jsLlRyAwyBrovW97UhrK/KEWvoNOrEWGcWEe1qjNIIHQz77l3924sqFKYqLhIecmXtwtDbLWJr5QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad2b3ee3970a85f922332738c8fad00ca348650d9cd12f918d3004004ec9d8b","last_reissued_at":"2026-07-05T05:53:46.209122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:53:46.209122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.15788","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-07-05T05:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gw83LqsKrvFomvd3d3IJAQxBG0I2f2YxLtAyERI4lY8GuYA57qN2qvSlWsc5UiW1e/zs8rNgaegaIEzhLWTVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:53:33.243000Z"},"content_sha256":"6d03643f4763967fa75f30e7fc0934500ccbce9e494356b0404a148b708543e5","schema_version":"1.0","event_id":"sha256:6d03643f4763967fa75f30e7fc0934500ccbce9e494356b0404a148b708543e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NLJLH3RZOCUF7ERDGJZYZD5NAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A branch-and-cut algorithm for submodular interdiction games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","submitted_at":"2021-03-29T17:31:37Z","abstract_excerpt":"Many relevant applications from diverse areas such as marketing, wildlife conservation, or defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function. Given a ground set of items, the leader interdicts the usage of some of the items of the follower in order to minimize the objective value achievable by the follower, who seeks to maximize a submodular set function over the uninterdicted items subject to knapsack constraints.\n  We propose an exact branch-and-cut algorithm for thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15788","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.15788/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLQEI5kQS5XpncBayd3/7DtrlFJmg//wZ2qTFt9sSe5T3jn9on5CL3DypfJQkZc0ZLKL0r7GmYo9GY/AbmkNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:53:33.243497Z"},"content_sha256":"cf0d99789eba2e6a2c67724349b7930b681f230f97a4e93501f2657967fe94ea","schema_version":"1.0","event_id":"sha256:cf0d99789eba2e6a2c67724349b7930b681f230f97a4e93501f2657967fe94ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/bundle.json","state_url":"https://pith.science/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/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-20T23:53:33Z","links":{"resolver":"https://pith.science/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD","bundle":"https://pith.science/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/bundle.json","state":"https://pith.science/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLJLH3RZOCUF7ERDGJZYZD5NAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NLJLH3RZOCUF7ERDGJZYZD5NAD","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":"b5cff6c9d00677b4422d62146ae0d670ed7baf20e92ca04812a34083d7d79b88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-29T17:31:37Z","title_canon_sha256":"1d0b6a388c61730710c3bef7718c59401488940ca1f7088ed7ab28d295f1e98c"},"schema_version":"1.0","source":{"id":"2103.15788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15788","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15788v1","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15788","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"NLJLH3RZOCUF","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_16","alias_value":"NLJLH3RZOCUF7ERD","created_at":"2026-07-05T05:53:46Z"},{"alias_kind":"pith_short_8","alias_value":"NLJLH3RZ","created_at":"2026-07-05T05:53:46Z"}],"graph_snapshots":[{"event_id":"sha256:cf0d99789eba2e6a2c67724349b7930b681f230f97a4e93501f2657967fe94ea","target":"graph","created_at":"2026-07-05T05:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.15788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many relevant applications from diverse areas such as marketing, wildlife conservation, or defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function. Given a ground set of items, the leader interdicts the usage of some of the items of the follower in order to minimize the objective value achievable by the follower, who seeks to maximize a submodular set function over the uninterdicted items subject to knapsack constraints.\n  We propose an exact branch-and-cut algorithm for thes","authors_text":"K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-29T17:31:37Z","title":"A branch-and-cut algorithm for submodular interdiction games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15788","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:6d03643f4763967fa75f30e7fc0934500ccbce9e494356b0404a148b708543e5","target":"record","created_at":"2026-07-05T05:53: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":"b5cff6c9d00677b4422d62146ae0d670ed7baf20e92ca04812a34083d7d79b88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-29T17:31:37Z","title_canon_sha256":"1d0b6a388c61730710c3bef7718c59401488940ca1f7088ed7ab28d295f1e98c"},"schema_version":"1.0","source":{"id":"2103.15788","kind":"arxiv","version":1}},"canonical_sha256":"6ad2b3ee3970a85f922332738c8fad00ca348650d9cd12f918d3004004ec9d8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad2b3ee3970a85f922332738c8fad00ca348650d9cd12f918d3004004ec9d8b","first_computed_at":"2026-07-05T05:53:46.209122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:53:46.209122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNnaBV/5jsLlRyAwyBrovW97UhrK/KEWvoNOrEWGcWEe1qjNIIHQz77l3924sqFKYqLhIecmXtwtDbLWJr5QAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:53:46.209479Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d03643f4763967fa75f30e7fc0934500ccbce9e494356b0404a148b708543e5","sha256:cf0d99789eba2e6a2c67724349b7930b681f230f97a4e93501f2657967fe94ea"],"state_sha256":"ae392af766c62f90d7a1148f959440d354b77acfa419df16f6a365be9ca25063"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpupZUDJmyfx/vlaVOdVGdyIvuFIFWnS5BnBx8lu2E8NKa15IlIMf0OBYIlKzdN5BpeRcaOWc2cFe2oaSRVcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T23:53:33.247666Z","bundle_sha256":"67e58ec41d658f9ad7d92e2346770541818de79f0fe2bfbb6b14f4575d407468"}}