{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TXRG3BLCD2QJLFU32SY36G7JKZ","short_pith_number":"pith:TXRG3BLC","schema_version":"1.0","canonical_sha256":"9de26d85621ea095969bd4b1bf1be9567e3b07b0dea2bbf506fef735cd76dfda","source":{"kind":"arxiv","id":"1903.05951","version":2},"attestation_state":"computed","paper":{"title":"Metrics which turn tilings into binary perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gabriella Akemi Miyamoto, Marcelo Firer","submitted_at":"2019-03-14T12:50:48Z","abstract_excerpt":"In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors (TS-metrics). We determine which of the tilings with small tiles or high rank can be a perfect code for some TS-metric and we characterize all such metrics. Finally, we show some procedures to obtain new perfect codes (relatively to TS-metrics) out of existing ones."},"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":"1903.05951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T12:50:48Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"7a0044fffdc6537f53bd67dd2b3a41dc3a0f68ae37894d35412ab8237044c1e3","abstract_canon_sha256":"61483d996ae1bc863a981e080b64f4b170ed6ee261d62351b95cb4be6470412e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.661560Z","signature_b64":"iL4pH474Q+o7Vktlpsibk4x3uHr1IqW16Zh2sUwXwlWAtLUYxHv4T/gU9h+G/miGF+UGwEhE0kqRpo9/ZPGjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de26d85621ea095969bd4b1bf1be9567e3b07b0dea2bbf506fef735cd76dfda","last_reissued_at":"2026-05-17T23:46:45.661129Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.661129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metrics which turn tilings into binary perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gabriella Akemi Miyamoto, Marcelo Firer","submitted_at":"2019-03-14T12:50:48Z","abstract_excerpt":"In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors (TS-metrics). We determine which of the tilings with small tiles or high rank can be a perfect code for some TS-metric and we characterize all such metrics. Finally, we show some procedures to obtain new perfect codes (relatively to TS-metrics) out of existing ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05951","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":"1903.05951","created_at":"2026-05-17T23:46:45.661192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05951v2","created_at":"2026-05-17T23:46:45.661192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05951","created_at":"2026-05-17T23:46:45.661192+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXRG3BLCD2QJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXRG3BLCD2QJLFU3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXRG3BLC","created_at":"2026-05-18T12:33:30.264802+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/TXRG3BLCD2QJLFU32SY36G7JKZ","json":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ.json","graph_json":"https://pith.science/api/pith-number/TXRG3BLCD2QJLFU32SY36G7JKZ/graph.json","events_json":"https://pith.science/api/pith-number/TXRG3BLCD2QJLFU32SY36G7JKZ/events.json","paper":"https://pith.science/paper/TXRG3BLC"},"agent_actions":{"view_html":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ","download_json":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ.json","view_paper":"https://pith.science/paper/TXRG3BLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05951&json=true","fetch_graph":"https://pith.science/api/pith-number/TXRG3BLCD2QJLFU32SY36G7JKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TXRG3BLCD2QJLFU32SY36G7JKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ/action/storage_attestation","attest_author":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ/action/author_attestation","sign_citation":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ/action/citation_signature","submit_replication":"https://pith.science/pith/TXRG3BLCD2QJLFU32SY36G7JKZ/action/replication_record"}},"created_at":"2026-05-17T23:46:45.661192+00:00","updated_at":"2026-05-17T23:46:45.661192+00:00"}