{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SXAF7H4GGTCAZCTW55454MXWOZ","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":"84d2fd60df2c4844f2d2b66d9c10d1a6d58b2ad0e366750e65d59c5a119dfe79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-03T04:15:13Z","title_canon_sha256":"87dee05cb95315dad132e837ba37648f0d8df018784739e1dd0e7399da1134a7"},"schema_version":"1.0","source":{"id":"1607.00588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00588","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00588v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00588","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"SXAF7H4GGTCA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SXAF7H4GGTCAZCTW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SXAF7H4G","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:b845f733b7d957f85a3d77c28f1414997de1a8943ad45a114a12971e303c7b20","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"When data is stored, compressed, or communicated through a media such as cable or air, sources of noise and other parameters such as EMI, crosstalk, and distance can considerably affect the reliability of these data. Error detection and correction techniques are therefore required. Orthogonal Code is one of the codes that can detect errors and correct corrupted data. An n-bit orthogonal code has n/2 1s and n/2 0s. In a previous work these properties have been exploited to detect and correct errors. In this paper we present a new methodology to enhance error detection capabilities of the orthog","authors_text":"Aparna Dhirde, Naima Kaabouch, Saleh Faruque","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-03T04:15:13Z","title":"Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00588","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:3c8752ca02ec940db4e6013346723ff6841948c2f9826804a878256843e81e7b","target":"record","created_at":"2026-05-18T00:57:49Z","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":"84d2fd60df2c4844f2d2b66d9c10d1a6d58b2ad0e366750e65d59c5a119dfe79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-03T04:15:13Z","title_canon_sha256":"87dee05cb95315dad132e837ba37648f0d8df018784739e1dd0e7399da1134a7"},"schema_version":"1.0","source":{"id":"1607.00588","kind":"arxiv","version":1}},"canonical_sha256":"95c05f9f8634c40c8a76ef79de32f6764b5f704bdb703e6d6affa0e7afb74455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95c05f9f8634c40c8a76ef79de32f6764b5f704bdb703e6d6affa0e7afb74455","first_computed_at":"2026-05-18T00:57:49.562329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.562329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i7tkvOCnQ3mTAgBCluM2NQRIXi7yr4k5ZUEik8C/4jQXOhD8BA3tO5IP7eAbkUF69sqjvGHDZx3RQq29xfF8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.562808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8752ca02ec940db4e6013346723ff6841948c2f9826804a878256843e81e7b","sha256:b845f733b7d957f85a3d77c28f1414997de1a8943ad45a114a12971e303c7b20"],"state_sha256":"21f754babc68c60392cf2c9242ba95d45cb010f0657a7fe234e21a83eb4f0bdb"}