{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U3JKOPR2R37PH62LSWOHD5J37G","short_pith_number":"pith:U3JKOPR2","schema_version":"1.0","canonical_sha256":"a6d2a73e3a8efef3fb4b959c71f53bf9bbdc6f452bb48930d67aae83c3b6b337","source":{"kind":"arxiv","id":"2211.05651","version":3},"attestation_state":"computed","paper":{"title":"Complexity of chess domination problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Alexis Langlois-R\\'emillard, \\'Erika R\\'oldan, Mia M\\\"u{\\ss}ig","submitted_at":"2022-11-10T15:31:45Z","abstract_excerpt":"We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have t"},"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":"2211.05651","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-10T15:31:45Z","cross_cats_sorted":["cs.CC","cs.CG","cs.DM"],"title_canon_sha256":"eb01359c7baa9aefae47c87f4c2aa8886cecffd977fcb44f3a41f9581311d484","abstract_canon_sha256":"1cad7890f546c2534879a2507408235fe9caddd989149a18fb75d3f707a3cc1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:30.008439Z","signature_b64":"66up1Bgz5CT6OfdU/kwUt1pjpdrIOt9iykN75cnElBkwZFu4cblecVsFk8R77UN6p3rWx3lr6b0LL6osQyKvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d2a73e3a8efef3fb4b959c71f53bf9bbdc6f452bb48930d67aae83c3b6b337","last_reissued_at":"2026-07-05T10:38:30.007889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:30.007889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of chess domination problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Alexis Langlois-R\\'emillard, \\'Erika R\\'oldan, Mia M\\\"u{\\ss}ig","submitted_at":"2022-11-10T15:31:45Z","abstract_excerpt":"We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05651","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.05651/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.05651","created_at":"2026-07-05T10:38:30.007949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.05651v3","created_at":"2026-07-05T10:38:30.007949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05651","created_at":"2026-07-05T10:38:30.007949+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3JKOPR2R37P","created_at":"2026-07-05T10:38:30.007949+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3JKOPR2R37PH62L","created_at":"2026-07-05T10:38:30.007949+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3JKOPR2","created_at":"2026-07-05T10:38:30.007949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10207","citing_title":"Insights from a workshop on gamification of research in mathematics and computer science","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G","json":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G.json","graph_json":"https://pith.science/api/pith-number/U3JKOPR2R37PH62LSWOHD5J37G/graph.json","events_json":"https://pith.science/api/pith-number/U3JKOPR2R37PH62LSWOHD5J37G/events.json","paper":"https://pith.science/paper/U3JKOPR2"},"agent_actions":{"view_html":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G","download_json":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G.json","view_paper":"https://pith.science/paper/U3JKOPR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.05651&json=true","fetch_graph":"https://pith.science/api/pith-number/U3JKOPR2R37PH62LSWOHD5J37G/graph.json","fetch_events":"https://pith.science/api/pith-number/U3JKOPR2R37PH62LSWOHD5J37G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G/action/storage_attestation","attest_author":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G/action/author_attestation","sign_citation":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G/action/citation_signature","submit_replication":"https://pith.science/pith/U3JKOPR2R37PH62LSWOHD5J37G/action/replication_record"}},"created_at":"2026-07-05T10:38:30.007949+00:00","updated_at":"2026-07-05T10:38:30.007949+00:00"}