{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LGEJKJD4EZYUOX6JSXYBR45CVE","short_pith_number":"pith:LGEJKJD4","schema_version":"1.0","canonical_sha256":"598895247c2671475fc995f018f3a2a91d6403f937f861ac24851debc7d5df02","source":{"kind":"arxiv","id":"1105.1969","version":1},"attestation_state":"computed","paper":{"title":"Capacity of Discrete Molecular Diffusion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Arash Einolghozati, Faramarz Fekri, Mohsen Sardari","submitted_at":"2011-05-10T15:11:47Z","abstract_excerpt":"In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one node to another in a diffusion channel. We observe that because of the molecular diffusion in the medium, the channel possesses memory. We then model the memory of the channel by a two-step Markov chain and obtain the equations describing the capacity of the diffusion channel. By performing a numerical analysis, we obtain the maximum achievable rate for differe"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1105.1969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T15:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b74583175b085a6f15783c1de76b543050cb571ff8e2dad4a0462e1855d6b59","abstract_canon_sha256":"08270d8f54805ef8f49c316afa5ab73654c7f5c07e628ad11fd2a2d2528d5d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.194488Z","signature_b64":"u2U7OR0L5IBTOFGt+Juz5vMPw4BJ22QF2ZSna7lPcbtvgsLfM9hQaCn1t3QRb3TO/3xA5lJqpJGQPQRO4um8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598895247c2671475fc995f018f3a2a91d6403f937f861ac24851debc7d5df02","last_reissued_at":"2026-05-18T04:22:30.194073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.194073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Discrete Molecular Diffusion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Arash Einolghozati, Faramarz Fekri, Mohsen Sardari","submitted_at":"2011-05-10T15:11:47Z","abstract_excerpt":"In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one node to another in a diffusion channel. We observe that because of the molecular diffusion in the medium, the channel possesses memory. We then model the memory of the channel by a two-step Markov chain and obtain the equations describing the capacity of the diffusion channel. By performing a numerical analysis, we obtain the maximum achievable rate for differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1969","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.1969","created_at":"2026-05-18T04:22:30.194133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1969v1","created_at":"2026-05-18T04:22:30.194133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1969","created_at":"2026-05-18T04:22:30.194133+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGEJKJD4EZYU","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGEJKJD4EZYUOX6J","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGEJKJD4","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE","json":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE.json","graph_json":"https://pith.science/api/pith-number/LGEJKJD4EZYUOX6JSXYBR45CVE/graph.json","events_json":"https://pith.science/api/pith-number/LGEJKJD4EZYUOX6JSXYBR45CVE/events.json","paper":"https://pith.science/paper/LGEJKJD4"},"agent_actions":{"view_html":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE","download_json":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE.json","view_paper":"https://pith.science/paper/LGEJKJD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1969&json=true","fetch_graph":"https://pith.science/api/pith-number/LGEJKJD4EZYUOX6JSXYBR45CVE/graph.json","fetch_events":"https://pith.science/api/pith-number/LGEJKJD4EZYUOX6JSXYBR45CVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE/action/storage_attestation","attest_author":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE/action/author_attestation","sign_citation":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE/action/citation_signature","submit_replication":"https://pith.science/pith/LGEJKJD4EZYUOX6JSXYBR45CVE/action/replication_record"}},"created_at":"2026-05-18T04:22:30.194133+00:00","updated_at":"2026-05-18T04:22:30.194133+00:00"}