{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J5F6S4MDREDCIUJTMCYLFKTORO","short_pith_number":"pith:J5F6S4MD","schema_version":"1.0","canonical_sha256":"4f4be97183890624513360b0b2aa6e8ba6886215f82b45b73ce7d281cbd7bbc9","source":{"kind":"arxiv","id":"1506.02517","version":2},"attestation_state":"computed","paper":{"title":"Perfect codes in the lp metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"and Jo\\~ao Strapasson, Antonio Campello, Grasiele C. Jorge, Sueli I. R. Costa","submitted_at":"2015-06-08T14:25:17Z","abstract_excerpt":"We investigate perfect codes in $\\mathbb{Z}^n$ under the $\\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine all radii for which there are linear perfect codes. The non-existence results for codes in $\\mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $\\mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes."},"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":"1506.02517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T14:25:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"29531783050a34b65da5f608be45e6b39c6632c2d0d713ca7ab413a6eb2c7956","abstract_canon_sha256":"c803accafcf72a169e4ac97a45c537c6735d5099ea6634998556f1e1a1f17bb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:23.528265Z","signature_b64":"pkZ4XZfBeDmNCsI0G3qJSo43W0I0DYxlkW0kNaRWRQtrsy9xUM+2LyNWNFNeahQlN5xkmel2uN6s3gHwvzC1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4be97183890624513360b0b2aa6e8ba6886215f82b45b73ce7d281cbd7bbc9","last_reissued_at":"2026-05-18T01:27:23.527857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:23.527857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect codes in the lp metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"and Jo\\~ao Strapasson, Antonio Campello, Grasiele C. Jorge, Sueli I. R. Costa","submitted_at":"2015-06-08T14:25:17Z","abstract_excerpt":"We investigate perfect codes in $\\mathbb{Z}^n$ under the $\\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine all radii for which there are linear perfect codes. The non-existence results for codes in $\\mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $\\mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02517","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":"1506.02517","created_at":"2026-05-18T01:27:23.527915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02517v2","created_at":"2026-05-18T01:27:23.527915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02517","created_at":"2026-05-18T01:27:23.527915+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5F6S4MDREDC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5F6S4MDREDCIUJT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5F6S4MD","created_at":"2026-05-18T12:29:27.538025+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/J5F6S4MDREDCIUJTMCYLFKTORO","json":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO.json","graph_json":"https://pith.science/api/pith-number/J5F6S4MDREDCIUJTMCYLFKTORO/graph.json","events_json":"https://pith.science/api/pith-number/J5F6S4MDREDCIUJTMCYLFKTORO/events.json","paper":"https://pith.science/paper/J5F6S4MD"},"agent_actions":{"view_html":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO","download_json":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO.json","view_paper":"https://pith.science/paper/J5F6S4MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02517&json=true","fetch_graph":"https://pith.science/api/pith-number/J5F6S4MDREDCIUJTMCYLFKTORO/graph.json","fetch_events":"https://pith.science/api/pith-number/J5F6S4MDREDCIUJTMCYLFKTORO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO/action/storage_attestation","attest_author":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO/action/author_attestation","sign_citation":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO/action/citation_signature","submit_replication":"https://pith.science/pith/J5F6S4MDREDCIUJTMCYLFKTORO/action/replication_record"}},"created_at":"2026-05-18T01:27:23.527915+00:00","updated_at":"2026-05-18T01:27:23.527915+00:00"}