{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FDTHX52IGMPO33D6WPTAWQQKEA","short_pith_number":"pith:FDTHX52I","schema_version":"1.0","canonical_sha256":"28e67bf748331eedec7eb3e60b420a203de81a14f6c3533fdde4385b5dc75251","source":{"kind":"arxiv","id":"1407.5228","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.5228","created_at":"2026-05-18T02:19:43.792768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5228v3","created_at":"2026-05-18T02:19:43.792768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5228","created_at":"2026-05-18T02:19:43.792768+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDTHX52IGMPO","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDTHX52IGMPO33D6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDTHX52I","created_at":"2026-05-18T12:28:28.263976+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/FDTHX52IGMPO33D6WPTAWQQKEA","json":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA.json","graph_json":"https://pith.science/api/pith-number/FDTHX52IGMPO33D6WPTAWQQKEA/graph.json","events_json":"https://pith.science/api/pith-number/FDTHX52IGMPO33D6WPTAWQQKEA/events.json","paper":"https://pith.science/paper/FDTHX52I"},"agent_actions":{"view_html":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA","download_json":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA.json","view_paper":"https://pith.science/paper/FDTHX52I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5228&json=true","fetch_graph":"https://pith.science/api/pith-number/FDTHX52IGMPO33D6WPTAWQQKEA/graph.json","fetch_events":"https://pith.science/api/pith-number/FDTHX52IGMPO33D6WPTAWQQKEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/action/storage_attestation","attest_author":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/action/author_attestation","sign_citation":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/action/citation_signature","submit_replication":"https://pith.science/pith/FDTHX52IGMPO33D6WPTAWQQKEA/action/replication_record"}},"created_at":"2026-05-18T02:19:43.792768+00:00","updated_at":"2026-05-18T02:19:43.792768+00:00"}