{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SR2Q7UR33RQEU5RXCMXMB5TX2K","short_pith_number":"pith:SR2Q7UR3","schema_version":"1.0","canonical_sha256":"94750fd23bdc604a7637132ec0f677d29a1215e4f28a861464fe11c311cdc555","source":{"kind":"arxiv","id":"1207.2734","version":3},"attestation_state":"computed","paper":{"title":"Information-bit error rate and false positives in an MDS code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"F. J. Lobillo, Gabriel Navarro, Jos\\'e G\\'omez-Torrecillas","submitted_at":"2012-07-11T18:21:55Z","abstract_excerpt":"In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the theoretical approximation of the information-bit and -symbol error rate, in terms of the channel bit-error rate, in a block transmission through a discrete memoryless channel. Since a bounded distance reproducing encoder is assumed, the computation of the here-called false positive (a decoding failure with no information-symbol error) is provided. As a consequ"},"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":"1207.2734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T18:21:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e8b4048b67cf79a8ca633266dee08d6bae8c626ec6ff0ca9d20b706e7eee28b","abstract_canon_sha256":"92e6c90a8d4d05fc839994ce156ea94aad51e0d589827395816103bf46b14ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.032519Z","signature_b64":"Z4SdgjdfcaFTiK8/zbk0CcTP9BPbzVzmJoovO9qpbwiF3peceQtY18BbRYz85CRLB/hXYoH9Pd1qKs9vEHoEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94750fd23bdc604a7637132ec0f677d29a1215e4f28a861464fe11c311cdc555","last_reissued_at":"2026-05-18T01:10:39.032007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.032007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-bit error rate and false positives in an MDS code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"F. J. Lobillo, Gabriel Navarro, Jos\\'e G\\'omez-Torrecillas","submitted_at":"2012-07-11T18:21:55Z","abstract_excerpt":"In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the theoretical approximation of the information-bit and -symbol error rate, in terms of the channel bit-error rate, in a block transmission through a discrete memoryless channel. Since a bounded distance reproducing encoder is assumed, the computation of the here-called false positive (a decoding failure with no information-symbol error) is provided. As a consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2734","kind":"arxiv","version":3},"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":"1207.2734","created_at":"2026-05-18T01:10:39.032086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2734v3","created_at":"2026-05-18T01:10:39.032086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2734","created_at":"2026-05-18T01:10:39.032086+00:00"},{"alias_kind":"pith_short_12","alias_value":"SR2Q7UR33RQE","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SR2Q7UR33RQEU5RX","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SR2Q7UR3","created_at":"2026-05-18T12:27:20.899486+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/SR2Q7UR33RQEU5RXCMXMB5TX2K","json":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K.json","graph_json":"https://pith.science/api/pith-number/SR2Q7UR33RQEU5RXCMXMB5TX2K/graph.json","events_json":"https://pith.science/api/pith-number/SR2Q7UR33RQEU5RXCMXMB5TX2K/events.json","paper":"https://pith.science/paper/SR2Q7UR3"},"agent_actions":{"view_html":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K","download_json":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K.json","view_paper":"https://pith.science/paper/SR2Q7UR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2734&json=true","fetch_graph":"https://pith.science/api/pith-number/SR2Q7UR33RQEU5RXCMXMB5TX2K/graph.json","fetch_events":"https://pith.science/api/pith-number/SR2Q7UR33RQEU5RXCMXMB5TX2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K/action/storage_attestation","attest_author":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K/action/author_attestation","sign_citation":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K/action/citation_signature","submit_replication":"https://pith.science/pith/SR2Q7UR33RQEU5RXCMXMB5TX2K/action/replication_record"}},"created_at":"2026-05-18T01:10:39.032086+00:00","updated_at":"2026-05-18T01:10:39.032086+00:00"}