{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L65IWJ2SOLFUOIFSNPWG5PP7W2","short_pith_number":"pith:L65IWJ2S","schema_version":"1.0","canonical_sha256":"5fba8b275272cb4720b26bec6ebdffb68f467eced457f41125e2f9f7c0e7a261","source":{"kind":"arxiv","id":"1508.02035","version":1},"attestation_state":"computed","paper":{"title":"Security Games with Ambiguous Beliefs of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.GT"],"primary_cat":"cs.AI","authors_text":"Hossein Khani, Mohsen Afsharchi","submitted_at":"2015-08-09T14:54:57Z","abstract_excerpt":"Currently the Dempster-Shafer based algorithm and Uniform Random Probability based algorithm are the preferred method of resolving security games, in which defenders are able to identify attackers and only strategy remained ambiguous. However this model is inefficient in situations where resources are limited and both the identity of the attackers and their strategies are ambiguous. The intent of this study is to find a more effective algorithm to guide the defenders in choosing which outside agents with which to cooperate given both ambiguities. We designed an experiment where defenders were "},"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":"1508.02035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-09T14:54:57Z","cross_cats_sorted":["cs.CR","cs.GT"],"title_canon_sha256":"030063add94dd1c0416a6e26f126877f9f618ce141ea7d2983e921c04bd2238a","abstract_canon_sha256":"eec50ab806e647f7e7dfce5156335184745c399db9c9e990b773eb574852b91b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.424403Z","signature_b64":"wEb2K2VRfL0VFjl8ahViYRaKoIJZSJUkZYyzLM9keT5H7fOpKLY3y+hhPlPFx8bSSreN2qmyrPnLQ5RuiZjMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fba8b275272cb4720b26bec6ebdffb68f467eced457f41125e2f9f7c0e7a261","last_reissued_at":"2026-05-18T01:35:34.423746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.423746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security Games with Ambiguous Beliefs of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.GT"],"primary_cat":"cs.AI","authors_text":"Hossein Khani, Mohsen Afsharchi","submitted_at":"2015-08-09T14:54:57Z","abstract_excerpt":"Currently the Dempster-Shafer based algorithm and Uniform Random Probability based algorithm are the preferred method of resolving security games, in which defenders are able to identify attackers and only strategy remained ambiguous. However this model is inefficient in situations where resources are limited and both the identity of the attackers and their strategies are ambiguous. The intent of this study is to find a more effective algorithm to guide the defenders in choosing which outside agents with which to cooperate given both ambiguities. We designed an experiment where defenders were "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02035","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":"1508.02035","created_at":"2026-05-18T01:35:34.423855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02035v1","created_at":"2026-05-18T01:35:34.423855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02035","created_at":"2026-05-18T01:35:34.423855+00:00"},{"alias_kind":"pith_short_12","alias_value":"L65IWJ2SOLFU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L65IWJ2SOLFUOIFS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L65IWJ2S","created_at":"2026-05-18T12:29:29.992203+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/L65IWJ2SOLFUOIFSNPWG5PP7W2","json":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2.json","graph_json":"https://pith.science/api/pith-number/L65IWJ2SOLFUOIFSNPWG5PP7W2/graph.json","events_json":"https://pith.science/api/pith-number/L65IWJ2SOLFUOIFSNPWG5PP7W2/events.json","paper":"https://pith.science/paper/L65IWJ2S"},"agent_actions":{"view_html":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2","download_json":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2.json","view_paper":"https://pith.science/paper/L65IWJ2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02035&json=true","fetch_graph":"https://pith.science/api/pith-number/L65IWJ2SOLFUOIFSNPWG5PP7W2/graph.json","fetch_events":"https://pith.science/api/pith-number/L65IWJ2SOLFUOIFSNPWG5PP7W2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2/action/storage_attestation","attest_author":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2/action/author_attestation","sign_citation":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2/action/citation_signature","submit_replication":"https://pith.science/pith/L65IWJ2SOLFUOIFSNPWG5PP7W2/action/replication_record"}},"created_at":"2026-05-18T01:35:34.423855+00:00","updated_at":"2026-05-18T01:35:34.423855+00:00"}