{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VPS66IYJ7D7MHEYNC5KT6GL2FT","short_pith_number":"pith:VPS66IYJ","schema_version":"1.0","canonical_sha256":"abe5ef2309f8fec3930d17553f197a2cd505b053e6e6f9bc9c98151d99466715","source":{"kind":"arxiv","id":"1210.0524","version":2},"attestation_state":"computed","paper":{"title":"Domination game played on trees and spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Douglas F. Rall, Sandi Klavzar","submitted_at":"2012-10-01T19:58:18Z","abstract_excerpt":"The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal strategy---Dominator plays so as to end the game as quickly as possible while Staller plays in such a way that the game lasts as many steps as possible. The game domination number of G is the number of vertices chosen when Dominator starts the game and the Staller-start game domination number of G when Staller starts the game.\n  In this paper these two games"},"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":"1210.0524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-01T19:58:18Z","cross_cats_sorted":[],"title_canon_sha256":"8d9ee4618c515e7961c61cf1a6b58d2120e9dc07b4128fecdf1f1f6ed010534b","abstract_canon_sha256":"e49ef16a9f8170b15166c557890315c6681a0affb8312887bb061fefabcb96fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:06.583879Z","signature_b64":"g5j0PsSwMO3TpZiKH9BsXXU4w6ArGFci+JzU0hA3AknJzLl/alxl+7jzUWGKGkvBL1wk+IhalFcgEgoWHYhLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe5ef2309f8fec3930d17553f197a2cd505b053e6e6f9bc9c98151d99466715","last_reissued_at":"2026-05-18T03:31:06.583248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:06.583248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination game played on trees and spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Douglas F. Rall, Sandi Klavzar","submitted_at":"2012-10-01T19:58:18Z","abstract_excerpt":"The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal strategy---Dominator plays so as to end the game as quickly as possible while Staller plays in such a way that the game lasts as many steps as possible. The game domination number of G is the number of vertices chosen when Dominator starts the game and the Staller-start game domination number of G when Staller starts the game.\n  In this paper these two games"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0524","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":""},"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":"1210.0524","created_at":"2026-05-18T03:31:06.583328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0524v2","created_at":"2026-05-18T03:31:06.583328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0524","created_at":"2026-05-18T03:31:06.583328+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPS66IYJ7D7M","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPS66IYJ7D7MHEYN","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPS66IYJ","created_at":"2026-05-18T12:27:25.539911+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/VPS66IYJ7D7MHEYNC5KT6GL2FT","json":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT.json","graph_json":"https://pith.science/api/pith-number/VPS66IYJ7D7MHEYNC5KT6GL2FT/graph.json","events_json":"https://pith.science/api/pith-number/VPS66IYJ7D7MHEYNC5KT6GL2FT/events.json","paper":"https://pith.science/paper/VPS66IYJ"},"agent_actions":{"view_html":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT","download_json":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT.json","view_paper":"https://pith.science/paper/VPS66IYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0524&json=true","fetch_graph":"https://pith.science/api/pith-number/VPS66IYJ7D7MHEYNC5KT6GL2FT/graph.json","fetch_events":"https://pith.science/api/pith-number/VPS66IYJ7D7MHEYNC5KT6GL2FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT/action/storage_attestation","attest_author":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT/action/author_attestation","sign_citation":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT/action/citation_signature","submit_replication":"https://pith.science/pith/VPS66IYJ7D7MHEYNC5KT6GL2FT/action/replication_record"}},"created_at":"2026-05-18T03:31:06.583328+00:00","updated_at":"2026-05-18T03:31:06.583328+00:00"}