{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MXNVSIIWOERRS454IYRAQ6H2RM","short_pith_number":"pith:MXNVSIIW","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"},"canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","source":{"kind":"arxiv","id":"1607.00248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00248","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00248v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00248","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"MXNVSIIWOERR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXNVSIIWOERRS454","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXNVSIIW","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MXNVSIIWOERRS454IYRAQ6H2RM","target":"record","payload":{"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"},"canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","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"},"source_kind":"arxiv","source_id":"1607.00248","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:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUgs8OnEs07iFLt3LpUS9wWWoefpDQhiLiCwjW7nMtTF4HHtTa9/3srKNCojw7Tfa53PzwOTuvwOBdhCL+zKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:20.907367Z"},"content_sha256":"8170ca20526b4245c7659f012e85ac206203048453e08beab039d8d96bf765a3","schema_version":"1.0","event_id":"sha256:8170ca20526b4245c7659f012e85ac206203048453e08beab039d8d96bf765a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MXNVSIIWOERRS454IYRAQ6H2RM","target":"graph","payload":{"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"},"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:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQMuoyonXRqg3ZgvSb+C/22WAHiSjB9JzqhdldMbQu7cNa1s6IQRlIU6KM+cvnHVWBegGfK8I6hRCP1pwZyQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:20.908017Z"},"content_sha256":"c1179e6ff6ecd11a34073bce3574ba91efa3f7ddd78c7e6e6946a3a3d396a3b2","schema_version":"1.0","event_id":"sha256:c1179e6ff6ecd11a34073bce3574ba91efa3f7ddd78c7e6e6946a3a3d396a3b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/bundle.json","state_url":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXNVSIIWOERRS454IYRAQ6H2RM/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-30T12:10:20Z","links":{"resolver":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM","bundle":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/bundle.json","state":"https://pith.science/pith/MXNVSIIWOERRS454IYRAQ6H2RM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXNVSIIWOERRS454IYRAQ6H2RM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MXNVSIIWOERRS454IYRAQ6H2RM","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":"55a28d0a49f7c3c8bfe8ebccf38ee0bc8ac7b6ab96561f17b78e2b6ea6bebd48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-01T13:51:23Z","title_canon_sha256":"78d91821bb3829ad5caad2e4846c9b8634819f8d1c65a19b9f2397e006e4d997"},"schema_version":"1.0","source":{"id":"1607.00248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00248","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00248v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00248","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"MXNVSIIWOERR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXNVSIIWOERRS454","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXNVSIIW","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:c1179e6ff6ecd11a34073bce3574ba91efa3f7ddd78c7e6e6946a3a3d396a3b2","target":"graph","created_at":"2026-05-18T01:11:37Z","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 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","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-01T13:51:23Z","title":"Dominating sequences in grid-like and toroidal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00248","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:8170ca20526b4245c7659f012e85ac206203048453e08beab039d8d96bf765a3","target":"record","created_at":"2026-05-18T01:11:37Z","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":"55a28d0a49f7c3c8bfe8ebccf38ee0bc8ac7b6ab96561f17b78e2b6ea6bebd48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-01T13:51:23Z","title_canon_sha256":"78d91821bb3829ad5caad2e4846c9b8634819f8d1c65a19b9f2397e006e4d997"},"schema_version":"1.0","source":{"id":"1607.00248","kind":"arxiv","version":1}},"canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65db59211671231973bc46220878fa8b2bc5be71d9d5b53f7d63fa5b66df0606","first_computed_at":"2026-05-18T01:11:37.807439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:37.807439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"76TZNgpClWMHunDwFGDytIRb4gjNZovDZB1ssbXhrF/ZUSDQERvNyq4Pp6lVpuk4GiJ1hPRDc8LfYEksuEtOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:37.807789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8170ca20526b4245c7659f012e85ac206203048453e08beab039d8d96bf765a3","sha256:c1179e6ff6ecd11a34073bce3574ba91efa3f7ddd78c7e6e6946a3a3d396a3b2"],"state_sha256":"5299bf1be6887dea04b94a98a9fca8f952a0ade21b687eeee8e11b363b398b1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZRcQCzP9IAg9NMqSDT4DLmDwr0NY0lp+cBsbFqnY1icJ2hnEfWc9cMEIMpM7NaJ+k43Eb31GFijz4rFrRcnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:10:20.911048Z","bundle_sha256":"04c0233cd25c2b51cddd291e20a85d37e58a5e759f1d3bd2b85989f8fc48d06f"}}