{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CBBF5VNFTBCYSEK7PS4HZBENKX","short_pith_number":"pith:CBBF5VNF","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"},"canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","source":{"kind":"arxiv","id":"2606.05439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05439","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05439v1","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05439","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"CBBF5VNFTBCY","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_16","alias_value":"CBBF5VNFTBCYSEK7","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_8","alias_value":"CBBF5VNF","created_at":"2026-06-05T00:13:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CBBF5VNFTBCYSEK7PS4HZBENKX","target":"record","payload":{"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"},"canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","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"},"source_kind":"arxiv","source_id":"2606.05439","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-05T00:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMydk3SAz1HNGJ1Cm6exYrF027p0X9L20R8dlw3ni+7zjl46VMQeISrT25cQRYz7Wp8BmegjnK4Q5aWorfjlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:37.523678Z"},"content_sha256":"af6c8b5434192ee2d141a81386f7fe46783b7af67d8b1d6b17a139c9c564a8e6","schema_version":"1.0","event_id":"sha256:af6c8b5434192ee2d141a81386f7fe46783b7af67d8b1d6b17a139c9c564a8e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CBBF5VNFTBCYSEK7PS4HZBENKX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-05T00:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+6IhG5EHYfyaO0h6z9vBgTK5YNVDGZEOyQrGR0niLKTZDR3u65C2SLdKjhV3FxQYHv/3pAro/1B7PTW813ZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:37.524384Z"},"content_sha256":"d985f4d2943e13c8fecc2bf9df436a42fc1ab1341cd5992ef0bdf1bb26ea7875","schema_version":"1.0","event_id":"sha256:d985f4d2943e13c8fecc2bf9df436a42fc1ab1341cd5992ef0bdf1bb26ea7875"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/bundle.json","state_url":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T06:02:37Z","links":{"resolver":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX","bundle":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/bundle.json","state":"https://pith.science/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBBF5VNFTBCYSEK7PS4HZBENKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CBBF5VNFTBCYSEK7PS4HZBENKX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"689b0d9dc320906391a0ca58bd10730e47409f2410ffe96b6fc134934b114488","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T21:01:55Z","title_canon_sha256":"da947ad30dca119d500fd8b92f049c96374972c8955cd72d6d723b34d146c938"},"schema_version":"1.0","source":{"id":"2606.05439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05439","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05439v1","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05439","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"CBBF5VNFTBCY","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_16","alias_value":"CBBF5VNFTBCYSEK7","created_at":"2026-06-05T00:13:57Z"},{"alias_kind":"pith_short_8","alias_value":"CBBF5VNF","created_at":"2026-06-05T00:13:57Z"}],"graph_snapshots":[{"event_id":"sha256:d985f4d2943e13c8fecc2bf9df436a42fc1ab1341cd5992ef0bdf1bb26ea7875","target":"graph","created_at":"2026-06-05T00:13:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.05439/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Doron Zeilberger, Natalya Ter-Saakov, Pablo Blanco, Robert Dougherty-Bliss","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T21:01:55Z","title":"In How Many Ways can a Rectangle be Rectangled?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05439","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af6c8b5434192ee2d141a81386f7fe46783b7af67d8b1d6b17a139c9c564a8e6","target":"record","created_at":"2026-06-05T00:13:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"689b0d9dc320906391a0ca58bd10730e47409f2410ffe96b6fc134934b114488","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T21:01:55Z","title_canon_sha256":"da947ad30dca119d500fd8b92f049c96374972c8955cd72d6d723b34d146c938"},"schema_version":"1.0","source":{"id":"2606.05439","kind":"arxiv","version":1}},"canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10425ed5a5984589115f7cb87c848d55f8890d240e5abeee667d9343aaba4e72","first_computed_at":"2026-06-05T00:13:57.931710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:57.931710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JA2jnJ3Cz3KzO4auH8uXCv6WbZUCdhPoL+iOY0EzXFqnwRdnUzOcwIejdQ0yh4OhOXTcVVVoLr/Jji9zz+txBQ==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:57.932279Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6c8b5434192ee2d141a81386f7fe46783b7af67d8b1d6b17a139c9c564a8e6","sha256:d985f4d2943e13c8fecc2bf9df436a42fc1ab1341cd5992ef0bdf1bb26ea7875"],"state_sha256":"609a0afae154b4e9f8287f1ea985aa81e6d7ef1330da1d2d2a5aaf134e9dd324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SH7vszc6ZxCGTh+7X6sRrFJF4tp4hxXdXfAYfe9rEyFtDNRFlFPJ/FhPZdiTC6V2+M5ZAXu8KOR1Rm9ZKZxwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:02:37.529337Z","bundle_sha256":"e3d3cac924c4ed4d728b14a98ba1a859166233be87222aa2bc33834801d2cbaf"}}