{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UNEPVTLBKBDYA3WKVAZUXTIUVF","short_pith_number":"pith:UNEPVTLB","schema_version":"1.0","canonical_sha256":"a348facd615047806ecaa8334bcd14a9617ea6e41b7cf15511cc2979152744c6","source":{"kind":"arxiv","id":"1110.5103","version":1},"attestation_state":"computed","paper":{"title":"Monomer-dimer tatami tilings of square regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alejandro Erickson, Mark Schurch","submitted_at":"2011-10-24T00:51:03Z","abstract_excerpt":"We prove that the number of monomer-dimer tilings of an $n\\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof of the result that there are $n2^{n-1}$ such tilings with $n$ monomers, which divides the tilings into $n$ classes of size $2^{n-1}$. The sum of these tilings over all monomer counts has the closed form $2^{n-1}(3n-4)+2$ and, curiously, this is equal to the sum of the squares of all parts in all compositions of $n$. We also describe two algorithms and a Gra"},"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":"1110.5103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-24T00:51:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bab074e88ebaa79739999f3ba5601793163c11192aa6c25f51abb46dc803d40d","abstract_canon_sha256":"59a67a593c1f9e21db76d8412b0362475fa51f6f559ce2fd0f83e3ca27b48bc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.704308Z","signature_b64":"grmjVNHrrPCoxYdiF3JwQP6cjkb/tsnDIQ70zCx7x6H7GhYYVhz0XGt6tTWefABzGAi2f9B0VXIcNPjOa/BGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a348facd615047806ecaa8334bcd14a9617ea6e41b7cf15511cc2979152744c6","last_reissued_at":"2026-05-18T04:10:24.703871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.703871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monomer-dimer tatami tilings of square regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alejandro Erickson, Mark Schurch","submitted_at":"2011-10-24T00:51:03Z","abstract_excerpt":"We prove that the number of monomer-dimer tilings of an $n\\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof of the result that there are $n2^{n-1}$ such tilings with $n$ monomers, which divides the tilings into $n$ classes of size $2^{n-1}$. The sum of these tilings over all monomer counts has the closed form $2^{n-1}(3n-4)+2$ and, curiously, this is equal to the sum of the squares of all parts in all compositions of $n$. We also describe two algorithms and a Gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5103","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":"1110.5103","created_at":"2026-05-18T04:10:24.703934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5103v1","created_at":"2026-05-18T04:10:24.703934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5103","created_at":"2026-05-18T04:10:24.703934+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNEPVTLBKBDY","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNEPVTLBKBDYA3WK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNEPVTLB","created_at":"2026-05-18T12:26:42.757692+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/UNEPVTLBKBDYA3WKVAZUXTIUVF","json":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF.json","graph_json":"https://pith.science/api/pith-number/UNEPVTLBKBDYA3WKVAZUXTIUVF/graph.json","events_json":"https://pith.science/api/pith-number/UNEPVTLBKBDYA3WKVAZUXTIUVF/events.json","paper":"https://pith.science/paper/UNEPVTLB"},"agent_actions":{"view_html":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF","download_json":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF.json","view_paper":"https://pith.science/paper/UNEPVTLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5103&json=true","fetch_graph":"https://pith.science/api/pith-number/UNEPVTLBKBDYA3WKVAZUXTIUVF/graph.json","fetch_events":"https://pith.science/api/pith-number/UNEPVTLBKBDYA3WKVAZUXTIUVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF/action/storage_attestation","attest_author":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF/action/author_attestation","sign_citation":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF/action/citation_signature","submit_replication":"https://pith.science/pith/UNEPVTLBKBDYA3WKVAZUXTIUVF/action/replication_record"}},"created_at":"2026-05-18T04:10:24.703934+00:00","updated_at":"2026-05-18T04:10:24.703934+00:00"}