{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TF3ZXZ35OPAWY3MESCZBBTOFVZ","short_pith_number":"pith:TF3ZXZ35","canonical_record":{"source":{"id":"1611.09850","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T23:50:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a9d36fd0a2c876a2a8e990606fe4541641b74de45709c4efd7ab308941f5e0c","abstract_canon_sha256":"7b5e7ffcfae8fb56ba4a8fb34eaa356ecad747ad2ec2a429decae0dab7c8bc75"},"schema_version":"1.0"},"canonical_sha256":"99779be77d73c16c6d8490b210cdc5ae500548305183b162450befd01564eedc","source":{"kind":"arxiv","id":"1611.09850","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09850","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09850v5","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09850","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"TF3ZXZ35OPAW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TF3ZXZ35OPAWY3ME","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TF3ZXZ35","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TF3ZXZ35OPAWY3MESCZBBTOFVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09850","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T23:50:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a9d36fd0a2c876a2a8e990606fe4541641b74de45709c4efd7ab308941f5e0c","abstract_canon_sha256":"7b5e7ffcfae8fb56ba4a8fb34eaa356ecad747ad2ec2a429decae0dab7c8bc75"},"schema_version":"1.0"},"canonical_sha256":"99779be77d73c16c6d8490b210cdc5ae500548305183b162450befd01564eedc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:59.311513Z","signature_b64":"6H8nbxtqBVCTqAVWFdZ3bjYLYBMzK4gzGPTUl/RWzw4zwqUPOZtS4PGaqf8mPe6RTwK2iLmDBV7TL/ooW1lQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99779be77d73c16c6d8490b210cdc5ae500548305183b162450befd01564eedc","last_reissued_at":"2026-05-18T00:19:59.310897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:59.310897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09850","source_version":5,"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-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/TJorIGq6ln9Z7eRELYsn/bSkQbpZxEUeJLcnpusBMloijMJcLkSTb7+YoZmtLBCuS+TWDoEnZ4VaI8/fjHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:16:02.248700Z"},"content_sha256":"f687fc8e8c35aad8460c6949dc114960f86c15b17eaf2202996ac84665ed0211","schema_version":"1.0","event_id":"sha256:f687fc8e8c35aad8460c6949dc114960f86c15b17eaf2202996ac84665ed0211"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TF3ZXZ35OPAWY3MESCZBBTOFVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Good Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Giuliano Gadioli La Guardia","submitted_at":"2016-11-28T23:50:07Z","abstract_excerpt":"In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the |u|u+v| construction and the product code construction to these block codes, we construct more new sequences of asymptotically good convolutional codes. Additionally, we show that the proposed construction method presented here also works when applied for all sequences of goo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09850","kind":"arxiv","version":5},"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-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzwFoWAYmYGEzIx23aFsn+0uS00yj8TWgasQAnISVOQUQocoeJfr6tx4FU8sUn3JcnGPxRpMsNSB5dNiyqkWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:16:02.249261Z"},"content_sha256":"7ef8c5a077b0e72ccece1ed470cf19a5f7c2ae7092d8c9e03e7b278419079223","schema_version":"1.0","event_id":"sha256:7ef8c5a077b0e72ccece1ed470cf19a5f7c2ae7092d8c9e03e7b278419079223"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/bundle.json","state_url":"https://pith.science/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/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-06-23T16:16:02Z","links":{"resolver":"https://pith.science/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ","bundle":"https://pith.science/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/bundle.json","state":"https://pith.science/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TF3ZXZ35OPAWY3MESCZBBTOFVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TF3ZXZ35OPAWY3MESCZBBTOFVZ","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":"7b5e7ffcfae8fb56ba4a8fb34eaa356ecad747ad2ec2a429decae0dab7c8bc75","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T23:50:07Z","title_canon_sha256":"7a9d36fd0a2c876a2a8e990606fe4541641b74de45709c4efd7ab308941f5e0c"},"schema_version":"1.0","source":{"id":"1611.09850","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09850","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09850v5","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09850","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"TF3ZXZ35OPAW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TF3ZXZ35OPAWY3ME","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TF3ZXZ35","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:7ef8c5a077b0e72ccece1ed470cf19a5f7c2ae7092d8c9e03e7b278419079223","target":"graph","created_at":"2026-05-18T00:19:59Z","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":"In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the |u|u+v| construction and the product code construction to these block codes, we construct more new sequences of asymptotically good convolutional codes. Additionally, we show that the proposed construction method presented here also works when applied for all sequences of goo","authors_text":"Giuliano Gadioli La Guardia","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T23:50:07Z","title":"Asymptotically Good Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09850","kind":"arxiv","version":5},"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:f687fc8e8c35aad8460c6949dc114960f86c15b17eaf2202996ac84665ed0211","target":"record","created_at":"2026-05-18T00:19:59Z","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":"7b5e7ffcfae8fb56ba4a8fb34eaa356ecad747ad2ec2a429decae0dab7c8bc75","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T23:50:07Z","title_canon_sha256":"7a9d36fd0a2c876a2a8e990606fe4541641b74de45709c4efd7ab308941f5e0c"},"schema_version":"1.0","source":{"id":"1611.09850","kind":"arxiv","version":5}},"canonical_sha256":"99779be77d73c16c6d8490b210cdc5ae500548305183b162450befd01564eedc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99779be77d73c16c6d8490b210cdc5ae500548305183b162450befd01564eedc","first_computed_at":"2026-05-18T00:19:59.310897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:59.310897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6H8nbxtqBVCTqAVWFdZ3bjYLYBMzK4gzGPTUl/RWzw4zwqUPOZtS4PGaqf8mPe6RTwK2iLmDBV7TL/ooW1lQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:59.311513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09850","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f687fc8e8c35aad8460c6949dc114960f86c15b17eaf2202996ac84665ed0211","sha256:7ef8c5a077b0e72ccece1ed470cf19a5f7c2ae7092d8c9e03e7b278419079223"],"state_sha256":"e3dc13b0f4bd44bbab78f664664b639568c9d0bdbe3dbc09ef7b2d013b8e01b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATNPiXHhpUQ/RQRoALAXR569Qm2TBG+Cem+9wBOiP3mpAtP6U3m3t6ykejTkPhiuOIPIr0elEuTyeP/jtbLOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:16:02.251999Z","bundle_sha256":"7a35f25da49790572e8183024a245fb965fdc0fa344a8403eb5566b66ac277e1"}}