{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V4OKPPFWI32HVQXKE4NOTSEW4V","short_pith_number":"pith:V4OKPPFW","schema_version":"1.0","canonical_sha256":"af1ca7bcb646f47ac2ea271ae9c896e54e4443f4914f73ed46c940bd0d99bcfb","source":{"kind":"arxiv","id":"1805.03335","version":1},"attestation_state":"computed","paper":{"title":"Perfect Domination in Knights Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renu Laskar, Soumendra Ganguly, Todd Fenstermacher","submitted_at":"2018-05-09T00:58:46Z","abstract_excerpt":"For a graph $G = (V,E),$ a subset $S$ of $V$ is a perfect dominating set of $G$ if every vertex not in $S$ is adjacent to exactly one vertex in $S.$ The perfect domination number, $\\gamma_p(G),$ is the minimum cardinality of a perfect dominating set of $G.$ The perfect domination number is found for knights graphs on square, rectangular, and infinite chessboards. Indeed, exact values or bounds are given for all chessboards except those with 3 rows and number of columns congruent to 1, 2, or 3 modulo 8."},"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":"1805.03335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T00:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"30b3173579113f95a7447f0414eccbcc8c451998ec2898ff5068ca13f801d136","abstract_canon_sha256":"b093de00589f2c4a35d49879f31b9df792bca6402c937be29590778fe85aaa25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.466455Z","signature_b64":"3b765+PydnowSx0yWan7OvBRguUbt64srlKfj0VQ49Z2stctQPQ7E81QWraU3Xe6WRgK7WXm39A6V2QJQbSvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1ca7bcb646f47ac2ea271ae9c896e54e4443f4914f73ed46c940bd0d99bcfb","last_reissued_at":"2026-05-18T00:16:20.465821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.465821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Domination in Knights Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renu Laskar, Soumendra Ganguly, Todd Fenstermacher","submitted_at":"2018-05-09T00:58:46Z","abstract_excerpt":"For a graph $G = (V,E),$ a subset $S$ of $V$ is a perfect dominating set of $G$ if every vertex not in $S$ is adjacent to exactly one vertex in $S.$ The perfect domination number, $\\gamma_p(G),$ is the minimum cardinality of a perfect dominating set of $G.$ The perfect domination number is found for knights graphs on square, rectangular, and infinite chessboards. Indeed, exact values or bounds are given for all chessboards except those with 3 rows and number of columns congruent to 1, 2, or 3 modulo 8."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03335","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":"1805.03335","created_at":"2026-05-18T00:16:20.465919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03335v1","created_at":"2026-05-18T00:16:20.465919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03335","created_at":"2026-05-18T00:16:20.465919+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4OKPPFWI32H","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4OKPPFWI32HVQXK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4OKPPFW","created_at":"2026-05-18T12:32:56.356000+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/V4OKPPFWI32HVQXKE4NOTSEW4V","json":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V.json","graph_json":"https://pith.science/api/pith-number/V4OKPPFWI32HVQXKE4NOTSEW4V/graph.json","events_json":"https://pith.science/api/pith-number/V4OKPPFWI32HVQXKE4NOTSEW4V/events.json","paper":"https://pith.science/paper/V4OKPPFW"},"agent_actions":{"view_html":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V","download_json":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V.json","view_paper":"https://pith.science/paper/V4OKPPFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03335&json=true","fetch_graph":"https://pith.science/api/pith-number/V4OKPPFWI32HVQXKE4NOTSEW4V/graph.json","fetch_events":"https://pith.science/api/pith-number/V4OKPPFWI32HVQXKE4NOTSEW4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V/action/storage_attestation","attest_author":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V/action/author_attestation","sign_citation":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V/action/citation_signature","submit_replication":"https://pith.science/pith/V4OKPPFWI32HVQXKE4NOTSEW4V/action/replication_record"}},"created_at":"2026-05-18T00:16:20.465919+00:00","updated_at":"2026-05-18T00:16:20.465919+00:00"}