{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6PNQDWTTO5ZPOX7E5TRFWF3BCH","short_pith_number":"pith:6PNQDWTT","schema_version":"1.0","canonical_sha256":"f3db01da737772f75fe4ece25b176111c1c1ccee36ded86e8afce6d30f4fa601","source":{"kind":"arxiv","id":"1911.08889","version":1},"attestation_state":"computed","paper":{"title":"Z-domination game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2019-11-20T13:25:27Z","abstract_excerpt":"The Z-domination game is a variant of the domination game in which each newly selected vertex $u$ in the game must have a not yet dominated neighbor, but after the move all vertices from the closed neighborhood of $u$ are declared to be dominated. The Z-domination game is the fastest among the five natural domination games. The corresponding game Z-domination number of a graph $G$ is denoted by $\\gamma_{Zg}(G)$. It is proved that the game domination number and the game total domination number of a graph can be expressed as the game Z-domination number of appropriate lexicographic products. Gra"},"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":"1911.08889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-20T13:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"3481511f1d175864a84efb3123d56323f362dc6b47ed830f161bdcea43d40b39","abstract_canon_sha256":"d94513649bbad2c1ec321f4cf48c28b70f40cceea67d9c122b45515e1fca68f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:46.684264Z","signature_b64":"HEv7Q+o2PUUQSsSXmerVKplY4GdGOvMWcUnVFI9udnvTgvb9OO5NJe+pZAj+6IjahL2NgHvRSDZOfLV4iAqHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3db01da737772f75fe4ece25b176111c1c1ccee36ded86e8afce6d30f4fa601","last_reissued_at":"2026-07-05T00:20:46.683832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:46.683832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Z-domination game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2019-11-20T13:25:27Z","abstract_excerpt":"The Z-domination game is a variant of the domination game in which each newly selected vertex $u$ in the game must have a not yet dominated neighbor, but after the move all vertices from the closed neighborhood of $u$ are declared to be dominated. The Z-domination game is the fastest among the five natural domination games. The corresponding game Z-domination number of a graph $G$ is denoted by $\\gamma_{Zg}(G)$. It is proved that the game domination number and the game total domination number of a graph can be expressed as the game Z-domination number of appropriate lexicographic products. Gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08889","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08889/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.08889","created_at":"2026-07-05T00:20:46.683895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08889v1","created_at":"2026-07-05T00:20:46.683895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08889","created_at":"2026-07-05T00:20:46.683895+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PNQDWTTO5ZP","created_at":"2026-07-05T00:20:46.683895+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PNQDWTTO5ZPOX7E","created_at":"2026-07-05T00:20:46.683895+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PNQDWTT","created_at":"2026-07-05T00:20:46.683895+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/6PNQDWTTO5ZPOX7E5TRFWF3BCH","json":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH.json","graph_json":"https://pith.science/api/pith-number/6PNQDWTTO5ZPOX7E5TRFWF3BCH/graph.json","events_json":"https://pith.science/api/pith-number/6PNQDWTTO5ZPOX7E5TRFWF3BCH/events.json","paper":"https://pith.science/paper/6PNQDWTT"},"agent_actions":{"view_html":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH","download_json":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH.json","view_paper":"https://pith.science/paper/6PNQDWTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08889&json=true","fetch_graph":"https://pith.science/api/pith-number/6PNQDWTTO5ZPOX7E5TRFWF3BCH/graph.json","fetch_events":"https://pith.science/api/pith-number/6PNQDWTTO5ZPOX7E5TRFWF3BCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH/action/storage_attestation","attest_author":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH/action/author_attestation","sign_citation":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH/action/citation_signature","submit_replication":"https://pith.science/pith/6PNQDWTTO5ZPOX7E5TRFWF3BCH/action/replication_record"}},"created_at":"2026-07-05T00:20:46.683895+00:00","updated_at":"2026-07-05T00:20:46.683895+00:00"}