{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4VVLGWSPLUE7MV3F3LFZ5SSBCB","short_pith_number":"pith:4VVLGWSP","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"},"canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","source":{"kind":"arxiv","id":"1405.6928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6928","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6928v2","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6928","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"4VVLGWSPLUE7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4VVLGWSPLUE7MV3F","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4VVLGWSP","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4VVLGWSPLUE7MV3F3LFZ5SSBCB","target":"record","payload":{"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"},"canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","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"},"source_kind":"arxiv","source_id":"1405.6928","source_version":2,"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-18T01:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdWwY9i5880xTRpq08UV1Aneis4nztK2o50XtvYf3AuIthmr50EgxAgNG7x6ZxbtjhlIUpWiLhbv/hNG0HckBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:02:21.119200Z"},"content_sha256":"fe494589835345608fa958d6bbd3eeff7b4a17c5e9ecca11b5796f4ebeb5d581","schema_version":"1.0","event_id":"sha256:fe494589835345608fa958d6bbd3eeff7b4a17c5e9ecca11b5796f4ebeb5d581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4VVLGWSPLUE7MV3F3LFZ5SSBCB","target":"graph","payload":{"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"},"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-18T01:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmNBYO/vsXeoJmfT7vWFOS5uruFMUV7kI82ceIhRBXTnvQpYnsyz9l2f/NUvDhPJuzaw2+xZQGSoCAm2UkqTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:02:21.119568Z"},"content_sha256":"76278b15892fe0446e62aa5ace555afeaa9a63e2a2d194275d8d49ccf770c467","schema_version":"1.0","event_id":"sha256:76278b15892fe0446e62aa5ace555afeaa9a63e2a2d194275d8d49ccf770c467"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/bundle.json","state_url":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/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-05-28T05:02:21Z","links":{"resolver":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB","bundle":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/bundle.json","state":"https://pith.science/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VVLGWSPLUE7MV3F3LFZ5SSBCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4VVLGWSPLUE7MV3F3LFZ5SSBCB","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":"ad2b978a33363f8c614e79ca20cfb9c54d7e22adefc914ae744f6cdc9cba0809","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-27T14:28:59Z","title_canon_sha256":"c38c41d63bbd539f1bbcf578820a663c3b47e1bd0df9b423bbcecb1e4e18d40a"},"schema_version":"1.0","source":{"id":"1405.6928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6928","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6928v2","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6928","created_at":"2026-05-18T01:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"4VVLGWSPLUE7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4VVLGWSPLUE7MV3F","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4VVLGWSP","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:76278b15892fe0446e62aa5ace555afeaa9a63e2a2d194275d8d49ccf770c467","target":"graph","created_at":"2026-05-18T01:22:10Z","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":"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","authors_text":"Swee Hong Chan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-27T14:28:59Z","title":"Quasi-periodic tiling with multiplicity: a lattice enumeration approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6928","kind":"arxiv","version":2},"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:fe494589835345608fa958d6bbd3eeff7b4a17c5e9ecca11b5796f4ebeb5d581","target":"record","created_at":"2026-05-18T01:22:10Z","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":"ad2b978a33363f8c614e79ca20cfb9c54d7e22adefc914ae744f6cdc9cba0809","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-27T14:28:59Z","title_canon_sha256":"c38c41d63bbd539f1bbcf578820a663c3b47e1bd0df9b423bbcecb1e4e18d40a"},"schema_version":"1.0","source":{"id":"1405.6928","kind":"arxiv","version":2}},"canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e56ab35a4f5d09f65765dacb9eca411071b04fd67ccdb70a7c769375e3736f3f","first_computed_at":"2026-05-18T01:22:10.653873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:10.653873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QrPHpSr5aN/7qt4GXvOiUG2mw1dsVzWG+54bzjbkl7A3NcsKPMeRTuX+E2hDnCVf5WQU0Mp9Fa1R52ANVR/0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:10.654529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe494589835345608fa958d6bbd3eeff7b4a17c5e9ecca11b5796f4ebeb5d581","sha256:76278b15892fe0446e62aa5ace555afeaa9a63e2a2d194275d8d49ccf770c467"],"state_sha256":"7fb46ecec3482ce2b5401c8a1f02d6254665ee1765a80a8289014e851bc22733"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5xAUwRl/pSh+iQr2YFoLEdmntGUpvn2Q5SeNZi94qV93MQbhMehexhm+AbcJ/ydK7Kret2qfDRqMUsqoNvnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:02:21.121545Z","bundle_sha256":"8397ec7618056c09f2f0f0adf70a33ef193fae341ae6b86f0828865eb1801325"}}