{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AGVC334H5YT4GRZ6PAAZVIEL73","short_pith_number":"pith:AGVC334H","canonical_record":{"source":{"id":"2507.05567","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-08T01:12:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c79da03c40f353653be5c057575c803185429a11dff5b6ab387815a00941703","abstract_canon_sha256":"620da33785fcbf03cdd4ac8cb6099b848937a5b4bf9cfffe7cfa3a2b7817e876"},"schema_version":"1.0"},"canonical_sha256":"01aa2def87ee27c3473e78019aa08bfedb0171c5175d0083e4a9503b62c6b0da","source":{"kind":"arxiv","id":"2507.05567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05567","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05567v1","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05567","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"AGVC334H5YT4","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_16","alias_value":"AGVC334H5YT4GRZ6","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_8","alias_value":"AGVC334H","created_at":"2026-07-05T11:33:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AGVC334H5YT4GRZ6PAAZVIEL73","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05567","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-08T01:12:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c79da03c40f353653be5c057575c803185429a11dff5b6ab387815a00941703","abstract_canon_sha256":"620da33785fcbf03cdd4ac8cb6099b848937a5b4bf9cfffe7cfa3a2b7817e876"},"schema_version":"1.0"},"canonical_sha256":"01aa2def87ee27c3473e78019aa08bfedb0171c5175d0083e4a9503b62c6b0da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:32.617563Z","signature_b64":"79ZcHN6QCHMr46t06xw1XODwv/nejQgMQkMsYmWYzcw/o/5V57yaMzudmn+Z3qjAEwc5Ppt2yM0Yg/Gpc5z3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01aa2def87ee27c3473e78019aa08bfedb0171c5175d0083e4a9503b62c6b0da","last_reissued_at":"2026-07-05T11:33:32.617134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:32.617134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05567","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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLJ+xVZBPCgfGJhsVrf0Jd9sF+gF870u8mVB9qaYjDV+KXKfnM1n8VBJoSQbCm2+Y0kndj9hXchls3Hkec3YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:10:28.307462Z"},"content_sha256":"b29bd392de8b7d280bede75efdc5a6011c5664aecaa485d5b111a3a10d0d25ff","schema_version":"1.0","event_id":"sha256:b29bd392de8b7d280bede75efdc5a6011c5664aecaa485d5b111a3a10d0d25ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AGVC334H5YT4GRZ6PAAZVIEL73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaofeng Guan, Gaojun Luo, Hong Wang, Shitao Li, Zhi Ma","submitted_at":"2025-07-08T01:12:10Z","abstract_excerpt":"The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame error rate (AFER) among all optimal linear codes under maximum likelihood decoding. Such codes are referred to as AFER-optimal linear codes.\n  The Griesmer bound is essential for determining the optimality of linear codes. However, establishing tight lower bounds on the error coefficients of Griesmer optimal linear codes is challenging, and the linear program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05567","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/2507.05567/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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0e8Mya1fnoIOAIXVJR3Y+A/7ar0QDtOQR0UEnLFS+0WKQWAOHqz0KFFU4xuZIbMnChBQRqqaxt9uRk9/tvR7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:10:28.308026Z"},"content_sha256":"647b4711451905912345efd2a2ddce704602f4b0d24433f98d6eec1caff90e9b","schema_version":"1.0","event_id":"sha256:647b4711451905912345efd2a2ddce704602f4b0d24433f98d6eec1caff90e9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGVC334H5YT4GRZ6PAAZVIEL73/bundle.json","state_url":"https://pith.science/pith/AGVC334H5YT4GRZ6PAAZVIEL73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGVC334H5YT4GRZ6PAAZVIEL73/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-03T20:10:28Z","links":{"resolver":"https://pith.science/pith/AGVC334H5YT4GRZ6PAAZVIEL73","bundle":"https://pith.science/pith/AGVC334H5YT4GRZ6PAAZVIEL73/bundle.json","state":"https://pith.science/pith/AGVC334H5YT4GRZ6PAAZVIEL73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGVC334H5YT4GRZ6PAAZVIEL73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AGVC334H5YT4GRZ6PAAZVIEL73","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":"620da33785fcbf03cdd4ac8cb6099b848937a5b4bf9cfffe7cfa3a2b7817e876","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-08T01:12:10Z","title_canon_sha256":"7c79da03c40f353653be5c057575c803185429a11dff5b6ab387815a00941703"},"schema_version":"1.0","source":{"id":"2507.05567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05567","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05567v1","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05567","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"AGVC334H5YT4","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_16","alias_value":"AGVC334H5YT4GRZ6","created_at":"2026-07-05T11:33:32Z"},{"alias_kind":"pith_short_8","alias_value":"AGVC334H","created_at":"2026-07-05T11:33:32Z"}],"graph_snapshots":[{"event_id":"sha256:647b4711451905912345efd2a2ddce704602f4b0d24433f98d6eec1caff90e9b","target":"graph","created_at":"2026-07-05T11:33:32Z","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/2507.05567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame error rate (AFER) among all optimal linear codes under maximum likelihood decoding. Such codes are referred to as AFER-optimal linear codes.\n  The Griesmer bound is essential for determining the optimality of linear codes. However, establishing tight lower bounds on the error coefficients of Griesmer optimal linear codes is challenging, and the linear program","authors_text":"Chaofeng Guan, Gaojun Luo, Hong Wang, Shitao Li, Zhi Ma","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-08T01:12:10Z","title":"Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05567","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:b29bd392de8b7d280bede75efdc5a6011c5664aecaa485d5b111a3a10d0d25ff","target":"record","created_at":"2026-07-05T11:33:32Z","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":"620da33785fcbf03cdd4ac8cb6099b848937a5b4bf9cfffe7cfa3a2b7817e876","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-08T01:12:10Z","title_canon_sha256":"7c79da03c40f353653be5c057575c803185429a11dff5b6ab387815a00941703"},"schema_version":"1.0","source":{"id":"2507.05567","kind":"arxiv","version":1}},"canonical_sha256":"01aa2def87ee27c3473e78019aa08bfedb0171c5175d0083e4a9503b62c6b0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01aa2def87ee27c3473e78019aa08bfedb0171c5175d0083e4a9503b62c6b0da","first_computed_at":"2026-07-05T11:33:32.617134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:32.617134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79ZcHN6QCHMr46t06xw1XODwv/nejQgMQkMsYmWYzcw/o/5V57yaMzudmn+Z3qjAEwc5Ppt2yM0Yg/Gpc5z3BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:32.617563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b29bd392de8b7d280bede75efdc5a6011c5664aecaa485d5b111a3a10d0d25ff","sha256:647b4711451905912345efd2a2ddce704602f4b0d24433f98d6eec1caff90e9b"],"state_sha256":"c8a96091b2d58cfc560101cfbe10edaba2984b1ce0051a58cce736c39e82cb34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeF8c1Kp6S82vD+hA/+rIxpTrB3oq8ZIUY3xkiSkKHBY4qh2GmaoXCyDPpDm8Af4g256P9CXSuYblk7P/l8jAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:10:28.313421Z","bundle_sha256":"9d7292299564d419c6dcf05e186625621affe4885e3331a7187916a7bd1108ec"}}