{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TYHISSANPTZNDGQMPRPTGCSX66","short_pith_number":"pith:TYHISSAN","canonical_record":{"source":{"id":"1607.07187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T09:30:05Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"52c172c00aceb551025b91205e700996f5c48a2a9e17cf6356f39e8434900a88","abstract_canon_sha256":"bff5242b7a3d7900bde13e1db3793e0632e2fd4f202482246588a00c57e78ae2"},"schema_version":"1.0"},"canonical_sha256":"9e0e89480d7cf2d19a0c7c5f330a57f7888f41a82fbab0815c139f22a16dc7d7","source":{"kind":"arxiv","id":"1607.07187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07187","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07187v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07187","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"TYHISSANPTZN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYHISSANPTZNDGQM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYHISSAN","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TYHISSANPTZNDGQMPRPTGCSX66","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T09:30:05Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"52c172c00aceb551025b91205e700996f5c48a2a9e17cf6356f39e8434900a88","abstract_canon_sha256":"bff5242b7a3d7900bde13e1db3793e0632e2fd4f202482246588a00c57e78ae2"},"schema_version":"1.0"},"canonical_sha256":"9e0e89480d7cf2d19a0c7c5f330a57f7888f41a82fbab0815c139f22a16dc7d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:34.553344Z","signature_b64":"MZnTxdHftaWAkpxlvKgUSfbYtAZug/m1aO9hyPjUvKdA6giO3rCKWRzUQ5Ffbx+GaO9NOv5fIC888dibCRZvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0e89480d7cf2d19a0c7c5f330a57f7888f41a82fbab0815c139f22a16dc7d7","last_reissued_at":"2026-05-18T01:10:34.552872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:34.552872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07187","source_version":1,"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:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fB9rj3DvTt4SUcy/Q8oS/DkcIee/MiReOS9qmIpGrimdipGNdFoExjDZpjsYykvC9Vcsl3gsEt0hBbuaehzaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:48.478232Z"},"content_sha256":"967f17d79985f05b6b9663dd3315ed2eecf11c91aafe02c04fea632a6800806f","schema_version":"1.0","event_id":"sha256:967f17d79985f05b6b9663dd3315ed2eecf11c91aafe02c04fea632a6800806f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TYHISSANPTZNDGQMPRPTGCSX66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sugiyama-like decoding algorithm for convolutional codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"F. J. Lobillo, Gabriel Navarro, Jos\\'e G\\'omez-Torrecillas","submitted_at":"2016-07-25T09:30:05Z","abstract_excerpt":"We propose a decoding algorithm for a class of convolutional codes called skew BCH convolutional codes. These are convolutional codes of designed Hamming distance endowed with a cyclic structure yielding a left ideal of a non-commutative ring (a quotient of a skew polynomial ring). In this setting, right and left division algorithms exist, so our algorithm follows the guidelines of the Sugiyama's procedure for finding the error locator and error evaluator polynomials for BCH block codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07187","kind":"arxiv","version":1},"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:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oMpmAKWJ1O/MXBiLJqVShwSjnPzm7PDBGRgVxTnkS0C5sLl/BZzPgl7gL9Zak1UOdgYlRQcKyg3+Tfbl5mxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:48.478587Z"},"content_sha256":"0d1f93392e0cd1e57a7cd0ea179d6cb4717ea4be4a705aca0e5d50b56fe89a7d","schema_version":"1.0","event_id":"sha256:0d1f93392e0cd1e57a7cd0ea179d6cb4717ea4be4a705aca0e5d50b56fe89a7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYHISSANPTZNDGQMPRPTGCSX66/bundle.json","state_url":"https://pith.science/pith/TYHISSANPTZNDGQMPRPTGCSX66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYHISSANPTZNDGQMPRPTGCSX66/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-30T03:51:48Z","links":{"resolver":"https://pith.science/pith/TYHISSANPTZNDGQMPRPTGCSX66","bundle":"https://pith.science/pith/TYHISSANPTZNDGQMPRPTGCSX66/bundle.json","state":"https://pith.science/pith/TYHISSANPTZNDGQMPRPTGCSX66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYHISSANPTZNDGQMPRPTGCSX66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TYHISSANPTZNDGQMPRPTGCSX66","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":"bff5242b7a3d7900bde13e1db3793e0632e2fd4f202482246588a00c57e78ae2","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T09:30:05Z","title_canon_sha256":"52c172c00aceb551025b91205e700996f5c48a2a9e17cf6356f39e8434900a88"},"schema_version":"1.0","source":{"id":"1607.07187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07187","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07187v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07187","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"TYHISSANPTZN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYHISSANPTZNDGQM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYHISSAN","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:0d1f93392e0cd1e57a7cd0ea179d6cb4717ea4be4a705aca0e5d50b56fe89a7d","target":"graph","created_at":"2026-05-18T01:10:34Z","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 propose a decoding algorithm for a class of convolutional codes called skew BCH convolutional codes. These are convolutional codes of designed Hamming distance endowed with a cyclic structure yielding a left ideal of a non-commutative ring (a quotient of a skew polynomial ring). In this setting, right and left division algorithms exist, so our algorithm follows the guidelines of the Sugiyama's procedure for finding the error locator and error evaluator polynomials for BCH block codes.","authors_text":"F. J. Lobillo, Gabriel Navarro, Jos\\'e G\\'omez-Torrecillas","cross_cats":["math.IT","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T09:30:05Z","title":"A Sugiyama-like decoding algorithm for convolutional codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07187","kind":"arxiv","version":1},"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:967f17d79985f05b6b9663dd3315ed2eecf11c91aafe02c04fea632a6800806f","target":"record","created_at":"2026-05-18T01:10:34Z","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":"bff5242b7a3d7900bde13e1db3793e0632e2fd4f202482246588a00c57e78ae2","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T09:30:05Z","title_canon_sha256":"52c172c00aceb551025b91205e700996f5c48a2a9e17cf6356f39e8434900a88"},"schema_version":"1.0","source":{"id":"1607.07187","kind":"arxiv","version":1}},"canonical_sha256":"9e0e89480d7cf2d19a0c7c5f330a57f7888f41a82fbab0815c139f22a16dc7d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e0e89480d7cf2d19a0c7c5f330a57f7888f41a82fbab0815c139f22a16dc7d7","first_computed_at":"2026-05-18T01:10:34.552872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:34.552872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZnTxdHftaWAkpxlvKgUSfbYtAZug/m1aO9hyPjUvKdA6giO3rCKWRzUQ5Ffbx+GaO9NOv5fIC888dibCRZvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:34.553344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967f17d79985f05b6b9663dd3315ed2eecf11c91aafe02c04fea632a6800806f","sha256:0d1f93392e0cd1e57a7cd0ea179d6cb4717ea4be4a705aca0e5d50b56fe89a7d"],"state_sha256":"a1f3321088e5b676ce5840d9d3c367f62a04a2d83db445a6c6503a78806c98a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92uf5k2eg+n4TCuNK9lGmpwc+iJDZbPUlExtGjc/OG7DprPDxOCsSO94k3/OqujEX1oEEI3K+/lkLuO3HXQhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:51:48.480605Z","bundle_sha256":"c13512cd46105ba4def2dd0a42d33a454c96098c2ac8aa4d9bc9324dd6d181b0"}}