{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HAD4LHG7C6HNSSVRYOS7T6DARZ","short_pith_number":"pith:HAD4LHG7","schema_version":"1.0","canonical_sha256":"3807c59cdf178ed94ab1c3a5f9f8608e405e177d64bbb9b3b7e3117a482986f4","source":{"kind":"arxiv","id":"1207.0745","version":1},"attestation_state":"computed","paper":{"title":"A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"John Musacchio, Lemonia Dritsoula, Patrick Loiseau","submitted_at":"2012-07-03T16:43:07Z","abstract_excerpt":"We consider a game in which a strategic defender classifies an intruder as spy or spammer. The classification is based on the number of file server and mail server attacks observed during a fixed window. The spammer naively attacks (with a known distribution) his main target: the mail server. The spy strategically selects the number of attacks on his main target: the file server. The defender strategically selects his classification policy: a threshold on the number of file server attacks. We model the interaction of the two players (spy and defender) as a nonzero-sum game: The defender needs "},"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":"1207.0745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-03T16:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"8ca8152da7872cc231630b16521034f9c42a4b92b10747b7fc54a32693b7aba1","abstract_canon_sha256":"14d07857a5ddd20ef74d4224f7e3486b3b8de548f838ddb64bfb90dc21a1871d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.540341Z","signature_b64":"xGrsngIT4j7qpi5+3yA9ZTBrIn/dEIZoYkYix+7ZqE/QFUpp2C5MekhN2YjWvAbb5YUvvKgxgBsDECZBG0eUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3807c59cdf178ed94ab1c3a5f9f8608e405e177d64bbb9b3b7e3117a482986f4","last_reissued_at":"2026-05-18T02:21:08.539951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.539951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"John Musacchio, Lemonia Dritsoula, Patrick Loiseau","submitted_at":"2012-07-03T16:43:07Z","abstract_excerpt":"We consider a game in which a strategic defender classifies an intruder as spy or spammer. The classification is based on the number of file server and mail server attacks observed during a fixed window. The spammer naively attacks (with a known distribution) his main target: the mail server. The spy strategically selects the number of attacks on his main target: the file server. The defender strategically selects his classification policy: a threshold on the number of file server attacks. We model the interaction of the two players (spy and defender) as a nonzero-sum game: The defender needs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0745","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":"1207.0745","created_at":"2026-05-18T02:21:08.540010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0745v1","created_at":"2026-05-18T02:21:08.540010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0745","created_at":"2026-05-18T02:21:08.540010+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAD4LHG7C6HN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAD4LHG7C6HNSSVR","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAD4LHG7","created_at":"2026-05-18T12:27:09.501522+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/HAD4LHG7C6HNSSVRYOS7T6DARZ","json":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ.json","graph_json":"https://pith.science/api/pith-number/HAD4LHG7C6HNSSVRYOS7T6DARZ/graph.json","events_json":"https://pith.science/api/pith-number/HAD4LHG7C6HNSSVRYOS7T6DARZ/events.json","paper":"https://pith.science/paper/HAD4LHG7"},"agent_actions":{"view_html":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ","download_json":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ.json","view_paper":"https://pith.science/paper/HAD4LHG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0745&json=true","fetch_graph":"https://pith.science/api/pith-number/HAD4LHG7C6HNSSVRYOS7T6DARZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HAD4LHG7C6HNSSVRYOS7T6DARZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ/action/storage_attestation","attest_author":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ/action/author_attestation","sign_citation":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ/action/citation_signature","submit_replication":"https://pith.science/pith/HAD4LHG7C6HNSSVRYOS7T6DARZ/action/replication_record"}},"created_at":"2026-05-18T02:21:08.540010+00:00","updated_at":"2026-05-18T02:21:08.540010+00:00"}