{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VOCHCVGRKWOQMYQEQPW6OVDA2J","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":"f52cf3d6c9bfd2efb8a2ebc8d1c2ac44ac96c315348551fa8521612e0db3c465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-16T14:23:29Z","title_canon_sha256":"dd7c8778481457da0c719cd96e6596f5c0397f799e24abd59d618da2117f09e1"},"schema_version":"1.0","source":{"id":"1603.05116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05116","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05116v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05116","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"VOCHCVGRKWOQ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VOCHCVGRKWOQMYQE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VOCHCVGR","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:440ce552f43219f413607f1ac2c3474d304672cde74d9bd1df7317ed7d4f5763","target":"graph","created_at":"2026-05-18T01:18:58Z","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":"A sequence $S=(v_1,\\ldots,v_k)$ of distinct vertices of a graph $G$ is called a legal sequence if $N[v_i] \\setminus \\cup_{j=1}^{i-1}N[v_j]\\not=\\emptyset$ for any $i$. The maximum length of a legal (dominating) sequence in $G$ is called the Grundy domination number $\\gamma_{gr}(G)$ of a graph $G$. It is known that the problem of determining the Grundy domination number is NP-complete in general, while efficient algorithm exist for trees and some other classes of graphs. In this paper we find an efficient algorithm for the Grundy domination number of an interval graph. We also show the exact val","authors_text":"Bostjan Bresar, Tanja Gologranc, Tim Kos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-16T14:23:29Z","title":"Dominating sequences under atomic changes with applications in Sierpi\\'{n}ski and interval graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05116","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:33c5be474c20d0551a3b409532c6f6d8d8921d130b732a176afb1a6851b96301","target":"record","created_at":"2026-05-18T01:18:58Z","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":"f52cf3d6c9bfd2efb8a2ebc8d1c2ac44ac96c315348551fa8521612e0db3c465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-16T14:23:29Z","title_canon_sha256":"dd7c8778481457da0c719cd96e6596f5c0397f799e24abd59d618da2117f09e1"},"schema_version":"1.0","source":{"id":"1603.05116","kind":"arxiv","version":1}},"canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","first_computed_at":"2026-05-18T01:18:58.013791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:58.013791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GDYa+cR0YydhtBTrbS83wZdhCpagRp8d+WTXPUkFgWKMgzVvklQzL0jDBNkpiMU8pjx1LR3sqzTvRZ4oXwltDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:58.014283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33c5be474c20d0551a3b409532c6f6d8d8921d130b732a176afb1a6851b96301","sha256:440ce552f43219f413607f1ac2c3474d304672cde74d9bd1df7317ed7d4f5763"],"state_sha256":"26f8c3b7951648e7edf110150cde1ead93f9972d39225d9a94dbb7d7f4685f0a"}