{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QKTBHRBBL63FUEXAFS7ZNBQEEN","short_pith_number":"pith:QKTBHRBB","schema_version":"1.0","canonical_sha256":"82a613c4215fb65a12e02cbf96860423571235a8d16c9c22643e107a4ba69d7c","source":{"kind":"arxiv","id":"1607.06138","version":2},"attestation_state":"computed","paper":{"title":"Dappled tiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.DM","authors_text":"Alexandre Derouet-Jourdan, Hiroyuki Ochiai, Shizuo Kaji","submitted_at":"2016-07-20T22:24:10Z","abstract_excerpt":"We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds of tiles. We give an efficient algorithm to turn any tiling into one satisfying the condition, and discuss its applications in texturing."},"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":"1607.06138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T22:24:10Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"41e762aa792017535a76da1993a1c42f15bdbc22763c4034ae81aa99204ac1c3","abstract_canon_sha256":"eadb4d5d930314d9e5794b612e5f44ee2915ea2cd4b705507a167afca7384873"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:15.204134Z","signature_b64":"3oJJ7v9yLql9yw0l+gB5ZWUDydDU52278KjQ56YXo+mQUF19bwbA5Iu75/PoAbyHFnyhYCfLq8ISXLb0nnEGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a613c4215fb65a12e02cbf96860423571235a8d16c9c22643e107a4ba69d7c","last_reissued_at":"2026-05-17T23:58:15.203509Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:15.203509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dappled tiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.DM","authors_text":"Alexandre Derouet-Jourdan, Hiroyuki Ochiai, Shizuo Kaji","submitted_at":"2016-07-20T22:24:10Z","abstract_excerpt":"We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds of tiles. We give an efficient algorithm to turn any tiling into one satisfying the condition, and discuss its applications in texturing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06138","kind":"arxiv","version":2},"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":"1607.06138","created_at":"2026-05-17T23:58:15.203643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06138v2","created_at":"2026-05-17T23:58:15.203643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06138","created_at":"2026-05-17T23:58:15.203643+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKTBHRBBL63F","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKTBHRBBL63FUEXA","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKTBHRBB","created_at":"2026-05-18T12:30:39.010887+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/QKTBHRBBL63FUEXAFS7ZNBQEEN","json":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN.json","graph_json":"https://pith.science/api/pith-number/QKTBHRBBL63FUEXAFS7ZNBQEEN/graph.json","events_json":"https://pith.science/api/pith-number/QKTBHRBBL63FUEXAFS7ZNBQEEN/events.json","paper":"https://pith.science/paper/QKTBHRBB"},"agent_actions":{"view_html":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN","download_json":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN.json","view_paper":"https://pith.science/paper/QKTBHRBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06138&json=true","fetch_graph":"https://pith.science/api/pith-number/QKTBHRBBL63FUEXAFS7ZNBQEEN/graph.json","fetch_events":"https://pith.science/api/pith-number/QKTBHRBBL63FUEXAFS7ZNBQEEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN/action/storage_attestation","attest_author":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN/action/author_attestation","sign_citation":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN/action/citation_signature","submit_replication":"https://pith.science/pith/QKTBHRBBL63FUEXAFS7ZNBQEEN/action/replication_record"}},"created_at":"2026-05-17T23:58:15.203643+00:00","updated_at":"2026-05-17T23:58:15.203643+00:00"}