{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4VVLGWSPLUE7MV3F3LFZ5SSBCB","short_pith_number":"pith:4VVLGWSP","schema_version":"1.0","canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","source":{"kind":"arxiv","id":"1405.6928","version":2},"attestation_state":"computed","paper":{"title":"Quasi-periodic tiling with multiplicity: a lattice enumeration approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Swee Hong Chan","submitted_at":"2014-05-27T14:28:59Z","abstract_excerpt":"The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\\mathbb R^d$ with translates of $P$ using a discrete multiset $\\Lambda$ of translation vectors, such that every point in $\\mathbb R^d$ is covered exactly $k$ times, except possibly for the boundary of $P$ and its translates. A classical result in the study of tiling problems is a theorem of McMullen that a convex polytope $P$ that 1-tiles $\\mathbb R^d$ with a discrete multiset  $\\Lambda$ can, in fact, 1-tile $\\mathbb R^d$ with a lattice $\\mathcal L$. A generalization of McMullen's theorem for $k$-tiling was conjecture"},"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":"1405.6928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-27T14:28:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c38c41d63bbd539f1bbcf578820a663c3b47e1bd0df9b423bbcecb1e4e18d40a","abstract_canon_sha256":"ad2b978a33363f8c614e79ca20cfb9c54d7e22adefc914ae744f6cdc9cba0809"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:10.654529Z","signature_b64":"QrPHpSr5aN/7qt4GXvOiUG2mw1dsVzWG+54bzjbkl7A3NcsKPMeRTuX+E2hDnCVf5WQU0Mp9Fa1R52ANVR/0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","last_reissued_at":"2026-05-18T01:22:10.653873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:10.653873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-periodic tiling with multiplicity: a lattice enumeration approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Swee Hong Chan","submitted_at":"2014-05-27T14:28:59Z","abstract_excerpt":"The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\\mathbb R^d$ with translates of $P$ using a discrete multiset $\\Lambda$ of translation vectors, such that every point in $\\mathbb R^d$ is covered exactly $k$ times, except possibly for the boundary of $P$ and its translates. A classical result in the study of tiling problems is a theorem of McMullen that a convex polytope $P$ that 1-tiles $\\mathbb R^d$ with a discrete multiset  $\\Lambda$ can, in fact, 1-tile $\\mathbb R^d$ with a lattice $\\mathcal L$. A generalization of McMullen's theorem for $k$-tiling was conjecture"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6928","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":"1405.6928","created_at":"2026-05-18T01:22:10.653964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6928v2","created_at":"2026-05-18T01:22:10.653964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6928","created_at":"2026-05-18T01:22:10.653964+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VVLGWSPLUE7","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VVLGWSPLUE7MV3F","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VVLGWSP","created_at":"2026-05-18T12:28:14.216126+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/4VVLGWSPLUE7MV3F3LFZ5SSBCB","json":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB.json","graph_json":"https://pith.science/api/pith-number/4VVLGWSPLUE7MV3F3LFZ5SSBCB/graph.json","events_json":"https://pith.science/api/pith-number/4VVLGWSPLUE7MV3F3LFZ5SSBCB/events.json","paper":"https://pith.science/paper/4VVLGWSP"},"agent_actions":{"view_html":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB","download_json":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB.json","view_paper":"https://pith.science/paper/4VVLGWSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6928&json=true","fetch_graph":"https://pith.science/api/pith-number/4VVLGWSPLUE7MV3F3LFZ5SSBCB/graph.json","fetch_events":"https://pith.science/api/pith-number/4VVLGWSPLUE7MV3F3LFZ5SSBCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/action/storage_attestation","attest_author":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/action/author_attestation","sign_citation":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/action/citation_signature","submit_replication":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/action/replication_record"}},"created_at":"2026-05-18T01:22:10.653964+00:00","updated_at":"2026-05-18T01:22:10.653964+00:00"}