{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EFZHDTJASSWWEGEIJ7EGIWI24G","short_pith_number":"pith:EFZHDTJA","canonical_record":{"source":{"id":"2407.11810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-16T15:00:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03553da2b347962bff021f11efa8751fb097ea40721a93d39450b6844e8e92ff","abstract_canon_sha256":"503b9b5e1345bf10fcef4f516f257a4eb132548a12fae0a4e948ed642ee73035"},"schema_version":"1.0"},"canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","source":{"kind":"arxiv","id":"2407.11810","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EFZHDTJASSWWEGEIJ7EGIWI24G","target":"record","payload":{"canonical_record":{"source":{"id":"2407.11810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-16T15:00:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03553da2b347962bff021f11efa8751fb097ea40721a93d39450b6844e8e92ff","abstract_canon_sha256":"503b9b5e1345bf10fcef4f516f257a4eb132548a12fae0a4e948ed642ee73035"},"schema_version":"1.0"},"canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:54.846657Z","signature_b64":"7m5n26bt+K0VYacB5ll7b5t2OLGGdZSzDWbUEvYrNehzM2r6pwh6poNVE9RfhLAu/RatJXnrAGpmGWyagRIoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","last_reissued_at":"2026-07-05T10:30:54.846152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:54.846152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.11810","source_version":2,"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-05T10:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0r6Wx/vTudFhxaGTu5gqqpvJcVRxKYw4GmqHL7wasPsGdvGPOuS1JKwiH4rXOPhyNys/3BXKMICIchV09Rk1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:42:07.278568Z"},"content_sha256":"9b8c3216125797b375f8b825064060f334cc4c07e7b7fa8811ac424c0e0ddd1c","schema_version":"1.0","event_id":"sha256:9b8c3216125797b375f8b825064060f334cc4c07e7b7fa8811ac424c0e0ddd1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EFZHDTJASSWWEGEIJ7EGIWI24G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"About the generalized Hamming weights of matrix-product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rodrigo San-Jos\\'e","submitted_at":"2024-07-16T15:00:55Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11810","kind":"arxiv","version":2},"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/2407.11810/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-05T10:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPexkF39LtLefmEOzTNxt7xQXPFuuNl5tVjqZEh6gl3OrsmG3OC2qNcHM0MQe61DAYRhShUaj31jnKxAdWIOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:42:07.279405Z"},"content_sha256":"86cdaa8e4bc3d55b35865e97600b558635c7d388dc76570eef4d223d43513091","schema_version":"1.0","event_id":"sha256:86cdaa8e4bc3d55b35865e97600b558635c7d388dc76570eef4d223d43513091"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/bundle.json","state_url":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/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-13T17:42:07Z","links":{"resolver":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G","bundle":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/bundle.json","state":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GftUFgDjT+a6FrlHqeODygVJ0g0a+2AavlOJCjbV6DRMYj2PL55XGV0oWoKbxndqFScssqKnlIIx7ZEkVtzRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:42:07.306702Z","bundle_sha256":"e963fd824f096f987f9c3cf85ae45828fb47b6dabdfd112af8bd8366ab01982c"}}