{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KSOPSFMGPBAUY2WUG4PPW2IGJA","short_pith_number":"pith:KSOPSFMG","schema_version":"1.0","canonical_sha256":"549cf9158678414c6ad4371efb69064807cc647d9d4f5d6847cde4f3d01cd5cc","source":{"kind":"arxiv","id":"1509.05348","version":1},"attestation_state":"computed","paper":{"title":"Quasi-perfect codes in the $\\ell_p$ metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio Campello, Grasiele C. Jorge, Jo\\~ao E. Strapasson, Sueli I. R. Costa","submitted_at":"2015-09-17T17:57:05Z","abstract_excerpt":"We consider quasi-perfect codes in $\\mathbb{Z}^n$ over the $\\ell_p$ metric, $2 \\leq p < \\infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover, we study codes with a certain \\textit{degree of imperfection}, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are presented."},"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":"1509.05348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T17:57:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe924818bb5091800c6ba62434011eb63669c46452480c93b46117d9f1ef3e57","abstract_canon_sha256":"0f976d3d1cf6eba1004d82e6d8938e12f1641e97352bc6dbb4bfd2fa6923a2fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:44.124637Z","signature_b64":"8xayl7Tq7FefhFbOzsn6z5O2hJQzLcLbuWYkHtogQ7NtTVnOz0AEpVfioY/NPI9YzOxnO2NL0jj7l7pBArCQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"549cf9158678414c6ad4371efb69064807cc647d9d4f5d6847cde4f3d01cd5cc","last_reissued_at":"2026-05-18T01:32:44.123892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:44.123892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-perfect codes in the $\\ell_p$ metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio Campello, Grasiele C. Jorge, Jo\\~ao E. Strapasson, Sueli I. R. Costa","submitted_at":"2015-09-17T17:57:05Z","abstract_excerpt":"We consider quasi-perfect codes in $\\mathbb{Z}^n$ over the $\\ell_p$ metric, $2 \\leq p < \\infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover, we study codes with a certain \\textit{degree of imperfection}, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05348","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05348","created_at":"2026-05-18T01:32:44.124001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05348v1","created_at":"2026-05-18T01:32:44.124001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05348","created_at":"2026-05-18T01:32:44.124001+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSOPSFMGPBAU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSOPSFMGPBAUY2WU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSOPSFMG","created_at":"2026-05-18T12:29:29.992203+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/KSOPSFMGPBAUY2WUG4PPW2IGJA","json":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA.json","graph_json":"https://pith.science/api/pith-number/KSOPSFMGPBAUY2WUG4PPW2IGJA/graph.json","events_json":"https://pith.science/api/pith-number/KSOPSFMGPBAUY2WUG4PPW2IGJA/events.json","paper":"https://pith.science/paper/KSOPSFMG"},"agent_actions":{"view_html":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA","download_json":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA.json","view_paper":"https://pith.science/paper/KSOPSFMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05348&json=true","fetch_graph":"https://pith.science/api/pith-number/KSOPSFMGPBAUY2WUG4PPW2IGJA/graph.json","fetch_events":"https://pith.science/api/pith-number/KSOPSFMGPBAUY2WUG4PPW2IGJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA/action/storage_attestation","attest_author":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA/action/author_attestation","sign_citation":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA/action/citation_signature","submit_replication":"https://pith.science/pith/KSOPSFMGPBAUY2WUG4PPW2IGJA/action/replication_record"}},"created_at":"2026-05-18T01:32:44.124001+00:00","updated_at":"2026-05-18T01:32:44.124001+00:00"}