{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:G7DHQMLQZZMJ3XMX7Y7HKRA6PM","short_pith_number":"pith:G7DHQMLQ","canonical_record":{"source":{"id":"1009.0556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-02T22:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02a5b631eccf95e4de93bd11e79c3add0f3a8529ff4c112dc4d2cc5ac3a40d18","abstract_canon_sha256":"94dc4b6dba4e5d0e6610979e7c1f8c84c1cdb112aa1dfd411f135a1bc3b31191"},"schema_version":"1.0"},"canonical_sha256":"37c6783170ce589ddd97fe3e75441e7b15395137ca909add812e933ec90243ea","source":{"kind":"arxiv","id":"1009.0556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0556","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0556v1","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0556","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"G7DHQMLQZZMJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G7DHQMLQZZMJ3XMX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G7DHQMLQ","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:G7DHQMLQZZMJ3XMX7Y7HKRA6PM","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-02T22:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02a5b631eccf95e4de93bd11e79c3add0f3a8529ff4c112dc4d2cc5ac3a40d18","abstract_canon_sha256":"94dc4b6dba4e5d0e6610979e7c1f8c84c1cdb112aa1dfd411f135a1bc3b31191"},"schema_version":"1.0"},"canonical_sha256":"37c6783170ce589ddd97fe3e75441e7b15395137ca909add812e933ec90243ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:25.883343Z","signature_b64":"U4BqiLZ4slAtqi3mginqnPoXsskfCNOe8ri3H0fhH2JINT+F/WQnHOFd6nODT7O5r8Xkau1pWqtHizMVX9cJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c6783170ce589ddd97fe3e75441e7b15395137ca909add812e933ec90243ea","last_reissued_at":"2026-05-18T04:41:25.882721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:25.882721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0556","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-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oY39ysvOE3dOaanvlREVQBrgcUekgsXc0D97Ro7GMCARZhzWLhGz/Cw6v7DtwH2PjfSbAKCedw9MCjqWc0F3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:27:21.230686Z"},"content_sha256":"e4df7122f4caac8b059a157498263353de05ab2a8becaed42ad32d33a5a57f8f","schema_version":"1.0","event_id":"sha256:e4df7122f4caac8b059a157498263353de05ab2a8becaed42ad32d33a5a57f8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:G7DHQMLQZZMJ3XMX7Y7HKRA6PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interdiction of a Markovian Evader","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alexander Gutfraind, Aric A. Hagberg, David Izraelevitz, Feng Pan","submitted_at":"2010-09-02T22:32:51Z","abstract_excerpt":"Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an \"interdictor\" and an \"evader\". The evader tries to move from a source node to the target node along a path of the least cost while the interdictor attempts to frustrate this motion by cutting edges or nodes. The interdiction objective is to find the optimal set of edges to cut given that there is a finite interdiction budget and the interdictor must move first. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0556","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-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnSjonYlmHFudiPj5bSjfdWd8u2LZ2X7a/xV5RaYNpSu50crkhVJBR/MMs8fpumLWRpae+bMBmff7kq09qqQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:27:21.231383Z"},"content_sha256":"8145b03a803b6d4b191319a4b5289cf6c9c0e8dff245648c6d722b448bffdde4","schema_version":"1.0","event_id":"sha256:8145b03a803b6d4b191319a4b5289cf6c9c0e8dff245648c6d722b448bffdde4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/bundle.json","state_url":"https://pith.science/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/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-31T04:27:21Z","links":{"resolver":"https://pith.science/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM","bundle":"https://pith.science/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/bundle.json","state":"https://pith.science/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7DHQMLQZZMJ3XMX7Y7HKRA6PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:G7DHQMLQZZMJ3XMX7Y7HKRA6PM","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":"94dc4b6dba4e5d0e6610979e7c1f8c84c1cdb112aa1dfd411f135a1bc3b31191","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-02T22:32:51Z","title_canon_sha256":"02a5b631eccf95e4de93bd11e79c3add0f3a8529ff4c112dc4d2cc5ac3a40d18"},"schema_version":"1.0","source":{"id":"1009.0556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0556","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0556v1","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0556","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"G7DHQMLQZZMJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G7DHQMLQZZMJ3XMX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G7DHQMLQ","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:8145b03a803b6d4b191319a4b5289cf6c9c0e8dff245648c6d722b448bffdde4","target":"graph","created_at":"2026-05-18T04:41:25Z","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":"Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an \"interdictor\" and an \"evader\". The evader tries to move from a source node to the target node along a path of the least cost while the interdictor attempts to frustrate this motion by cutting edges or nodes. The interdiction objective is to find the optimal set of edges to cut given that there is a finite interdiction budget and the interdictor must move first. ","authors_text":"Alexander Gutfraind, Aric A. Hagberg, David Izraelevitz, Feng Pan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-02T22:32:51Z","title":"Interdiction of a Markovian Evader"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0556","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:e4df7122f4caac8b059a157498263353de05ab2a8becaed42ad32d33a5a57f8f","target":"record","created_at":"2026-05-18T04:41:25Z","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":"94dc4b6dba4e5d0e6610979e7c1f8c84c1cdb112aa1dfd411f135a1bc3b31191","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-02T22:32:51Z","title_canon_sha256":"02a5b631eccf95e4de93bd11e79c3add0f3a8529ff4c112dc4d2cc5ac3a40d18"},"schema_version":"1.0","source":{"id":"1009.0556","kind":"arxiv","version":1}},"canonical_sha256":"37c6783170ce589ddd97fe3e75441e7b15395137ca909add812e933ec90243ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c6783170ce589ddd97fe3e75441e7b15395137ca909add812e933ec90243ea","first_computed_at":"2026-05-18T04:41:25.882721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:25.882721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U4BqiLZ4slAtqi3mginqnPoXsskfCNOe8ri3H0fhH2JINT+F/WQnHOFd6nODT7O5r8Xkau1pWqtHizMVX9cJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:25.883343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4df7122f4caac8b059a157498263353de05ab2a8becaed42ad32d33a5a57f8f","sha256:8145b03a803b6d4b191319a4b5289cf6c9c0e8dff245648c6d722b448bffdde4"],"state_sha256":"c5c1705eae87a66a6ee2653e1118d905d1a9b7554168fa6036bd475653b30a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HojTgU+I3nOl/54YUjc/t3Blh8gFfuOCxJBAcM5PgLOdIhEDSgniEeuQSwlKGjrDAVbm0Mc/NPhNZj+rHsQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:27:21.235378Z","bundle_sha256":"f27f6893a17d17f55235781762cbd252bb18b70cd931bbfcd8dbb944e15f4a1f"}}