{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZFVKF7ESCG4IVIG5MNHOBXTU7A","short_pith_number":"pith:ZFVKF7ES","canonical_record":{"source":{"id":"1503.01100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-03T20:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"f378efad900fc695aed584c47de2fb13c2ebe61bf88993a93be568465201666d","abstract_canon_sha256":"0d4dba2e24160c0f41471df1136a59ca6826534c67de6cfd02574157b0be6b98"},"schema_version":"1.0"},"canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","source":{"kind":"arxiv","id":"1503.01100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01100","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01100v2","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01100","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZFVKF7ESCG4I","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZFVKF7ESCG4IVIG5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZFVKF7ES","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZFVKF7ESCG4IVIG5MNHOBXTU7A","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-03T20:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"f378efad900fc695aed584c47de2fb13c2ebe61bf88993a93be568465201666d","abstract_canon_sha256":"0d4dba2e24160c0f41471df1136a59ca6826534c67de6cfd02574157b0be6b98"},"schema_version":"1.0"},"canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:13.482126Z","signature_b64":"gEszqVCsMrsDYrw2TtYF1d++aUA1LwzaStQvRtg7DkUg9CShoU0jk208LLqyVX5zKakoWkLIKmYDV2F6YOLqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","last_reissued_at":"2026-05-18T01:36:13.481588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:13.481588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01100","source_version":2,"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-18T01:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDD6bYlbe+BD+KGl44wmWuiSFQmB5DktgQED9v7COzWA2tJTqPdyBKOEafRSk0l6usQc5GhC+2YJzP8r9ZO9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:38.714930Z"},"content_sha256":"78edec049bb33e43568e5ec610483f97474c8efdbb3c31df1667f91275d2e62d","schema_version":"1.0","event_id":"sha256:78edec049bb33e43568e5ec610483f97474c8efdbb3c31df1667f91275d2e62d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZFVKF7ESCG4IVIG5MNHOBXTU7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Decentralized Network Interdiction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew L. Liu, Ashish R. Hota, Harikrishnan Sreekumaran, Nelson A. Uhan, Shreyas Sundaram","submitted_at":"2015-03-03T20:53:10Z","abstract_excerpt":"In this work, we introduce decentralized network interdiction games, which model the interactions among multiple interdictors with differing objectives operating on a common network. As a starting point, we focus on decentralized shortest path interdiction (DSPI) games, where multiple interdictors try to increase the shortest path lengths of their own adversaries, who all attempt to traverse a common network. We first establish results regarding the existence of equilibria for DSPI games under both discrete and continuous interdiction strategies. To compute such an equilibrium, we present a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01100","kind":"arxiv","version":2},"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-18T01:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNgOCR02/krkX9TPVJAQdz0nkNmNncsY8GK2VKteozYJXK7soG95fFl1F0cvf3UQH0AzB4FwLTW3zUBsaki9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:38.715275Z"},"content_sha256":"f60f468887e147fb9761374b10c87bf1931f2e3cdcf4dc7c8c831892cef77f1e","schema_version":"1.0","event_id":"sha256:f60f468887e147fb9761374b10c87bf1931f2e3cdcf4dc7c8c831892cef77f1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/bundle.json","state_url":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/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-06-03T01:12:38Z","links":{"resolver":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A","bundle":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/bundle.json","state":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZFVKF7ESCG4IVIG5MNHOBXTU7A","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":"0d4dba2e24160c0f41471df1136a59ca6826534c67de6cfd02574157b0be6b98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-03T20:53:10Z","title_canon_sha256":"f378efad900fc695aed584c47de2fb13c2ebe61bf88993a93be568465201666d"},"schema_version":"1.0","source":{"id":"1503.01100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01100","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01100v2","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01100","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZFVKF7ESCG4I","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZFVKF7ESCG4IVIG5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZFVKF7ES","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:f60f468887e147fb9761374b10c87bf1931f2e3cdcf4dc7c8c831892cef77f1e","target":"graph","created_at":"2026-05-18T01:36:13Z","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":"In this work, we introduce decentralized network interdiction games, which model the interactions among multiple interdictors with differing objectives operating on a common network. As a starting point, we focus on decentralized shortest path interdiction (DSPI) games, where multiple interdictors try to increase the shortest path lengths of their own adversaries, who all attempt to traverse a common network. We first establish results regarding the existence of equilibria for DSPI games under both discrete and continuous interdiction strategies. To compute such an equilibrium, we present a re","authors_text":"Andrew L. Liu, Ashish R. Hota, Harikrishnan Sreekumaran, Nelson A. Uhan, Shreyas Sundaram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-03T20:53:10Z","title":"Multi-Agent Decentralized Network Interdiction Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01100","kind":"arxiv","version":2},"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:78edec049bb33e43568e5ec610483f97474c8efdbb3c31df1667f91275d2e62d","target":"record","created_at":"2026-05-18T01:36:13Z","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":"0d4dba2e24160c0f41471df1136a59ca6826534c67de6cfd02574157b0be6b98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-03T20:53:10Z","title_canon_sha256":"f378efad900fc695aed584c47de2fb13c2ebe61bf88993a93be568465201666d"},"schema_version":"1.0","source":{"id":"1503.01100","kind":"arxiv","version":2}},"canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","first_computed_at":"2026-05-18T01:36:13.481588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:13.481588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gEszqVCsMrsDYrw2TtYF1d++aUA1LwzaStQvRtg7DkUg9CShoU0jk208LLqyVX5zKakoWkLIKmYDV2F6YOLqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:13.482126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78edec049bb33e43568e5ec610483f97474c8efdbb3c31df1667f91275d2e62d","sha256:f60f468887e147fb9761374b10c87bf1931f2e3cdcf4dc7c8c831892cef77f1e"],"state_sha256":"1b142f9b6bc649ccf61ecd30d331c7cd0bf5eb7fa3838c8f9a0372c419fb70fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcSmjqtB6OgC/Uj46QfQsKY5wcI+EWg9q/dbXNYMXXWDvyeo/bjFvKjq4FPAhLV1J917V8PM3ORhLBikEo19Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:12:38.717234Z","bundle_sha256":"86dd1281b3c6c8bf9510a391a6616ef5508c7a8b6247214ca18f6dd591c5695a"}}