{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SQSBATFAHEHQQ4G7FU5BAFR2AS","short_pith_number":"pith:SQSBATFA","canonical_record":{"source":{"id":"1908.03239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T19:04:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ec9da33f57fa32138313407e3b852a56dbb4ff98dba0f4ae9c759835c5a0bd7","abstract_canon_sha256":"7a9e4b6a7a2ad9563311b5aa9e56d8b4b7258907308f37303825ac17d0ddcd98"},"schema_version":"1.0"},"canonical_sha256":"9424104ca0390f0870df2d3a10163a04b2dfce7b7c405cb11410de469466a99c","source":{"kind":"arxiv","id":"1908.03239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03239","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03239v2","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03239","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"SQSBATFAHEHQ","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"SQSBATFAHEHQQ4G7","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"SQSBATFA","created_at":"2026-07-05T02:06:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SQSBATFAHEHQQ4G7FU5BAFR2AS","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T19:04:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ec9da33f57fa32138313407e3b852a56dbb4ff98dba0f4ae9c759835c5a0bd7","abstract_canon_sha256":"7a9e4b6a7a2ad9563311b5aa9e56d8b4b7258907308f37303825ac17d0ddcd98"},"schema_version":"1.0"},"canonical_sha256":"9424104ca0390f0870df2d3a10163a04b2dfce7b7c405cb11410de469466a99c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:04.761708Z","signature_b64":"4MmRAxsXRtSWA+ffOjTeRx0Q0YldFQWY4qPxS1NyS2vkFnD4IMv3HmSJ3Qnwr7E39QZ9y/+CbTrXtKl/LcyXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9424104ca0390f0870df2d3a10163a04b2dfce7b7c405cb11410de469466a99c","last_reissued_at":"2026-07-05T02:06:04.761234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:04.761234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03239","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-05T02:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1ga203RyIrRdAA4yqsVaz7g3tstxIb1tUNSu/Oe+4VxrUXH/A+bl8W1B5SmauG4yFfgyHu6UFbE3NvuC7pDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:08:59.736541Z"},"content_sha256":"8c47ab2a315a836c913e58acba8eae46af3421a84b8f01eb2fcf602e1396c487","schema_version":"1.0","event_id":"sha256:8c47ab2a315a836c913e58acba8eae46af3421a84b8f01eb2fcf602e1396c487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SQSBATFAHEHQQ4G7FU5BAFR2AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamming and simplex codes for the sum-rank metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2019-08-08T19:04:18Z","abstract_excerpt":"Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least $ 3 $ (thus one-error-correcting) for a fixed redundancy $ r $, base-field size $ q $ and field-extension degree $ m $ (i.e., number of matrix rows). General upper bounds on their code length, number of shots or sublengths and average sublength are obtained based on such parameters. When the field-extension degree is $ 1 $, it is shown that sum-rank isometry classes of sum-rank Hamming codes are in bijective corresponde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03239","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/1908.03239/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-05T02:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsVhlFiBM9uvyOlGzJheDw0Y99irR/WVM7AiOjcgyqdD5ncFp4zyDHgvoUxETz4PAdTyzGXvl3IWwmwwVhaZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:08:59.738980Z"},"content_sha256":"73058e054d0ba0d5de11fa44aa737d3a2c14f24f16b248ffdf57969977a76f9a","schema_version":"1.0","event_id":"sha256:73058e054d0ba0d5de11fa44aa737d3a2c14f24f16b248ffdf57969977a76f9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/bundle.json","state_url":"https://pith.science/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/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-16T13:08:59Z","links":{"resolver":"https://pith.science/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS","bundle":"https://pith.science/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/bundle.json","state":"https://pith.science/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQSBATFAHEHQQ4G7FU5BAFR2AS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SQSBATFAHEHQQ4G7FU5BAFR2AS","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":"7a9e4b6a7a2ad9563311b5aa9e56d8b4b7258907308f37303825ac17d0ddcd98","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T19:04:18Z","title_canon_sha256":"4ec9da33f57fa32138313407e3b852a56dbb4ff98dba0f4ae9c759835c5a0bd7"},"schema_version":"1.0","source":{"id":"1908.03239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03239","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03239v2","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03239","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"SQSBATFAHEHQ","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"SQSBATFAHEHQQ4G7","created_at":"2026-07-05T02:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"SQSBATFA","created_at":"2026-07-05T02:06:04Z"}],"graph_snapshots":[{"event_id":"sha256:73058e054d0ba0d5de11fa44aa737d3a2c14f24f16b248ffdf57969977a76f9a","target":"graph","created_at":"2026-07-05T02:06:04Z","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/1908.03239/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least $ 3 $ (thus one-error-correcting) for a fixed redundancy $ r $, base-field size $ q $ and field-extension degree $ m $ (i.e., number of matrix rows). General upper bounds on their code length, number of shots or sublengths and average sublength are obtained based on such parameters. When the field-extension degree is $ 1 $, it is shown that sum-rank isometry classes of sum-rank Hamming codes are in bijective corresponde","authors_text":"Umberto Mart\\'inez-Pe\\~nas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T19:04:18Z","title":"Hamming and simplex codes for the sum-rank metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03239","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:8c47ab2a315a836c913e58acba8eae46af3421a84b8f01eb2fcf602e1396c487","target":"record","created_at":"2026-07-05T02:06:04Z","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":"7a9e4b6a7a2ad9563311b5aa9e56d8b4b7258907308f37303825ac17d0ddcd98","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T19:04:18Z","title_canon_sha256":"4ec9da33f57fa32138313407e3b852a56dbb4ff98dba0f4ae9c759835c5a0bd7"},"schema_version":"1.0","source":{"id":"1908.03239","kind":"arxiv","version":2}},"canonical_sha256":"9424104ca0390f0870df2d3a10163a04b2dfce7b7c405cb11410de469466a99c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9424104ca0390f0870df2d3a10163a04b2dfce7b7c405cb11410de469466a99c","first_computed_at":"2026-07-05T02:06:04.761234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:04.761234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4MmRAxsXRtSWA+ffOjTeRx0Q0YldFQWY4qPxS1NyS2vkFnD4IMv3HmSJ3Qnwr7E39QZ9y/+CbTrXtKl/LcyXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:04.761708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c47ab2a315a836c913e58acba8eae46af3421a84b8f01eb2fcf602e1396c487","sha256:73058e054d0ba0d5de11fa44aa737d3a2c14f24f16b248ffdf57969977a76f9a"],"state_sha256":"8ac457d8dd35dac33fa17e2cc47cd301b27679fd9401efdf7a3a81ff649de8a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8Lr5lqIaVeGx8UJnIG8Ee7DThsazxlO/K5sNuqJKbveBCwpzG/TDT4ZAXVX3LAI0/1hC9gNDzBsTLwtvD88Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:08:59.745438Z","bundle_sha256":"9cdd02002b644f4dbec94bcdc18292e51c9b33da1fc35d7efabc4e742259bd93"}}