{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YSALOBCEQZWNESLP3M6GYIVE2T","short_pith_number":"pith:YSALOBCE","schema_version":"1.0","canonical_sha256":"c480b70444866cd2496fdb3c6c22a4d4c29cd73e96ae66d51d0567901de17608","source":{"kind":"arxiv","id":"1906.02774","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.02774","created_at":"2026-05-17T23:43:57.568115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02774v1","created_at":"2026-05-17T23:43:57.568115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02774","created_at":"2026-05-17T23:43:57.568115+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSALOBCEQZWN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSALOBCEQZWNESLP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSALOBCE","created_at":"2026-05-18T12:33:33.725879+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/YSALOBCEQZWNESLP3M6GYIVE2T","json":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T.json","graph_json":"https://pith.science/api/pith-number/YSALOBCEQZWNESLP3M6GYIVE2T/graph.json","events_json":"https://pith.science/api/pith-number/YSALOBCEQZWNESLP3M6GYIVE2T/events.json","paper":"https://pith.science/paper/YSALOBCE"},"agent_actions":{"view_html":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T","download_json":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T.json","view_paper":"https://pith.science/paper/YSALOBCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02774&json=true","fetch_graph":"https://pith.science/api/pith-number/YSALOBCEQZWNESLP3M6GYIVE2T/graph.json","fetch_events":"https://pith.science/api/pith-number/YSALOBCEQZWNESLP3M6GYIVE2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/action/storage_attestation","attest_author":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/action/author_attestation","sign_citation":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/action/citation_signature","submit_replication":"https://pith.science/pith/YSALOBCEQZWNESLP3M6GYIVE2T/action/replication_record"}},"created_at":"2026-05-17T23:43:57.568115+00:00","updated_at":"2026-05-17T23:43:57.568115+00:00"}