{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M5BZXVA23GDMNKU77PSU4YKRP7","short_pith_number":"pith:M5BZXVA2","schema_version":"1.0","canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","source":{"kind":"arxiv","id":"1401.3580","version":1},"attestation_state":"computed","paper":{"title":"Bits Through Bufferless Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mehrnaz Tavan, Roy D. Yates, Waheed U. Bajwa","submitted_at":"2013-12-18T22:43:12Z","abstract_excerpt":"This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In p"},"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":"1401.3580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T22:43:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77e5ac832e1cff4c3ddbd16d5fa34af30c1c2adcff2a03a4eca5de3b76cb85e0","abstract_canon_sha256":"4dd81ea56f2375ce9080ebc9fdf47bf3282334a600048904bf8e519f880f562e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.105859Z","signature_b64":"W9JlHZWOXBXM0iZIdm43O+HCJyzMMuD6Mun8005cKFTHI96LggY5dbqgO2/F6hyOPbXea8fI10ZzsaklvQagBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","last_reissued_at":"2026-05-18T00:22:07.105225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.105225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bits Through Bufferless Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mehrnaz Tavan, Roy D. Yates, Waheed U. Bajwa","submitted_at":"2013-12-18T22:43:12Z","abstract_excerpt":"This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3580","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":"1401.3580","created_at":"2026-05-18T00:22:07.105299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3580v1","created_at":"2026-05-18T00:22:07.105299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3580","created_at":"2026-05-18T00:22:07.105299+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5BZXVA23GDM","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5BZXVA23GDMNKU7","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5BZXVA2","created_at":"2026-05-18T12:27:51.066281+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/M5BZXVA23GDMNKU77PSU4YKRP7","json":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7.json","graph_json":"https://pith.science/api/pith-number/M5BZXVA23GDMNKU77PSU4YKRP7/graph.json","events_json":"https://pith.science/api/pith-number/M5BZXVA23GDMNKU77PSU4YKRP7/events.json","paper":"https://pith.science/paper/M5BZXVA2"},"agent_actions":{"view_html":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7","download_json":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7.json","view_paper":"https://pith.science/paper/M5BZXVA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3580&json=true","fetch_graph":"https://pith.science/api/pith-number/M5BZXVA23GDMNKU77PSU4YKRP7/graph.json","fetch_events":"https://pith.science/api/pith-number/M5BZXVA23GDMNKU77PSU4YKRP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/action/storage_attestation","attest_author":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/action/author_attestation","sign_citation":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/action/citation_signature","submit_replication":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/action/replication_record"}},"created_at":"2026-05-18T00:22:07.105299+00:00","updated_at":"2026-05-18T00:22:07.105299+00:00"}