{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V62KRV2EOH36JASLVYBP5A377P","short_pith_number":"pith:V62KRV2E","canonical_record":{"source":{"id":"2506.07846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-09T15:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"52b6a2841ca06ff11fe74b9d361e895e0c3632bb68dbed381f822ba6a278494d","abstract_canon_sha256":"7129c662ba45b594f22f7cc8b32f218cc381cf0e31a27b4188254f25bb9a257d"},"schema_version":"1.0"},"canonical_sha256":"afb4a8d74471f7e4824bae02fe837ffbca15b4899ca4b5d78fdde235b06622b7","source":{"kind":"arxiv","id":"2506.07846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07846","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07846v1","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07846","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"V62KRV2EOH36","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"V62KRV2EOH36JASL","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"V62KRV2E","created_at":"2026-07-05T11:18:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V62KRV2EOH36JASLVYBP5A377P","target":"record","payload":{"canonical_record":{"source":{"id":"2506.07846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-09T15:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"52b6a2841ca06ff11fe74b9d361e895e0c3632bb68dbed381f822ba6a278494d","abstract_canon_sha256":"7129c662ba45b594f22f7cc8b32f218cc381cf0e31a27b4188254f25bb9a257d"},"schema_version":"1.0"},"canonical_sha256":"afb4a8d74471f7e4824bae02fe837ffbca15b4899ca4b5d78fdde235b06622b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:34.315100Z","signature_b64":"K/3XYZf59EJ/NGEnjdTlrk39E9o1IEtTXzzCL0QwoGF2KMXM1yvf9w2Old/KvX3l60fv9yZ9LfUZq7HmC1WaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afb4a8d74471f7e4824bae02fe837ffbca15b4899ca4b5d78fdde235b06622b7","last_reissued_at":"2026-07-05T11:18:34.314626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:34.314626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.07846","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-07-05T11:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SNpHRjtofR11ClhuZfQPVW1Gdy1I6jE0y3vNd+LP3mBXJmjy9JbjL0nc716e67Nuq7c2x/GJ7unWb8vbGgSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:10:54.163467Z"},"content_sha256":"ebd6cdd8930bfb9af54778d9f723ff17d018a4df431f349e15d48c64463dc0ee","schema_version":"1.0","event_id":"sha256:ebd6cdd8930bfb9af54778d9f723ff17d018a4df431f349e15d48c64463dc0ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V62KRV2EOH36JASLVYBP5A377P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Divisibility of Griesmer Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haihua Deng, Hexiang Huang, Qing Xiang","submitted_at":"2025-06-09T15:09:44Z","abstract_excerpt":"In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if $p^e|d$, then $p^e|\\mathrm{wt}(c)$ for all $c\\in C$. In this paper, we show that if $q^e|d$, then $C$ has a basis consisting of $k$ codewords such that the first $\\min\\left\\{e+1,k\\right\\}$ of them span a Griesmer subcode with constant weight $d$ and any $k-1$ of them span a $[g_q(k-1,d),k-1,d]_q$ Griesmer subcode. Using the $p$-adic algebraic method together "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07846","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/2506.07846/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"},"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-07-05T11:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLLrNRVQppCYUghUSjg4oVE/+z8Sv7woWmjkA3hGHXnhJ7nnYDBzJRP3uXdM4iYLOwlLy9This799hXtOHRuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:10:54.164515Z"},"content_sha256":"acbea3b0af4b46ae134cc90d94b7309ccced54d17155affbb40b37090663c5ba","schema_version":"1.0","event_id":"sha256:acbea3b0af4b46ae134cc90d94b7309ccced54d17155affbb40b37090663c5ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V62KRV2EOH36JASLVYBP5A377P/bundle.json","state_url":"https://pith.science/pith/V62KRV2EOH36JASLVYBP5A377P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V62KRV2EOH36JASLVYBP5A377P/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-08-10T12:10:54Z","links":{"resolver":"https://pith.science/pith/V62KRV2EOH36JASLVYBP5A377P","bundle":"https://pith.science/pith/V62KRV2EOH36JASLVYBP5A377P/bundle.json","state":"https://pith.science/pith/V62KRV2EOH36JASLVYBP5A377P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V62KRV2EOH36JASLVYBP5A377P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V62KRV2EOH36JASLVYBP5A377P","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":"7129c662ba45b594f22f7cc8b32f218cc381cf0e31a27b4188254f25bb9a257d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-09T15:09:44Z","title_canon_sha256":"52b6a2841ca06ff11fe74b9d361e895e0c3632bb68dbed381f822ba6a278494d"},"schema_version":"1.0","source":{"id":"2506.07846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07846","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07846v1","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07846","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"V62KRV2EOH36","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"V62KRV2EOH36JASL","created_at":"2026-07-05T11:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"V62KRV2E","created_at":"2026-07-05T11:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:acbea3b0af4b46ae134cc90d94b7309ccced54d17155affbb40b37090663c5ba","target":"graph","created_at":"2026-07-05T11:18: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.07846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if $p^e|d$, then $p^e|\\mathrm{wt}(c)$ for all $c\\in C$. In this paper, we show that if $q^e|d$, then $C$ has a basis consisting of $k$ codewords such that the first $\\min\\left\\{e+1,k\\right\\}$ of them span a Griesmer subcode with constant weight $d$ and any $k-1$ of them span a $[g_q(k-1,d),k-1,d]_q$ Griesmer subcode. Using the $p$-adic algebraic method together ","authors_text":"Haihua Deng, Hexiang Huang, Qing Xiang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-09T15:09:44Z","title":"Divisibility of Griesmer Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07846","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:ebd6cdd8930bfb9af54778d9f723ff17d018a4df431f349e15d48c64463dc0ee","target":"record","created_at":"2026-07-05T11:18: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":"7129c662ba45b594f22f7cc8b32f218cc381cf0e31a27b4188254f25bb9a257d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-09T15:09:44Z","title_canon_sha256":"52b6a2841ca06ff11fe74b9d361e895e0c3632bb68dbed381f822ba6a278494d"},"schema_version":"1.0","source":{"id":"2506.07846","kind":"arxiv","version":1}},"canonical_sha256":"afb4a8d74471f7e4824bae02fe837ffbca15b4899ca4b5d78fdde235b06622b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afb4a8d74471f7e4824bae02fe837ffbca15b4899ca4b5d78fdde235b06622b7","first_computed_at":"2026-07-05T11:18:34.314626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:34.314626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/3XYZf59EJ/NGEnjdTlrk39E9o1IEtTXzzCL0QwoGF2KMXM1yvf9w2Old/KvX3l60fv9yZ9LfUZq7HmC1WaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:34.315100Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd6cdd8930bfb9af54778d9f723ff17d018a4df431f349e15d48c64463dc0ee","sha256:acbea3b0af4b46ae134cc90d94b7309ccced54d17155affbb40b37090663c5ba"],"state_sha256":"0b50c75ed8e105d3036f3d931a0859dc9305cee00a2347d0bc9763f7cfad73d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfKPgCQskAkaaONq6rhGFViGm0xav4hrFdsKhWRe4ueNohf2z8FoUFWQfKijm1m/1WhkhoCj1uWAPS4T2i07Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:10:54.170682Z","bundle_sha256":"6a4aee9df7550140a221a2f75ebb4dedb005e714e18310f0515818711b37c092"}}