{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:73QEOD3N5DDQYPMF7BILSBQ55K","short_pith_number":"pith:73QEOD3N","schema_version":"1.0","canonical_sha256":"fee0470f6de8c70c3d85f850b9061deaab7c3ff964efc7121f42934fab7a29e5","source":{"kind":"arxiv","id":"0711.4343","version":4},"attestation_state":"computed","paper":{"title":"Perfect domination in regular grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Italo J. Dejter","submitted_at":"2007-11-27T20:40:28Z","abstract_excerpt":"We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\\Lambda}$ of $\\R^2$. In contrast, there is just one 1-perfect code in ${\\Lambda}$ and one total perfect code in ${\\Lambda}$ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products $C_m\\times C_n$ with parallel total perfect codes, and the $d$-perfect and total perfect code partitions of ${\\Lambda}$ and $C_m\\times C_n$, the former having as quotient graph the undirected Cayley graphs of $\\Z_{2d^2+2d"},"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":"0711.4343","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-11-27T20:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"05255466e20afaf50ef74b2a1597842fb2895b97626ec2df3ea5cfe47cb13699","abstract_canon_sha256":"08652c77df9bc859f6b053d52ad4ad665d66151b44f0fb00e3571d90f6ee47ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:57.754658Z","signature_b64":"FWdTh3czQWtPqgYosvccLFB0jwbSfk5FF6z8TbnyKYt/MiMFyqQ9jHH9gbNPKj4Aptbq6GQsmDI9EprLzXt7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fee0470f6de8c70c3d85f850b9061deaab7c3ff964efc7121f42934fab7a29e5","last_reissued_at":"2026-05-18T02:24:57.753744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:57.753744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect domination in regular grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Italo J. Dejter","submitted_at":"2007-11-27T20:40:28Z","abstract_excerpt":"We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\\Lambda}$ of $\\R^2$. In contrast, there is just one 1-perfect code in ${\\Lambda}$ and one total perfect code in ${\\Lambda}$ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products $C_m\\times C_n$ with parallel total perfect codes, and the $d$-perfect and total perfect code partitions of ${\\Lambda}$ and $C_m\\times C_n$, the former having as quotient graph the undirected Cayley graphs of $\\Z_{2d^2+2d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.4343","kind":"arxiv","version":4},"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":"0711.4343","created_at":"2026-05-18T02:24:57.753893+00:00"},{"alias_kind":"arxiv_version","alias_value":"0711.4343v4","created_at":"2026-05-18T02:24:57.753893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.4343","created_at":"2026-05-18T02:24:57.753893+00:00"},{"alias_kind":"pith_short_12","alias_value":"73QEOD3N5DDQ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"73QEOD3N5DDQYPMF","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"73QEOD3N","created_at":"2026-05-18T12:25:55.427421+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/73QEOD3N5DDQYPMF7BILSBQ55K","json":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K.json","graph_json":"https://pith.science/api/pith-number/73QEOD3N5DDQYPMF7BILSBQ55K/graph.json","events_json":"https://pith.science/api/pith-number/73QEOD3N5DDQYPMF7BILSBQ55K/events.json","paper":"https://pith.science/paper/73QEOD3N"},"agent_actions":{"view_html":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K","download_json":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K.json","view_paper":"https://pith.science/paper/73QEOD3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0711.4343&json=true","fetch_graph":"https://pith.science/api/pith-number/73QEOD3N5DDQYPMF7BILSBQ55K/graph.json","fetch_events":"https://pith.science/api/pith-number/73QEOD3N5DDQYPMF7BILSBQ55K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K/action/storage_attestation","attest_author":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K/action/author_attestation","sign_citation":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K/action/citation_signature","submit_replication":"https://pith.science/pith/73QEOD3N5DDQYPMF7BILSBQ55K/action/replication_record"}},"created_at":"2026-05-18T02:24:57.753893+00:00","updated_at":"2026-05-18T02:24:57.753893+00:00"}