{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GGTMUVV7FN44ORYCQSVNKHZPHD","short_pith_number":"pith:GGTMUVV7","schema_version":"1.0","canonical_sha256":"31a6ca56bf2b79c7470284aad51f2f38c88a5f71ff3dce64efdb564d837720b6","source":{"kind":"arxiv","id":"1605.07905","version":1},"attestation_state":"computed","paper":{"title":"Timing Channel: Achievable Rate in the Finite Block-Length Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew C. Singer, Thomas J. Riedl, Todd P. Coleman","submitted_at":"2016-05-25T14:45:19Z","abstract_excerpt":"The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a target error probability. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at blocklength $n$ and error probability $\\epsilon$. The bound is approximated by $C- n^{-1/2} \\sigma Q^{-1}(\\epsilon)$ where $Q$ denotes the Q-function and "},"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":"1605.07905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-25T14:45:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"326eb3a76c57bbe1a4ab7e49d3704a505503d5920ea521c63915049a2896eeaa","abstract_canon_sha256":"282aa1c0733790ed56d66c12f210a5bcd4d2f7eb95699f2a6a29d3287705c694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:38.826351Z","signature_b64":"O9pdBVb6H+ZIeU4rrD4HYvcgHzwD9GZ8d4EZiUyjSa97hyTMeD8vGpTUpng34G7OMOK+FL3hcR3belpJORN/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a6ca56bf2b79c7470284aad51f2f38c88a5f71ff3dce64efdb564d837720b6","last_reissued_at":"2026-05-18T01:13:38.825778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:38.825778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timing Channel: Achievable Rate in the Finite Block-Length Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew C. Singer, Thomas J. Riedl, Todd P. Coleman","submitted_at":"2016-05-25T14:45:19Z","abstract_excerpt":"The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a target error probability. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at blocklength $n$ and error probability $\\epsilon$. The bound is approximated by $C- n^{-1/2} \\sigma Q^{-1}(\\epsilon)$ where $Q$ denotes the Q-function and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07905","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":"1605.07905","created_at":"2026-05-18T01:13:38.825865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07905v1","created_at":"2026-05-18T01:13:38.825865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07905","created_at":"2026-05-18T01:13:38.825865+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGTMUVV7FN44","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGTMUVV7FN44ORYC","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGTMUVV7","created_at":"2026-05-18T12:30:19.053100+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/GGTMUVV7FN44ORYCQSVNKHZPHD","json":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD.json","graph_json":"https://pith.science/api/pith-number/GGTMUVV7FN44ORYCQSVNKHZPHD/graph.json","events_json":"https://pith.science/api/pith-number/GGTMUVV7FN44ORYCQSVNKHZPHD/events.json","paper":"https://pith.science/paper/GGTMUVV7"},"agent_actions":{"view_html":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD","download_json":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD.json","view_paper":"https://pith.science/paper/GGTMUVV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07905&json=true","fetch_graph":"https://pith.science/api/pith-number/GGTMUVV7FN44ORYCQSVNKHZPHD/graph.json","fetch_events":"https://pith.science/api/pith-number/GGTMUVV7FN44ORYCQSVNKHZPHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD/action/storage_attestation","attest_author":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD/action/author_attestation","sign_citation":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD/action/citation_signature","submit_replication":"https://pith.science/pith/GGTMUVV7FN44ORYCQSVNKHZPHD/action/replication_record"}},"created_at":"2026-05-18T01:13:38.825865+00:00","updated_at":"2026-05-18T01:13:38.825865+00:00"}