{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4ZRVVMLBHC7EIFYFPU72EU2C63","short_pith_number":"pith:4ZRVVMLB","schema_version":"1.0","canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","source":{"kind":"arxiv","id":"1609.03059","version":1},"attestation_state":"computed","paper":{"title":"Trees with Equal Total Domination and Game Total Domination Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Michael A. Henning","submitted_at":"2016-09-10T14:34:28Z","abstract_excerpt":"In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are neighbors. This process eventually produces a total dominating set $S$ of $G$ in which every vertex is totally dominated by a vertex in $S$. Dominator wishes to minimize the number of vertices chosen, while Staller wishes to maximize it. The game "},"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":"1609.03059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T14:34:28Z","cross_cats_sorted":[],"title_canon_sha256":"4e5613f0e13fca06cccd760b0fb1b4500b7f9d038e080b09df65e2e87f5c2c01","abstract_canon_sha256":"3de4829825d68a1957d42e8ce5bf50184f6e46269571c45cef5c48fde4700834"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:49.047430Z","signature_b64":"+mkZz4JfAOXr/X+f5dgsFCMcJWwWkMyjTewFK2Nh9C0AoyqXFu60ejOZqZsFwNt5aUMtzZXoOuI4VCrZI8SUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","last_reissued_at":"2026-05-18T01:04:49.047074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:49.047074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees with Equal Total Domination and Game Total Domination Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Michael A. Henning","submitted_at":"2016-09-10T14:34:28Z","abstract_excerpt":"In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are neighbors. This process eventually produces a total dominating set $S$ of $G$ in which every vertex is totally dominated by a vertex in $S$. Dominator wishes to minimize the number of vertices chosen, while Staller wishes to maximize it. The game "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03059","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":"1609.03059","created_at":"2026-05-18T01:04:49.047129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03059v1","created_at":"2026-05-18T01:04:49.047129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03059","created_at":"2026-05-18T01:04:49.047129+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZRVVMLBHC7E","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZRVVMLBHC7EIFYF","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZRVVMLB","created_at":"2026-05-18T12:29:58.707656+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/4ZRVVMLBHC7EIFYFPU72EU2C63","json":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63.json","graph_json":"https://pith.science/api/pith-number/4ZRVVMLBHC7EIFYFPU72EU2C63/graph.json","events_json":"https://pith.science/api/pith-number/4ZRVVMLBHC7EIFYFPU72EU2C63/events.json","paper":"https://pith.science/paper/4ZRVVMLB"},"agent_actions":{"view_html":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63","download_json":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63.json","view_paper":"https://pith.science/paper/4ZRVVMLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03059&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZRVVMLBHC7EIFYFPU72EU2C63/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZRVVMLBHC7EIFYFPU72EU2C63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/action/storage_attestation","attest_author":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/action/author_attestation","sign_citation":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/action/citation_signature","submit_replication":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/action/replication_record"}},"created_at":"2026-05-18T01:04:49.047129+00:00","updated_at":"2026-05-18T01:04:49.047129+00:00"}