{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3STFKH4PMWNJI5YYTHHAPQM6UT","short_pith_number":"pith:3STFKH4P","canonical_record":{"source":{"id":"1504.01274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T12:05:37Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d44d53bfaf060bbe77bb1da709ddb9f26d63e7f1b2ef1a5482596eabc86b14d0","abstract_canon_sha256":"d3df8c8353cc9cd5aaf1890df5a8a5d1225d5275db3dabd0cc76c4f463c2bf10"},"schema_version":"1.0"},"canonical_sha256":"dca6551f8f659a94771899ce07c19ea4c8dbbe835ca1a1a0cbe48898d60a876f","source":{"kind":"arxiv","id":"1504.01274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01274","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01274v1","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01274","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"3STFKH4PMWNJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3STFKH4PMWNJI5YY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3STFKH4P","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3STFKH4PMWNJI5YYTHHAPQM6UT","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T12:05:37Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d44d53bfaf060bbe77bb1da709ddb9f26d63e7f1b2ef1a5482596eabc86b14d0","abstract_canon_sha256":"d3df8c8353cc9cd5aaf1890df5a8a5d1225d5275db3dabd0cc76c4f463c2bf10"},"schema_version":"1.0"},"canonical_sha256":"dca6551f8f659a94771899ce07c19ea4c8dbbe835ca1a1a0cbe48898d60a876f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:34.761084Z","signature_b64":"WJEWwzS63nI9BP8czthIEkLe58pm9Epg06M2q6+N8n1I1Rb+PRVPlHLzrjamBLQrdq4BWdOEdr2DLalcA0BKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca6551f8f659a94771899ce07c19ea4c8dbbe835ca1a1a0cbe48898d60a876f","last_reissued_at":"2026-05-18T02:19:34.760473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:34.760473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01274","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"er9ZYFaUUtFAKWir9nwvL8eQ+M3QkaXY+wHkxJCw9uqbiNLGVYfl6YMlxMoulVxkkFXMF1Zzw9TKNkHVsd5iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:11.541549Z"},"content_sha256":"e9fac8368f28b3f96624e5f80084c06c542f2c17ded91a7ac679c0d407725ecb","schema_version":"1.0","event_id":"sha256:e9fac8368f28b3f96624e5f80084c06c542f2c17ded91a7ac679c0d407725ecb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3STFKH4PMWNJI5YYTHHAPQM6UT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Weight Hierarchy of Some Reducible Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Maosheng Xiong, Shuxing Li","submitted_at":"2015-04-06T12:05:37Z","abstract_excerpt":"The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we study the GHWs for a family of reducible cyclic codes and obtain the complete weight hierarchy in several cases. This is achieved by extending the idea of \\cite{YLFL} into higher dimension and by employing some interesting combinatorial arguments. It shall be noted that these cyclic codes may have arbitrary number of nonzeroes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01274","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwNPlhlJIxyCV7QIpRJh6dtZUeLf2o+QA3QzmsHqqW1+QBZq8735UCmu8lXgpKyn9tVzfSbT79QZDdoDMwd/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:11.541949Z"},"content_sha256":"bbe74b2f9cb69061b3f2189089e2dbce462dfe48c8fb7311ce072fbafa606d37","schema_version":"1.0","event_id":"sha256:bbe74b2f9cb69061b3f2189089e2dbce462dfe48c8fb7311ce072fbafa606d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/bundle.json","state_url":"https://pith.science/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T14:46:11Z","links":{"resolver":"https://pith.science/pith/3STFKH4PMWNJI5YYTHHAPQM6UT","bundle":"https://pith.science/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/bundle.json","state":"https://pith.science/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3STFKH4PMWNJI5YYTHHAPQM6UT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3STFKH4PMWNJI5YYTHHAPQM6UT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d3df8c8353cc9cd5aaf1890df5a8a5d1225d5275db3dabd0cc76c4f463c2bf10","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T12:05:37Z","title_canon_sha256":"d44d53bfaf060bbe77bb1da709ddb9f26d63e7f1b2ef1a5482596eabc86b14d0"},"schema_version":"1.0","source":{"id":"1504.01274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01274","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01274v1","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01274","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"3STFKH4PMWNJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3STFKH4PMWNJI5YY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3STFKH4P","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:bbe74b2f9cb69061b3f2189089e2dbce462dfe48c8fb7311ce072fbafa606d37","target":"graph","created_at":"2026-05-18T02:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we study the GHWs for a family of reducible cyclic codes and obtain the complete weight hierarchy in several cases. This is achieved by extending the idea of \\cite{YLFL} into higher dimension and by employing some interesting combinatorial arguments. It shall be noted that these cyclic codes may have arbitrary number of nonzeroes.","authors_text":"Gennian Ge, Maosheng Xiong, Shuxing Li","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T12:05:37Z","title":"The Weight Hierarchy of Some Reducible Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01274","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e9fac8368f28b3f96624e5f80084c06c542f2c17ded91a7ac679c0d407725ecb","target":"record","created_at":"2026-05-18T02:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d3df8c8353cc9cd5aaf1890df5a8a5d1225d5275db3dabd0cc76c4f463c2bf10","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T12:05:37Z","title_canon_sha256":"d44d53bfaf060bbe77bb1da709ddb9f26d63e7f1b2ef1a5482596eabc86b14d0"},"schema_version":"1.0","source":{"id":"1504.01274","kind":"arxiv","version":1}},"canonical_sha256":"dca6551f8f659a94771899ce07c19ea4c8dbbe835ca1a1a0cbe48898d60a876f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dca6551f8f659a94771899ce07c19ea4c8dbbe835ca1a1a0cbe48898d60a876f","first_computed_at":"2026-05-18T02:19:34.760473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:34.760473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJEWwzS63nI9BP8czthIEkLe58pm9Epg06M2q6+N8n1I1Rb+PRVPlHLzrjamBLQrdq4BWdOEdr2DLalcA0BKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:34.761084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9fac8368f28b3f96624e5f80084c06c542f2c17ded91a7ac679c0d407725ecb","sha256:bbe74b2f9cb69061b3f2189089e2dbce462dfe48c8fb7311ce072fbafa606d37"],"state_sha256":"32d0a18ea1531d203098472385bfb62ed291a34fc1264c24a71e187b3aa3d997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsd/wZ+ep+JyVVEE0n8Nq8T47h7lXBZmoa9bUiGwRmskhnmpmPLZtNfe4lHj1nrD9I4IRNsuTzE77g1w8AdeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:46:11.544462Z","bundle_sha256":"137a7dc1e25f73a91ccc887c57bd0001fa6e43939f08ab7a89495401fe5906d5"}}