{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4ZRVVMLBHC7EIFYFPU72EU2C63","short_pith_number":"pith:4ZRVVMLB","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"},"canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","source":{"kind":"arxiv","id":"1609.03059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03059","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03059v1","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03059","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"4ZRVVMLBHC7E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ZRVVMLBHC7EIFYF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ZRVVMLB","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4ZRVVMLBHC7EIFYFPU72EU2C63","target":"record","payload":{"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"},"canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","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"},"source_kind":"arxiv","source_id":"1609.03059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w891VYUN9VKb0faZy33Emfr/cAdRQbRoSV1XRSCTq3/ptot8atvrrRBJsMB3TwQr0HxqqTgDSy+pbVE7zZ38Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:09:44.409365Z"},"content_sha256":"8d40440274e7da32c46fc6715dc7025d4389b3566fb67bf4efa79167e9657d1f","schema_version":"1.0","event_id":"sha256:8d40440274e7da32c46fc6715dc7025d4389b3566fb67bf4efa79167e9657d1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4ZRVVMLBHC7EIFYFPU72EU2C63","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brlWt+Jy/uObHnukdmhvAfi4vljMa5yli4Lkm9L0rSVWwjQuDylHmhoRG050iEUPP0PxyhdFAul0SfW3MwyVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:09:44.409713Z"},"content_sha256":"e91357c74a1a3b915ee70f8d16e5d6a85963cb615d2523a940bcd85f84bcae3e","schema_version":"1.0","event_id":"sha256:e91357c74a1a3b915ee70f8d16e5d6a85963cb615d2523a940bcd85f84bcae3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/bundle.json","state_url":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T02:09:44Z","links":{"resolver":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63","bundle":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/bundle.json","state":"https://pith.science/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZRVVMLBHC7EIFYFPU72EU2C63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4ZRVVMLBHC7EIFYFPU72EU2C63","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":"3de4829825d68a1957d42e8ce5bf50184f6e46269571c45cef5c48fde4700834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T14:34:28Z","title_canon_sha256":"4e5613f0e13fca06cccd760b0fb1b4500b7f9d038e080b09df65e2e87f5c2c01"},"schema_version":"1.0","source":{"id":"1609.03059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03059","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03059v1","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03059","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"4ZRVVMLBHC7E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ZRVVMLBHC7EIFYF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ZRVVMLB","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:e91357c74a1a3b915ee70f8d16e5d6a85963cb615d2523a940bcd85f84bcae3e","target":"graph","created_at":"2026-05-18T01:04:49Z","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":"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 ","authors_text":"Douglas F. Rall, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T14:34:28Z","title":"Trees with Equal Total Domination and Game Total Domination Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03059","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:8d40440274e7da32c46fc6715dc7025d4389b3566fb67bf4efa79167e9657d1f","target":"record","created_at":"2026-05-18T01:04:49Z","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":"3de4829825d68a1957d42e8ce5bf50184f6e46269571c45cef5c48fde4700834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T14:34:28Z","title_canon_sha256":"4e5613f0e13fca06cccd760b0fb1b4500b7f9d038e080b09df65e2e87f5c2c01"},"schema_version":"1.0","source":{"id":"1609.03059","kind":"arxiv","version":1}},"canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6635ab16138be4417057d3fa25342f6df58be69f9b5f3f22984e91e5b415f44","first_computed_at":"2026-05-18T01:04:49.047074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:49.047074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mkZz4JfAOXr/X+f5dgsFCMcJWwWkMyjTewFK2Nh9C0AoyqXFu60ejOZqZsFwNt5aUMtzZXoOuI4VCrZI8SUCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:49.047430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d40440274e7da32c46fc6715dc7025d4389b3566fb67bf4efa79167e9657d1f","sha256:e91357c74a1a3b915ee70f8d16e5d6a85963cb615d2523a940bcd85f84bcae3e"],"state_sha256":"8f49fea4ec0623115f223cdd48b9ce26b154d2755684b7590dc32a9b642e5f30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvS1JMMXtTXKx4NIj8WqZnjAp6LWTlbvctpLlKqpN7dZ23m99445OXzVa8s2tUVDJpJp0Tn5PLLHlf+796aIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:09:44.411849Z","bundle_sha256":"2a5cf9833fd1b7864e7369a059d5bf9fe8a48cd539aa943f7f6ecfcc6d8dc416"}}