{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VOCHCVGRKWOQMYQEQPW6OVDA2J","short_pith_number":"pith:VOCHCVGR","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"},"canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","source":{"kind":"arxiv","id":"1603.05116","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VOCHCVGRKWOQMYQEQPW6OVDA2J","target":"record","payload":{"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"},"canonical_sha256":"ab847154d1559d06620483ede75460d260ba3833c0b75bee11ca2c7cd454ecd2","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"},"source_kind":"arxiv","source_id":"1603.05116","source_version":1,"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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LPe2hwO5MhF3vD4g1DrzBCbP90BmzvE1iQTCQ1ZXhlG5az2gkYmFZCoTkaJzmMQfhWX81BepxmEEp35P+5rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:56:31.057360Z"},"content_sha256":"33c5be474c20d0551a3b409532c6f6d8d8921d130b732a176afb1a6851b96301","schema_version":"1.0","event_id":"sha256:33c5be474c20d0551a3b409532c6f6d8d8921d130b732a176afb1a6851b96301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VOCHCVGRKWOQMYQEQPW6OVDA2J","target":"graph","payload":{"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"},"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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWhtur8dDBXnrPL+dXnk4kXlC/xNoXfFDqEr/e/nCir5LdL/QbE3WJrVLCpLAknD08qWsmh7NOXVNIub46WCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:56:31.057979Z"},"content_sha256":"440ce552f43219f413607f1ac2c3474d304672cde74d9bd1df7317ed7d4f5763","schema_version":"1.0","event_id":"sha256:440ce552f43219f413607f1ac2c3474d304672cde74d9bd1df7317ed7d4f5763"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/bundle.json","state_url":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/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-05-31T12:56:31Z","links":{"resolver":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J","bundle":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/bundle.json","state":"https://pith.science/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOCHCVGRKWOQMYQEQPW6OVDA2J/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quyk+BhAEb5MB1O0V4IbgkEjsJYLfrZwgLpSeXAorqtEiG8QnjXqLwFdd/lsrFA8m33n+AbPRbMrxWAiZ4pFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:56:31.060699Z","bundle_sha256":"7ee36720cd2bb60c62241735e8f2ec1ba1fce61ed4f6def11f9a66e636e8931d"}}