{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PSDUWNINBY7JQVOIL6ZKHSOMGU","short_pith_number":"pith:PSDUWNIN","schema_version":"1.0","canonical_sha256":"7c874b350d0e3e9855c85fb2a3c9cc35192dad63e975dd1ba55307a31e1dc848","source":{"kind":"arxiv","id":"1510.00140","version":2},"attestation_state":"computed","paper":{"title":"Complexity of the Game Domination Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Gabriel Renault, Ga\\v{s}per Ko\\v{s}mrlj, Paul Dorbec, Sandi Klav\\v{z}ar","submitted_at":"2015-10-01T08:42:02Z","abstract_excerpt":"The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph coloring. In this paper we show that verifying whether the game domination number of a graph is bounded by a given integer is PSPACE-complete. This contrasts the situation of the game coloring problem whose complexity is still unknown."},"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":"1510.00140","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-10-01T08:42:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d8499336474fe48afd4c44bcb463b3d2f3246e1ca30592540149b2218864a00d","abstract_canon_sha256":"5347556db7593bfee3c66f0a2de0280de09e585b14d19e9318a0a1618d4e4f9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.951820Z","signature_b64":"eeugb5ZpUU4P70dwaowDtM7YnIFLylXPyU+kq2xXU3v0lpH5EqWIYK/O51R0mcC/n2VINYYjzSkqTtFbEZYsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c874b350d0e3e9855c85fb2a3c9cc35192dad63e975dd1ba55307a31e1dc848","last_reissued_at":"2026-05-18T01:12:19.951477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.951477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the Game Domination Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Gabriel Renault, Ga\\v{s}per Ko\\v{s}mrlj, Paul Dorbec, Sandi Klav\\v{z}ar","submitted_at":"2015-10-01T08:42:02Z","abstract_excerpt":"The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph coloring. In this paper we show that verifying whether the game domination number of a graph is bounded by a given integer is PSPACE-complete. This contrasts the situation of the game coloring problem whose complexity is still unknown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00140","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":"1510.00140","created_at":"2026-05-18T01:12:19.951532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00140v2","created_at":"2026-05-18T01:12:19.951532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00140","created_at":"2026-05-18T01:12:19.951532+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSDUWNINBY7J","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSDUWNINBY7JQVOI","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSDUWNIN","created_at":"2026-05-18T12:29:37.295048+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/PSDUWNINBY7JQVOIL6ZKHSOMGU","json":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU.json","graph_json":"https://pith.science/api/pith-number/PSDUWNINBY7JQVOIL6ZKHSOMGU/graph.json","events_json":"https://pith.science/api/pith-number/PSDUWNINBY7JQVOIL6ZKHSOMGU/events.json","paper":"https://pith.science/paper/PSDUWNIN"},"agent_actions":{"view_html":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU","download_json":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU.json","view_paper":"https://pith.science/paper/PSDUWNIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00140&json=true","fetch_graph":"https://pith.science/api/pith-number/PSDUWNINBY7JQVOIL6ZKHSOMGU/graph.json","fetch_events":"https://pith.science/api/pith-number/PSDUWNINBY7JQVOIL6ZKHSOMGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU/action/storage_attestation","attest_author":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU/action/author_attestation","sign_citation":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU/action/citation_signature","submit_replication":"https://pith.science/pith/PSDUWNINBY7JQVOIL6ZKHSOMGU/action/replication_record"}},"created_at":"2026-05-18T01:12:19.951532+00:00","updated_at":"2026-05-18T01:12:19.951532+00:00"}