{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EFZHDTJASSWWEGEIJ7EGIWI24G","short_pith_number":"pith:EFZHDTJA","schema_version":"1.0","canonical_sha256":"217271cd2094ad6218884fc864591ae1917475da7800ccd31fb557262f6cccb4","source":{"kind":"arxiv","id":"2407.11810","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.11810","created_at":"2026-07-05T10:30:54.846216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11810v2","created_at":"2026-07-05T10:30:54.846216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11810","created_at":"2026-07-05T10:30:54.846216+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFZHDTJASSWW","created_at":"2026-07-05T10:30:54.846216+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFZHDTJASSWWEGEI","created_at":"2026-07-05T10:30:54.846216+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFZHDTJA","created_at":"2026-07-05T10:30:54.846216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13375","citing_title":"The weight hierarchy of decreasing norm-trace codes","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G","json":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G.json","graph_json":"https://pith.science/api/pith-number/EFZHDTJASSWWEGEIJ7EGIWI24G/graph.json","events_json":"https://pith.science/api/pith-number/EFZHDTJASSWWEGEIJ7EGIWI24G/events.json","paper":"https://pith.science/paper/EFZHDTJA"},"agent_actions":{"view_html":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G","download_json":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G.json","view_paper":"https://pith.science/paper/EFZHDTJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11810&json=true","fetch_graph":"https://pith.science/api/pith-number/EFZHDTJASSWWEGEIJ7EGIWI24G/graph.json","fetch_events":"https://pith.science/api/pith-number/EFZHDTJASSWWEGEIJ7EGIWI24G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/action/storage_attestation","attest_author":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/action/author_attestation","sign_citation":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/action/citation_signature","submit_replication":"https://pith.science/pith/EFZHDTJASSWWEGEIJ7EGIWI24G/action/replication_record"}},"created_at":"2026-07-05T10:30:54.846216+00:00","updated_at":"2026-07-05T10:30:54.846216+00:00"}