{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FW6PJND2DV2XJ4CHBL36QVK53S","short_pith_number":"pith:FW6PJND2","canonical_record":{"source":{"id":"1506.02990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T16:37:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be3954c4756e8e3e133cadc088651f0c4b715da8a006870e5888a5dfd3dacaa7","abstract_canon_sha256":"db6b8ce4e4ff4d7d309f33208ce69c5243bf08028b6a6ab97a30013f75cbb972"},"schema_version":"1.0"},"canonical_sha256":"2dbcf4b47a1d7574f0470af7e8555ddc89878a7565b74e6900c7178b291fa9ef","source":{"kind":"arxiv","id":"1506.02990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02990","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02990v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02990","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"FW6PJND2DV2X","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FW6PJND2DV2XJ4CH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FW6PJND2","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FW6PJND2DV2XJ4CHBL36QVK53S","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T16:37:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be3954c4756e8e3e133cadc088651f0c4b715da8a006870e5888a5dfd3dacaa7","abstract_canon_sha256":"db6b8ce4e4ff4d7d309f33208ce69c5243bf08028b6a6ab97a30013f75cbb972"},"schema_version":"1.0"},"canonical_sha256":"2dbcf4b47a1d7574f0470af7e8555ddc89878a7565b74e6900c7178b291fa9ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.299268Z","signature_b64":"rf0zmBr1T1qyld2e+6+aekHh8Uf6He7JZQW7KHDHn1lrZhZA7SOo6BEnbRdUU6UpPPw0pWEiNZyaeiT1fB5cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dbcf4b47a1d7574f0470af7e8555ddc89878a7565b74e6900c7178b291fa9ef","last_reissued_at":"2026-05-18T01:55:40.298268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.298268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02990","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:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3JYE/6y9whHR25XvAna0GoqHHoJvGMXIWBoMXVVEWza2CTZ18cAxMIIuAH2I3BhQiXm+cFVqkcK1zFBFZtrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:57:23.379491Z"},"content_sha256":"fda619f09535f9416aaa3b5b3ca647224892f55e5892f5b776ff0412dbcd2b05","schema_version":"1.0","event_id":"sha256:fda619f09535f9416aaa3b5b3ca647224892f55e5892f5b776ff0412dbcd2b05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FW6PJND2DV2XJ4CHBL36QVK53S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional-Code-Specific CRC Code Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Daneshrad, Chung-Yu Lou, Richard D. Wesel","submitted_at":"2015-06-09T16:37:15Z","abstract_excerpt":"Cyclic redundancy check (CRC) codes check if a codeword is correctly received. This paper presents an algorithm to design CRC codes that are optimized for the code-specific error behavior of a specified feedforward convolutional code. The algorithm utilizes two distinct approaches to computing undetected error probability of a CRC code used with a specific convolutional code. The first approach enumerates the error patterns of the convolutional code and tests if each of them is detectable. The second approach reduces complexity significantly by exploiting the equivalence of the undetected erro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02990","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:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nH5544xEU6MhShB1Vb275hRRVWMMLnMAEjTEFI8v31SUtMysXxLPlBdOkunLjURz3tuU9HNVvByboh+zVHgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:57:23.379840Z"},"content_sha256":"03059fa0351a977022d1582321d2a6dabd998cf2f827f9b806bdc9be258a8008","schema_version":"1.0","event_id":"sha256:03059fa0351a977022d1582321d2a6dabd998cf2f827f9b806bdc9be258a8008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FW6PJND2DV2XJ4CHBL36QVK53S/bundle.json","state_url":"https://pith.science/pith/FW6PJND2DV2XJ4CHBL36QVK53S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FW6PJND2DV2XJ4CHBL36QVK53S/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-28T05:57:23Z","links":{"resolver":"https://pith.science/pith/FW6PJND2DV2XJ4CHBL36QVK53S","bundle":"https://pith.science/pith/FW6PJND2DV2XJ4CHBL36QVK53S/bundle.json","state":"https://pith.science/pith/FW6PJND2DV2XJ4CHBL36QVK53S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FW6PJND2DV2XJ4CHBL36QVK53S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FW6PJND2DV2XJ4CHBL36QVK53S","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":"db6b8ce4e4ff4d7d309f33208ce69c5243bf08028b6a6ab97a30013f75cbb972","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T16:37:15Z","title_canon_sha256":"be3954c4756e8e3e133cadc088651f0c4b715da8a006870e5888a5dfd3dacaa7"},"schema_version":"1.0","source":{"id":"1506.02990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02990","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02990v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02990","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"FW6PJND2DV2X","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FW6PJND2DV2XJ4CH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FW6PJND2","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:03059fa0351a977022d1582321d2a6dabd998cf2f827f9b806bdc9be258a8008","target":"graph","created_at":"2026-05-18T01:55: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":"Cyclic redundancy check (CRC) codes check if a codeword is correctly received. This paper presents an algorithm to design CRC codes that are optimized for the code-specific error behavior of a specified feedforward convolutional code. The algorithm utilizes two distinct approaches to computing undetected error probability of a CRC code used with a specific convolutional code. The first approach enumerates the error patterns of the convolutional code and tests if each of them is detectable. The second approach reduces complexity significantly by exploiting the equivalence of the undetected erro","authors_text":"Babak Daneshrad, Chung-Yu Lou, Richard D. Wesel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T16:37:15Z","title":"Convolutional-Code-Specific CRC Code Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02990","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:fda619f09535f9416aaa3b5b3ca647224892f55e5892f5b776ff0412dbcd2b05","target":"record","created_at":"2026-05-18T01:55: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":"db6b8ce4e4ff4d7d309f33208ce69c5243bf08028b6a6ab97a30013f75cbb972","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T16:37:15Z","title_canon_sha256":"be3954c4756e8e3e133cadc088651f0c4b715da8a006870e5888a5dfd3dacaa7"},"schema_version":"1.0","source":{"id":"1506.02990","kind":"arxiv","version":1}},"canonical_sha256":"2dbcf4b47a1d7574f0470af7e8555ddc89878a7565b74e6900c7178b291fa9ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dbcf4b47a1d7574f0470af7e8555ddc89878a7565b74e6900c7178b291fa9ef","first_computed_at":"2026-05-18T01:55:40.298268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.298268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rf0zmBr1T1qyld2e+6+aekHh8Uf6He7JZQW7KHDHn1lrZhZA7SOo6BEnbRdUU6UpPPw0pWEiNZyaeiT1fB5cAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.299268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fda619f09535f9416aaa3b5b3ca647224892f55e5892f5b776ff0412dbcd2b05","sha256:03059fa0351a977022d1582321d2a6dabd998cf2f827f9b806bdc9be258a8008"],"state_sha256":"7ce4bf84bb6e651b647a7298b4eeb150bebea7b28aa5160f0667c8e5d572ba4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mYSlNH9aDRldIR3pnN2d1EnfnT4iFzUhQhl7mHJVbea9p6pMAtUviYpZAAT90WvBIgBoL1HhzBD6Lw/09KXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:57:23.381780Z","bundle_sha256":"3b579b920af03c4cbcba045251511cb6c6ef49a3adeb4a86ae748d8f5813be41"}}