{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EEFZNLSV5FYY6XAYQG5L6ZBTNK","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":"7a6e7d96f738b961161b638cae8336ced8b922d9587abb882ba9818681ea9d8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-15T09:34:48Z","title_canon_sha256":"3dfc9eb0adea3515a5aebc2675bf7e04b408022fa8ea62d22efa92796fc07054"},"schema_version":"1.0","source":{"id":"1410.3988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3988","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3988v2","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3988","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"EEFZNLSV5FYY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EEFZNLSV5FYY6XAY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EEFZNLSV","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:076501bdeba880d4f8f454947d500652ffd555e8cb338ce3e34148f969203cb4","target":"graph","created_at":"2026-05-18T02:39:56Z","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, the capacity of a diffusion based molecular communication network under the model of a Linear Time Invarient-Poisson (LTI-Poisson) channel is studied. Introduced in the context of molecular communication, the LTI-Poisson model is a natural extension of the conventional memoryless Poisson channel to include memory. Exploiting prior art on linear ISI channels, a computable finite-letter characterization of the capacity of single-hop LTI-Poisson networks is provided. Then, the problem of finding more explicit bounds on the capacity is examined, where lower and upper bounds for the ","authors_text":"Amin Gohari, Gholamali Aminian, Hamidreza Arjmandi, Masoumeh Nasiri Kenari, Urbashi Mitra","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-15T09:34:48Z","title":"Capacity of Diffusion based Molecular Communication Networks over LTI-Poisson Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3988","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:eab5808458e6ee14219d5f9d71da70d9328a231504a746a7c5f95f10b435eb4e","target":"record","created_at":"2026-05-18T02:39:56Z","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":"7a6e7d96f738b961161b638cae8336ced8b922d9587abb882ba9818681ea9d8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-15T09:34:48Z","title_canon_sha256":"3dfc9eb0adea3515a5aebc2675bf7e04b408022fa8ea62d22efa92796fc07054"},"schema_version":"1.0","source":{"id":"1410.3988","kind":"arxiv","version":2}},"canonical_sha256":"210b96ae55e9718f5c1881babf64336a8970de46c6b2d12930f5d6edaf7a338e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"210b96ae55e9718f5c1881babf64336a8970de46c6b2d12930f5d6edaf7a338e","first_computed_at":"2026-05-18T02:39:56.698566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:56.698566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+pBIh146kenSP0HoREyRH6cFuCi2sDWT6lEio3WAEz/TGbl8Og7hw8neOCh3sVxLaDWVFXiPY/r4cPVnSah6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:56.699030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eab5808458e6ee14219d5f9d71da70d9328a231504a746a7c5f95f10b435eb4e","sha256:076501bdeba880d4f8f454947d500652ffd555e8cb338ce3e34148f969203cb4"],"state_sha256":"8391f7db85468f7dfceef0aea2bf4dcc14c721c50d74de087a94dfbd914550c7"}