{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VOCHCVGRKWOQMYQEQPW6OVDA2J","short_pith_number":"pith:VOCHCVGR","schema_version":"1.0","canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","source":{"kind":"arxiv","id":"1603.05116","version":1},"attestation_state":"computed","paper":{"title":"Dominating sequences under atomic changes with applications in Sierpi\\'{n}ski and interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Tanja Gologranc, Tim Kos","submitted_at":"2016-03-16T14:23:29Z","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"},"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":"1603.05116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-16T14:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"dd7c8778481457da0c719cd96e6596f5c0397f799e24abd59d618da2117f09e1","abstract_canon_sha256":"f52cf3d6c9bfd2efb8a2ebc8d1c2ac44ac96c315348551fa8521612e0db3c465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:58.014283Z","signature_b64":"GDYa+cR0YydhtBTrbS83wZdhCpagRp8d+WTXPUkFgWKMgzVvklQzL0jDBNkpiMU8pjx1LR3sqzTvRZ4oXwltDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","last_reissued_at":"2026-05-18T01:18:58.013791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:58.013791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating sequences under atomic changes with applications in Sierpi\\'{n}ski and interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Tanja Gologranc, Tim Kos","submitted_at":"2016-03-16T14:23:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05116","kind":"arxiv","version":1},"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":"1603.05116","created_at":"2026-05-18T01:18:58.013861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05116v1","created_at":"2026-05-18T01:18:58.013861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05116","created_at":"2026-05-18T01:18:58.013861+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOCHCVGRKWOQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOCHCVGRKWOQMYQE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOCHCVGR","created_at":"2026-05-18T12:30:48.956258+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/VOCHCVGRKWOQMYQEQPW6OVDA2J","json":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J.json","graph_json":"https://pith.science/api/pith-number/VOCHCVGRKWOQMYQEQPW6OVDA2J/graph.json","events_json":"https://pith.science/api/pith-number/VOCHCVGRKWOQMYQEQPW6OVDA2J/events.json","paper":"https://pith.science/paper/VOCHCVGR"},"agent_actions":{"view_html":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J","download_json":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J.json","view_paper":"https://pith.science/paper/VOCHCVGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05116&json=true","fetch_graph":"https://pith.science/api/pith-number/VOCHCVGRKWOQMYQEQPW6OVDA2J/graph.json","fetch_events":"https://pith.science/api/pith-number/VOCHCVGRKWOQMYQEQPW6OVDA2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/action/storage_attestation","attest_author":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/action/author_attestation","sign_citation":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/action/citation_signature","submit_replication":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/action/replication_record"}},"created_at":"2026-05-18T01:18:58.013861+00:00","updated_at":"2026-05-18T01:18:58.013861+00:00"}