{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YW4GBA6O5PVYQNFW66JV6HK3TI","short_pith_number":"pith:YW4GBA6O","canonical_record":{"source":{"id":"1403.4776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-19T12:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"5dd9367aac1cb462f90ad909069e8658f540b2fd807261b1f82a9c672e82293c","abstract_canon_sha256":"ed08385d6072b4b1aa6b0165ff83c893a1c47c598c9df918ba68b13699154242"},"schema_version":"1.0"},"canonical_sha256":"c5b86083ceebeb8834b6f7935f1d5b9a1bdea1007a608700192b5c32c0d5b9c1","source":{"kind":"arxiv","id":"1403.4776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4776","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4776v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4776","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"YW4GBA6O5PVY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YW4GBA6O5PVYQNFW","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YW4GBA6O","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YW4GBA6O5PVYQNFW66JV6HK3TI","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-19T12:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"5dd9367aac1cb462f90ad909069e8658f540b2fd807261b1f82a9c672e82293c","abstract_canon_sha256":"ed08385d6072b4b1aa6b0165ff83c893a1c47c598c9df918ba68b13699154242"},"schema_version":"1.0"},"canonical_sha256":"c5b86083ceebeb8834b6f7935f1d5b9a1bdea1007a608700192b5c32c0d5b9c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.503224Z","signature_b64":"S3FKN0rdXmMKjUAPGQz3Avssuc1llXtlU9d8g1vCbVjfjHjcNRCbc/fVXqfMVcSsem5wMeMVLxTHgJ9gFISABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5b86083ceebeb8834b6f7935f1d5b9a1bdea1007a608700192b5c32c0d5b9c1","last_reissued_at":"2026-05-18T02:56:04.502797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.502797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4776","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-05-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhZeOWj4iszAbUjM0i9R8doDPCPjd/Ag8h/dp0QWibeCSwlKEuYyrVnjOyRGM0MBfDy20Xb1q8WhquaOnmizBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:48:25.370643Z"},"content_sha256":"a7ba9e6ab3a701f34f6d0d79a0a035908f27708774d86793937529c976d2fe05","schema_version":"1.0","event_id":"sha256:a7ba9e6ab3a701f34f6d0d79a0a035908f27708774d86793937529c976d2fe05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YW4GBA6O5PVYQNFW66JV6HK3TI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Tatami Coverings Efficiently","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Erickson, Frank Ruskey","submitted_at":"2014-03-19T12:01:52Z","abstract_excerpt":"We present two algorithms to list certain classes of monomino-domino coverings which conform to the \\emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in $O(1)$ time per covering. This is faster than known methods for generating certain classes of matchings in bipartite graphs.\n  We discuss tatami coverings of $n\\times n$ grids with $n$ monominoes and $v$ vertical dominoes, as well as tatami coverings of a two-way infinitely-wide strip of constant height, subject to the constraint that they have a finite numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4776","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"},"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-05-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZQurtaPyeUKe0j+Eq2Kirvu1PHItBQCGi1H7sKnCguE2MogTQaISNSw7BIkS5ueccQltwPEjgqVa2elY+sXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:48:25.370989Z"},"content_sha256":"498917513bf1e80068dcab45052b60a8253c1080a521a27b96bf95ff1affe703","schema_version":"1.0","event_id":"sha256:498917513bf1e80068dcab45052b60a8253c1080a521a27b96bf95ff1affe703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/bundle.json","state_url":"https://pith.science/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/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-03T18:48:25Z","links":{"resolver":"https://pith.science/pith/YW4GBA6O5PVYQNFW66JV6HK3TI","bundle":"https://pith.science/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/bundle.json","state":"https://pith.science/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YW4GBA6O5PVYQNFW66JV6HK3TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YW4GBA6O5PVYQNFW66JV6HK3TI","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":"ed08385d6072b4b1aa6b0165ff83c893a1c47c598c9df918ba68b13699154242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-19T12:01:52Z","title_canon_sha256":"5dd9367aac1cb462f90ad909069e8658f540b2fd807261b1f82a9c672e82293c"},"schema_version":"1.0","source":{"id":"1403.4776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4776","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4776v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4776","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"YW4GBA6O5PVY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YW4GBA6O5PVYQNFW","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YW4GBA6O","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:498917513bf1e80068dcab45052b60a8253c1080a521a27b96bf95ff1affe703","target":"graph","created_at":"2026-05-18T02:56:04Z","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"},"paper":{"abstract_excerpt":"We present two algorithms to list certain classes of monomino-domino coverings which conform to the \\emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in $O(1)$ time per covering. This is faster than known methods for generating certain classes of matchings in bipartite graphs.\n  We discuss tatami coverings of $n\\times n$ grids with $n$ monominoes and $v$ vertical dominoes, as well as tatami coverings of a two-way infinitely-wide strip of constant height, subject to the constraint that they have a finite numbe","authors_text":"Alejandro Erickson, Frank Ruskey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-19T12:01:52Z","title":"Generating Tatami Coverings Efficiently"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4776","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:a7ba9e6ab3a701f34f6d0d79a0a035908f27708774d86793937529c976d2fe05","target":"record","created_at":"2026-05-18T02:56:04Z","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":"ed08385d6072b4b1aa6b0165ff83c893a1c47c598c9df918ba68b13699154242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-19T12:01:52Z","title_canon_sha256":"5dd9367aac1cb462f90ad909069e8658f540b2fd807261b1f82a9c672e82293c"},"schema_version":"1.0","source":{"id":"1403.4776","kind":"arxiv","version":1}},"canonical_sha256":"c5b86083ceebeb8834b6f7935f1d5b9a1bdea1007a608700192b5c32c0d5b9c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5b86083ceebeb8834b6f7935f1d5b9a1bdea1007a608700192b5c32c0d5b9c1","first_computed_at":"2026-05-18T02:56:04.502797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.502797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S3FKN0rdXmMKjUAPGQz3Avssuc1llXtlU9d8g1vCbVjfjHjcNRCbc/fVXqfMVcSsem5wMeMVLxTHgJ9gFISABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.503224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7ba9e6ab3a701f34f6d0d79a0a035908f27708774d86793937529c976d2fe05","sha256:498917513bf1e80068dcab45052b60a8253c1080a521a27b96bf95ff1affe703"],"state_sha256":"6866c649a697f460b92aeb1d499cf1cee3f6f988d939f317029b7de574d64639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/ijT7DkwJQgQhmilwuaKXxWRDvMQ9CeGHdz+QH07oaA+miwe7SdANIsfzoEkYqXPakwzMfK8+cZ3paUCsOJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:48:25.372925Z","bundle_sha256":"2325a2032061ff96f77cc9d8fb5e9e1c70957cfc0cfcf73c1fc48f090e7c00d0"}}