{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F2PJYX4NGJLJE73ZTRY3EAJREL","short_pith_number":"pith:F2PJYX4N","schema_version":"1.0","canonical_sha256":"2e9e9c5f8d3256927f799c71b2013122e1d15b006fba932ed28b38bf3cc41daa","source":{"kind":"arxiv","id":"1412.1695","version":4},"attestation_state":"computed","paper":{"title":"Convolutional codes from unit schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Ted Hurley","submitted_at":"2014-12-04T15:17:22Z","abstract_excerpt":"Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and algebraic decoding methods are derived. For a given rate and given error-correction capability at each component, convolutional codes with these specifications and with efficient decoding algorithms are constructed. Explicit prototype examples are given but in general large lengths and large error capability are achievable. Convolutional codes with efficient"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.1695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-12-04T15:17:22Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"91079014549aae832b5636519596a09ca495205ff2441738b618a58c9b1c3515","abstract_canon_sha256":"0e78541b0a72c87d004043536986e5b83790c98eaa82a04fbb526d2605e2262b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:36.284765Z","signature_b64":"oSw8K11lBfXnxUUUnhYkh/8bLG/xrZU6+0gHqhuIIZ6n1NbG88TFWI3rBtClhGygrK/yw57o5SvJy+sEGpmRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e9e9c5f8d3256927f799c71b2013122e1d15b006fba932ed28b38bf3cc41daa","last_reissued_at":"2026-05-18T00:19:36.284059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:36.284059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional codes from unit schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Ted Hurley","submitted_at":"2014-12-04T15:17:22Z","abstract_excerpt":"Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and algebraic decoding methods are derived. For a given rate and given error-correction capability at each component, convolutional codes with these specifications and with efficient decoding algorithms are constructed. Explicit prototype examples are given but in general large lengths and large error capability are achievable. Convolutional codes with efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1695","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1695","created_at":"2026-05-18T00:19:36.284178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1695v4","created_at":"2026-05-18T00:19:36.284178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1695","created_at":"2026-05-18T00:19:36.284178+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2PJYX4NGJLJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2PJYX4NGJLJE73Z","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2PJYX4N","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL","json":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL.json","graph_json":"https://pith.science/api/pith-number/F2PJYX4NGJLJE73ZTRY3EAJREL/graph.json","events_json":"https://pith.science/api/pith-number/F2PJYX4NGJLJE73ZTRY3EAJREL/events.json","paper":"https://pith.science/paper/F2PJYX4N"},"agent_actions":{"view_html":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL","download_json":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL.json","view_paper":"https://pith.science/paper/F2PJYX4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1695&json=true","fetch_graph":"https://pith.science/api/pith-number/F2PJYX4NGJLJE73ZTRY3EAJREL/graph.json","fetch_events":"https://pith.science/api/pith-number/F2PJYX4NGJLJE73ZTRY3EAJREL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL/action/storage_attestation","attest_author":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL/action/author_attestation","sign_citation":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL/action/citation_signature","submit_replication":"https://pith.science/pith/F2PJYX4NGJLJE73ZTRY3EAJREL/action/replication_record"}},"created_at":"2026-05-18T00:19:36.284178+00:00","updated_at":"2026-05-18T00:19:36.284178+00:00"}