{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBBF5VNFTBCYSEK7PS4HZBENKX","short_pith_number":"pith:CBBF5VNF","schema_version":"1.0","canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","source":{"kind":"arxiv","id":"2606.05439","version":1},"attestation_state":"computed","paper":{"title":"In How Many Ways can a Rectangle be Rectangled?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Natalya Ter-Saakov, Pablo Blanco, Robert Dougherty-Bliss","submitted_at":"2026-06-03T21:01:55Z","abstract_excerpt":"There are $2^{n-1}$ ways to tile a $1 \\times n$ rectangle with rectangular tiles (of any length, of course they all must have width $1$), but in how many ways can you tile a $100 \\times 100$ checkerboard with such tiles? Neither humankind, nor computer-kind, will (most probably) ever know the exact number. But it is possible to compute these numbers for $m \\times n$ rectangular grids, if $m$ is not too big, while $n$ can be as big as one wishes. This was initially done in 1988 by David Klarner and Spyros Magliveras, and beautifully extended, around 2006, by, at-the-time, first-year LSU undergr"},"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":"2606.05439","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T21:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"da947ad30dca119d500fd8b92f049c96374972c8955cd72d6d723b34d146c938","abstract_canon_sha256":"689b0d9dc320906391a0ca58bd10730e47409f2410ffe96b6fc134934b114488"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:57.932279Z","signature_b64":"JA2jnJ3Cz3KzO4auH8uXCv6WbZUCdhPoL+iOY0EzXFqnwRdnUzOcwIejdQ0yh4OhOXTcVVVoLr/Jji9zz+txBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","last_reissued_at":"2026-06-05T00:13:57.931710Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:57.931710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In How Many Ways can a Rectangle be Rectangled?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Natalya Ter-Saakov, Pablo Blanco, Robert Dougherty-Bliss","submitted_at":"2026-06-03T21:01:55Z","abstract_excerpt":"There are $2^{n-1}$ ways to tile a $1 \\times n$ rectangle with rectangular tiles (of any length, of course they all must have width $1$), but in how many ways can you tile a $100 \\times 100$ checkerboard with such tiles? Neither humankind, nor computer-kind, will (most probably) ever know the exact number. But it is possible to compute these numbers for $m \\times n$ rectangular grids, if $m$ is not too big, while $n$ can be as big as one wishes. This was initially done in 1988 by David Klarner and Spyros Magliveras, and beautifully extended, around 2006, by, at-the-time, first-year LSU undergr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05439","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05439/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":"2606.05439","created_at":"2026-06-05T00:13:57.931797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05439v1","created_at":"2026-06-05T00:13:57.931797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05439","created_at":"2026-06-05T00:13:57.931797+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBBF5VNFTBCY","created_at":"2026-06-05T00:13:57.931797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBBF5VNFTBCYSEK7","created_at":"2026-06-05T00:13:57.931797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBBF5VNF","created_at":"2026-06-05T00:13:57.931797+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/CBBF5VNFTBCYSEK7PS4HZBENKX","json":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX.json","graph_json":"https://pith.science/api/pith-number/CBBF5VNFTBCYSEK7PS4HZBENKX/graph.json","events_json":"https://pith.science/api/pith-number/CBBF5VNFTBCYSEK7PS4HZBENKX/events.json","paper":"https://pith.science/paper/CBBF5VNF"},"agent_actions":{"view_html":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX","download_json":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX.json","view_paper":"https://pith.science/paper/CBBF5VNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05439&json=true","fetch_graph":"https://pith.science/api/pith-number/CBBF5VNFTBCYSEK7PS4HZBENKX/graph.json","fetch_events":"https://pith.science/api/pith-number/CBBF5VNFTBCYSEK7PS4HZBENKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/action/storage_attestation","attest_author":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/action/author_attestation","sign_citation":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/action/citation_signature","submit_replication":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/action/replication_record"}},"created_at":"2026-06-05T00:13:57.931797+00:00","updated_at":"2026-06-05T00:13:57.931797+00:00"}