{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IKECK537CSZENJ6G6UGUR2YIB7","short_pith_number":"pith:IKECK537","schema_version":"1.0","canonical_sha256":"428825777f14b246a7c6f50d48eb080fe6bc260a3a4fd67647052633544c6e9c","source":{"kind":"arxiv","id":"1511.03043","version":1},"attestation_state":"computed","paper":{"title":"Tiling with Small Tiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anne Kenyon, Martin Tassy","submitted_at":"2015-11-10T10:03:00Z","abstract_excerpt":"We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of this. We also present a result to a more classic tiling question with dominoes and L-shape tiles."},"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":"1511.03043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-10T10:03:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8c80b4e76917a57394dafd691d9f9d3f18d876a9d09db92b70d0e862c9ca9dab","abstract_canon_sha256":"1d17853b5339bb48154934243876b608c8286ee32e5d3972744a1b2f05a11b00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:17.132809Z","signature_b64":"eUpRuQMko9L/BQp/ak4un9Ya7UV7csWjtOg7QnT9tXbyH4m+DPcVwZYqha0wun+OVmRtOhnAQkxFw7xeBhVjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428825777f14b246a7c6f50d48eb080fe6bc260a3a4fd67647052633544c6e9c","last_reissued_at":"2026-05-18T01:27:17.132187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:17.132187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiling with Small Tiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anne Kenyon, Martin Tassy","submitted_at":"2015-11-10T10:03:00Z","abstract_excerpt":"We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of this. We also present a result to a more classic tiling question with dominoes and L-shape tiles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03043","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":"1511.03043","created_at":"2026-05-18T01:27:17.132274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03043v1","created_at":"2026-05-18T01:27:17.132274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03043","created_at":"2026-05-18T01:27:17.132274+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKECK537CSZE","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKECK537CSZENJ6G","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKECK537","created_at":"2026-05-18T12:29:25.134429+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/IKECK537CSZENJ6G6UGUR2YIB7","json":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7.json","graph_json":"https://pith.science/api/pith-number/IKECK537CSZENJ6G6UGUR2YIB7/graph.json","events_json":"https://pith.science/api/pith-number/IKECK537CSZENJ6G6UGUR2YIB7/events.json","paper":"https://pith.science/paper/IKECK537"},"agent_actions":{"view_html":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7","download_json":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7.json","view_paper":"https://pith.science/paper/IKECK537","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03043&json=true","fetch_graph":"https://pith.science/api/pith-number/IKECK537CSZENJ6G6UGUR2YIB7/graph.json","fetch_events":"https://pith.science/api/pith-number/IKECK537CSZENJ6G6UGUR2YIB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7/action/storage_attestation","attest_author":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7/action/author_attestation","sign_citation":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7/action/citation_signature","submit_replication":"https://pith.science/pith/IKECK537CSZENJ6G6UGUR2YIB7/action/replication_record"}},"created_at":"2026-05-18T01:27:17.132274+00:00","updated_at":"2026-05-18T01:27:17.132274+00:00"}