{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PKI6WV2RCEVAOWU2YS5CYKVD5M","short_pith_number":"pith:PKI6WV2R","schema_version":"1.0","canonical_sha256":"7a91eb5751112a075a9ac4ba2c2aa3eb21d93a60cc8208e1b71008b9542f035c","source":{"kind":"arxiv","id":"1608.06748","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Tang, Sihem Mesnager, Yanfeng Qi","submitted_at":"2016-08-24T08:32:23Z","abstract_excerpt":"Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the best alternative to the perfect codes. In this paper we firstly highlight the relationships between subset sums, Cayley graphs, and Lee linear codes and present some results. Next, we present a new constructive method for constructing quasi-perfect Lee codes. Our approach uses subsets derived from some quadratic curves over finite fields (in odd characteristic)"},"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":"1608.06748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-24T08:32:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e52bb7b9538fbce72c2e1e2ca0eaad1051a7e6a9e1cc5a2ed0be63061a290ca","abstract_canon_sha256":"64d4c0e4a613620310b2f20d7045052df0d47ce9a618aa38f14de4a74d10b990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:57.614460Z","signature_b64":"+k2155+MxDjZ5bxkxVk5R8ZeHJ3qcVP3kKYYReRGees8J1OflJRQSLiPIw5mn2B0LLtQGiFjK+KM0/We6vXfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a91eb5751112a075a9ac4ba2c2aa3eb21d93a60cc8208e1b71008b9542f035c","last_reissued_at":"2026-05-18T01:07:57.614054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:57.614054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Tang, Sihem Mesnager, Yanfeng Qi","submitted_at":"2016-08-24T08:32:23Z","abstract_excerpt":"Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the best alternative to the perfect codes. In this paper we firstly highlight the relationships between subset sums, Cayley graphs, and Lee linear codes and present some results. Next, we present a new constructive method for constructing quasi-perfect Lee codes. Our approach uses subsets derived from some quadratic curves over finite fields (in odd characteristic)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06748","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":"1608.06748","created_at":"2026-05-18T01:07:57.614112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06748v1","created_at":"2026-05-18T01:07:57.614112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06748","created_at":"2026-05-18T01:07:57.614112+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKI6WV2RCEVA","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKI6WV2RCEVAOWU2","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKI6WV2R","created_at":"2026-05-18T12:30:39.010887+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/PKI6WV2RCEVAOWU2YS5CYKVD5M","json":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M.json","graph_json":"https://pith.science/api/pith-number/PKI6WV2RCEVAOWU2YS5CYKVD5M/graph.json","events_json":"https://pith.science/api/pith-number/PKI6WV2RCEVAOWU2YS5CYKVD5M/events.json","paper":"https://pith.science/paper/PKI6WV2R"},"agent_actions":{"view_html":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M","download_json":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M.json","view_paper":"https://pith.science/paper/PKI6WV2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06748&json=true","fetch_graph":"https://pith.science/api/pith-number/PKI6WV2RCEVAOWU2YS5CYKVD5M/graph.json","fetch_events":"https://pith.science/api/pith-number/PKI6WV2RCEVAOWU2YS5CYKVD5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M/action/storage_attestation","attest_author":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M/action/author_attestation","sign_citation":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M/action/citation_signature","submit_replication":"https://pith.science/pith/PKI6WV2RCEVAOWU2YS5CYKVD5M/action/replication_record"}},"created_at":"2026-05-18T01:07:57.614112+00:00","updated_at":"2026-05-18T01:07:57.614112+00:00"}