{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:INHUL6HCKCUHGKRJ27C2BW5YIQ","short_pith_number":"pith:INHUL6HC","canonical_record":{"source":{"id":"2301.12232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-28T15:48:20Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"bd3dc62db91b8d96ab7b3ba73d91c1bba50cd0fa7c429ab1358ca8f26d6457ee","abstract_canon_sha256":"b2b840a8b8797c15c024442833988553f21690003f359d11def4a263c1575e9d"},"schema_version":"1.0"},"canonical_sha256":"434f45f8e250a8732a29d7c5a0dbb84404ce1ac03fa5b742f4d9340096d9ba06","source":{"kind":"arxiv","id":"2301.12232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.12232","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"2301.12232v1","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12232","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"INHUL6HCKCUH","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_16","alias_value":"INHUL6HCKCUHGKRJ","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_8","alias_value":"INHUL6HC","created_at":"2026-07-05T05:36:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:INHUL6HCKCUHGKRJ27C2BW5YIQ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.12232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-28T15:48:20Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"bd3dc62db91b8d96ab7b3ba73d91c1bba50cd0fa7c429ab1358ca8f26d6457ee","abstract_canon_sha256":"b2b840a8b8797c15c024442833988553f21690003f359d11def4a263c1575e9d"},"schema_version":"1.0"},"canonical_sha256":"434f45f8e250a8732a29d7c5a0dbb84404ce1ac03fa5b742f4d9340096d9ba06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:36.957869Z","signature_b64":"3gY3nJtwtngbiYlh4bS+LFfeo3jWBeBP0UhqpcDfLlVq/2kKkrO7idDEtDiLu8to+c9D8zVDi/AHCn0A0uT0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"434f45f8e250a8732a29d7c5a0dbb84404ce1ac03fa5b742f4d9340096d9ba06","last_reissued_at":"2026-07-05T05:36:36.957443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:36.957443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.12232","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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYg5TvXpkUCjNGymsDQpLf7td4tlgu5rdsrzCV0kqZaedokBRE+SgohWaYh4qKiWqS9gpUfPuyIm7qCzwnU5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:58:39.776027Z"},"content_sha256":"4ea0ceba99528bf20ce185a3e346e5b23bcc6b843220f50dff8209176dd42dd0","schema_version":"1.0","event_id":"sha256:4ea0ceba99528bf20ce185a3e346e5b23bcc6b843220f50dff8209176dd42dd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:INHUL6HCKCUHGKRJ27C2BW5YIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Arunesh Sinha, Avinandan Bose, Thanh H. Nguyen, Tien Mai","submitted_at":"2023-01-28T15:48:20Z","abstract_excerpt":"This work studies Stackelberg network interdiction games -- an important class of games in which a defender first allocates (randomized) defense resources to a set of critical nodes on a graph while an adversary chooses its path to attack these nodes accordingly. We consider a boundedly rational adversary in which the adversary's response model is based on a dynamic form of classic logit-based discrete choice models. We show that the problem of finding an optimal interdiction strategy for the defender in the rational setting is NP-hard. The resulting optimization is in fact non-convex and addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12232","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/2301.12232/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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87oAk97L19Qw3pSMhqixud6JqeeMEtpHiBN+L2TqH3HNusuiWINtAVCWG5HOPmvpit5ssbY7T+xDTiheDjZZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:58:39.776439Z"},"content_sha256":"0d3dfb4630480fbf763e7f90bfde874cfab673b52759bee2302c53e02d26ef1f","schema_version":"1.0","event_id":"sha256:0d3dfb4630480fbf763e7f90bfde874cfab673b52759bee2302c53e02d26ef1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/bundle.json","state_url":"https://pith.science/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/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-07-07T05:58:39Z","links":{"resolver":"https://pith.science/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ","bundle":"https://pith.science/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/bundle.json","state":"https://pith.science/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INHUL6HCKCUHGKRJ27C2BW5YIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:INHUL6HCKCUHGKRJ27C2BW5YIQ","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":"b2b840a8b8797c15c024442833988553f21690003f359d11def4a263c1575e9d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-28T15:48:20Z","title_canon_sha256":"bd3dc62db91b8d96ab7b3ba73d91c1bba50cd0fa7c429ab1358ca8f26d6457ee"},"schema_version":"1.0","source":{"id":"2301.12232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.12232","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"2301.12232v1","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12232","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"INHUL6HCKCUH","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_16","alias_value":"INHUL6HCKCUHGKRJ","created_at":"2026-07-05T05:36:36Z"},{"alias_kind":"pith_short_8","alias_value":"INHUL6HC","created_at":"2026-07-05T05:36:36Z"}],"graph_snapshots":[{"event_id":"sha256:0d3dfb4630480fbf763e7f90bfde874cfab673b52759bee2302c53e02d26ef1f","target":"graph","created_at":"2026-07-05T05:36: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.12232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work studies Stackelberg network interdiction games -- an important class of games in which a defender first allocates (randomized) defense resources to a set of critical nodes on a graph while an adversary chooses its path to attack these nodes accordingly. We consider a boundedly rational adversary in which the adversary's response model is based on a dynamic form of classic logit-based discrete choice models. We show that the problem of finding an optimal interdiction strategy for the defender in the rational setting is NP-hard. The resulting optimization is in fact non-convex and addi","authors_text":"Arunesh Sinha, Avinandan Bose, Thanh H. Nguyen, Tien Mai","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-28T15:48:20Z","title":"Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12232","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:4ea0ceba99528bf20ce185a3e346e5b23bcc6b843220f50dff8209176dd42dd0","target":"record","created_at":"2026-07-05T05:36: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":"b2b840a8b8797c15c024442833988553f21690003f359d11def4a263c1575e9d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-28T15:48:20Z","title_canon_sha256":"bd3dc62db91b8d96ab7b3ba73d91c1bba50cd0fa7c429ab1358ca8f26d6457ee"},"schema_version":"1.0","source":{"id":"2301.12232","kind":"arxiv","version":1}},"canonical_sha256":"434f45f8e250a8732a29d7c5a0dbb84404ce1ac03fa5b742f4d9340096d9ba06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"434f45f8e250a8732a29d7c5a0dbb84404ce1ac03fa5b742f4d9340096d9ba06","first_computed_at":"2026-07-05T05:36:36.957443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:36:36.957443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gY3nJtwtngbiYlh4bS+LFfeo3jWBeBP0UhqpcDfLlVq/2kKkrO7idDEtDiLu8to+c9D8zVDi/AHCn0A0uT0Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:36:36.957869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.12232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea0ceba99528bf20ce185a3e346e5b23bcc6b843220f50dff8209176dd42dd0","sha256:0d3dfb4630480fbf763e7f90bfde874cfab673b52759bee2302c53e02d26ef1f"],"state_sha256":"92221a546f9271d65f05631760bc65367ef8c3b1d3d89af2eba9e6dca03f7ea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgr7BAHabqVVLhWNcNKiYlQJq7tkKQGtkWNMtazcWiIBl5xU/UQD/e/rw5UW1pU1gtlointnbXomGLU+lVXYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:58:39.778843Z","bundle_sha256":"1b26992156cc3febd40ebfb14922cf76b5916c9c48fd494db79213b589a7f676"}}