{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P4QCU7YNVSGYLLQ27URG3USNVY","short_pith_number":"pith:P4QCU7YN","canonical_record":{"source":{"id":"1604.06409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T18:25:21Z","cross_cats_sorted":["cs.ET","math.IT"],"title_canon_sha256":"d070ea08912446d1aed094c447129fa8e7e00ece467ec2ffb1a63676eff43e44","abstract_canon_sha256":"ee7748684f0b3b2aada0444b69f9c3ee18b98673bfeedbd66ca0f49b002b7c40"},"schema_version":"1.0"},"canonical_sha256":"7f202a7f0dac8d85ae1afd226dd24dae2d67b712e3e2a3add7b00c032a369ea5","source":{"kind":"arxiv","id":"1604.06409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06409","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06409v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06409","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"P4QCU7YNVSGY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P4QCU7YNVSGYLLQ2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P4QCU7YN","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P4QCU7YNVSGYLLQ27URG3USNVY","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T18:25:21Z","cross_cats_sorted":["cs.ET","math.IT"],"title_canon_sha256":"d070ea08912446d1aed094c447129fa8e7e00ece467ec2ffb1a63676eff43e44","abstract_canon_sha256":"ee7748684f0b3b2aada0444b69f9c3ee18b98673bfeedbd66ca0f49b002b7c40"},"schema_version":"1.0"},"canonical_sha256":"7f202a7f0dac8d85ae1afd226dd24dae2d67b712e3e2a3add7b00c032a369ea5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.003718Z","signature_b64":"t7udq8uwVYkt8h5DXfaG9/x7PrNq0or9CZDdxf/8Zpo+6f6c019JL5ZVU3lJ3C8K8/kkwcs0u3r/FVnHJPNQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f202a7f0dac8d85ae1afd226dd24dae2d67b712e3e2a3add7b00c032a369ea5","last_reissued_at":"2026-05-18T00:58:57.003063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.003063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06409","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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRjCUUylaEwl3Brgf7sr4fF2x4RwBxBkOZLxaBvIzrSobfy974Fnaxs3topMv9xK30tCKIhb2V/hly/PQjpoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:40:11.580830Z"},"content_sha256":"fe4813e10a7b883d943104b970f173b30fb2873f349ca631c5fc4907ce195998","schema_version":"1.0","event_id":"sha256:fe4813e10a7b883d943104b970f173b30fb2873f349ca631c5fc4907ce195998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P4QCU7YNVSGYLLQ27URG3USNVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Diffusion-Based Molecular Timing Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Andrew Eckford, Nariman Farsad, Yonathan Murin","submitted_at":"2016-04-21T18:25:21Z","abstract_excerpt":"This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random time of arrival can be represented as an additive noise channel, and for the diffusion-based MT (DBMT) channel, this noise is distributed according to the L\\'evy distribution. Lower and upper bounds on the capacity of the DBMT channel are derived for the case where the delay associated with the propagation of information particles in the channel is finite. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06409","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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcrtJtt6KaFVpwPzRLfVfEwcqscXCkQylljNdLbYWgh21RxFFGmsOgonZHKNIfrLcplXhqJvwT4LdWAWWkx4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:40:11.581498Z"},"content_sha256":"1fae9fa84ffc3488b363b0b793469b81a35a4243d18538d952b73ea0a1c4ac08","schema_version":"1.0","event_id":"sha256:1fae9fa84ffc3488b363b0b793469b81a35a4243d18538d952b73ea0a1c4ac08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4QCU7YNVSGYLLQ27URG3USNVY/bundle.json","state_url":"https://pith.science/pith/P4QCU7YNVSGYLLQ27URG3USNVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4QCU7YNVSGYLLQ27URG3USNVY/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-05T19:40:11Z","links":{"resolver":"https://pith.science/pith/P4QCU7YNVSGYLLQ27URG3USNVY","bundle":"https://pith.science/pith/P4QCU7YNVSGYLLQ27URG3USNVY/bundle.json","state":"https://pith.science/pith/P4QCU7YNVSGYLLQ27URG3USNVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4QCU7YNVSGYLLQ27URG3USNVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P4QCU7YNVSGYLLQ27URG3USNVY","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":"ee7748684f0b3b2aada0444b69f9c3ee18b98673bfeedbd66ca0f49b002b7c40","cross_cats_sorted":["cs.ET","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T18:25:21Z","title_canon_sha256":"d070ea08912446d1aed094c447129fa8e7e00ece467ec2ffb1a63676eff43e44"},"schema_version":"1.0","source":{"id":"1604.06409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06409","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06409v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06409","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"P4QCU7YNVSGY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P4QCU7YNVSGYLLQ2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P4QCU7YN","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:1fae9fa84ffc3488b363b0b793469b81a35a4243d18538d952b73ea0a1c4ac08","target":"graph","created_at":"2026-05-18T00:58:57Z","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":"This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random time of arrival can be represented as an additive noise channel, and for the diffusion-based MT (DBMT) channel, this noise is distributed according to the L\\'evy distribution. Lower and upper bounds on the capacity of the DBMT channel are derived for the case where the delay associated with the propagation of information particles in the channel is finite. T","authors_text":"Andrea Goldsmith, Andrew Eckford, Nariman Farsad, Yonathan Murin","cross_cats":["cs.ET","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T18:25:21Z","title":"On the Capacity of Diffusion-Based Molecular Timing Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06409","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:fe4813e10a7b883d943104b970f173b30fb2873f349ca631c5fc4907ce195998","target":"record","created_at":"2026-05-18T00:58:57Z","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":"ee7748684f0b3b2aada0444b69f9c3ee18b98673bfeedbd66ca0f49b002b7c40","cross_cats_sorted":["cs.ET","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T18:25:21Z","title_canon_sha256":"d070ea08912446d1aed094c447129fa8e7e00ece467ec2ffb1a63676eff43e44"},"schema_version":"1.0","source":{"id":"1604.06409","kind":"arxiv","version":1}},"canonical_sha256":"7f202a7f0dac8d85ae1afd226dd24dae2d67b712e3e2a3add7b00c032a369ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f202a7f0dac8d85ae1afd226dd24dae2d67b712e3e2a3add7b00c032a369ea5","first_computed_at":"2026-05-18T00:58:57.003063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.003063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t7udq8uwVYkt8h5DXfaG9/x7PrNq0or9CZDdxf/8Zpo+6f6c019JL5ZVU3lJ3C8K8/kkwcs0u3r/FVnHJPNQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.003718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe4813e10a7b883d943104b970f173b30fb2873f349ca631c5fc4907ce195998","sha256:1fae9fa84ffc3488b363b0b793469b81a35a4243d18538d952b73ea0a1c4ac08"],"state_sha256":"e6e848c87ab2d23b52dcae9984135a733e314c9e8c52b5c50cdec507b68d1e8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuCIZbTgV/NxzFkJsXyATXGQ3C4J74yhh2LCOTY5EnVrmZD0lwnMJP8JFLwa2rs0cwKUKhY4KfMgH89ms00qAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:40:11.584765Z","bundle_sha256":"b0f1d0b278bb3dfdf7760e66b82d1ff2da0f70ea19d6832c83f2a4683c0b6945"}}