{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HVDL5OH2XOUA5FM7KZML6D6OWS","short_pith_number":"pith:HVDL5OH2","canonical_record":{"source":{"id":"1102.2700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T08:53:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b579460e61a4cde95a85053c12b3d86328330f7d14acf453e270e2727213af9","abstract_canon_sha256":"a5d1eb187754fef0557710dc3e51e3166ce30373fbef9958e6006fa86293afb0"},"schema_version":"1.0"},"canonical_sha256":"3d46beb8fabba80e959f5658bf0fceb4a0adefd8710e7b30798ec87a6e4af233","source":{"kind":"arxiv","id":"1102.2700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2700","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2700v2","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2700","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"HVDL5OH2XOUA","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HVDL5OH2XOUA5FM7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HVDL5OH2","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HVDL5OH2XOUA5FM7KZML6D6OWS","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T08:53:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b579460e61a4cde95a85053c12b3d86328330f7d14acf453e270e2727213af9","abstract_canon_sha256":"a5d1eb187754fef0557710dc3e51e3166ce30373fbef9958e6006fa86293afb0"},"schema_version":"1.0"},"canonical_sha256":"3d46beb8fabba80e959f5658bf0fceb4a0adefd8710e7b30798ec87a6e4af233","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.772900Z","signature_b64":"1eEFPACmMFmxBMjvP0QTVvstrfD9d4UmWkr9ZvmdD0tRqRAHLzX7alNq5cPcOUYn14Npt67SWpsea/Rrgvu8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d46beb8fabba80e959f5658bf0fceb4a0adefd8710e7b30798ec87a6e4af233","last_reissued_at":"2026-05-18T04:28:38.772350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.772350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2700","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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAcRvjTvIQcYaCjTR3yenqXMDadOGzzHE9cbY9qZpcDZAdqAreuW6vYerTIQi8UPsC14SkqLrXxmocJpptVyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:39:54.063177Z"},"content_sha256":"49503213f1435c4c937eeee0d3c4009953452f17b3eeeb649e6dc3dbd334c6c4","schema_version":"1.0","event_id":"sha256:49503213f1435c4c937eeee0d3c4009953452f17b3eeeb649e6dc3dbd334c6c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HVDL5OH2XOUA5FM7KZML6D6OWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On (Partial) Unit Memory Codes Based on Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter, Martin Bossert, Victor Zyablov, Vladimir Sidorenko","submitted_at":"2011-02-14T08:53:34Z","abstract_excerpt":"(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined analogous to the extended row distance in Hamming metric. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2700","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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGufeAx6pJIB7cCqvB1iPiK6WE5AbpUo18ovHCJehmAQeOJHdePuVwi6a/ShiUBFFUXqHzJbkXL26oAE6GmHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:39:54.063543Z"},"content_sha256":"c56e7c703e6f4bfbebc0fcd8a2665348046de61aa8156f66c1bb6afe533532ae","schema_version":"1.0","event_id":"sha256:c56e7c703e6f4bfbebc0fcd8a2665348046de61aa8156f66c1bb6afe533532ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/bundle.json","state_url":"https://pith.science/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/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-05-28T08:39:54Z","links":{"resolver":"https://pith.science/pith/HVDL5OH2XOUA5FM7KZML6D6OWS","bundle":"https://pith.science/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/bundle.json","state":"https://pith.science/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVDL5OH2XOUA5FM7KZML6D6OWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HVDL5OH2XOUA5FM7KZML6D6OWS","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":"a5d1eb187754fef0557710dc3e51e3166ce30373fbef9958e6006fa86293afb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T08:53:34Z","title_canon_sha256":"3b579460e61a4cde95a85053c12b3d86328330f7d14acf453e270e2727213af9"},"schema_version":"1.0","source":{"id":"1102.2700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2700","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2700v2","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2700","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"HVDL5OH2XOUA","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HVDL5OH2XOUA5FM7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HVDL5OH2","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:c56e7c703e6f4bfbebc0fcd8a2665348046de61aa8156f66c1bb6afe533532ae","target":"graph","created_at":"2026-05-18T04:28:38Z","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":"(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined analogous to the extended row distance in Hamming metric. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived and","authors_text":"Antonia Wachter, Martin Bossert, Victor Zyablov, Vladimir Sidorenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T08:53:34Z","title":"On (Partial) Unit Memory Codes Based on Gabidulin Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2700","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:49503213f1435c4c937eeee0d3c4009953452f17b3eeeb649e6dc3dbd334c6c4","target":"record","created_at":"2026-05-18T04:28:38Z","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":"a5d1eb187754fef0557710dc3e51e3166ce30373fbef9958e6006fa86293afb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T08:53:34Z","title_canon_sha256":"3b579460e61a4cde95a85053c12b3d86328330f7d14acf453e270e2727213af9"},"schema_version":"1.0","source":{"id":"1102.2700","kind":"arxiv","version":2}},"canonical_sha256":"3d46beb8fabba80e959f5658bf0fceb4a0adefd8710e7b30798ec87a6e4af233","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d46beb8fabba80e959f5658bf0fceb4a0adefd8710e7b30798ec87a6e4af233","first_computed_at":"2026-05-18T04:28:38.772350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:38.772350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1eEFPACmMFmxBMjvP0QTVvstrfD9d4UmWkr9ZvmdD0tRqRAHLzX7alNq5cPcOUYn14Npt67SWpsea/Rrgvu8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:38.772900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49503213f1435c4c937eeee0d3c4009953452f17b3eeeb649e6dc3dbd334c6c4","sha256:c56e7c703e6f4bfbebc0fcd8a2665348046de61aa8156f66c1bb6afe533532ae"],"state_sha256":"e58dbd354c0a623a3eb6717f1a21d311b8dd55d6d368066aa0f41c1eef34c9b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rx7vwmbrl0N1Sj9+dxo379cixKiKhKUHc3a85txif6PNZZV/Jm+dl0I7MqVzj4/lXFaaVLcwsuhbsF8N2d1PDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:39:54.065619Z","bundle_sha256":"eb94187589dcec1f8eb515c805ba3bf442c71b19b03c9f047a046eac4559a56d"}}