{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2AWPP7QEZE7O2QKM62GMLJUK3L","short_pith_number":"pith:2AWPP7QE","schema_version":"1.0","canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","source":{"kind":"arxiv","id":"1601.06312","version":2},"attestation_state":"computed","paper":{"title":"Channels with Synchronization/Substitution Errors and Computation of Error Control Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nelma Moreira, Rogerio Reis, Stavros Konstantinidis","submitted_at":"2016-01-23T21:33:18Z","abstract_excerpt":"We introduce the concept of an \\ff-maximal error-detecting block code, for some parameter \\ff{} between 0 and 1, in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our motivation for this is that constructing a maximal error-detecting code is a computationally hard problem. We present a randomized algorithm that takes as input two positive integers $N,\\ell$, a probability value \\ff, and a specification of the errors permitted in some application, and generates an error-detecting, or error-correcting, block code having up to $N$ cod"},"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":"1601.06312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T21:33:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcb49655356854fb7591db12b491a17d4b4743f1a44098e7c07975d1d7b42215","abstract_canon_sha256":"b21d622c253a2689f647389530bae5f7e3fc8c82611e4f07aceab6f439eb280f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:18.133800Z","signature_b64":"sWUclBHStTwmnq1h5a8wYIgFGRR8GCcqKb7v91VYvgXwWV/V38sVF79DQjNG64nX2BqfYqVrLtetThZQkDHwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","last_reissued_at":"2026-05-18T01:10:18.133165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:18.133165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channels with Synchronization/Substitution Errors and Computation of Error Control Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nelma Moreira, Rogerio Reis, Stavros Konstantinidis","submitted_at":"2016-01-23T21:33:18Z","abstract_excerpt":"We introduce the concept of an \\ff-maximal error-detecting block code, for some parameter \\ff{} between 0 and 1, in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our motivation for this is that constructing a maximal error-detecting code is a computationally hard problem. We present a randomized algorithm that takes as input two positive integers $N,\\ell$, a probability value \\ff, and a specification of the errors permitted in some application, and generates an error-detecting, or error-correcting, block code having up to $N$ cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06312","kind":"arxiv","version":2},"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":"1601.06312","created_at":"2026-05-18T01:10:18.133260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06312v2","created_at":"2026-05-18T01:10:18.133260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06312","created_at":"2026-05-18T01:10:18.133260+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AWPP7QEZE7O","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AWPP7QEZE7O2QKM","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AWPP7QE","created_at":"2026-05-18T12:29:52.810259+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/2AWPP7QEZE7O2QKM62GMLJUK3L","json":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L.json","graph_json":"https://pith.science/api/pith-number/2AWPP7QEZE7O2QKM62GMLJUK3L/graph.json","events_json":"https://pith.science/api/pith-number/2AWPP7QEZE7O2QKM62GMLJUK3L/events.json","paper":"https://pith.science/paper/2AWPP7QE"},"agent_actions":{"view_html":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L","download_json":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L.json","view_paper":"https://pith.science/paper/2AWPP7QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06312&json=true","fetch_graph":"https://pith.science/api/pith-number/2AWPP7QEZE7O2QKM62GMLJUK3L/graph.json","fetch_events":"https://pith.science/api/pith-number/2AWPP7QEZE7O2QKM62GMLJUK3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/action/storage_attestation","attest_author":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/action/author_attestation","sign_citation":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/action/citation_signature","submit_replication":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/action/replication_record"}},"created_at":"2026-05-18T01:10:18.133260+00:00","updated_at":"2026-05-18T01:10:18.133260+00:00"}