{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M5BZXVA23GDMNKU77PSU4YKRP7","short_pith_number":"pith:M5BZXVA2","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"},"canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","source":{"kind":"arxiv","id":"1401.3580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3580","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3580v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3580","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"M5BZXVA23GDM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5BZXVA23GDMNKU7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5BZXVA2","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M5BZXVA23GDMNKU77PSU4YKRP7","target":"record","payload":{"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"},"canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","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"},"source_kind":"arxiv","source_id":"1401.3580","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:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YanShpcpXEmcOcYxJz0aZcGO5Yr0w1GNpoAKLwNrkHEld7/R2nhXl/+VqZ8KMJ6T0QsuC5ST6OxaXzw2vffcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:28:31.208495Z"},"content_sha256":"654af61e68b695fca901dce3058b5969453b28ed06e7edd5c1f64a939752993f","schema_version":"1.0","event_id":"sha256:654af61e68b695fca901dce3058b5969453b28ed06e7edd5c1f64a939752993f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M5BZXVA23GDMNKU77PSU4YKRP7","target":"graph","payload":{"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"},"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:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiYOgUImOI4sqLAPgx0zF75B4PVD3BY+dkmOY8T7vb9wqDLplXiV305HLKh3UBOVkaHnjrJycR7FrzQjDYIkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:28:31.209136Z"},"content_sha256":"9d6ae100cf79f0cea51e6dd58abb6993d88589d18df9939df11bfed4f2113dd3","schema_version":"1.0","event_id":"sha256:9d6ae100cf79f0cea51e6dd58abb6993d88589d18df9939df11bfed4f2113dd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/bundle.json","state_url":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5BZXVA23GDMNKU77PSU4YKRP7/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-05-27T11:28:31Z","links":{"resolver":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7","bundle":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/bundle.json","state":"https://pith.science/pith/M5BZXVA23GDMNKU77PSU4YKRP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5BZXVA23GDMNKU77PSU4YKRP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M5BZXVA23GDMNKU77PSU4YKRP7","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":"4dd81ea56f2375ce9080ebc9fdf47bf3282334a600048904bf8e519f880f562e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T22:43:12Z","title_canon_sha256":"77e5ac832e1cff4c3ddbd16d5fa34af30c1c2adcff2a03a4eca5de3b76cb85e0"},"schema_version":"1.0","source":{"id":"1401.3580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3580","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3580v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3580","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"M5BZXVA23GDM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5BZXVA23GDMNKU7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5BZXVA2","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:9d6ae100cf79f0cea51e6dd58abb6993d88589d18df9939df11bfed4f2113dd3","target":"graph","created_at":"2026-05-18T00:22:07Z","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 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","authors_text":"Mehrnaz Tavan, Roy D. Yates, Waheed U. Bajwa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T22:43:12Z","title":"Bits Through Bufferless Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3580","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:654af61e68b695fca901dce3058b5969453b28ed06e7edd5c1f64a939752993f","target":"record","created_at":"2026-05-18T00:22:07Z","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":"4dd81ea56f2375ce9080ebc9fdf47bf3282334a600048904bf8e519f880f562e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T22:43:12Z","title_canon_sha256":"77e5ac832e1cff4c3ddbd16d5fa34af30c1c2adcff2a03a4eca5de3b76cb85e0"},"schema_version":"1.0","source":{"id":"1401.3580","kind":"arxiv","version":1}},"canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67439bd41ad986c6aa9ffbe54e61517fdf6f3fb4b3420891cf33d4b78c44f74f","first_computed_at":"2026-05-18T00:22:07.105225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:07.105225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9JlHZWOXBXM0iZIdm43O+HCJyzMMuD6Mun8005cKFTHI96LggY5dbqgO2/F6hyOPbXea8fI10ZzsaklvQagBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:07.105859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:654af61e68b695fca901dce3058b5969453b28ed06e7edd5c1f64a939752993f","sha256:9d6ae100cf79f0cea51e6dd58abb6993d88589d18df9939df11bfed4f2113dd3"],"state_sha256":"4dd3f6d01fb277d730c2ef170e05023de30abd982bef24158b4c5fb48359123c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBmxiXRXnVCJiCij3cm+EDhTr5dtF3LMixs/5ubLrv72mCyUSASgHG/OuPgIrM0Fk1Vu/9+08RMF2I+H86VYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:28:31.212564Z","bundle_sha256":"c7258a573498bad81e3852717b22d5c047b02eff1c7ac40f9c5c2ce445d514c3"}}