{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XBYIPROP4CGP6FXA2XOCCZE2XL","short_pith_number":"pith:XBYIPROP","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"},"canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","source":{"kind":"arxiv","id":"1611.07169","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07169","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07169v6","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07169","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"XBYIPROP4CGP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBYIPROP4CGP6FXA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBYIPROP","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XBYIPROP4CGP6FXA2XOCCZE2XL","target":"record","payload":{"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"},"canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","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"},"source_kind":"arxiv","source_id":"1611.07169","source_version":6,"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-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsvNJ+mFvIdaL2y3P9jB3njHIJpA71v+SxjyDiAxHMvHZcxqpqAuEKBrKrqK3GUOdn9Smy4o7IfOiDdgcLeHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:14.090437Z"},"content_sha256":"443159e2c6530ccc1f1db84c2561d51dd4353138ed64b13d20edaf0190c3805a","schema_version":"1.0","event_id":"sha256:443159e2c6530ccc1f1db84c2561d51dd4353138ed64b13d20edaf0190c3805a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XBYIPROP4CGP6FXA2XOCCZE2XL","target":"graph","payload":{"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"},"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-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtllHwLbWFo1872RzwBVzDfnb54tMNWMBEzHiayhMYy3DNh1OSyTtRVkjIk2AsKbawh2f5Gzz71cvAeg5AySAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:14.091152Z"},"content_sha256":"ea51357481545b5ae7727551bc924ee81aac6f3555e672d85dad1314af32f2f3","schema_version":"1.0","event_id":"sha256:ea51357481545b5ae7727551bc924ee81aac6f3555e672d85dad1314af32f2f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/bundle.json","state_url":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/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-30T23:35:14Z","links":{"resolver":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL","bundle":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/bundle.json","state":"https://pith.science/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBYIPROP4CGP6FXA2XOCCZE2XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XBYIPROP4CGP6FXA2XOCCZE2XL","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":"7f3e9e07e2be3b2637b6aabccc4027178feffd5275f62bdada1a83329039f54b","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-22T07:16:22Z","title_canon_sha256":"2439d3fb10e20e63f13ad7d8015709be8be847e7b5c59d375e5b7d9ea0cd8983"},"schema_version":"1.0","source":{"id":"1611.07169","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07169","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07169v6","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07169","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"XBYIPROP4CGP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBYIPROP4CGP6FXA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBYIPROP","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ea51357481545b5ae7727551bc924ee81aac6f3555e672d85dad1314af32f2f3","target":"graph","created_at":"2026-05-18T00:17:55Z","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 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","authors_text":"David Kempe, Leonard J. Schulman, Omer Tamuz","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-22T07:16:22Z","title":"Quasi-regular sequences and optimal schedules for security games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07169","kind":"arxiv","version":6},"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:443159e2c6530ccc1f1db84c2561d51dd4353138ed64b13d20edaf0190c3805a","target":"record","created_at":"2026-05-18T00:17:55Z","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":"7f3e9e07e2be3b2637b6aabccc4027178feffd5275f62bdada1a83329039f54b","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-22T07:16:22Z","title_canon_sha256":"2439d3fb10e20e63f13ad7d8015709be8be847e7b5c59d375e5b7d9ea0cd8983"},"schema_version":"1.0","source":{"id":"1611.07169","kind":"arxiv","version":6}},"canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b87087c5cfe08cff16e0d5dc21649abacd17bbc936c1b2ecb95096a33b3aa650","first_computed_at":"2026-05-18T00:17:55.102538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.102538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIovNnL87WrLGWvPjY/NZqBZ2UzyCF7VBtitbrW2KXiVl+RjABUBRkKQlY2rw/ejVhiPt8K8UQ8afGt9YQF3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.103093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07169","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:443159e2c6530ccc1f1db84c2561d51dd4353138ed64b13d20edaf0190c3805a","sha256:ea51357481545b5ae7727551bc924ee81aac6f3555e672d85dad1314af32f2f3"],"state_sha256":"0f153dd1efc3e0bb81bdd46302f655bba1a8fc31a79e4d82cda4e1860d40f521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gl25tLvWvTTTJAGJSXjstAlCxp6PBtPtNo4mS/iSr2r8dokm+M2Mvc7agGp5ehSLqOYLL5OMG8ewxeXT/ToQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:35:14.094172Z","bundle_sha256":"00c2762a062957dff93f121303726d3700b7bfeeb078e900f10cace12ed53b8f"}}