{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A4BXZYTYODWFLPSS3A62VDRLRI","short_pith_number":"pith:A4BXZYTY","schema_version":"1.0","canonical_sha256":"07037ce27870ec55be52d83daa8e2b8a01cae6c2eebf6946e625687d90916893","source":{"kind":"arxiv","id":"1612.05523","version":1},"attestation_state":"computed","paper":{"title":"Two-weight codes from trace codes over $R_k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Yue Guan","submitted_at":"2016-12-16T16:00:25Z","abstract_excerpt":"We construct a family of two-Lee-weight codes over the ring $R_k,$ which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain optimal abelian binary two-weight codes by using the Griesmer bound. An application to secret sharing schemes is also given."},"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":"1612.05523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-16T16:00:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"370edda8244a2bcc9d38cf165fd9a938c7f431e74bd976fde98db13dcf0be2e3","abstract_canon_sha256":"e605ecb82500a1b0c6e4db3364ee2d74a496a249066f1eb8a832fbfc2c17afb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:51.613159Z","signature_b64":"lRA3uJITno9EN8fY+ta+35/0hetGWuGltvXtPcQUlIBsqtEogxUp18r9JM2enMY5rqlMh9+bxInBx5DbN4gaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07037ce27870ec55be52d83daa8e2b8a01cae6c2eebf6946e625687d90916893","last_reissued_at":"2026-05-18T00:54:51.612640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:51.612640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-weight codes from trace codes over $R_k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Yue Guan","submitted_at":"2016-12-16T16:00:25Z","abstract_excerpt":"We construct a family of two-Lee-weight codes over the ring $R_k,$ which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain optimal abelian binary two-weight codes by using the Griesmer bound. An application to secret sharing schemes is also given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05523","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":"1612.05523","created_at":"2026-05-18T00:54:51.612718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05523v1","created_at":"2026-05-18T00:54:51.612718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05523","created_at":"2026-05-18T00:54:51.612718+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4BXZYTYODWF","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4BXZYTYODWFLPSS","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4BXZYTY","created_at":"2026-05-18T12:30:04.600751+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/A4BXZYTYODWFLPSS3A62VDRLRI","json":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI.json","graph_json":"https://pith.science/api/pith-number/A4BXZYTYODWFLPSS3A62VDRLRI/graph.json","events_json":"https://pith.science/api/pith-number/A4BXZYTYODWFLPSS3A62VDRLRI/events.json","paper":"https://pith.science/paper/A4BXZYTY"},"agent_actions":{"view_html":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI","download_json":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI.json","view_paper":"https://pith.science/paper/A4BXZYTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05523&json=true","fetch_graph":"https://pith.science/api/pith-number/A4BXZYTYODWFLPSS3A62VDRLRI/graph.json","fetch_events":"https://pith.science/api/pith-number/A4BXZYTYODWFLPSS3A62VDRLRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI/action/storage_attestation","attest_author":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI/action/author_attestation","sign_citation":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI/action/citation_signature","submit_replication":"https://pith.science/pith/A4BXZYTYODWFLPSS3A62VDRLRI/action/replication_record"}},"created_at":"2026-05-18T00:54:51.612718+00:00","updated_at":"2026-05-18T00:54:51.612718+00:00"}