{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XBYIPROP4CGP6FXA2XOCCZE2XL","short_pith_number":"pith:XBYIPROP","schema_version":"1.0","canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","source":{"kind":"arxiv","id":"1611.07169","version":6},"attestation_state":"computed","paper":{"title":"Quasi-regular sequences and optimal schedules for security games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.GT","authors_text":"David Kempe, Leonard J. Schulman, Omer Tamuz","submitted_at":"2016-11-22T07:16:22Z","abstract_excerpt":"We study security games in which a defender commits to a mixed strategy for protecting a finite set of targets of different values. An attacker, knowing the defender's strategy, chooses which target to attack and for how long. If the attacker spends time $t$ at a target $i$ of value $\\alpha_i$, and if he leaves before the defender visits the target, his utility is $t \\cdot \\alpha_i $; if the defender visits before he leaves, his utility is 0. The defender's goal is to minimize the attacker's utility. The defender's strategy consists of a schedule for visiting the targets; it takes her unit tim"},"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":"1611.07169","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-22T07:16:22Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2439d3fb10e20e63f13ad7d8015709be8be847e7b5c59d375e5b7d9ea0cd8983","abstract_canon_sha256":"7f3e9e07e2be3b2637b6aabccc4027178feffd5275f62bdada1a83329039f54b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.103093Z","signature_b64":"NIovNnL87WrLGWvPjY/NZqBZ2UzyCF7VBtitbrW2KXiVl+RjABUBRkKQlY2rw/ejVhiPt8K8UQ8afGt9YQF3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","last_reissued_at":"2026-05-18T00:17:55.102538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.102538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-regular sequences and optimal schedules for security games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.GT","authors_text":"David Kempe, Leonard J. Schulman, Omer Tamuz","submitted_at":"2016-11-22T07:16:22Z","abstract_excerpt":"We study security games in which a defender commits to a mixed strategy for protecting a finite set of targets of different values. An attacker, knowing the defender's strategy, chooses which target to attack and for how long. If the attacker spends time $t$ at a target $i$ of value $\\alpha_i$, and if he leaves before the defender visits the target, his utility is $t \\cdot \\alpha_i $; if the defender visits before he leaves, his utility is 0. The defender's goal is to minimize the attacker's utility. The defender's strategy consists of a schedule for visiting the targets; it takes her unit tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07169","kind":"arxiv","version":6},"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":"1611.07169","created_at":"2026-05-18T00:17:55.102633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07169v6","created_at":"2026-05-18T00:17:55.102633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07169","created_at":"2026-05-18T00:17:55.102633+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBYIPROP4CGP","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBYIPROP4CGP6FXA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBYIPROP","created_at":"2026-05-18T12:30:51.357362+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/XBYIPROP4CGP6FXA2XOCCZE2XL","json":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL.json","graph_json":"https://pith.science/api/pith-number/XBYIPROP4CGP6FXA2XOCCZE2XL/graph.json","events_json":"https://pith.science/api/pith-number/XBYIPROP4CGP6FXA2XOCCZE2XL/events.json","paper":"https://pith.science/paper/XBYIPROP"},"agent_actions":{"view_html":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL","download_json":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL.json","view_paper":"https://pith.science/paper/XBYIPROP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07169&json=true","fetch_graph":"https://pith.science/api/pith-number/XBYIPROP4CGP6FXA2XOCCZE2XL/graph.json","fetch_events":"https://pith.science/api/pith-number/XBYIPROP4CGP6FXA2XOCCZE2XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/action/storage_attestation","attest_author":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/action/author_attestation","sign_citation":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/action/citation_signature","submit_replication":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/action/replication_record"}},"created_at":"2026-05-18T00:17:55.102633+00:00","updated_at":"2026-05-18T00:17:55.102633+00:00"}