{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WQLQNPK6HUVMMXRSFXBST25MEY","short_pith_number":"pith:WQLQNPK6","schema_version":"1.0","canonical_sha256":"b41706bd5e3d2ac65e322dc329ebac26094a0ce64b09288a4744cb1e96d05164","source":{"kind":"arxiv","id":"1609.03964","version":1},"attestation_state":"computed","paper":{"title":"Tiling n X m rectangles with 1 X 1 and s X s squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard J. Mathar","submitted_at":"2016-09-13T18:26:01Z","abstract_excerpt":"We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths n as a function of the parameter m and of the number of s X s squares in the rectangle."},"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":"1609.03964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T18:26:01Z","cross_cats_sorted":[],"title_canon_sha256":"aafed6b9cd7b2bbc0ec251ac7f7e636716a996bf39b3ce896750d7ef22d7c6b8","abstract_canon_sha256":"220e5fd14a459f15f1fa2082fd101bc781141caaa125e2d853450730bcc4dc1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.075668Z","signature_b64":"SIVCNXmZPD/2vUEHahPfZ0hm6+Kd6MM7hCvjpCO0TLiK5XUx2nLolT//pDzlGAm7kBYxPlzuY9bJENbpZsglDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41706bd5e3d2ac65e322dc329ebac26094a0ce64b09288a4744cb1e96d05164","last_reissued_at":"2026-05-18T01:04:42.075160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.075160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiling n X m rectangles with 1 X 1 and s X s squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard J. Mathar","submitted_at":"2016-09-13T18:26:01Z","abstract_excerpt":"We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths n as a function of the parameter m and of the number of s X s squares in the rectangle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03964","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":"1609.03964","created_at":"2026-05-18T01:04:42.075244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03964v1","created_at":"2026-05-18T01:04:42.075244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03964","created_at":"2026-05-18T01:04:42.075244+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQLQNPK6HUVM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQLQNPK6HUVMMXRS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQLQNPK6","created_at":"2026-05-18T12:30:51.357362+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/WQLQNPK6HUVMMXRSFXBST25MEY","json":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY.json","graph_json":"https://pith.science/api/pith-number/WQLQNPK6HUVMMXRSFXBST25MEY/graph.json","events_json":"https://pith.science/api/pith-number/WQLQNPK6HUVMMXRSFXBST25MEY/events.json","paper":"https://pith.science/paper/WQLQNPK6"},"agent_actions":{"view_html":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY","download_json":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY.json","view_paper":"https://pith.science/paper/WQLQNPK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03964&json=true","fetch_graph":"https://pith.science/api/pith-number/WQLQNPK6HUVMMXRSFXBST25MEY/graph.json","fetch_events":"https://pith.science/api/pith-number/WQLQNPK6HUVMMXRSFXBST25MEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY/action/storage_attestation","attest_author":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY/action/author_attestation","sign_citation":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY/action/citation_signature","submit_replication":"https://pith.science/pith/WQLQNPK6HUVMMXRSFXBST25MEY/action/replication_record"}},"created_at":"2026-05-18T01:04:42.075244+00:00","updated_at":"2026-05-18T01:04:42.075244+00:00"}