{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F3NVST5DDA6QN7CQOQVXKPB6NR","short_pith_number":"pith:F3NVST5D","canonical_record":{"source":{"id":"1901.02572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"ecd726ad599f0a4bd146d6353fb910ab9e7f24ae9aa3ec175efb38b364eb26bb","abstract_canon_sha256":"7931f6b1daba0eb4b760897c351e00c298ddaf634022c11d13853fb384fe8a91"},"schema_version":"1.0"},"canonical_sha256":"2edb594fa3183d06fc50742b753c3e6c547dfe27ce7fde9c1fb26e6436beb62d","source":{"kind":"arxiv","id":"1901.02572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02572","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02572v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02572","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"F3NVST5DDA6Q","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3NVST5DDA6QN7CQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3NVST5D","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F3NVST5DDA6QN7CQOQVXKPB6NR","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"ecd726ad599f0a4bd146d6353fb910ab9e7f24ae9aa3ec175efb38b364eb26bb","abstract_canon_sha256":"7931f6b1daba0eb4b760897c351e00c298ddaf634022c11d13853fb384fe8a91"},"schema_version":"1.0"},"canonical_sha256":"2edb594fa3183d06fc50742b753c3e6c547dfe27ce7fde9c1fb26e6436beb62d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.134800Z","signature_b64":"DmY7XzsBrO0g5Whcnv1JFDKbzKBATEVLWivtmyjSct4F82/P9mEndI9nWdGCMtfFDjtIRylwlxN0eJUvlfhLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2edb594fa3183d06fc50742b753c3e6c547dfe27ce7fde9c1fb26e6436beb62d","last_reissued_at":"2026-05-17T23:56:40.134012Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.134012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02572","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-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S76L/cBZA18fpxEXRrHWeGt0Agh/ABo+NGctr80/hN9sJ3wyn6mFSAk0eV2UFBRZa16FIcjgvf7Y16G9dTrCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:18:40.962677Z"},"content_sha256":"b451dbc272646cc020f45e331f04928a9f798a464ecb85b13af9dd9d8d3142cf","schema_version":"1.0","event_id":"sha256:b451dbc272646cc020f45e331f04928a9f798a464ecb85b13af9dd9d8d3142cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F3NVST5DDA6QN7CQOQVXKPB6NR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Interdiction Using Adversarial Traffic Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Xinzhe Fu","submitted_at":"2019-01-09T01:18:15Z","abstract_excerpt":"Traditional network interdiction refers to the problem of an interdictor trying to reduce the throughput of network users by removing network edges. In this paper, we propose a new paradigm for network interdiction that models scenarios, such as stealth DoS attack, where the interdiction is performed through injecting adversarial traffic flows. Under this paradigm, we first study the deterministic flow interdiction problem, where the interdictor has perfect knowledge of the operation of network users. We show that the problem is highly inapproximable on general networks and is NP-hard even whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02572","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-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Mgb28WOTi9fn9qFquH6Y1/9SF9bGFUtG0H3iKEn8GB0J6tY0eirrCIJyWeDlbqFJ+abVcwovznpdVPfK3bRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:18:40.963272Z"},"content_sha256":"6818f42fa0bd8651372216892ac122cf66c1dfe548b4c1fed545a0b8740b9887","schema_version":"1.0","event_id":"sha256:6818f42fa0bd8651372216892ac122cf66c1dfe548b4c1fed545a0b8740b9887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/bundle.json","state_url":"https://pith.science/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/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-28T08:18:40Z","links":{"resolver":"https://pith.science/pith/F3NVST5DDA6QN7CQOQVXKPB6NR","bundle":"https://pith.science/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/bundle.json","state":"https://pith.science/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3NVST5DDA6QN7CQOQVXKPB6NR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F3NVST5DDA6QN7CQOQVXKPB6NR","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":"7931f6b1daba0eb4b760897c351e00c298ddaf634022c11d13853fb384fe8a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:18:15Z","title_canon_sha256":"ecd726ad599f0a4bd146d6353fb910ab9e7f24ae9aa3ec175efb38b364eb26bb"},"schema_version":"1.0","source":{"id":"1901.02572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02572","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02572v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02572","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"F3NVST5DDA6Q","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3NVST5DDA6QN7CQ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3NVST5D","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6818f42fa0bd8651372216892ac122cf66c1dfe548b4c1fed545a0b8740b9887","target":"graph","created_at":"2026-05-17T23:56:40Z","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":"Traditional network interdiction refers to the problem of an interdictor trying to reduce the throughput of network users by removing network edges. In this paper, we propose a new paradigm for network interdiction that models scenarios, such as stealth DoS attack, where the interdiction is performed through injecting adversarial traffic flows. Under this paradigm, we first study the deterministic flow interdiction problem, where the interdictor has perfect knowledge of the operation of network users. We show that the problem is highly inapproximable on general networks and is NP-hard even whe","authors_text":"Eytan Modiano, Xinzhe Fu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:18:15Z","title":"Network Interdiction Using Adversarial Traffic Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02572","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:b451dbc272646cc020f45e331f04928a9f798a464ecb85b13af9dd9d8d3142cf","target":"record","created_at":"2026-05-17T23:56:40Z","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":"7931f6b1daba0eb4b760897c351e00c298ddaf634022c11d13853fb384fe8a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:18:15Z","title_canon_sha256":"ecd726ad599f0a4bd146d6353fb910ab9e7f24ae9aa3ec175efb38b364eb26bb"},"schema_version":"1.0","source":{"id":"1901.02572","kind":"arxiv","version":1}},"canonical_sha256":"2edb594fa3183d06fc50742b753c3e6c547dfe27ce7fde9c1fb26e6436beb62d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2edb594fa3183d06fc50742b753c3e6c547dfe27ce7fde9c1fb26e6436beb62d","first_computed_at":"2026-05-17T23:56:40.134012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.134012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DmY7XzsBrO0g5Whcnv1JFDKbzKBATEVLWivtmyjSct4F82/P9mEndI9nWdGCMtfFDjtIRylwlxN0eJUvlfhLDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.134800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b451dbc272646cc020f45e331f04928a9f798a464ecb85b13af9dd9d8d3142cf","sha256:6818f42fa0bd8651372216892ac122cf66c1dfe548b4c1fed545a0b8740b9887"],"state_sha256":"f11470cc52ac5473f126b2f7924790d852b8864e0691ab82bf6978a89fce28d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWFpWP8b2mtWEtxLePZHkLdPLaOnn6R0m1h6A1lrnAzpLqH3Toe/57rVpFxMVuLv4/s9P47nQikhGacke3+7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:18:40.966100Z","bundle_sha256":"6fb2c3f927c7a9734a497181418a91327d2fc405f3ab8e29ae7f867746205f2e"}}