{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3ZYJOQOBHJBLTP6LWHFUF55XDO","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":"dfcc3928a1322c6cb70e70960dc59514bbc130b4ab9b62b55992835367ed1142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-19T11:24:32Z","title_canon_sha256":"b7b278c8bf4d974701230afca9f2d0cb5655ed82c7d5de3c40b7f48674de3c02"},"schema_version":"1.0","source":{"id":"1411.5184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5184","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5184v1","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5184","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"pith_short_12","alias_value":"3ZYJOQOBHJBL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3ZYJOQOBHJBLTP6L","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3ZYJOQOB","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4b4fd0507e9114e253410d2487af93e50ad8b790dd76c1ce1021ae0523b5bb1c","target":"graph","created_at":"2026-05-18T02:34:44Z","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":"We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker has a winning strategy on all connected graphs if the game is started by the breaker. This implies the same in the $(2:1)$ biased game also in the maker-start game. It remains open to characterize the maker-win graphs in the maker-start non-biased game, and to analyze the $(a:b)$ biased game for $(a:b)\\neq (2:1)$. For a more restricted variant of the non-biased game we prove that the maker can win on every graph with","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-19T11:24:32Z","title":"The Disjoint Domination Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5184","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:c384a2c150847eb75a5ea9f6ebc650d9e19b83cc6d8d9453c30650f526eebb93","target":"record","created_at":"2026-05-18T02:34:44Z","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":"dfcc3928a1322c6cb70e70960dc59514bbc130b4ab9b62b55992835367ed1142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-19T11:24:32Z","title_canon_sha256":"b7b278c8bf4d974701230afca9f2d0cb5655ed82c7d5de3c40b7f48674de3c02"},"schema_version":"1.0","source":{"id":"1411.5184","kind":"arxiv","version":1}},"canonical_sha256":"de709741c13a42b9bfcbb1cb42f7b71bbc74f5937cc95a37ba6c7e04c6bda53e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de709741c13a42b9bfcbb1cb42f7b71bbc74f5937cc95a37ba6c7e04c6bda53e","first_computed_at":"2026-05-18T02:34:44.200398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:44.200398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"asn8ty7VVA8THykRDJ41yb9kfzW7ted6EN3lQRK3TyBtbmYjF84uWiZg8OhsT3/r9NNV2aPfTAy47PRMW7hWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:44.200773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c384a2c150847eb75a5ea9f6ebc650d9e19b83cc6d8d9453c30650f526eebb93","sha256:4b4fd0507e9114e253410d2487af93e50ad8b790dd76c1ce1021ae0523b5bb1c"],"state_sha256":"0de4f50c28c00f01a46ab6678d371fc635905bf7dfdd307946387c6afcad13b1"}