{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JM3YLKL356A4G4PYYLTXWHOGJC","short_pith_number":"pith:JM3YLKL3","schema_version":"1.0","canonical_sha256":"4b3785a97bef81c371f8c2e77b1dc64888ea051de6b4c7f6c1a79665244b23b8","source":{"kind":"arxiv","id":"2104.03606","version":2},"attestation_state":"computed","paper":{"title":"Predominating a vertex in the connected domination game","license":"http://creativecommons.org/licenses/by/4.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":"2021-04-08T08:40:43Z","abstract_excerpt":"The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a graph $G$ when both players play optimally is denoted by $\\gamma_{\\rm cg}(G)$ ($\\gamma_{\\rm cg}'(G)$, resp.). Connected Game Continuation Principle is established as a substitute for the classical Continuation Principle which does not hold for the connected domination game. Let $G|x$ denote the graph $G$ together with a declaration that the vertex $x$ is already"},"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":"2104.03606","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-08T08:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"464ae5eb7a9e30444dd2676f7ee67015fa17956af43ce958511c101442f495b7","abstract_canon_sha256":"a7a77be6ce3629f61f75370100e078637aa5c827391b735981d2669ae17e53d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:42:00.491200Z","signature_b64":"SGVBNeHgITTm28ZrIi7BioyKzzpYccvoxha/ff0/sXWGRabjAFk1FizVCMRbltRF7FXiZ1QOwgQhX/kKnQ7NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b3785a97bef81c371f8c2e77b1dc64888ea051de6b4c7f6c1a79665244b23b8","last_reissued_at":"2026-07-05T03:42:00.490829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:42:00.490829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predominating a vertex in the connected domination game","license":"http://creativecommons.org/licenses/by/4.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":"2021-04-08T08:40:43Z","abstract_excerpt":"The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a graph $G$ when both players play optimally is denoted by $\\gamma_{\\rm cg}(G)$ ($\\gamma_{\\rm cg}'(G)$, resp.). Connected Game Continuation Principle is established as a substitute for the classical Continuation Principle which does not hold for the connected domination game. Let $G|x$ denote the graph $G$ together with a declaration that the vertex $x$ is already"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03606","kind":"arxiv","version":2},"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/2104.03606/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":"2104.03606","created_at":"2026-07-05T03:42:00.490887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.03606v2","created_at":"2026-07-05T03:42:00.490887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03606","created_at":"2026-07-05T03:42:00.490887+00:00"},{"alias_kind":"pith_short_12","alias_value":"JM3YLKL356A4","created_at":"2026-07-05T03:42:00.490887+00:00"},{"alias_kind":"pith_short_16","alias_value":"JM3YLKL356A4G4PY","created_at":"2026-07-05T03:42:00.490887+00:00"},{"alias_kind":"pith_short_8","alias_value":"JM3YLKL3","created_at":"2026-07-05T03:42:00.490887+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/JM3YLKL356A4G4PYYLTXWHOGJC","json":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC.json","graph_json":"https://pith.science/api/pith-number/JM3YLKL356A4G4PYYLTXWHOGJC/graph.json","events_json":"https://pith.science/api/pith-number/JM3YLKL356A4G4PYYLTXWHOGJC/events.json","paper":"https://pith.science/paper/JM3YLKL3"},"agent_actions":{"view_html":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC","download_json":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC.json","view_paper":"https://pith.science/paper/JM3YLKL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.03606&json=true","fetch_graph":"https://pith.science/api/pith-number/JM3YLKL356A4G4PYYLTXWHOGJC/graph.json","fetch_events":"https://pith.science/api/pith-number/JM3YLKL356A4G4PYYLTXWHOGJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC/action/storage_attestation","attest_author":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC/action/author_attestation","sign_citation":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC/action/citation_signature","submit_replication":"https://pith.science/pith/JM3YLKL356A4G4PYYLTXWHOGJC/action/replication_record"}},"created_at":"2026-07-05T03:42:00.490887+00:00","updated_at":"2026-07-05T03:42:00.490887+00:00"}