{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M2XJ6CEHJ45C57JJSY74262Q5L","short_pith_number":"pith:M2XJ6CEH","canonical_record":{"source":{"id":"1801.02890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T11:31:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27bb0f11a843be385fb3c126a8d69bcc745ced8fb24a04fbaeb79586aedc5126","abstract_canon_sha256":"103309b85e2782cf0840065288332f881514a25effe2b0b619ab88ef3361274e"},"schema_version":"1.0"},"canonical_sha256":"66ae9f08874f3a2efd29963fcd7b50eafff459e9eec77cbc78785b5792cb1d56","source":{"kind":"arxiv","id":"1801.02890","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02890","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02890v3","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02890","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"M2XJ6CEHJ45C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2XJ6CEHJ45C57JJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2XJ6CEH","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M2XJ6CEHJ45C57JJSY74262Q5L","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T11:31:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27bb0f11a843be385fb3c126a8d69bcc745ced8fb24a04fbaeb79586aedc5126","abstract_canon_sha256":"103309b85e2782cf0840065288332f881514a25effe2b0b619ab88ef3361274e"},"schema_version":"1.0"},"canonical_sha256":"66ae9f08874f3a2efd29963fcd7b50eafff459e9eec77cbc78785b5792cb1d56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.986015Z","signature_b64":"rOi6QHxS9qrQfKRigy3mN57/hQuPGOayeLEU9gyXnK4pd0eppVRUPXG9cXznqCWq+fbLMstOCeZoGr+rgCByCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ae9f08874f3a2efd29963fcd7b50eafff459e9eec77cbc78785b5792cb1d56","last_reissued_at":"2026-05-17T23:59:22.985645Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.985645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02890","source_version":3,"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:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AojHzMDiHix3j0ZCBWj3hui48pnZyVoPQigeCeFtZ30IbluaHoPLRPTZU70cOKCxoj5XUbDLHUwq1ncmvIAZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:32:10.464021Z"},"content_sha256":"618851cb3d548b612e018790497f9fe895223709e45697fa166cc45104ec966f","schema_version":"1.0","event_id":"sha256:618851cb3d548b612e018790497f9fe895223709e45697fa166cc45104ec966f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M2XJ6CEHJ45C57JJSY74262Q5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Noel, Andrew W. Eckford, Nan Yang, Rodney A. Kennedy, Yuting Fang","submitted_at":"2018-01-09T11:31:27Z","abstract_excerpt":"In this paper, symbol-by-symbol maximum likelihood (ML) detection is proposed for a cooperative diffusion-based molecular communication (MC) system. In this system, the transmitter (TX) sends a common information symbol to multiple receivers (RXs) and a fusion center (FC) chooses the TX symbol that is more likely, given the likelihood of its observations from all RXs. The transmission of a sequence of binary symbols and the resultant intersymbol interference are considered in the cooperative MC system. Three ML detection variants are proposed according to different RX behaviors and different k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02890","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"},"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:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlsVYIxJ/PPNpAJV+ROFy8jglH8AZJ6TNWvBcYO2ID9g66E7aIhX60gw6R7rmSi0ndyL5Rftvt5GcnqDpcTdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:32:10.464698Z"},"content_sha256":"940a2d51c6bfa95c326a974e8ee6d320c2775ba2579d0db959fb2148a83cc73c","schema_version":"1.0","event_id":"sha256:940a2d51c6bfa95c326a974e8ee6d320c2775ba2579d0db959fb2148a83cc73c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2XJ6CEHJ45C57JJSY74262Q5L/bundle.json","state_url":"https://pith.science/pith/M2XJ6CEHJ45C57JJSY74262Q5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2XJ6CEHJ45C57JJSY74262Q5L/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-04T05:32:10Z","links":{"resolver":"https://pith.science/pith/M2XJ6CEHJ45C57JJSY74262Q5L","bundle":"https://pith.science/pith/M2XJ6CEHJ45C57JJSY74262Q5L/bundle.json","state":"https://pith.science/pith/M2XJ6CEHJ45C57JJSY74262Q5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2XJ6CEHJ45C57JJSY74262Q5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M2XJ6CEHJ45C57JJSY74262Q5L","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":"103309b85e2782cf0840065288332f881514a25effe2b0b619ab88ef3361274e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T11:31:27Z","title_canon_sha256":"27bb0f11a843be385fb3c126a8d69bcc745ced8fb24a04fbaeb79586aedc5126"},"schema_version":"1.0","source":{"id":"1801.02890","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02890","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02890v3","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02890","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"M2XJ6CEHJ45C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2XJ6CEHJ45C57JJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2XJ6CEH","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:940a2d51c6bfa95c326a974e8ee6d320c2775ba2579d0db959fb2148a83cc73c","target":"graph","created_at":"2026-05-17T23:59:22Z","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, symbol-by-symbol maximum likelihood (ML) detection is proposed for a cooperative diffusion-based molecular communication (MC) system. In this system, the transmitter (TX) sends a common information symbol to multiple receivers (RXs) and a fusion center (FC) chooses the TX symbol that is more likely, given the likelihood of its observations from all RXs. The transmission of a sequence of binary symbols and the resultant intersymbol interference are considered in the cooperative MC system. Three ML detection variants are proposed according to different RX behaviors and different k","authors_text":"Adam Noel, Andrew W. Eckford, Nan Yang, Rodney A. Kennedy, Yuting Fang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T11:31:27Z","title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02890","kind":"arxiv","version":3},"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:618851cb3d548b612e018790497f9fe895223709e45697fa166cc45104ec966f","target":"record","created_at":"2026-05-17T23:59:22Z","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":"103309b85e2782cf0840065288332f881514a25effe2b0b619ab88ef3361274e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T11:31:27Z","title_canon_sha256":"27bb0f11a843be385fb3c126a8d69bcc745ced8fb24a04fbaeb79586aedc5126"},"schema_version":"1.0","source":{"id":"1801.02890","kind":"arxiv","version":3}},"canonical_sha256":"66ae9f08874f3a2efd29963fcd7b50eafff459e9eec77cbc78785b5792cb1d56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66ae9f08874f3a2efd29963fcd7b50eafff459e9eec77cbc78785b5792cb1d56","first_computed_at":"2026-05-17T23:59:22.985645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:22.985645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOi6QHxS9qrQfKRigy3mN57/hQuPGOayeLEU9gyXnK4pd0eppVRUPXG9cXznqCWq+fbLMstOCeZoGr+rgCByCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:22.986015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02890","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:618851cb3d548b612e018790497f9fe895223709e45697fa166cc45104ec966f","sha256:940a2d51c6bfa95c326a974e8ee6d320c2775ba2579d0db959fb2148a83cc73c"],"state_sha256":"dbccfdce056f1db9a9ff28c9a595e0d86042c42becf91ce1dc1c526e1d371b66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7U/gkPkJrhZr+IuJkM2Q40DJiAgCO9Iifglk47PhFCiUzwwbxt8AFkh1i0EL8/Xvk68xhWlgJmJmf88R5VmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:32:10.467237Z","bundle_sha256":"518759de13d29ad5387285e72e90dbf4bbe8a6744ac29fbd23c6e2040f1c72f2"}}