{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JB6LO4JTD6OKPZ4ITMYCGWA2QB","short_pith_number":"pith:JB6LO4JT","canonical_record":{"source":{"id":"1902.09525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c84a0d91aa5db1ce2a4ddc5278dbd201f85a563b8eb51e0bc650ad7574fb1680","abstract_canon_sha256":"ba26958413b5d1050c5be62640befb6548420ea5e277d10cef3570bd54014c28"},"schema_version":"1.0"},"canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","source":{"kind":"arxiv","id":"1902.09525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09525","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09525v1","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09525","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"JB6LO4JTD6OK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JB6LO4JTD6OKPZ4I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JB6LO4JT","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JB6LO4JTD6OKPZ4ITMYCGWA2QB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c84a0d91aa5db1ce2a4ddc5278dbd201f85a563b8eb51e0bc650ad7574fb1680","abstract_canon_sha256":"ba26958413b5d1050c5be62640befb6548420ea5e277d10cef3570bd54014c28"},"schema_version":"1.0"},"canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:45.293925Z","signature_b64":"mAq8gO3/LQjD1mvV9Ae7o8HLaXH1Y3ppU1kD5ZokCTb4Fuhd7e4mUHDZr1DtDpHxLJe1hx4OROgGeDMnrElCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","last_reissued_at":"2026-05-17T23:52:45.293163Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:45.293163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09525","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-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NSOyJ99DewrvK3WaGsC8TMworbQMBhUuJutY9luYEdGx7tM9iYVTtSCE+HqdKvMBcrSIkY3PnWx9BSHLFSlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:32.153146Z"},"content_sha256":"43b9481c2098bd709324db9a4dac81de036b04aff246a2c75f2d9d76c9967553","schema_version":"1.0","event_id":"sha256:43b9481c2098bd709324db9a4dac81de036b04aff246a2c75f2d9d76c9967553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JB6LO4JTD6OKPZ4ITMYCGWA2QB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude D'Amours, Gurgen Khachatrian, Halim Yanikomeroglu, Hovannes Kulhandjian, Michel Kulhandjian","submitted_at":"2019-02-24T01:24:46Z","abstract_excerpt":"In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09525","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-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEc8zNY+e+fpOm3pC6S7Ij1+Pv6X4XUop+PYsjQ142ZjH53PlcRBkm4FndNpCSedeuvYcS3KnZrXQ9s/tl7mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:32.153847Z"},"content_sha256":"8eaac19952e9b61d118d1cfcc32ec9ad78f7eebaca308ff0b1431be35b847692","schema_version":"1.0","event_id":"sha256:8eaac19952e9b61d118d1cfcc32ec9ad78f7eebaca308ff0b1431be35b847692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/bundle.json","state_url":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/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-11T21:09:32Z","links":{"resolver":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB","bundle":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/bundle.json","state":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JB6LO4JTD6OKPZ4ITMYCGWA2QB","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":"ba26958413b5d1050c5be62640befb6548420ea5e277d10cef3570bd54014c28","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","title_canon_sha256":"c84a0d91aa5db1ce2a4ddc5278dbd201f85a563b8eb51e0bc650ad7574fb1680"},"schema_version":"1.0","source":{"id":"1902.09525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09525","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09525v1","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09525","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"JB6LO4JTD6OK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JB6LO4JTD6OKPZ4I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JB6LO4JT","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:8eaac19952e9b61d118d1cfcc32ec9ad78f7eebaca308ff0b1431be35b847692","target":"graph","created_at":"2026-05-17T23:52:45Z","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":"In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that th","authors_text":"Claude D'Amours, Gurgen Khachatrian, Halim Yanikomeroglu, Hovannes Kulhandjian, Michel Kulhandjian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","title":"Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09525","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:43b9481c2098bd709324db9a4dac81de036b04aff246a2c75f2d9d76c9967553","target":"record","created_at":"2026-05-17T23:52:45Z","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":"ba26958413b5d1050c5be62640befb6548420ea5e277d10cef3570bd54014c28","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","title_canon_sha256":"c84a0d91aa5db1ce2a4ddc5278dbd201f85a563b8eb51e0bc650ad7574fb1680"},"schema_version":"1.0","source":{"id":"1902.09525","kind":"arxiv","version":1}},"canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","first_computed_at":"2026-05-17T23:52:45.293163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:45.293163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mAq8gO3/LQjD1mvV9Ae7o8HLaXH1Y3ppU1kD5ZokCTb4Fuhd7e4mUHDZr1DtDpHxLJe1hx4OROgGeDMnrElCAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:45.293925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43b9481c2098bd709324db9a4dac81de036b04aff246a2c75f2d9d76c9967553","sha256:8eaac19952e9b61d118d1cfcc32ec9ad78f7eebaca308ff0b1431be35b847692"],"state_sha256":"16dfb1d1ea05c0ddf756524b8443d148b63c0d12d8c02d68c5b04d0086f69f4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVq3/nD7e3oggy2mIOdlRMipWSR6BsknIsQIZoozaZqjKG6jU73yOyBBF2Gb8BC80jIl+ZS8K+x4jlsL1+C0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:09:32.157728Z","bundle_sha256":"24a97c9983f87f6c5ffcd26c22dab5035f89bb8a38b92c76acfb03bd755cef36"}}