{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZFVKF7ESCG4IVIG5MNHOBXTU7A","short_pith_number":"pith:ZFVKF7ES","schema_version":"1.0","canonical_sha256":"c96aa2fc9211b88aa0dd634ee0de74f821d7c4ef0b15543b8e1f151a31258098","source":{"kind":"arxiv","id":"1503.01100","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01100","created_at":"2026-05-18T01:36:13.481676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01100v2","created_at":"2026-05-18T01:36:13.481676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01100","created_at":"2026-05-18T01:36:13.481676+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFVKF7ESCG4I","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFVKF7ESCG4IVIG5","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFVKF7ES","created_at":"2026-05-18T12:29:52.810259+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/ZFVKF7ESCG4IVIG5MNHOBXTU7A","json":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A.json","graph_json":"https://pith.science/api/pith-number/ZFVKF7ESCG4IVIG5MNHOBXTU7A/graph.json","events_json":"https://pith.science/api/pith-number/ZFVKF7ESCG4IVIG5MNHOBXTU7A/events.json","paper":"https://pith.science/paper/ZFVKF7ES"},"agent_actions":{"view_html":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A","download_json":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A.json","view_paper":"https://pith.science/paper/ZFVKF7ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01100&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFVKF7ESCG4IVIG5MNHOBXTU7A/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFVKF7ESCG4IVIG5MNHOBXTU7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/action/storage_attestation","attest_author":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/action/author_attestation","sign_citation":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/action/citation_signature","submit_replication":"https://pith.science/pith/ZFVKF7ESCG4IVIG5MNHOBXTU7A/action/replication_record"}},"created_at":"2026-05-18T01:36:13.481676+00:00","updated_at":"2026-05-18T01:36:13.481676+00:00"}