{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:53XBC5UDQKR4G2HYY5VGM34TIM","short_pith_number":"pith:53XBC5UD","schema_version":"1.0","canonical_sha256":"eeee11768382a3c368f8c76a666f93433b59bdf389ad9acf1484b6d07ac70361","source":{"kind":"arxiv","id":"1709.06069","version":1},"attestation_state":"computed","paper":{"title":"Game Total Domination Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Michael A. Henning, Sandi Klav\\v{z}ar","submitted_at":"2017-09-18T17:48:39Z","abstract_excerpt":"In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, $\\gamma_{\\rm tg}(G)$, of $G$ is the number of vertices chosen when Dominator starts the game and both players play optimally. If a vertex $v$ of $G$ is declared to be already totally dominated, then we denote this graph by $G|v$. In this paper the total dominatio"},"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":"1709.06069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T17:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"930154fb83f47c23a1422ae4eaa3ca998d357fda483d34bc206bae96f0bd638d","abstract_canon_sha256":"17e7c0fcdbb14f34c7ca8b3d825e22baf87aa6268d76e8e43129bf816fdb678c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.345232Z","signature_b64":"SyxBNXufSimzF4BvAi//1idjDEEtdXK8dexoJjhYpoMDf47PAl4LJ0+8SWdAU9NtjS0lsYbrA409zechVY1BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeee11768382a3c368f8c76a666f93433b59bdf389ad9acf1484b6d07ac70361","last_reissued_at":"2026-05-18T00:34:58.344580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.344580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game Total Domination Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Michael A. Henning, Sandi Klav\\v{z}ar","submitted_at":"2017-09-18T17:48:39Z","abstract_excerpt":"In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, $\\gamma_{\\rm tg}(G)$, of $G$ is the number of vertices chosen when Dominator starts the game and both players play optimally. If a vertex $v$ of $G$ is declared to be already totally dominated, then we denote this graph by $G|v$. In this paper the total dominatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06069","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":"1709.06069","created_at":"2026-05-18T00:34:58.344703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06069v1","created_at":"2026-05-18T00:34:58.344703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06069","created_at":"2026-05-18T00:34:58.344703+00:00"},{"alias_kind":"pith_short_12","alias_value":"53XBC5UDQKR4","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"53XBC5UDQKR4G2HY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"53XBC5UD","created_at":"2026-05-18T12:31:00.734936+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/53XBC5UDQKR4G2HYY5VGM34TIM","json":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM.json","graph_json":"https://pith.science/api/pith-number/53XBC5UDQKR4G2HYY5VGM34TIM/graph.json","events_json":"https://pith.science/api/pith-number/53XBC5UDQKR4G2HYY5VGM34TIM/events.json","paper":"https://pith.science/paper/53XBC5UD"},"agent_actions":{"view_html":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM","download_json":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM.json","view_paper":"https://pith.science/paper/53XBC5UD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06069&json=true","fetch_graph":"https://pith.science/api/pith-number/53XBC5UDQKR4G2HYY5VGM34TIM/graph.json","fetch_events":"https://pith.science/api/pith-number/53XBC5UDQKR4G2HYY5VGM34TIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM/action/storage_attestation","attest_author":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM/action/author_attestation","sign_citation":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM/action/citation_signature","submit_replication":"https://pith.science/pith/53XBC5UDQKR4G2HYY5VGM34TIM/action/replication_record"}},"created_at":"2026-05-18T00:34:58.344703+00:00","updated_at":"2026-05-18T00:34:58.344703+00:00"}