{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:APVJTXSEXMNBSTCZLG7BQGOMZA","short_pith_number":"pith:APVJTXSE","canonical_record":{"source":{"id":"1812.04476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-08T05:41:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3748c82bd8452f590f69acd4e53523aaf3c88f5b2c18f9509259177668bdaf00","abstract_canon_sha256":"a47a42e7e8bdee1a08ff82c942eb8dbf8eb53524a35bf4396ce4ba5a04d8d4d8"},"schema_version":"1.0"},"canonical_sha256":"03ea99de44bb1a194c5959be1819ccc801131b313642311ce1f828a6cac873d3","source":{"kind":"arxiv","id":"1812.04476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04476","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04476v1","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04476","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"APVJTXSEXMNB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"APVJTXSEXMNBSTCZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"APVJTXSE","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:APVJTXSEXMNBSTCZLG7BQGOMZA","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-08T05:41:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3748c82bd8452f590f69acd4e53523aaf3c88f5b2c18f9509259177668bdaf00","abstract_canon_sha256":"a47a42e7e8bdee1a08ff82c942eb8dbf8eb53524a35bf4396ce4ba5a04d8d4d8"},"schema_version":"1.0"},"canonical_sha256":"03ea99de44bb1a194c5959be1819ccc801131b313642311ce1f828a6cac873d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.944184Z","signature_b64":"HT0Cug3yowgIKWm8t7QCordlwMi1Cpaf3UyD4iocp/XVlIKtePz1qTGmvZzYWG/GKjQZYZQglBYt9hSp1ZpwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03ea99de44bb1a194c5959be1819ccc801131b313642311ce1f828a6cac873d3","last_reissued_at":"2026-05-17T23:58:31.943578Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.943578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04476","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTIZuVU0e0X3VaVGrlXilN6xnhJjbvfMRs/2QDMkPj9c9IYY/dWKNGvlstth43Kf4zD1fGVJwDuDfXe2MKwgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:28:19.268688Z"},"content_sha256":"c3fbd8e3471872d39041865ea2677f1bea117075f55514d8072c2395fbec3727","schema_version":"1.0","event_id":"sha256:c3fbd8e3471872d39041865ea2677f1bea117075f55514d8072c2395fbec3727"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:APVJTXSEXMNBSTCZLG7BQGOMZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication System Design and Analysis for Asynchronous Molecular Timing Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Andrea Goldsmith, Andrew Eckford, Chan-Byoung Chae, Nariman Farsad, Weisi Guo, Yonathan Murin","submitted_at":"2018-12-08T05:41:39Z","abstract_excerpt":"Two new asynchronous modulation techniques for molecular timing (MT) channels are proposed. One based on modulating information on the time between two consecutive releases of indistinguishable information particles, and one based on using distinguishable particles. For comparison, we consider the synchronized modulation scheme where information is encoded in the time of release and decoded from the time of arrival of particles. We show that all three modulation techniques result in a system that can be modeled as an additive noise channel, and we derive the expression for the probability dens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04476","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qtSXLWFxH5M/qysvH08/j9hTZzVTmyG/g7913S4u8qUwiEEFsIJ8Gyp6uGeAekp8BjyDvEat6+Qo0WZmf4DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:28:19.269044Z"},"content_sha256":"89c1c65e7b43a9d188e2fbc07e9b0e5063a50ca1f2011db437c640687e6bdadf","schema_version":"1.0","event_id":"sha256:89c1c65e7b43a9d188e2fbc07e9b0e5063a50ca1f2011db437c640687e6bdadf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/bundle.json","state_url":"https://pith.science/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/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-02T19:28:19Z","links":{"resolver":"https://pith.science/pith/APVJTXSEXMNBSTCZLG7BQGOMZA","bundle":"https://pith.science/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/bundle.json","state":"https://pith.science/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APVJTXSEXMNBSTCZLG7BQGOMZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:APVJTXSEXMNBSTCZLG7BQGOMZA","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":"a47a42e7e8bdee1a08ff82c942eb8dbf8eb53524a35bf4396ce4ba5a04d8d4d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-08T05:41:39Z","title_canon_sha256":"3748c82bd8452f590f69acd4e53523aaf3c88f5b2c18f9509259177668bdaf00"},"schema_version":"1.0","source":{"id":"1812.04476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04476","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04476v1","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04476","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"APVJTXSEXMNB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"APVJTXSEXMNBSTCZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"APVJTXSE","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:89c1c65e7b43a9d188e2fbc07e9b0e5063a50ca1f2011db437c640687e6bdadf","target":"graph","created_at":"2026-05-17T23:58:31Z","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":"Two new asynchronous modulation techniques for molecular timing (MT) channels are proposed. One based on modulating information on the time between two consecutive releases of indistinguishable information particles, and one based on using distinguishable particles. For comparison, we consider the synchronized modulation scheme where information is encoded in the time of release and decoded from the time of arrival of particles. We show that all three modulation techniques result in a system that can be modeled as an additive noise channel, and we derive the expression for the probability dens","authors_text":"Andrea Goldsmith, Andrew Eckford, Chan-Byoung Chae, Nariman Farsad, Weisi Guo, Yonathan Murin","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-08T05:41:39Z","title":"Communication System Design and Analysis for Asynchronous Molecular Timing Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04476","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:c3fbd8e3471872d39041865ea2677f1bea117075f55514d8072c2395fbec3727","target":"record","created_at":"2026-05-17T23:58:31Z","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":"a47a42e7e8bdee1a08ff82c942eb8dbf8eb53524a35bf4396ce4ba5a04d8d4d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-08T05:41:39Z","title_canon_sha256":"3748c82bd8452f590f69acd4e53523aaf3c88f5b2c18f9509259177668bdaf00"},"schema_version":"1.0","source":{"id":"1812.04476","kind":"arxiv","version":1}},"canonical_sha256":"03ea99de44bb1a194c5959be1819ccc801131b313642311ce1f828a6cac873d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03ea99de44bb1a194c5959be1819ccc801131b313642311ce1f828a6cac873d3","first_computed_at":"2026-05-17T23:58:31.943578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.943578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HT0Cug3yowgIKWm8t7QCordlwMi1Cpaf3UyD4iocp/XVlIKtePz1qTGmvZzYWG/GKjQZYZQglBYt9hSp1ZpwAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.944184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3fbd8e3471872d39041865ea2677f1bea117075f55514d8072c2395fbec3727","sha256:89c1c65e7b43a9d188e2fbc07e9b0e5063a50ca1f2011db437c640687e6bdadf"],"state_sha256":"9af3d01ccdda4416931084a5d9b853bc291dccb6112cb60bf7a36eea8f0bb7a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuMvcsmkBzXXIb+acpy79EttOUwB3Gp3huz6xcSe4GnzSHnRQ1WTeNRsS+tIiCTdaKqC6uswtiaUUQgFFqhcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:28:19.271001Z","bundle_sha256":"356ea953e6539c63408d2179ee34288bf8e12ab234a40ec6ff4bd2bc7031fba6"}}