{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T7VWLSETY7XZZMP5VAZZATRSOK","short_pith_number":"pith:T7VWLSET","schema_version":"1.0","canonical_sha256":"9feb65c893c7ef9cb1fda833904e327290f9b3678e8cfe49357d14395b639912","source":{"kind":"arxiv","id":"1910.04334","version":1},"attestation_state":"computed","paper":{"title":"Optimal few-weight codes from simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qin Yue, Xiaomeng Zhu, Yansheng Wu","submitted_at":"2019-10-10T02:31:09Z","abstract_excerpt":"Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\\Bbb F_2+u\\Bbb F_2$ by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over $\\Bbb F_2+u\\Bbb F_2$. Our results show that the codes have few Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of"},"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":"1910.04334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-10T02:31:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ca6e4d4e9c5ad85aadbba6d50070363bff27bf89c881b320a6d1ae38dcd9211","abstract_canon_sha256":"58f7add5163d3d52435afdc48126a626432e7dd929dff93b9008149b15f33f7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:07.017078Z","signature_b64":"O4cdukcGKQaGf+C2GzG+rfOt2U9rRfNWQsYDAqTSoptTrkjGyTpo/sleUc0EyLST/f1LFrBiQ3utZkpyMfDNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9feb65c893c7ef9cb1fda833904e327290f9b3678e8cfe49357d14395b639912","last_reissued_at":"2026-07-05T00:11:07.016712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:07.016712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal few-weight codes from simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qin Yue, Xiaomeng Zhu, Yansheng Wu","submitted_at":"2019-10-10T02:31:09Z","abstract_excerpt":"Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\\Bbb F_2+u\\Bbb F_2$ by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over $\\Bbb F_2+u\\Bbb F_2$. Our results show that the codes have few Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04334","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.04334/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.04334","created_at":"2026-07-05T00:11:07.016764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04334v1","created_at":"2026-07-05T00:11:07.016764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04334","created_at":"2026-07-05T00:11:07.016764+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7VWLSETY7XZ","created_at":"2026-07-05T00:11:07.016764+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7VWLSETY7XZZMP5","created_at":"2026-07-05T00:11:07.016764+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7VWLSET","created_at":"2026-07-05T00:11:07.016764+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/T7VWLSETY7XZZMP5VAZZATRSOK","json":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK.json","graph_json":"https://pith.science/api/pith-number/T7VWLSETY7XZZMP5VAZZATRSOK/graph.json","events_json":"https://pith.science/api/pith-number/T7VWLSETY7XZZMP5VAZZATRSOK/events.json","paper":"https://pith.science/paper/T7VWLSET"},"agent_actions":{"view_html":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK","download_json":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK.json","view_paper":"https://pith.science/paper/T7VWLSET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04334&json=true","fetch_graph":"https://pith.science/api/pith-number/T7VWLSETY7XZZMP5VAZZATRSOK/graph.json","fetch_events":"https://pith.science/api/pith-number/T7VWLSETY7XZZMP5VAZZATRSOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK/action/storage_attestation","attest_author":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK/action/author_attestation","sign_citation":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK/action/citation_signature","submit_replication":"https://pith.science/pith/T7VWLSETY7XZZMP5VAZZATRSOK/action/replication_record"}},"created_at":"2026-07-05T00:11:07.016764+00:00","updated_at":"2026-07-05T00:11:07.016764+00:00"}