{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AKGE6FMJQHU6EAYNLV64YFPUSZ","short_pith_number":"pith:AKGE6FMJ","canonical_record":{"source":{"id":"1804.00906","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T10:46:17Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"6338646c7be58c6f01f60b7dcbceb6057ed176499a629d5d4297905cc118f1d1","abstract_canon_sha256":"b094fb6b4d8e96807ab131b99b7c30310d2b7a5cbb03e6e0df8711b94ba4b75e"},"schema_version":"1.0"},"canonical_sha256":"028c4f158981e9e2030d5d7dcc15f4966a2f38a600ae85e33cb449d9deeb29c1","source":{"kind":"arxiv","id":"1804.00906","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00906","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00906v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00906","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"AKGE6FMJQHU6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AKGE6FMJQHU6EAYN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AKGE6FMJ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AKGE6FMJQHU6EAYNLV64YFPUSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00906","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T10:46:17Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"6338646c7be58c6f01f60b7dcbceb6057ed176499a629d5d4297905cc118f1d1","abstract_canon_sha256":"b094fb6b4d8e96807ab131b99b7c30310d2b7a5cbb03e6e0df8711b94ba4b75e"},"schema_version":"1.0"},"canonical_sha256":"028c4f158981e9e2030d5d7dcc15f4966a2f38a600ae85e33cb449d9deeb29c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.899756Z","signature_b64":"0ZmCJca135TgctGAiDFYKgXM9Ayql+FC7BrSIKDaaNUcVkWwjWLrv/vQ31V+zWzA9Ag4Zq3kuFgwBdPRFPPNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028c4f158981e9e2030d5d7dcc15f4966a2f38a600ae85e33cb449d9deeb29c1","last_reissued_at":"2026-05-17T23:48:45.899303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.899303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00906","source_version":3,"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLIRYNs6ekD62f286G5neJ7X8RAndTT8Wk2cNW7ztQpsRqvaaTbsUKgwU0bxwbwp5FwSOM3szSXVgkx5JOpbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:10:09.805186Z"},"content_sha256":"c077032161519fac339753938c92cec31e4e53fc8f62b4885c2cc93facd12a9f","schema_version":"1.0","event_id":"sha256:c077032161519fac339753938c92cec31e4e53fc8f62b4885c2cc93facd12a9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AKGE6FMJQHU6EAYNLV64YFPUSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qubits through Queues: The Capacity of Channels with Waiting Time Dependent Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Avhishek Chatterjee, Krishna Jagannathan, Prabha Mandayam","submitted_at":"2018-04-03T10:46:17Z","abstract_excerpt":"We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a `queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00906","kind":"arxiv","version":3},"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTeTj/J14WuPa0MzF2cEb5acxXaKiZJjC6Y+a+2lAdWvBBuLgXZbBihFi+/HOhC+/5ew8da2in5hYj/cbeaCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:10:09.805552Z"},"content_sha256":"db3fc4dcf8f0f3c15812df69f801d69475974b5b2b2b71da3dbc776fa32430cd","schema_version":"1.0","event_id":"sha256:db3fc4dcf8f0f3c15812df69f801d69475974b5b2b2b71da3dbc776fa32430cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/bundle.json","state_url":"https://pith.science/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/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-04T09:10:09Z","links":{"resolver":"https://pith.science/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ","bundle":"https://pith.science/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/bundle.json","state":"https://pith.science/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKGE6FMJQHU6EAYNLV64YFPUSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AKGE6FMJQHU6EAYNLV64YFPUSZ","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":"b094fb6b4d8e96807ab131b99b7c30310d2b7a5cbb03e6e0df8711b94ba4b75e","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T10:46:17Z","title_canon_sha256":"6338646c7be58c6f01f60b7dcbceb6057ed176499a629d5d4297905cc118f1d1"},"schema_version":"1.0","source":{"id":"1804.00906","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00906","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00906v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00906","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"AKGE6FMJQHU6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AKGE6FMJQHU6EAYN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AKGE6FMJ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:db3fc4dcf8f0f3c15812df69f801d69475974b5b2b2b71da3dbc776fa32430cd","target":"graph","created_at":"2026-05-17T23:48:45Z","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":"We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a `queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the ","authors_text":"Avhishek Chatterjee, Krishna Jagannathan, Prabha Mandayam","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T10:46:17Z","title":"Qubits through Queues: The Capacity of Channels with Waiting Time Dependent Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00906","kind":"arxiv","version":3},"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:c077032161519fac339753938c92cec31e4e53fc8f62b4885c2cc93facd12a9f","target":"record","created_at":"2026-05-17T23:48:45Z","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":"b094fb6b4d8e96807ab131b99b7c30310d2b7a5cbb03e6e0df8711b94ba4b75e","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T10:46:17Z","title_canon_sha256":"6338646c7be58c6f01f60b7dcbceb6057ed176499a629d5d4297905cc118f1d1"},"schema_version":"1.0","source":{"id":"1804.00906","kind":"arxiv","version":3}},"canonical_sha256":"028c4f158981e9e2030d5d7dcc15f4966a2f38a600ae85e33cb449d9deeb29c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"028c4f158981e9e2030d5d7dcc15f4966a2f38a600ae85e33cb449d9deeb29c1","first_computed_at":"2026-05-17T23:48:45.899303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:45.899303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ZmCJca135TgctGAiDFYKgXM9Ayql+FC7BrSIKDaaNUcVkWwjWLrv/vQ31V+zWzA9Ag4Zq3kuFgwBdPRFPPNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:45.899756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00906","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c077032161519fac339753938c92cec31e4e53fc8f62b4885c2cc93facd12a9f","sha256:db3fc4dcf8f0f3c15812df69f801d69475974b5b2b2b71da3dbc776fa32430cd"],"state_sha256":"eec5c7138db949b055f56d83bb8195829df47427e080857cf4e024dfefb0393e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsNUhkwr7gA8mpGArDt+InPu94P0CpN9Moeymoc6H0+g64sNeALdldVY+614Dfp8PXVHNhkz9hn0aFf//TiGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:10:09.807460Z","bundle_sha256":"0bc8a065e3e4e2445fe9f36ae295799941161980f7fe537030db114881b6bc7c"}}