{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FDTHX52IGMPO33D6WPTAWQQKEA","short_pith_number":"pith:FDTHX52I","canonical_record":{"source":{"id":"1407.5228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-19T23:56:18Z","cross_cats_sorted":[],"title_canon_sha256":"21631ed2fbeaf40b34ee7a37acfc0e99e7fc7d0d9c140042a6eb4e1f2d7f9440","abstract_canon_sha256":"814b2c44eb1b40284434befa34ea1858a6452abf8e43ad17b7e13f68b80752bc"},"schema_version":"1.0"},"canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","source":{"kind":"arxiv","id":"1407.5228","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5228","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5228v3","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5228","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"FDTHX52IGMPO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FDTHX52IGMPO33D6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FDTHX52I","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FDTHX52IGMPO33D6WPTAWQQKEA","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-19T23:56:18Z","cross_cats_sorted":[],"title_canon_sha256":"21631ed2fbeaf40b34ee7a37acfc0e99e7fc7d0d9c140042a6eb4e1f2d7f9440","abstract_canon_sha256":"814b2c44eb1b40284434befa34ea1858a6452abf8e43ad17b7e13f68b80752bc"},"schema_version":"1.0"},"canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.793117Z","signature_b64":"WSrvdqY81nVX5fmGZ2A0BYh2ZK4E+fChWyAstjCWvU56vHIYWoFqOR6UIWwfnAItX+HnuH+qfPI2iLevQ6mKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","last_reissued_at":"2026-05-18T02:19:43.792707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.792707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5228","source_version":3,"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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueNqgO+oTTN07bymM/NVLeDn1MjfaF6UVTzRSGLzHSuYHcQyupcQI8mMQnkg7LJPMPcNKRQ7BXTD53DLWMDwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:47:56.500860Z"},"content_sha256":"5752c7eacd3c3415958896c63e8683781aa331092f4590331bd13056fe55a5fb","schema_version":"1.0","event_id":"sha256:5752c7eacd3c3415958896c63e8683781aa331092f4590331bd13056fe55a5fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FDTHX52IGMPO33D6WPTAWQQKEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protecting a Graph with Mobile Guards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina M. Mynhardt, William F. Klostermeyer","submitted_at":"2014-07-19T23:56:18Z","abstract_excerpt":"Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed. In this survey we describe a number of these models with particular attention to the case when the attack sequence is infinitely long and the guards must induce some particular configuration before each attack, such as a dominating set or a vertex cover. Results from the literature concerning the number of guards needed to successfully defend a graph in each of these problems are surveyed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5228","kind":"arxiv","version":3},"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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TZ9tI8FSxxC4IAyJdF64r3V2ioWlCuJbFxk5Sct82zPwLZGcP5JYEnjVNUKK5GEYtbrgzkvEuuq12benRuyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:47:56.501441Z"},"content_sha256":"4e37ebeada0cdbe5e1fe956f6ffa0b23b7ddfa2bbecf47cf580061a266063151","schema_version":"1.0","event_id":"sha256:4e37ebeada0cdbe5e1fe956f6ffa0b23b7ddfa2bbecf47cf580061a266063151"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/bundle.json","state_url":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDTHX52IGMPO33D6WPTAWQQKEA/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-07-01T11:47:56Z","links":{"resolver":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA","bundle":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/bundle.json","state":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDTHX52IGMPO33D6WPTAWQQKEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FDTHX52IGMPO33D6WPTAWQQKEA","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":"814b2c44eb1b40284434befa34ea1858a6452abf8e43ad17b7e13f68b80752bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-19T23:56:18Z","title_canon_sha256":"21631ed2fbeaf40b34ee7a37acfc0e99e7fc7d0d9c140042a6eb4e1f2d7f9440"},"schema_version":"1.0","source":{"id":"1407.5228","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5228","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5228v3","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5228","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"FDTHX52IGMPO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FDTHX52IGMPO33D6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FDTHX52I","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:4e37ebeada0cdbe5e1fe956f6ffa0b23b7ddfa2bbecf47cf580061a266063151","target":"graph","created_at":"2026-05-18T02:19:43Z","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":"Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed. In this survey we describe a number of these models with particular attention to the case when the attack sequence is infinitely long and the guards must induce some particular configuration before each attack, such as a dominating set or a vertex cover. Results from the literature concerning the number of guards needed to successfully defend a graph in each of these problems are surveyed.","authors_text":"Christina M. Mynhardt, William F. Klostermeyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-19T23:56:18Z","title":"Protecting a Graph with Mobile Guards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5228","kind":"arxiv","version":3},"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:5752c7eacd3c3415958896c63e8683781aa331092f4590331bd13056fe55a5fb","target":"record","created_at":"2026-05-18T02:19:43Z","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":"814b2c44eb1b40284434befa34ea1858a6452abf8e43ad17b7e13f68b80752bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-19T23:56:18Z","title_canon_sha256":"21631ed2fbeaf40b34ee7a37acfc0e99e7fc7d0d9c140042a6eb4e1f2d7f9440"},"schema_version":"1.0","source":{"id":"1407.5228","kind":"arxiv","version":3}},"canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","first_computed_at":"2026-05-18T02:19:43.792707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.792707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WSrvdqY81nVX5fmGZ2A0BYh2ZK4E+fChWyAstjCWvU56vHIYWoFqOR6UIWwfnAItX+HnuH+qfPI2iLevQ6mKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.793117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5228","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5752c7eacd3c3415958896c63e8683781aa331092f4590331bd13056fe55a5fb","sha256:4e37ebeada0cdbe5e1fe956f6ffa0b23b7ddfa2bbecf47cf580061a266063151"],"state_sha256":"ccb878fbe06e3c0b6bae13b0272021a6623d27c853f0b26a75cd5eeaf28b4323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZQ6MqfJ0XzJQtFha1DHSuIKmzQeGKE4ZU13XP7kbazqGek4nE8b9rBLcRpJ2dTnd41jkRzrpS38zSGFhpGhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T11:47:56.504339Z","bundle_sha256":"9f41e723fd7c24bc659f3d48a085337af38d81b9b9b21773814799a7c82faf5f"}}