{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5HZMMGRLEI6IH7RYMQX7J3V3UQ","short_pith_number":"pith:5HZMMGRL","canonical_record":{"source":{"id":"1506.03792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T19:32:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9efb6676f0378dfeb4200426c8709b85083754252895dd252adcbc90f5a2d95d","abstract_canon_sha256":"9c30cfb5a581a219efa50cb0bd3093c0d548e3f56caf2b370224d5f07f8851c4"},"schema_version":"1.0"},"canonical_sha256":"e9f2c61a2b223c83fe38642ff4eebba424756228b5662f63fc6d8256e2514d25","source":{"kind":"arxiv","id":"1506.03792","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03792","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03792v2","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03792","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"5HZMMGRLEI6I","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HZMMGRLEI6IH7RY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HZMMGRL","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5HZMMGRLEI6IH7RYMQX7J3V3UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T19:32:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9efb6676f0378dfeb4200426c8709b85083754252895dd252adcbc90f5a2d95d","abstract_canon_sha256":"9c30cfb5a581a219efa50cb0bd3093c0d548e3f56caf2b370224d5f07f8851c4"},"schema_version":"1.0"},"canonical_sha256":"e9f2c61a2b223c83fe38642ff4eebba424756228b5662f63fc6d8256e2514d25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:00.711965Z","signature_b64":"P2oogID+7H6AfeiuwUviyCEVSNpLNOkb1g34g0tfxyajNKLttK7nzHijIwLUVbSL1NQPzx3nooZwafMm0GcGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f2c61a2b223c83fe38642ff4eebba424756228b5662f63fc6d8256e2514d25","last_reissued_at":"2026-05-18T01:17:00.711298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:00.711298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03792","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:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSZ7c6o9/Nuofj1XLGLxtAuvAZXhKPucURd0tV6omtBrVXN2G6fzg3h/OCPCBXFGAruNuWMsLwvw9Xyhx3SOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:01:57.863141Z"},"content_sha256":"adfaab39c964eec87ccdf3dacfcbe3f7ab2da73e4d7e7a0d8c559af8d15f3d35","schema_version":"1.0","event_id":"sha256:adfaab39c964eec87ccdf3dacfcbe3f7ab2da73e4d7e7a0d8c559af8d15f3d35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5HZMMGRLEI6IH7RYMQX7J3V3UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional Codes with Maximum Column Sum Rank for Network Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, Rafid Mahmood","submitted_at":"2015-06-11T19:32:27Z","abstract_excerpt":"The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank, that parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several known column Hamming distance properties and introduce a new family of convolutional codes that maximize the column sum rank up to the code memory. Our construction involves finding a class of super-regular matrices that preserve this property after multiplication with non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03792","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:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWwIBnb0PFsGm+jjPOSVJP3EJQgoYL6uK1X7UbnrvjHZe9AavPTbabPqUD/hRIg2rCQ+dZK6i3H8fcjkqdujAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:01:57.863866Z"},"content_sha256":"65335adbe2fea36fc375ceff15918d4ace20bcc4dd4d0963b311a4b863c31f05","schema_version":"1.0","event_id":"sha256:65335adbe2fea36fc375ceff15918d4ace20bcc4dd4d0963b311a4b863c31f05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/bundle.json","state_url":"https://pith.science/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/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-22T11:01:57Z","links":{"resolver":"https://pith.science/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ","bundle":"https://pith.science/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/bundle.json","state":"https://pith.science/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HZMMGRLEI6IH7RYMQX7J3V3UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5HZMMGRLEI6IH7RYMQX7J3V3UQ","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":"9c30cfb5a581a219efa50cb0bd3093c0d548e3f56caf2b370224d5f07f8851c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T19:32:27Z","title_canon_sha256":"9efb6676f0378dfeb4200426c8709b85083754252895dd252adcbc90f5a2d95d"},"schema_version":"1.0","source":{"id":"1506.03792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03792","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03792v2","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03792","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"5HZMMGRLEI6I","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HZMMGRLEI6IH7RY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HZMMGRL","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:65335adbe2fea36fc375ceff15918d4ace20bcc4dd4d0963b311a4b863c31f05","target":"graph","created_at":"2026-05-18T01:17: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":"The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank, that parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several known column Hamming distance properties and introduce a new family of convolutional codes that maximize the column sum rank up to the code memory. Our construction involves finding a class of super-regular matrices that preserve this property after multiplication with non","authors_text":"Ahmed Badr, Ashish Khisti, Rafid Mahmood","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T19:32:27Z","title":"Convolutional Codes with Maximum Column Sum Rank for Network Streaming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03792","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:adfaab39c964eec87ccdf3dacfcbe3f7ab2da73e4d7e7a0d8c559af8d15f3d35","target":"record","created_at":"2026-05-18T01:17: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":"9c30cfb5a581a219efa50cb0bd3093c0d548e3f56caf2b370224d5f07f8851c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T19:32:27Z","title_canon_sha256":"9efb6676f0378dfeb4200426c8709b85083754252895dd252adcbc90f5a2d95d"},"schema_version":"1.0","source":{"id":"1506.03792","kind":"arxiv","version":2}},"canonical_sha256":"e9f2c61a2b223c83fe38642ff4eebba424756228b5662f63fc6d8256e2514d25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f2c61a2b223c83fe38642ff4eebba424756228b5662f63fc6d8256e2514d25","first_computed_at":"2026-05-18T01:17:00.711298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:00.711298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P2oogID+7H6AfeiuwUviyCEVSNpLNOkb1g34g0tfxyajNKLttK7nzHijIwLUVbSL1NQPzx3nooZwafMm0GcGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:00.711965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adfaab39c964eec87ccdf3dacfcbe3f7ab2da73e4d7e7a0d8c559af8d15f3d35","sha256:65335adbe2fea36fc375ceff15918d4ace20bcc4dd4d0963b311a4b863c31f05"],"state_sha256":"9d8ba56eaa92f71457f8c8e01221722f48dc7e1d8df0b785ad8bbc6e98d67652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3V6s8fyODaQdm5kaW9/QGufuxef95b8r+mqxyeEo6ci8IklVp6NHp14z7ZXy2u5kOGwUsNyj8IrAewLJNdQhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:01:57.867356Z","bundle_sha256":"0bcfb2f42ab219fd907dfdde1cd6371426cf1e1e262022317a9acc4309f90b5a"}}