{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2O5WGV7RVMYBRQDD74BB32QGEM","short_pith_number":"pith:2O5WGV7R","schema_version":"1.0","canonical_sha256":"d3bb6357f1ab3018c063ff021dea062336386250abca88fc97a78461b3aef8b1","source":{"kind":"arxiv","id":"1512.07341","version":1},"attestation_state":"computed","paper":{"title":"Complete weight enumerators of two classes of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongdai Lin, Fei Li, Kelan Ding, Qiuyan Wang","submitted_at":"2015-12-23T02:56:15Z","abstract_excerpt":"Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications 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":"1512.07341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-23T02:56:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa28307195fc5f5edace80057bf28d73f160a9bcf4c8064c7a4d862ee440752c","abstract_canon_sha256":"ffc70539198a90b308de3f114498e7201e564753fe79370b6077bc1af89831a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.969242Z","signature_b64":"pAiFimPXbmM3sX8xOYLaXOLg6ch1iAux7TfAiLRS1kh2ULonavZAwxEblBEBCPPqbPJyeOIO7KQAUmt7BkPQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3bb6357f1ab3018c063ff021dea062336386250abca88fc97a78461b3aef8b1","last_reissued_at":"2026-05-18T01:23:49.968567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.968567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete weight enumerators of two classes of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongdai Lin, Fei Li, Kelan Ding, Qiuyan Wang","submitted_at":"2015-12-23T02:56:15Z","abstract_excerpt":"Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07341","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":"1512.07341","created_at":"2026-05-18T01:23:49.968656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07341v1","created_at":"2026-05-18T01:23:49.968656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07341","created_at":"2026-05-18T01:23:49.968656+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O5WGV7RVMYB","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O5WGV7RVMYBRQDD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O5WGV7R","created_at":"2026-05-18T12:29:02.477457+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/2O5WGV7RVMYBRQDD74BB32QGEM","json":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM.json","graph_json":"https://pith.science/api/pith-number/2O5WGV7RVMYBRQDD74BB32QGEM/graph.json","events_json":"https://pith.science/api/pith-number/2O5WGV7RVMYBRQDD74BB32QGEM/events.json","paper":"https://pith.science/paper/2O5WGV7R"},"agent_actions":{"view_html":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM","download_json":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM.json","view_paper":"https://pith.science/paper/2O5WGV7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07341&json=true","fetch_graph":"https://pith.science/api/pith-number/2O5WGV7RVMYBRQDD74BB32QGEM/graph.json","fetch_events":"https://pith.science/api/pith-number/2O5WGV7RVMYBRQDD74BB32QGEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM/action/storage_attestation","attest_author":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM/action/author_attestation","sign_citation":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM/action/citation_signature","submit_replication":"https://pith.science/pith/2O5WGV7RVMYBRQDD74BB32QGEM/action/replication_record"}},"created_at":"2026-05-18T01:23:49.968656+00:00","updated_at":"2026-05-18T01:23:49.968656+00:00"}