{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUUIVASZBUCH4IPY3J5GV5UUVI","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":"7914df854af21dea9ea2fd89467ee6ede02de587ead3e3116a7e60d369fd5950","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T07:23:23Z","title_canon_sha256":"c25e8dc1aa102a624184afbe431f9729140b0ddb976ca211f508ac7da589418f"},"schema_version":"1.0","source":{"id":"1907.07910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07910","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07910v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07910","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"LUUIVASZBUCH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUUIVASZBUCH4IPY","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUUIVASZ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:807be31cb31f0f1be2a1aefc8e90fd60b9479af26431562e2c6d89ae81f4a56f","target":"graph","created_at":"2026-05-17T23:40:15Z","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":"Given a graph $G$, guards are placed on vertices of $G$. Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a neighboring vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper we study the m-eternal domination number of cactus graphs, that is, connected graphs where each edge lies in at most two cycles, and we consider three variants of the m-eternal domination number: first variant allows multiple guards to occupy a single vertex, second varia","authors_text":"Jan Maty\\'a\\v{s} K\\v{r}i\\v{s}\\v{t}an, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T07:23:23Z","title":"On the m-eternal Domination Number of Cactus Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07910","kind":"arxiv","version":1},"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:7ece4b2bb3eea050d239dbdaac792e9fb4df029ad9ba90c9a055677e52465ab6","target":"record","created_at":"2026-05-17T23:40:15Z","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":"7914df854af21dea9ea2fd89467ee6ede02de587ead3e3116a7e60d369fd5950","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T07:23:23Z","title_canon_sha256":"c25e8dc1aa102a624184afbe431f9729140b0ddb976ca211f508ac7da589418f"},"schema_version":"1.0","source":{"id":"1907.07910","kind":"arxiv","version":1}},"canonical_sha256":"5d288a82590d047e21f8da7a6af694aa1cca503ffe37f0b705873f96f9fa8b2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d288a82590d047e21f8da7a6af694aa1cca503ffe37f0b705873f96f9fa8b2a","first_computed_at":"2026-05-17T23:40:15.721253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.721253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xAc2T6GmM6hJgyI4yiM7YUTEuGgAVuikJn1zZXWPbsyPFsOle1wSrURcnk6sv/5B/o/DbsxZghddHh36BjHTCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.722004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ece4b2bb3eea050d239dbdaac792e9fb4df029ad9ba90c9a055677e52465ab6","sha256:807be31cb31f0f1be2a1aefc8e90fd60b9479af26431562e2c6d89ae81f4a56f"],"state_sha256":"36b920aad77136fbb9bfb7cab52efbb96c72130dd3eb17f69d176ed6628482fd"}