{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EWVBNUPRJ5Z2OOKO5GJLNBJXFB","short_pith_number":"pith:EWVBNUPR","canonical_record":{"source":{"id":"1408.1546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-07T11:25:11Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"58921c95a67381a673b408de2d551a592030d4fa48c9634be6c0c19dd784b86a","abstract_canon_sha256":"36194dc6d7e0cfecaa14c3770a18c5460492d25caa070933e1a90f912a5a8c75"},"schema_version":"1.0"},"canonical_sha256":"25aa16d1f14f73a7394ee992b68537286165229e217927480682ecd2134e003a","source":{"kind":"arxiv","id":"1408.1546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1546","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1546v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1546","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"EWVBNUPRJ5Z2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWVBNUPRJ5Z2OOKO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWVBNUPR","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EWVBNUPRJ5Z2OOKO5GJLNBJXFB","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-07T11:25:11Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"58921c95a67381a673b408de2d551a592030d4fa48c9634be6c0c19dd784b86a","abstract_canon_sha256":"36194dc6d7e0cfecaa14c3770a18c5460492d25caa070933e1a90f912a5a8c75"},"schema_version":"1.0"},"canonical_sha256":"25aa16d1f14f73a7394ee992b68537286165229e217927480682ecd2134e003a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.214664Z","signature_b64":"45aQ3inlEGq7b78gea/ZbDmBmcIdYbBTjXhO+yuKCyPn7fJpjBuzyW3XE/cHIX40N5jMRofDc5I9RPUf56snBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25aa16d1f14f73a7394ee992b68537286165229e217927480682ecd2134e003a","last_reissued_at":"2026-05-18T02:45:40.214232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.214232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1546","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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CN+NOqjUQvWg1/H2WB9EyAmFF+ZMt4MLreG3/mkC4Z7qpdrFegoB0DsLZysCumi4cpdU6Szmsapvr7US6ijuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:05.009488Z"},"content_sha256":"95a56e88001551014ebf3285804294a17b135383b144284f72f95651821f9a9a","schema_version":"1.0","event_id":"sha256:95a56e88001551014ebf3285804294a17b135383b144284f72f95651821f9a9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EWVBNUPRJ5Z2OOKO5GJLNBJXFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ideal codes over separable ring extensions","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":"2014-08-07T11:25:11Z","abstract_excerpt":"This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all previously known as well as new non trivial examples. It is proved that ideal codes are direct summands as left ideals of the underlying non-commutative algebra, in analogy with cyclic block codes. This implies, in particular, that they are generated by an idempotent element. Hence, by using a suitable separability element, we design an efficient algorithm for com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1546","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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mV3KXvLWof+rcFKckyElxFx6EUirDVoGUKIHDFchb0Ib4jK01Mp8O7TyhHe9XcSvNDM+jBQ66BcA69mxTbhRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:05.009840Z"},"content_sha256":"7453ddef46168eea29a4f1e3a4d19ec3f971abaf450c722f92541afab95684d2","schema_version":"1.0","event_id":"sha256:7453ddef46168eea29a4f1e3a4d19ec3f971abaf450c722f92541afab95684d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/bundle.json","state_url":"https://pith.science/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/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-30T07:43:05Z","links":{"resolver":"https://pith.science/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB","bundle":"https://pith.science/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/bundle.json","state":"https://pith.science/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWVBNUPRJ5Z2OOKO5GJLNBJXFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EWVBNUPRJ5Z2OOKO5GJLNBJXFB","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":"36194dc6d7e0cfecaa14c3770a18c5460492d25caa070933e1a90f912a5a8c75","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-07T11:25:11Z","title_canon_sha256":"58921c95a67381a673b408de2d551a592030d4fa48c9634be6c0c19dd784b86a"},"schema_version":"1.0","source":{"id":"1408.1546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1546","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1546v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1546","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"EWVBNUPRJ5Z2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWVBNUPRJ5Z2OOKO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWVBNUPR","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:7453ddef46168eea29a4f1e3a4d19ec3f971abaf450c722f92541afab95684d2","target":"graph","created_at":"2026-05-18T02:45:40Z","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":"This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all previously known as well as new non trivial examples. It is proved that ideal codes are direct summands as left ideals of the underlying non-commutative algebra, in analogy with cyclic block codes. This implies, in particular, that they are generated by an idempotent element. Hence, by using a suitable separability element, we design an efficient algorithm for com","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":"2014-08-07T11:25:11Z","title":"Ideal codes over separable ring extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1546","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:95a56e88001551014ebf3285804294a17b135383b144284f72f95651821f9a9a","target":"record","created_at":"2026-05-18T02:45:40Z","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":"36194dc6d7e0cfecaa14c3770a18c5460492d25caa070933e1a90f912a5a8c75","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-07T11:25:11Z","title_canon_sha256":"58921c95a67381a673b408de2d551a592030d4fa48c9634be6c0c19dd784b86a"},"schema_version":"1.0","source":{"id":"1408.1546","kind":"arxiv","version":1}},"canonical_sha256":"25aa16d1f14f73a7394ee992b68537286165229e217927480682ecd2134e003a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25aa16d1f14f73a7394ee992b68537286165229e217927480682ecd2134e003a","first_computed_at":"2026-05-18T02:45:40.214232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.214232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"45aQ3inlEGq7b78gea/ZbDmBmcIdYbBTjXhO+yuKCyPn7fJpjBuzyW3XE/cHIX40N5jMRofDc5I9RPUf56snBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.214664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a56e88001551014ebf3285804294a17b135383b144284f72f95651821f9a9a","sha256:7453ddef46168eea29a4f1e3a4d19ec3f971abaf450c722f92541afab95684d2"],"state_sha256":"2213f9be03d37baedd2cf30b383f16f6c6b3838f348282e6d231226a0cfdce2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qi25L63OnSzHi05e4g2SYN1VWDsVKIRtdKojaWo2LmI403RAfu36jX+FCmGCR55gEDzOLRNfton1BsM4HDHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:43:05.011949Z","bundle_sha256":"2748a5af06e94472305d304cbbeb130225aa9cf41196318c8871851f8e8b523f"}}