{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SWHINNMS6FQ36IMYCB2T3QX2PJ","short_pith_number":"pith:SWHINNMS","schema_version":"1.0","canonical_sha256":"958e86b592f161bf219810753dc2fa7a4e51724507d47c445fd1f3909bed6a24","source":{"kind":"arxiv","id":"1602.00914","version":1},"attestation_state":"computed","paper":{"title":"Binary linear codes with at most 4 weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fei Li, Qiuyan Wang, Tongjiang Yan, Yang Yan","submitted_at":"2016-02-02T13:17:48Z","abstract_excerpt":"For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes."},"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":"1602.00914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T13:17:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4b9a3ced0ab4bcd2cf7d7009aa89f0664e6404ca3141cdb1350585869cf2169","abstract_canon_sha256":"9ca75ed4031832036b06751a2d5392b2900add234d61f64f24827b087e918fb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:24.312398Z","signature_b64":"HSOUSVq1O5DCYUoyCAqsOc6ZL/x2raHKFL2ataHB8Tl+cKLQdlGAHEi//xBHFwJB7t8iFLJV2bjd5TmwJ/a5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958e86b592f161bf219810753dc2fa7a4e51724507d47c445fd1f3909bed6a24","last_reissued_at":"2026-05-18T01:21:24.311834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:24.311834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary linear codes with at most 4 weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fei Li, Qiuyan Wang, Tongjiang Yan, Yang Yan","submitted_at":"2016-02-02T13:17:48Z","abstract_excerpt":"For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00914","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":"1602.00914","created_at":"2026-05-18T01:21:24.311925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00914v1","created_at":"2026-05-18T01:21:24.311925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00914","created_at":"2026-05-18T01:21:24.311925+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWHINNMS6FQ3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWHINNMS6FQ36IMY","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWHINNMS","created_at":"2026-05-18T12:30:44.179134+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/SWHINNMS6FQ36IMYCB2T3QX2PJ","json":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ.json","graph_json":"https://pith.science/api/pith-number/SWHINNMS6FQ36IMYCB2T3QX2PJ/graph.json","events_json":"https://pith.science/api/pith-number/SWHINNMS6FQ36IMYCB2T3QX2PJ/events.json","paper":"https://pith.science/paper/SWHINNMS"},"agent_actions":{"view_html":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ","download_json":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ.json","view_paper":"https://pith.science/paper/SWHINNMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00914&json=true","fetch_graph":"https://pith.science/api/pith-number/SWHINNMS6FQ36IMYCB2T3QX2PJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SWHINNMS6FQ36IMYCB2T3QX2PJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ/action/storage_attestation","attest_author":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ/action/author_attestation","sign_citation":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ/action/citation_signature","submit_replication":"https://pith.science/pith/SWHINNMS6FQ36IMYCB2T3QX2PJ/action/replication_record"}},"created_at":"2026-05-18T01:21:24.311925+00:00","updated_at":"2026-05-18T01:21:24.311925+00:00"}