{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WQDJ7LKUZ3HUVHZS53RSNL53GY","short_pith_number":"pith:WQDJ7LKU","canonical_record":{"source":{"id":"1603.01675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T03:41:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"baa1872dc221cb110f39032597206b73a796e7c33f355c94712ec0d15ea896e2","abstract_canon_sha256":"9bdb7a29ba37ddcb78560798e21caaef36ef51b4a5426d4672a13680bed7f7c3"},"schema_version":"1.0"},"canonical_sha256":"b4069fad54cecf4a9f32eee326afbb361250e090c2bef71d8bc5f4ec2f36ffee","source":{"kind":"arxiv","id":"1603.01675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01675","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01675v1","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01675","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"WQDJ7LKUZ3HU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WQDJ7LKUZ3HUVHZS","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WQDJ7LKU","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WQDJ7LKUZ3HUVHZS53RSNL53GY","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T03:41:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"baa1872dc221cb110f39032597206b73a796e7c33f355c94712ec0d15ea896e2","abstract_canon_sha256":"9bdb7a29ba37ddcb78560798e21caaef36ef51b4a5426d4672a13680bed7f7c3"},"schema_version":"1.0"},"canonical_sha256":"b4069fad54cecf4a9f32eee326afbb361250e090c2bef71d8bc5f4ec2f36ffee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.036450Z","signature_b64":"StTlN025rAWoGtKRsbRxxlwgpHsLdNgzm/0y5ydPWMNyBwYUbIUmWOtDiJoVmEdegp//HuRaR8c23u8+BlI3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4069fad54cecf4a9f32eee326afbb361250e090c2bef71d8bc5f4ec2f36ffee","last_reissued_at":"2026-05-18T01:19:35.036029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.036029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01675","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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8hmx7CFj2ZB9y+arlPr8Fyd3VreGuxDUUoXzF8RgHkSafah/FSblLJhn2vkddNqdsV5UYjGKp9gZFiXBG2xBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:25:49.899123Z"},"content_sha256":"cc8c2954618be511e59ac206d0fac718c96ac04bf55c9fae730f3492f0e4f4d8","schema_version":"1.0","event_id":"sha256:cc8c2954618be511e59ac206d0fac718c96ac04bf55c9fae730f3492f0e4f4d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WQDJ7LKUZ3HUVHZS53RSNL53GY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity of Systems with Queue-Length Dependent Service Quality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Avhishek Chatterjee, Daewon Seo, Lav R. Varshney","submitted_at":"2016-03-05T03:41:38Z","abstract_excerpt":"We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and characterize it in terms of queuing system parameters. We also characterize the distributions of the arrival and service processes that maximize and minimize the capacity of such systems in a discrete-time setting. For arrival processes with at most one arrival per time slot, we observed a minimum around the memoryless distribution. We also studied the case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01675","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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLGXbWXqojXBw0+tGK8Ivx1wcD1j6Bsd4PDG8CvbiiZgPJspq2/OkhuIFXjKDjdvkdeydNsq0rgaQ830fd/XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:25:49.899872Z"},"content_sha256":"af6921db15b3444ed428ecb05e57458300c6a70ee0df6713afcc4141181fb98a","schema_version":"1.0","event_id":"sha256:af6921db15b3444ed428ecb05e57458300c6a70ee0df6713afcc4141181fb98a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/bundle.json","state_url":"https://pith.science/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/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-07T17:25:49Z","links":{"resolver":"https://pith.science/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY","bundle":"https://pith.science/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/bundle.json","state":"https://pith.science/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQDJ7LKUZ3HUVHZS53RSNL53GY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WQDJ7LKUZ3HUVHZS53RSNL53GY","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":"9bdb7a29ba37ddcb78560798e21caaef36ef51b4a5426d4672a13680bed7f7c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T03:41:38Z","title_canon_sha256":"baa1872dc221cb110f39032597206b73a796e7c33f355c94712ec0d15ea896e2"},"schema_version":"1.0","source":{"id":"1603.01675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01675","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01675v1","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01675","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"WQDJ7LKUZ3HU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WQDJ7LKUZ3HUVHZS","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WQDJ7LKU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:af6921db15b3444ed428ecb05e57458300c6a70ee0df6713afcc4141181fb98a","target":"graph","created_at":"2026-05-18T01:19:35Z","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 study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and characterize it in terms of queuing system parameters. We also characterize the distributions of the arrival and service processes that maximize and minimize the capacity of such systems in a discrete-time setting. For arrival processes with at most one arrival per time slot, we observed a minimum around the memoryless distribution. We also studied the case of ","authors_text":"Avhishek Chatterjee, Daewon Seo, Lav R. Varshney","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T03:41:38Z","title":"Capacity of Systems with Queue-Length Dependent Service Quality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01675","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:cc8c2954618be511e59ac206d0fac718c96ac04bf55c9fae730f3492f0e4f4d8","target":"record","created_at":"2026-05-18T01:19:35Z","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":"9bdb7a29ba37ddcb78560798e21caaef36ef51b4a5426d4672a13680bed7f7c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T03:41:38Z","title_canon_sha256":"baa1872dc221cb110f39032597206b73a796e7c33f355c94712ec0d15ea896e2"},"schema_version":"1.0","source":{"id":"1603.01675","kind":"arxiv","version":1}},"canonical_sha256":"b4069fad54cecf4a9f32eee326afbb361250e090c2bef71d8bc5f4ec2f36ffee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4069fad54cecf4a9f32eee326afbb361250e090c2bef71d8bc5f4ec2f36ffee","first_computed_at":"2026-05-18T01:19:35.036029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:35.036029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"StTlN025rAWoGtKRsbRxxlwgpHsLdNgzm/0y5ydPWMNyBwYUbIUmWOtDiJoVmEdegp//HuRaR8c23u8+BlI3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:35.036450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc8c2954618be511e59ac206d0fac718c96ac04bf55c9fae730f3492f0e4f4d8","sha256:af6921db15b3444ed428ecb05e57458300c6a70ee0df6713afcc4141181fb98a"],"state_sha256":"c3b0b0fb57a3adcb69f8e59017a4b8e3d016c96a2aae96301bd2b0fecc5ded5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkREiOL+I2h80XI9emTSvjT1WIs9xQvicUX+ovdQpo2FBD+PJlVgpTy0fFXoObhOqKUDcWs00JcXjMNbelrnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:25:49.903593Z","bundle_sha256":"76b9f7c0c42164b8c089e81d94e8814a468c7cdc637de18bb549b8c5982e1b3e"}}