{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EFZHDTJASSWWEGEIJ7EGIWI24G","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":"503b9b5e1345bf10fcef4f516f257a4eb132548a12fae0a4e948ed642ee73035","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-16T15:00:55Z","title_canon_sha256":"03553da2b347962bff021f11efa8751fb097ea40721a93d39450b6844e8e92ff"},"schema_version":"1.0","source":{"id":"2407.11810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11810","created_at":"2026-07-05T10:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11810v2","created_at":"2026-07-05T10:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11810","created_at":"2026-07-05T10:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"EFZHDTJASSWW","created_at":"2026-07-05T10:30:54Z"},{"alias_kind":"pith_short_16","alias_value":"EFZHDTJASSWWEGEI","created_at":"2026-07-05T10:30:54Z"},{"alias_kind":"pith_short_8","alias_value":"EFZHDTJA","created_at":"2026-07-05T10:30:54Z"}],"graph_snapshots":[{"event_id":"sha256:86cdaa8e4bc3d55b35865e97600b558635c7d388dc76570eef4d223d43513091","target":"graph","created_at":"2026-07-05T10:30:54Z","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/2407.11810/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the bounds used for the minimum distance of matrix-product codes. When the constituent codes are two Reed-Solomon codes, we obtain an explicit formula for the generalized Hamming weights of the resulting matrix-product code. We also deal with the non-nested case for the case of two constituent codes.","authors_text":"Rodrigo San-Jos\\'e","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-16T15:00:55Z","title":"About the generalized Hamming weights of matrix-product codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11810","kind":"arxiv","version":2},"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:9b8c3216125797b375f8b825064060f334cc4c07e7b7fa8811ac424c0e0ddd1c","target":"record","created_at":"2026-07-05T10:30:54Z","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":"503b9b5e1345bf10fcef4f516f257a4eb132548a12fae0a4e948ed642ee73035","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-16T15:00:55Z","title_canon_sha256":"03553da2b347962bff021f11efa8751fb097ea40721a93d39450b6844e8e92ff"},"schema_version":"1.0","source":{"id":"2407.11810","kind":"arxiv","version":2}},"canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","first_computed_at":"2026-07-05T10:30:54.846152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:54.846152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7m5n26bt+K0VYacB5ll7b5t2OLGGdZSzDWbUEvYrNehzM2r6pwh6poNVE9RfhLAu/RatJXnrAGpmGWyagRIoDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:54.846657Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.11810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b8c3216125797b375f8b825064060f334cc4c07e7b7fa8811ac424c0e0ddd1c","sha256:86cdaa8e4bc3d55b35865e97600b558635c7d388dc76570eef4d223d43513091"],"state_sha256":"c4feccfff41845ecfb00592c24dd10ae5995f690ce164ebbbb03e57db12fc4f9"}