{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BRK4XG6ALZDA35ZWAO4Y4Y6XUX","short_pith_number":"pith:BRK4XG6A","schema_version":"1.0","canonical_sha256":"0c55cb9bc05e460df73603b98e63d7a5d6c71f5e830d319a59b92cf59a0f4d2f","source":{"kind":"arxiv","id":"2606.10345","version":1},"attestation_state":"computed","paper":{"title":"Supermodularity and Submodularity in Network Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Zhou, Ruiwei Jiang, Siqian Shen","submitted_at":"2026-06-09T02:54:27Z","abstract_excerpt":"We study a bilevel network interdiction problem, with an attacker interdicting (attacking) certain components of a network and a defender optimizing operations over the ensuing network. We study when the defender's optimal objective is submodular or supermodular with respect to the attacker's interdiction decisions, for optimizing the bilevel integer program more efficiently. We first consider the min-cost flow (MinCF) interdiction problem and derive necessary and sufficient conditions for the supermodularity or submodularity to hold under three types of attacks, respectively on supplies/deman"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.10345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-09T02:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"475e8d5dbec10322bb15c9585662d780d823649d9224aa73f316da6db6d33238","abstract_canon_sha256":"94ffa86c333d10c1179cb2c88108aaf2ed843a6e00e5273e139beeea7ae653fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:12.853877Z","signature_b64":"QNQ48Gt+U/kbRX+U6x+jhareAC0QC6xlzSBQLHbM2Prw49FtbcYjMulUABmuO3ckgQkDRqUkVZnGlxz7agz7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c55cb9bc05e460df73603b98e63d7a5d6c71f5e830d319a59b92cf59a0f4d2f","last_reissued_at":"2026-06-10T01:10:12.853022Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:12.853022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supermodularity and Submodularity in Network Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Zhou, Ruiwei Jiang, Siqian Shen","submitted_at":"2026-06-09T02:54:27Z","abstract_excerpt":"We study a bilevel network interdiction problem, with an attacker interdicting (attacking) certain components of a network and a defender optimizing operations over the ensuing network. We study when the defender's optimal objective is submodular or supermodular with respect to the attacker's interdiction decisions, for optimizing the bilevel integer program more efficiently. We first consider the min-cost flow (MinCF) interdiction problem and derive necessary and sufficient conditions for the supermodularity or submodularity to hold under three types of attacks, respectively on supplies/deman"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10345","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/2606.10345/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.10345","created_at":"2026-06-10T01:10:12.853165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10345v1","created_at":"2026-06-10T01:10:12.853165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10345","created_at":"2026-06-10T01:10:12.853165+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRK4XG6ALZDA","created_at":"2026-06-10T01:10:12.853165+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRK4XG6ALZDA35ZW","created_at":"2026-06-10T01:10:12.853165+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRK4XG6A","created_at":"2026-06-10T01:10:12.853165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX","json":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX.json","graph_json":"https://pith.science/api/pith-number/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/graph.json","events_json":"https://pith.science/api/pith-number/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/events.json","paper":"https://pith.science/paper/BRK4XG6A"},"agent_actions":{"view_html":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX","download_json":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX.json","view_paper":"https://pith.science/paper/BRK4XG6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10345&json=true","fetch_graph":"https://pith.science/api/pith-number/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/graph.json","fetch_events":"https://pith.science/api/pith-number/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/action/storage_attestation","attest_author":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/action/author_attestation","sign_citation":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/action/citation_signature","submit_replication":"https://pith.science/pith/BRK4XG6ALZDA35ZWAO4Y4Y6XUX/action/replication_record"}},"created_at":"2026-06-10T01:10:12.853165+00:00","updated_at":"2026-06-10T01:10:12.853165+00:00"}