{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MXNVSIIWOERRS454IYRAQ6H2RM","short_pith_number":"pith:MXNVSIIW","schema_version":"1.0","canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","source":{"kind":"arxiv","id":"1607.00248","version":1},"attestation_state":"computed","paper":{"title":"Dominating sequences in grid-like and toroidal graphs","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":"2016-07-01T13:51:23Z","abstract_excerpt":"A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$. In this paper we study the Grundy domination number in the four standard graph products: the Cartesian, the lexicographic, the direct, and the strong product. For each of the products we present a lower bound for the Grundy domination number which turns out to be exact for the lexicographic product and is conjectured to be exact for the stro"},"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":"1607.00248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-01T13:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"78d91821bb3829ad5caad2e4846c9b8634819f8d1c65a19b9f2397e006e4d997","abstract_canon_sha256":"55a28d0a49f7c3c8bfe8ebccf38ee0bc8ac7b6ab96561f17b78e2b6ea6bebd48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.807789Z","signature_b64":"76TZNgpClWMHunDwFGDytIRb4gjNZovDZB1ssbXhrF/ZUSDQERvNyq4Pp6lVpuk4GiJ1hPRDc8LfYEksuEtOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","last_reissued_at":"2026-05-18T01:11:37.807439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.807439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating sequences in grid-like and toroidal graphs","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":"2016-07-01T13:51:23Z","abstract_excerpt":"A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$. In this paper we study the Grundy domination number in the four standard graph products: the Cartesian, the lexicographic, the direct, and the strong product. For each of the products we present a lower bound for the Grundy domination number which turns out to be exact for the lexicographic product and is conjectured to be exact for the stro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00248","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":"1607.00248","created_at":"2026-05-18T01:11:37.807500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00248v1","created_at":"2026-05-18T01:11:37.807500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00248","created_at":"2026-05-18T01:11:37.807500+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXNVSIIWOERR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXNVSIIWOERRS454","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXNVSIIW","created_at":"2026-05-18T12:30:32.724797+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/MXNVSIIWOERRS454IYRAQ6H2RM","json":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM.json","graph_json":"https://pith.science/api/pith-number/MXNVSIIWOERRS454IYRAQ6H2RM/graph.json","events_json":"https://pith.science/api/pith-number/MXNVSIIWOERRS454IYRAQ6H2RM/events.json","paper":"https://pith.science/paper/MXNVSIIW"},"agent_actions":{"view_html":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM","download_json":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM.json","view_paper":"https://pith.science/paper/MXNVSIIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00248&json=true","fetch_graph":"https://pith.science/api/pith-number/MXNVSIIWOERRS454IYRAQ6H2RM/graph.json","fetch_events":"https://pith.science/api/pith-number/MXNVSIIWOERRS454IYRAQ6H2RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/action/storage_attestation","attest_author":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/action/author_attestation","sign_citation":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/action/citation_signature","submit_replication":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/action/replication_record"}},"created_at":"2026-05-18T01:11:37.807500+00:00","updated_at":"2026-05-18T01:11:37.807500+00:00"}