{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:546URJTAVIJ5PW4P7GXJBKGZMX","short_pith_number":"pith:546URJTA","schema_version":"1.0","canonical_sha256":"ef3d48a660aa13d7db8ff9ae90a8d965fec35ef3eb4ea995b545ff961c2e06c4","source":{"kind":"arxiv","id":"1709.02977","version":1},"attestation_state":"computed","paper":{"title":"Optimal Detection for Diffusion-Based Molecular Timing Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Mainak Chowdhury, Nariman Farsad, Yonathan Murin","submitted_at":"2017-09-09T16:43:22Z","abstract_excerpt":"This work studies optimal detection for communication over diffusion-based molecular timing (DBMT) channels. The transmitter simultaneously releases multiple information particles, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrival of the information particles, which is modeled as an additive noise channel. For a DBMT channel without flow, this noise follows the L\\'evy distribution. Under this channel model, the maximum-likelihood (ML) detector is derived and shown to have high computational complexity. "},"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":"1709.02977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-09T16:43:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82f2c8729973ebaf606816aa4fedb5bc0b946ef760ae25d083ab65a539e8efdb","abstract_canon_sha256":"47e4758df3466e72224bafd46235f6cd30e8df3edd2bca5dd52596bd9defe853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.839533Z","signature_b64":"2vtQaqo1ak3DK3Z2UYpywWHMmGLi7pSl7zvg2khxJCR8Z9JST5a5Vzl0VpZwj8CcSa28ww8hJZyDIrtpafizDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef3d48a660aa13d7db8ff9ae90a8d965fec35ef3eb4ea995b545ff961c2e06c4","last_reissued_at":"2026-05-18T00:35:39.838871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.838871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Detection for Diffusion-Based Molecular Timing Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Mainak Chowdhury, Nariman Farsad, Yonathan Murin","submitted_at":"2017-09-09T16:43:22Z","abstract_excerpt":"This work studies optimal detection for communication over diffusion-based molecular timing (DBMT) channels. The transmitter simultaneously releases multiple information particles, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrival of the information particles, which is modeled as an additive noise channel. For a DBMT channel without flow, this noise follows the L\\'evy distribution. Under this channel model, the maximum-likelihood (ML) detector is derived and shown to have high computational complexity. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02977","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":"1709.02977","created_at":"2026-05-18T00:35:39.838963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02977v1","created_at":"2026-05-18T00:35:39.838963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02977","created_at":"2026-05-18T00:35:39.838963+00:00"},{"alias_kind":"pith_short_12","alias_value":"546URJTAVIJ5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"546URJTAVIJ5PW4P","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"546URJTA","created_at":"2026-05-18T12:31:00.734936+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/546URJTAVIJ5PW4P7GXJBKGZMX","json":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX.json","graph_json":"https://pith.science/api/pith-number/546URJTAVIJ5PW4P7GXJBKGZMX/graph.json","events_json":"https://pith.science/api/pith-number/546URJTAVIJ5PW4P7GXJBKGZMX/events.json","paper":"https://pith.science/paper/546URJTA"},"agent_actions":{"view_html":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX","download_json":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX.json","view_paper":"https://pith.science/paper/546URJTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02977&json=true","fetch_graph":"https://pith.science/api/pith-number/546URJTAVIJ5PW4P7GXJBKGZMX/graph.json","fetch_events":"https://pith.science/api/pith-number/546URJTAVIJ5PW4P7GXJBKGZMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX/action/storage_attestation","attest_author":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX/action/author_attestation","sign_citation":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX/action/citation_signature","submit_replication":"https://pith.science/pith/546URJTAVIJ5PW4P7GXJBKGZMX/action/replication_record"}},"created_at":"2026-05-18T00:35:39.838963+00:00","updated_at":"2026-05-18T00:35:39.838963+00:00"}