{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3EOSGZKSRRMIGOHZEUCR74TYJ7","short_pith_number":"pith:3EOSGZKS","schema_version":"1.0","canonical_sha256":"d91d2365528c588338f925051ff2784ff884bd431f1621774d4c65cc77474e0c","source":{"kind":"arxiv","id":"1902.00204","version":1},"attestation_state":"computed","paper":{"title":"Maker-Breaker total domination game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Sandi Klav\\v{z}ar, Valentin Gledel, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2019-02-01T07:14:06Z","abstract_excerpt":"Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duch\\^ene, Gledel, Parreau, and Renault. Both games are instances of the combinatorial Maker-Breaker games. The Maker-Breaker total domination game is played on a graph $G$ by two players who alternately take turns choosing vertices of $G$. The first player, Dominator, selects a vertex in order to totally dominate $G$ while the other player, Staller, forbids a vertex to Dominator in order to prevent him to reach his goal.\n  It is shown that there are inf"},"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":"1902.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T07:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"68aceb3f7642b317517bf7f593fc18713f3b9235767cf14c6c7eb806f995d901","abstract_canon_sha256":"60af1d751b447260d10533d672aed3a480e8eab30a4afb7fde7794b5be267b36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.059855Z","signature_b64":"s4PUuJ3Dq4BJDRno5ZR5R/7ocQ3/wvelOL7sxi/tDG01Ycy6DMeAXaIofsr4iG/O7WO/hSDWx6l+jgelKTykBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d91d2365528c588338f925051ff2784ff884bd431f1621774d4c65cc77474e0c","last_reissued_at":"2026-05-17T23:54:58.059449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.059449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maker-Breaker total domination game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Sandi Klav\\v{z}ar, Valentin Gledel, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2019-02-01T07:14:06Z","abstract_excerpt":"Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duch\\^ene, Gledel, Parreau, and Renault. Both games are instances of the combinatorial Maker-Breaker games. The Maker-Breaker total domination game is played on a graph $G$ by two players who alternately take turns choosing vertices of $G$. The first player, Dominator, selects a vertex in order to totally dominate $G$ while the other player, Staller, forbids a vertex to Dominator in order to prevent him to reach his goal.\n  It is shown that there are inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00204","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":"1902.00204","created_at":"2026-05-17T23:54:58.059513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00204v1","created_at":"2026-05-17T23:54:58.059513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00204","created_at":"2026-05-17T23:54:58.059513+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EOSGZKSRRMI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EOSGZKSRRMIGOHZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EOSGZKS","created_at":"2026-05-18T12:33:07.085635+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/3EOSGZKSRRMIGOHZEUCR74TYJ7","json":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7.json","graph_json":"https://pith.science/api/pith-number/3EOSGZKSRRMIGOHZEUCR74TYJ7/graph.json","events_json":"https://pith.science/api/pith-number/3EOSGZKSRRMIGOHZEUCR74TYJ7/events.json","paper":"https://pith.science/paper/3EOSGZKS"},"agent_actions":{"view_html":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7","download_json":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7.json","view_paper":"https://pith.science/paper/3EOSGZKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00204&json=true","fetch_graph":"https://pith.science/api/pith-number/3EOSGZKSRRMIGOHZEUCR74TYJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/3EOSGZKSRRMIGOHZEUCR74TYJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7/action/storage_attestation","attest_author":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7/action/author_attestation","sign_citation":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7/action/citation_signature","submit_replication":"https://pith.science/pith/3EOSGZKSRRMIGOHZEUCR74TYJ7/action/replication_record"}},"created_at":"2026-05-17T23:54:58.059513+00:00","updated_at":"2026-05-17T23:54:58.059513+00:00"}