{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YSALOBCEQZWNESLP3M6GYIVE2T","short_pith_number":"pith:YSALOBCE","canonical_record":{"source":{"id":"1906.02774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-06T18:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"491873f537eba11c042e0b32feb78d374337e2d6eb707f834f9eedd83c928ca6","abstract_canon_sha256":"850b6f39900627b532593459f7e0621cd4ec024b98b3bea75bcda8df225c5d63"},"schema_version":"1.0"},"canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","source":{"kind":"arxiv","id":"1906.02774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02774","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02774v1","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02774","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"YSALOBCEQZWN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YSALOBCEQZWNESLP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YSALOBCE","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YSALOBCEQZWNESLP3M6GYIVE2T","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-06T18:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"491873f537eba11c042e0b32feb78d374337e2d6eb707f834f9eedd83c928ca6","abstract_canon_sha256":"850b6f39900627b532593459f7e0621cd4ec024b98b3bea75bcda8df225c5d63"},"schema_version":"1.0"},"canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:57.568761Z","signature_b64":"11KLGORCOf/+qIuouHq4t5DSz3Qi1yf1+LlZ0AGr4jpJkW6UpJCuL3fdLs2+bLarjwvUguBWSTNYOeHKOeiTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","last_reissued_at":"2026-05-17T23:43:57.567999Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:57.567999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02774","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:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8E2NBvq+R0pN41i1qnEaefWTi3CD3umnww+cVJI8ySdZHcfLr2m4ObnxaFIk0Gpyktjd5MauX0znyr2/KTXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:35:13.807580Z"},"content_sha256":"897a3410239c71ceccada5f453917399a51e5bd7c0bb2b7b923d65670d7ec4a4","schema_version":"1.0","event_id":"sha256:897a3410239c71ceccada5f453917399a51e5bd7c0bb2b7b923d65670d7ec4a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YSALOBCEQZWNESLP3M6GYIVE2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Subgraph Defense Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Argyrios Deligkas, Eleni C. Akrida, Paul G. Spirakis, Themistoklis Melissourgos","submitted_at":"2019-06-06T18:51:44Z","abstract_excerpt":"We study a security game over a network played between a $defender$ and $k$ $attackers$. Every attacker chooses, probabilistically, a node of the network to damage. The defender chooses, probabilistically as well, a connected induced subgraph of the network of $\\lambda$ nodes to scan and clean.Each attacker wishes to maximize the probability of escaping her cleaning by the defender. On the other hand, the goal of the defender is to maximize the expected number of attackers that she catches. This game is a generalization of the model from the seminal paper of Mavronicolas et al. \"The price of d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02774","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:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pxL/bF34AEm5VKXipUnmON/q8DNsFXxKhqxbIwmha4ft0z7Opy8MNivmpfx8HZ2AMxC5J/e032Xdwv/ByTkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:35:13.808197Z"},"content_sha256":"16bf3afff4049ca0529a3705d5bec5f8e94a3e2041db9bea8d477150b361b37b","schema_version":"1.0","event_id":"sha256:16bf3afff4049ca0529a3705d5bec5f8e94a3e2041db9bea8d477150b361b37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/bundle.json","state_url":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSALOBCEQZWNESLP3M6GYIVE2T/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-18T20:35:13Z","links":{"resolver":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T","bundle":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/bundle.json","state":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSALOBCEQZWNESLP3M6GYIVE2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YSALOBCEQZWNESLP3M6GYIVE2T","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":"850b6f39900627b532593459f7e0621cd4ec024b98b3bea75bcda8df225c5d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-06T18:51:44Z","title_canon_sha256":"491873f537eba11c042e0b32feb78d374337e2d6eb707f834f9eedd83c928ca6"},"schema_version":"1.0","source":{"id":"1906.02774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02774","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02774v1","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02774","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"YSALOBCEQZWN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YSALOBCEQZWNESLP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YSALOBCE","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:16bf3afff4049ca0529a3705d5bec5f8e94a3e2041db9bea8d477150b361b37b","target":"graph","created_at":"2026-05-17T23:43:57Z","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":"We study a security game over a network played between a $defender$ and $k$ $attackers$. Every attacker chooses, probabilistically, a node of the network to damage. The defender chooses, probabilistically as well, a connected induced subgraph of the network of $\\lambda$ nodes to scan and clean.Each attacker wishes to maximize the probability of escaping her cleaning by the defender. On the other hand, the goal of the defender is to maximize the expected number of attackers that she catches. This game is a generalization of the model from the seminal paper of Mavronicolas et al. \"The price of d","authors_text":"Argyrios Deligkas, Eleni C. Akrida, Paul G. Spirakis, Themistoklis Melissourgos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-06T18:51:44Z","title":"Connected Subgraph Defense Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02774","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:897a3410239c71ceccada5f453917399a51e5bd7c0bb2b7b923d65670d7ec4a4","target":"record","created_at":"2026-05-17T23:43:57Z","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":"850b6f39900627b532593459f7e0621cd4ec024b98b3bea75bcda8df225c5d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-06T18:51:44Z","title_canon_sha256":"491873f537eba11c042e0b32feb78d374337e2d6eb707f834f9eedd83c928ca6"},"schema_version":"1.0","source":{"id":"1906.02774","kind":"arxiv","version":1}},"canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","first_computed_at":"2026-05-17T23:43:57.567999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:57.567999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11KLGORCOf/+qIuouHq4t5DSz3Qi1yf1+LlZ0AGr4jpJkW6UpJCuL3fdLs2+bLarjwvUguBWSTNYOeHKOeiTCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:57.568761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:897a3410239c71ceccada5f453917399a51e5bd7c0bb2b7b923d65670d7ec4a4","sha256:16bf3afff4049ca0529a3705d5bec5f8e94a3e2041db9bea8d477150b361b37b"],"state_sha256":"ef84d8963e4e27242ab3f808adfcef828f62824a5432d7d60c2326f77298168c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64+Xy5sRI1XO4jXFMQbnTDKLkk0myVM1S3S6burqeO5JpophfG07J2sM1Uh07tKOMrQT2OiB89Mg4tfIhsdBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:35:13.809682Z","bundle_sha256":"efac2b9a2d252b977122a35f4185d4e9585ebee5389be2f75a3a0531324b0fc3"}}