{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TUKUC52RWRLIHEJAE7ICRGHCAJ","short_pith_number":"pith:TUKUC52R","schema_version":"1.0","canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","source":{"kind":"arxiv","id":"1501.06419","version":2},"attestation_state":"computed","paper":{"title":"Critical pairs for the Product Singleton Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Mirandola, Gilles Z\\'emor","submitted_at":"2015-01-26T14:48:04Z","abstract_excerpt":"We characterize Product-MDS pairs of linear codes, i.e.\\ pairs of codes $C,D$ whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions $\\dim C, \\dim D$. We prove in particular, for $C=D$, that if the square of the code $C$ has minimum distance at least $2$, and $(C,C)$ is a Product-MDS pair, then either $C$ is a generalized Reed-Solomon code, or $C$ is a direct sum of self-dual codes. In passing we establish coding-theory analogues of classical theorems of additive combinatorics."},"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":"1501.06419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T14:48:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c96f306804454a90fcf0b578c871ae501e3f340dc0cb1b5cade43890ba5295a","abstract_canon_sha256":"86087cd246f420da45c4664c307d851da3d703a4ac42ad307a4e7065e6d559fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.761859Z","signature_b64":"liHYNoxTosdcK20U4vQbnySTTyYtveKLvDMB002S6bF2HnleGHFVx0f/O9EL8haLL6P45CL+OXxpUh+ShYKGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","last_reissued_at":"2026-05-18T01:35:00.761131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.761131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical pairs for the Product Singleton Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Mirandola, Gilles Z\\'emor","submitted_at":"2015-01-26T14:48:04Z","abstract_excerpt":"We characterize Product-MDS pairs of linear codes, i.e.\\ pairs of codes $C,D$ whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions $\\dim C, \\dim D$. We prove in particular, for $C=D$, that if the square of the code $C$ has minimum distance at least $2$, and $(C,C)$ is a Product-MDS pair, then either $C$ is a generalized Reed-Solomon code, or $C$ is a direct sum of self-dual codes. In passing we establish coding-theory analogues of classical theorems of additive combinatorics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06419","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":""},"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":"1501.06419","created_at":"2026-05-18T01:35:00.761243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06419v2","created_at":"2026-05-18T01:35:00.761243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06419","created_at":"2026-05-18T01:35:00.761243+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUKUC52RWRLI","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUKUC52RWRLIHEJA","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUKUC52R","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ","json":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ.json","graph_json":"https://pith.science/api/pith-number/TUKUC52RWRLIHEJAE7ICRGHCAJ/graph.json","events_json":"https://pith.science/api/pith-number/TUKUC52RWRLIHEJAE7ICRGHCAJ/events.json","paper":"https://pith.science/paper/TUKUC52R"},"agent_actions":{"view_html":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ","download_json":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ.json","view_paper":"https://pith.science/paper/TUKUC52R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06419&json=true","fetch_graph":"https://pith.science/api/pith-number/TUKUC52RWRLIHEJAE7ICRGHCAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TUKUC52RWRLIHEJAE7ICRGHCAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/action/storage_attestation","attest_author":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/action/author_attestation","sign_citation":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/action/citation_signature","submit_replication":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/action/replication_record"}},"created_at":"2026-05-18T01:35:00.761243+00:00","updated_at":"2026-05-18T01:35:00.761243+00:00"}