{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TUKUC52RWRLIHEJAE7ICRGHCAJ","short_pith_number":"pith:TUKUC52R","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"},"canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","source":{"kind":"arxiv","id":"1501.06419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06419","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06419v2","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06419","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"TUKUC52RWRLI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUKUC52RWRLIHEJA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUKUC52R","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TUKUC52RWRLIHEJAE7ICRGHCAJ","target":"record","payload":{"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"},"canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","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"},"source_kind":"arxiv","source_id":"1501.06419","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-05-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1fVbXPXPASkL3AsgREKKfTrQiwMyYouI0wvwRh3MXoJVXuQo56ERN7N4vU3avXASOk12S4a6oovQ0Nprb1rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:43.207495Z"},"content_sha256":"6345637092c884337054a1a0dc4a57ffe313f7b5c09eaa3dd5e4ec2602006bbb","schema_version":"1.0","event_id":"sha256:6345637092c884337054a1a0dc4a57ffe313f7b5c09eaa3dd5e4ec2602006bbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TUKUC52RWRLIHEJAE7ICRGHCAJ","target":"graph","payload":{"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"},"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-05-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nu1MGr+AECX5+eKiB4rcIPqyP70Mh6TGRIvjvvtpDiBv/cFimG6AMKKF7z0HX86oztQQ/HDETfcyNzC3l9SsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:43.207844Z"},"content_sha256":"f4e7f9d8a35d39e1f38752fed19b991edbb1bd123b69df357f2ca41362d1fb89","schema_version":"1.0","event_id":"sha256:f4e7f9d8a35d39e1f38752fed19b991edbb1bd123b69df357f2ca41362d1fb89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/bundle.json","state_url":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/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-06-23T19:36:43Z","links":{"resolver":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ","bundle":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/bundle.json","state":"https://pith.science/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUKUC52RWRLIHEJAE7ICRGHCAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TUKUC52RWRLIHEJAE7ICRGHCAJ","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":"86087cd246f420da45c4664c307d851da3d703a4ac42ad307a4e7065e6d559fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T14:48:04Z","title_canon_sha256":"3c96f306804454a90fcf0b578c871ae501e3f340dc0cb1b5cade43890ba5295a"},"schema_version":"1.0","source":{"id":"1501.06419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06419","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06419v2","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06419","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"TUKUC52RWRLI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUKUC52RWRLIHEJA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUKUC52R","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f4e7f9d8a35d39e1f38752fed19b991edbb1bd123b69df357f2ca41362d1fb89","target":"graph","created_at":"2026-05-18T01:35:00Z","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"},"paper":{"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.","authors_text":"Diego Mirandola, Gilles Z\\'emor","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T14:48:04Z","title":"Critical pairs for the Product Singleton Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06419","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:6345637092c884337054a1a0dc4a57ffe313f7b5c09eaa3dd5e4ec2602006bbb","target":"record","created_at":"2026-05-18T01:35:00Z","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":"86087cd246f420da45c4664c307d851da3d703a4ac42ad307a4e7065e6d559fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T14:48:04Z","title_canon_sha256":"3c96f306804454a90fcf0b578c871ae501e3f340dc0cb1b5cade43890ba5295a"},"schema_version":"1.0","source":{"id":"1501.06419","kind":"arxiv","version":2}},"canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d15417751b45683912027d02898e2026add3564ee59bba067e515c448e7db45","first_computed_at":"2026-05-18T01:35:00.761131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.761131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"liHYNoxTosdcK20U4vQbnySTTyYtveKLvDMB002S6bF2HnleGHFVx0f/O9EL8haLL6P45CL+OXxpUh+ShYKGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.761859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6345637092c884337054a1a0dc4a57ffe313f7b5c09eaa3dd5e4ec2602006bbb","sha256:f4e7f9d8a35d39e1f38752fed19b991edbb1bd123b69df357f2ca41362d1fb89"],"state_sha256":"de564c4e7d7efcae1a7efbd92e082fb153ae73935157d7703f650b9f30fdff02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwY0jAunzeE4GwxaYacHCSrldYjRht7+Xvu4ehBty2UvVJbEcE0Ae3r+tPnhLPKHOsp+xzCzNJHxCOOxg4ZJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:36:43.209825Z","bundle_sha256":"af1a9f9e14b9e04385ca3fbd06509e5db6a9affe9b97a3aca4885ce1244d093c"}}