{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XYJT6F3Y3HDHJ2JQJYJVD7AZDP","short_pith_number":"pith:XYJT6F3Y","canonical_record":{"source":{"id":"1409.0838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-02T19:42:10Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"74d8611838c9367a5c131633c86466fb9a86a1d62f85aa8ebdf42c8e28551577","abstract_canon_sha256":"c35e99e19d5ad52f769d72ae31d253d2b8de2fc59d9aa4cb9f4ac92869e5a424"},"schema_version":"1.0"},"canonical_sha256":"be133f1778d9c674e9304e1351fc191be6a0cd585bf7f5d169139f03c33b7d35","source":{"kind":"arxiv","id":"1409.0838","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0838","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0838v2","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0838","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"XYJT6F3Y3HDH","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XYJT6F3Y3HDHJ2JQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XYJT6F3Y","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XYJT6F3Y3HDHJ2JQJYJVD7AZDP","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-02T19:42:10Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"74d8611838c9367a5c131633c86466fb9a86a1d62f85aa8ebdf42c8e28551577","abstract_canon_sha256":"c35e99e19d5ad52f769d72ae31d253d2b8de2fc59d9aa4cb9f4ac92869e5a424"},"schema_version":"1.0"},"canonical_sha256":"be133f1778d9c674e9304e1351fc191be6a0cd585bf7f5d169139f03c33b7d35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:01.932427Z","signature_b64":"2ESdS+i1o4JUMfc1XXkj2pfbNSD8BGkFDvYyLGmyxJEf72pJTcIoToPzOMh08qV7FL0kGgYBly7W4lYbvTjKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be133f1778d9c674e9304e1351fc191be6a0cd585bf7f5d169139f03c33b7d35","last_reissued_at":"2026-05-18T02:43:01.931885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:01.931885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0838","source_version":2,"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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jy2NFjVCG3hZs2r5MdGbECHfKoXlnE/vdxhJColJR4AaOYhooHKFCE3chEZLY78bh6AJywDFxX1cLR94CDpBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:27:38.202159Z"},"content_sha256":"5fc90ad32596c26033768ba5c7a8960f4d90527c57e323c265cf10ac007c6613","schema_version":"1.0","event_id":"sha256:5fc90ad32596c26033768ba5c7a8960f4d90527c57e323c265cf10ac007c6613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XYJT6F3Y3HDHJ2JQJYJVD7AZDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Supervisory Control Approach to Dynamic Cyber-Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SY","authors_text":"Demosthenis Teneketzis, Erik Miehling, Mohammad Rasouli","submitted_at":"2014-09-02T19:42:10Z","abstract_excerpt":"An analytical approach for a dynamic cyber-security problem that captures progressive attacks to a computer network is presented. We formulate the dynamic security problem from the defender's point of view as a supervisory control problem with imperfect information, modeling the computer network's operation by a discrete event system. We consider a min-max performance criterion and use dynamic programming to determine, within a restricted set of policies, an optimal policy for the defender. We study and interpret the behavior of this optimal policy as we vary certain parameters of the supervis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0838","kind":"arxiv","version":2},"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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCuunpP4iUI5P95dvuY8uulK9SVaGLLATEYiOnK8o7BLxc3Y1e3MgZ2gFppVO1lQnODaHg0M/gZIKLTJ5GoiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:27:38.202563Z"},"content_sha256":"bb70c114db92bb43449416c587332ebaa180fc5f3ab13d13d7cf96a0c31d1c1a","schema_version":"1.0","event_id":"sha256:bb70c114db92bb43449416c587332ebaa180fc5f3ab13d13d7cf96a0c31d1c1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/bundle.json","state_url":"https://pith.science/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/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-06-25T11:27:38Z","links":{"resolver":"https://pith.science/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP","bundle":"https://pith.science/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/bundle.json","state":"https://pith.science/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYJT6F3Y3HDHJ2JQJYJVD7AZDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XYJT6F3Y3HDHJ2JQJYJVD7AZDP","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":"c35e99e19d5ad52f769d72ae31d253d2b8de2fc59d9aa4cb9f4ac92869e5a424","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-02T19:42:10Z","title_canon_sha256":"74d8611838c9367a5c131633c86466fb9a86a1d62f85aa8ebdf42c8e28551577"},"schema_version":"1.0","source":{"id":"1409.0838","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0838","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0838v2","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0838","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"XYJT6F3Y3HDH","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XYJT6F3Y3HDHJ2JQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XYJT6F3Y","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:bb70c114db92bb43449416c587332ebaa180fc5f3ab13d13d7cf96a0c31d1c1a","target":"graph","created_at":"2026-05-18T02:43:01Z","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":"An analytical approach for a dynamic cyber-security problem that captures progressive attacks to a computer network is presented. We formulate the dynamic security problem from the defender's point of view as a supervisory control problem with imperfect information, modeling the computer network's operation by a discrete event system. We consider a min-max performance criterion and use dynamic programming to determine, within a restricted set of policies, an optimal policy for the defender. We study and interpret the behavior of this optimal policy as we vary certain parameters of the supervis","authors_text":"Demosthenis Teneketzis, Erik Miehling, Mohammad Rasouli","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-02T19:42:10Z","title":"A Supervisory Control Approach to Dynamic Cyber-Security"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0838","kind":"arxiv","version":2},"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:5fc90ad32596c26033768ba5c7a8960f4d90527c57e323c265cf10ac007c6613","target":"record","created_at":"2026-05-18T02:43:01Z","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":"c35e99e19d5ad52f769d72ae31d253d2b8de2fc59d9aa4cb9f4ac92869e5a424","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-02T19:42:10Z","title_canon_sha256":"74d8611838c9367a5c131633c86466fb9a86a1d62f85aa8ebdf42c8e28551577"},"schema_version":"1.0","source":{"id":"1409.0838","kind":"arxiv","version":2}},"canonical_sha256":"be133f1778d9c674e9304e1351fc191be6a0cd585bf7f5d169139f03c33b7d35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be133f1778d9c674e9304e1351fc191be6a0cd585bf7f5d169139f03c33b7d35","first_computed_at":"2026-05-18T02:43:01.931885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:01.931885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ESdS+i1o4JUMfc1XXkj2pfbNSD8BGkFDvYyLGmyxJEf72pJTcIoToPzOMh08qV7FL0kGgYBly7W4lYbvTjKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:01.932427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0838","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fc90ad32596c26033768ba5c7a8960f4d90527c57e323c265cf10ac007c6613","sha256:bb70c114db92bb43449416c587332ebaa180fc5f3ab13d13d7cf96a0c31d1c1a"],"state_sha256":"8081c51fe8d602b48b541c7b6b2b72a486bd9b8db25376cb8329dddbd636d0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dImswp7e/M1CBX35nYiaEw9voJ3MOtUBFKpWa8PB/KrRVWMmoIUL0L4WGSdv3rkRMeBfi1B3Glg6DRQlodVzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:27:38.204670Z","bundle_sha256":"4d998516630a5a4807e5b77509651c21011c4ac21ddbe79f57f6892b94fc2ec1"}}