{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2AWPP7QEZE7O2QKM62GMLJUK3L","short_pith_number":"pith:2AWPP7QE","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"},"canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","source":{"kind":"arxiv","id":"1601.06312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06312","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06312v2","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06312","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"2AWPP7QEZE7O","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2AWPP7QEZE7O2QKM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2AWPP7QE","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2AWPP7QEZE7O2QKM62GMLJUK3L","target":"record","payload":{"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"},"canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","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"},"source_kind":"arxiv","source_id":"1601.06312","source_version":2,"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:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPLv348j7lqNGH5ikI6T6dyD8FxH5RL+bvXRmERPl9KBlP0LQvnG4BWegElgy2gwSHfRrWx7jLavhgSsIKcjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:52:52.997421Z"},"content_sha256":"9dcb1a6dcd3ea76b3e2721ab2a0ee55179e3716c0cc021a3ebc67d9f785220ae","schema_version":"1.0","event_id":"sha256:9dcb1a6dcd3ea76b3e2721ab2a0ee55179e3716c0cc021a3ebc67d9f785220ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2AWPP7QEZE7O2QKM62GMLJUK3L","target":"graph","payload":{"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"},"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:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYLgg2oeDYW+ZHhq3rlJLV+xyuLk0eCnmnG4gzTQZiPb30M4cLfqL1wmPdSlq3hDfhN6Ba8WVwZLToHyyA+7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:52:52.997783Z"},"content_sha256":"17ae3b976b702e8be000cd40287a536b60ce1f25fa43db4f617052c55b7f0511","schema_version":"1.0","event_id":"sha256:17ae3b976b702e8be000cd40287a536b60ce1f25fa43db4f617052c55b7f0511"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/bundle.json","state_url":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/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-20T22:52:52Z","links":{"resolver":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L","bundle":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/bundle.json","state":"https://pith.science/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2AWPP7QEZE7O2QKM62GMLJUK3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2AWPP7QEZE7O2QKM62GMLJUK3L","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":"b21d622c253a2689f647389530bae5f7e3fc8c82611e4f07aceab6f439eb280f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T21:33:18Z","title_canon_sha256":"fcb49655356854fb7591db12b491a17d4b4743f1a44098e7c07975d1d7b42215"},"schema_version":"1.0","source":{"id":"1601.06312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06312","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06312v2","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06312","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"2AWPP7QEZE7O","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2AWPP7QEZE7O2QKM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2AWPP7QE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:17ae3b976b702e8be000cd40287a536b60ce1f25fa43db4f617052c55b7f0511","target":"graph","created_at":"2026-05-18T01:10:18Z","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":"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","authors_text":"Nelma Moreira, Rogerio Reis, Stavros Konstantinidis","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T21:33:18Z","title":"Channels with Synchronization/Substitution Errors and Computation of Error Control Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06312","kind":"arxiv","version":2},"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:9dcb1a6dcd3ea76b3e2721ab2a0ee55179e3716c0cc021a3ebc67d9f785220ae","target":"record","created_at":"2026-05-18T01:10:18Z","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":"b21d622c253a2689f647389530bae5f7e3fc8c82611e4f07aceab6f439eb280f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T21:33:18Z","title_canon_sha256":"fcb49655356854fb7591db12b491a17d4b4743f1a44098e7c07975d1d7b42215"},"schema_version":"1.0","source":{"id":"1601.06312","kind":"arxiv","version":2}},"canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d02cf7fe04c93eed414cf68cc5a68adad30309f0f03d8bfdb5a44da0cdcc26ee","first_computed_at":"2026-05-18T01:10:18.133165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:18.133165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sWUclBHStTwmnq1h5a8wYIgFGRR8GCcqKb7v91VYvgXwWV/V38sVF79DQjNG64nX2BqfYqVrLtetThZQkDHwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:18.133800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dcb1a6dcd3ea76b3e2721ab2a0ee55179e3716c0cc021a3ebc67d9f785220ae","sha256:17ae3b976b702e8be000cd40287a536b60ce1f25fa43db4f617052c55b7f0511"],"state_sha256":"6c425ce8cde9f25dee2f3cc3540a781cab6d4a2e87f3692fff01dcdd5dd122dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bi0+kasCHndMrx3VuZaJSY0+3Duc6ovnBg9tcZWoXFpwdqn1w5TeFPtEs8E9oes3sssk3l/CB2rtz+7oIXf5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:52:52.999702Z","bundle_sha256":"e8606a67a9f19c31a33ead1199562bfd9d90a390b49c2432a186281e50e0f17c"}}