{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OCLDAZRY6YVMTMQDIUD5NEKODX","short_pith_number":"pith:OCLDAZRY","canonical_record":{"source":{"id":"1805.07806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T17:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"fb4cd30f3fd44fa1c51f8802c503bc95a4f4d84035a84fad84c1bd4725265368","abstract_canon_sha256":"726aae31ea13a8cb9139d06ab14dab8f09c2d5983a6d824b8507a07a19955b5f"},"schema_version":"1.0"},"canonical_sha256":"7096306638f62ac9b2034507d6914e1dd5f3663f024ea468fbe8202787f4fa66","source":{"kind":"arxiv","id":"1805.07806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07806","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07806v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07806","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"OCLDAZRY6YVM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OCLDAZRY6YVMTMQD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OCLDAZRY","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OCLDAZRY6YVMTMQDIUD5NEKODX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T17:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"fb4cd30f3fd44fa1c51f8802c503bc95a4f4d84035a84fad84c1bd4725265368","abstract_canon_sha256":"726aae31ea13a8cb9139d06ab14dab8f09c2d5983a6d824b8507a07a19955b5f"},"schema_version":"1.0"},"canonical_sha256":"7096306638f62ac9b2034507d6914e1dd5f3663f024ea468fbe8202787f4fa66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.491049Z","signature_b64":"RNcUsd97qzzKOby05OgJEJu96MjpP+Ikl48lRUFUBPPSeAJcmLBQ2Lv+tnt1se/VRrmweLnZdovSmkHpmNtBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7096306638f62ac9b2034507d6914e1dd5f3663f024ea468fbe8202787f4fa66","last_reissued_at":"2026-05-18T00:15:32.490494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.490494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07806","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-18T00:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RVLIl/7xEFOXneUySWqrQesLnWZv4Sf0t7/aGW6yJwXujFqitWpY7VRYaxQfbpdV0iYeX9jjIsfO9uiNrbsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:38:09.879989Z"},"content_sha256":"1a9088bb0d16831e1107ee2666425ee7da56b38c1dd0a52c8d3197bd147632dd","schema_version":"1.0","event_id":"sha256:1a9088bb0d16831e1107ee2666425ee7da56b38c1dd0a52c8d3197bd147632dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OCLDAZRY6YVMTMQDIUD5NEKODX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the structure of cube tiling codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej P. Kisielewicz","submitted_at":"2018-05-20T17:53:30Z","abstract_excerpt":"Let $S$ be a set of arbitrary objects, and let $S^d=\\{v_1...v_d\\colon v_i\\in S\\}$. A polybox code is a set $V\\subset S^d$ with the property that for every two words $v,w\\in V$ there is $i\\in [d]$ with $v_i'=w_i$, where a permutation $s\\mapsto s'$ of $S$ is such that $s''=(s')'=s$ and $s'\\neq s$. If $|V|=2^d$, then $V$ is called a cube tiling code. Cube tiling codes determine $2$-periodic cube tilings of $\\mathbb{R}^d$ or, equivalently, tilings of the flat torus $\\mathbb{T}^d=\\{(x_1,\\ldots ,x_d)({\\rm mod} 2):(x_1,\\ldots ,x_d)\\in \\mathbb{R}^d\\}$ by translates of the unit cube as well as $r$-perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07806","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-18T00:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTLnh08ikSmprhQM7tLp9L9maaDucNwBv81wjcfj9ckzLfIocOKxuYcJG6QjP//vO7i6aCJowmdkCBbQWAiDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:38:09.880340Z"},"content_sha256":"699a65646907002c34474f90fba66377ab28fec3e46ddc8e33ff175b7b78823f","schema_version":"1.0","event_id":"sha256:699a65646907002c34474f90fba66377ab28fec3e46ddc8e33ff175b7b78823f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/bundle.json","state_url":"https://pith.science/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/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-23T09:38:09Z","links":{"resolver":"https://pith.science/pith/OCLDAZRY6YVMTMQDIUD5NEKODX","bundle":"https://pith.science/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/bundle.json","state":"https://pith.science/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCLDAZRY6YVMTMQDIUD5NEKODX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OCLDAZRY6YVMTMQDIUD5NEKODX","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":"726aae31ea13a8cb9139d06ab14dab8f09c2d5983a6d824b8507a07a19955b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T17:53:30Z","title_canon_sha256":"fb4cd30f3fd44fa1c51f8802c503bc95a4f4d84035a84fad84c1bd4725265368"},"schema_version":"1.0","source":{"id":"1805.07806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07806","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07806v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07806","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"OCLDAZRY6YVM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OCLDAZRY6YVMTMQD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OCLDAZRY","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:699a65646907002c34474f90fba66377ab28fec3e46ddc8e33ff175b7b78823f","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"Let $S$ be a set of arbitrary objects, and let $S^d=\\{v_1...v_d\\colon v_i\\in S\\}$. A polybox code is a set $V\\subset S^d$ with the property that for every two words $v,w\\in V$ there is $i\\in [d]$ with $v_i'=w_i$, where a permutation $s\\mapsto s'$ of $S$ is such that $s''=(s')'=s$ and $s'\\neq s$. If $|V|=2^d$, then $V$ is called a cube tiling code. Cube tiling codes determine $2$-periodic cube tilings of $\\mathbb{R}^d$ or, equivalently, tilings of the flat torus $\\mathbb{T}^d=\\{(x_1,\\ldots ,x_d)({\\rm mod} 2):(x_1,\\ldots ,x_d)\\in \\mathbb{R}^d\\}$ by translates of the unit cube as well as $r$-perf","authors_text":"Andrzej P. Kisielewicz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T17:53:30Z","title":"On the structure of cube tiling codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07806","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:1a9088bb0d16831e1107ee2666425ee7da56b38c1dd0a52c8d3197bd147632dd","target":"record","created_at":"2026-05-18T00:15:32Z","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":"726aae31ea13a8cb9139d06ab14dab8f09c2d5983a6d824b8507a07a19955b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T17:53:30Z","title_canon_sha256":"fb4cd30f3fd44fa1c51f8802c503bc95a4f4d84035a84fad84c1bd4725265368"},"schema_version":"1.0","source":{"id":"1805.07806","kind":"arxiv","version":1}},"canonical_sha256":"7096306638f62ac9b2034507d6914e1dd5f3663f024ea468fbe8202787f4fa66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7096306638f62ac9b2034507d6914e1dd5f3663f024ea468fbe8202787f4fa66","first_computed_at":"2026-05-18T00:15:32.490494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.490494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNcUsd97qzzKOby05OgJEJu96MjpP+Ikl48lRUFUBPPSeAJcmLBQ2Lv+tnt1se/VRrmweLnZdovSmkHpmNtBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.491049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a9088bb0d16831e1107ee2666425ee7da56b38c1dd0a52c8d3197bd147632dd","sha256:699a65646907002c34474f90fba66377ab28fec3e46ddc8e33ff175b7b78823f"],"state_sha256":"b28bf13863a13055327f699a613fb81f13928c65784311f3766bdd96f4af05ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+E4dIaLTsHocWtcdxXR01JCg4cMDO5uPS3/1bL/UzAEpnz+/uCWPwABT9+vYWUp3//cYeYLZ9ENrxV8398XrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T09:38:09.882218Z","bundle_sha256":"39f65d731f1e74b089ee5a534dd22ec50e96bca691da9456fd13c315829d791b"}}