{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WATKF56ZO64KEBTKVZ5X6K63CU","short_pith_number":"pith:WATKF56Z","schema_version":"1.0","canonical_sha256":"b026a2f7d977b8a2066aae7b7f2bdb1518d4aa1ad4f0e72eb68893468763e50e","source":{"kind":"arxiv","id":"1410.2702","version":1},"attestation_state":"computed","paper":{"title":"Generalized Hamming Weights of Irreducible Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongdai Lin, Jin Li, Keqin Feng, Minghui Yang","submitted_at":"2014-10-10T08:04:23Z","abstract_excerpt":"The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on $d_r(C)$ for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy $\\{d_1(C), d_2(C), \\ldots, d_k(C)\\}$ $(k=\\dim C)$ are completely determined for several cases."},"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":"1410.2702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T08:04:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d9eeb875243a57911e357c47bf0b61096da23a97cc7187fa862fb18d9ad16002","abstract_canon_sha256":"0abfcfb6a88c9300790b0cc39088146455a8fe69358b86d39c7ba65a3afff92d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:37.470156Z","signature_b64":"Ayje/XUldHTBv8g0YrbwrebXj0Unyf+G3tBfervcF5Wdp0EnTqvwm/zYVMgDVT8p1TcOUZ8H7jHjr2Jr/DQMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b026a2f7d977b8a2066aae7b7f2bdb1518d4aa1ad4f0e72eb68893468763e50e","last_reissued_at":"2026-05-18T02:40:37.469450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:37.469450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Hamming Weights of Irreducible Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongdai Lin, Jin Li, Keqin Feng, Minghui Yang","submitted_at":"2014-10-10T08:04:23Z","abstract_excerpt":"The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on $d_r(C)$ for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy $\\{d_1(C), d_2(C), \\ldots, d_k(C)\\}$ $(k=\\dim C)$ are completely determined for several cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2702","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":"1410.2702","created_at":"2026-05-18T02:40:37.469579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2702v1","created_at":"2026-05-18T02:40:37.469579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2702","created_at":"2026-05-18T02:40:37.469579+00:00"},{"alias_kind":"pith_short_12","alias_value":"WATKF56ZO64K","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WATKF56ZO64KEBTK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WATKF56Z","created_at":"2026-05-18T12:28:54.890064+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/WATKF56ZO64KEBTKVZ5X6K63CU","json":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU.json","graph_json":"https://pith.science/api/pith-number/WATKF56ZO64KEBTKVZ5X6K63CU/graph.json","events_json":"https://pith.science/api/pith-number/WATKF56ZO64KEBTKVZ5X6K63CU/events.json","paper":"https://pith.science/paper/WATKF56Z"},"agent_actions":{"view_html":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU","download_json":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU.json","view_paper":"https://pith.science/paper/WATKF56Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2702&json=true","fetch_graph":"https://pith.science/api/pith-number/WATKF56ZO64KEBTKVZ5X6K63CU/graph.json","fetch_events":"https://pith.science/api/pith-number/WATKF56ZO64KEBTKVZ5X6K63CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU/action/storage_attestation","attest_author":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU/action/author_attestation","sign_citation":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU/action/citation_signature","submit_replication":"https://pith.science/pith/WATKF56ZO64KEBTKVZ5X6K63CU/action/replication_record"}},"created_at":"2026-05-18T02:40:37.469579+00:00","updated_at":"2026-05-18T02:40:37.469579+00:00"}