{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5YHUU4ZOQEKAFNAOL4ARJI63IU","short_pith_number":"pith:5YHUU4ZO","schema_version":"1.0","canonical_sha256":"ee0f4a732e811402b40e5f0114a3db4509a864b7b4eaa7fe789b43121efe5b31","source":{"kind":"arxiv","id":"1702.00828","version":1},"attestation_state":"computed","paper":{"title":"Grundy dominating sequences and zero forcing sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Bo\\v{s}tjan Bre\\v{s}ar, Csilla Bujt\\'as, Ga\\v{s}per Ko\\v{s}mrlj, M\\'at\\'e Vizer, Sandi Klav\\v{z}ar, Tanja Gologranc, Zsolt Tuza","submitted_at":"2017-02-02T21:10:02Z","abstract_excerpt":"In a graph $G$ a sequence $v_1,v_2,\\dots,v_m$ of vertices is Grundy dominating if for all $2\\le i \\le m$ we have $N[v_i]\\not\\subseteq \\cup_{j=1}^{i-1}N[v_j]$ and is Grundy total dominating if for all $2\\le i \\le m$ we have $N(v_i)\\not\\subseteq \\cup_{j=1}^{i-1}N(v_j)$. The length of the longest Grundy (total) dominating sequence has been studied by several authors. In this paper we introduce two similar concepts when the requirement on the neighborhoods is changed to $N(v_i)\\not\\subseteq \\cup_{j=1}^{i-1}N[v_j]$ or $N[v_i]\\not\\subseteq \\cup_{j=1}^{i-1}N(v_j)$. In the former case we establish a s"},"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":"1702.00828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T21:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"308752972875833ce682d76d918e282c9b757c050d88414aab646e5a9703e81e","abstract_canon_sha256":"0005136959c989e7f51743172626a6b4e291164c52dee66c747cd8ace1ac36fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.661404Z","signature_b64":"TEJZE6wQg4srHkxT5qllMQUZs9ipI/vTrueDHnf9jtq/gFB2HxaV9HofzGrR3zFnIYvrt4h0gskHymyuUbZpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee0f4a732e811402b40e5f0114a3db4509a864b7b4eaa7fe789b43121efe5b31","last_reissued_at":"2026-05-18T00:51:29.660728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.660728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grundy dominating sequences and zero forcing sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Bo\\v{s}tjan Bre\\v{s}ar, Csilla Bujt\\'as, Ga\\v{s}per Ko\\v{s}mrlj, M\\'at\\'e Vizer, Sandi Klav\\v{z}ar, Tanja Gologranc, Zsolt Tuza","submitted_at":"2017-02-02T21:10:02Z","abstract_excerpt":"In a graph $G$ a sequence $v_1,v_2,\\dots,v_m$ of vertices is Grundy dominating if for all $2\\le i \\le m$ we have $N[v_i]\\not\\subseteq \\cup_{j=1}^{i-1}N[v_j]$ and is Grundy total dominating if for all $2\\le i \\le m$ we have $N(v_i)\\not\\subseteq \\cup_{j=1}^{i-1}N(v_j)$. The length of the longest Grundy (total) dominating sequence has been studied by several authors. In this paper we introduce two similar concepts when the requirement on the neighborhoods is changed to $N(v_i)\\not\\subseteq \\cup_{j=1}^{i-1}N[v_j]$ or $N[v_i]\\not\\subseteq \\cup_{j=1}^{i-1}N(v_j)$. In the former case we establish a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00828","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":"1702.00828","created_at":"2026-05-18T00:51:29.660833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00828v1","created_at":"2026-05-18T00:51:29.660833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00828","created_at":"2026-05-18T00:51:29.660833+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YHUU4ZOQEKA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YHUU4ZOQEKAFNAO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YHUU4ZO","created_at":"2026-05-18T12:31:03.183658+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/5YHUU4ZOQEKAFNAOL4ARJI63IU","json":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU.json","graph_json":"https://pith.science/api/pith-number/5YHUU4ZOQEKAFNAOL4ARJI63IU/graph.json","events_json":"https://pith.science/api/pith-number/5YHUU4ZOQEKAFNAOL4ARJI63IU/events.json","paper":"https://pith.science/paper/5YHUU4ZO"},"agent_actions":{"view_html":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU","download_json":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU.json","view_paper":"https://pith.science/paper/5YHUU4ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00828&json=true","fetch_graph":"https://pith.science/api/pith-number/5YHUU4ZOQEKAFNAOL4ARJI63IU/graph.json","fetch_events":"https://pith.science/api/pith-number/5YHUU4ZOQEKAFNAOL4ARJI63IU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU/action/storage_attestation","attest_author":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU/action/author_attestation","sign_citation":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU/action/citation_signature","submit_replication":"https://pith.science/pith/5YHUU4ZOQEKAFNAOL4ARJI63IU/action/replication_record"}},"created_at":"2026-05-18T00:51:29.660833+00:00","updated_at":"2026-05-18T00:51:29.660833+00:00"}