{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LG3CI72ADLMG4XHIWXVFWJZJSI","short_pith_number":"pith:LG3CI72A","canonical_record":{"source":{"id":"1108.0187","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2011-07-31T16:10:57Z","cross_cats_sorted":["cs.MM","cs.NI"],"title_canon_sha256":"8054371daf2487ad29d448310e633843188375c60e1cc01151eaf01a92fd66ef","abstract_canon_sha256":"544e47bf284263f0de954cd409bb6a4730174ff3a9ebc30fbe042da138e861f0"},"schema_version":"1.0"},"canonical_sha256":"59b6247f401ad86e5ce8b5ea5b2729923f94964b4a9cd87b54a83eabecb9ba8e","source":{"kind":"arxiv","id":"1108.0187","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0187","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0187v5","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0187","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"LG3CI72ADLMG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LG3CI72ADLMG4XHI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LG3CI72A","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LG3CI72ADLMG4XHIWXVFWJZJSI","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0187","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2011-07-31T16:10:57Z","cross_cats_sorted":["cs.MM","cs.NI"],"title_canon_sha256":"8054371daf2487ad29d448310e633843188375c60e1cc01151eaf01a92fd66ef","abstract_canon_sha256":"544e47bf284263f0de954cd409bb6a4730174ff3a9ebc30fbe042da138e861f0"},"schema_version":"1.0"},"canonical_sha256":"59b6247f401ad86e5ce8b5ea5b2729923f94964b4a9cd87b54a83eabecb9ba8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.215401Z","signature_b64":"w0+7iGevCXoI/bPJbDHz8R8GIi8hJZbxVBVzAoFFG2ZffOLIPmy7qZW9OLJNufjDb7sfCu1DBKgjXaVXAcN2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b6247f401ad86e5ce8b5ea5b2729923f94964b4a9cd87b54a83eabecb9ba8e","last_reissued_at":"2026-05-18T00:59:10.214785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.214785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0187","source_version":5,"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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktwPxAlnEt12hXkfRbk+2G02zdonA05ew1sxuNjehboECqZzW9Uh0ibX7vff/UtQ8wBabCnKA7he+s1YR0AXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:59:45.618168Z"},"content_sha256":"0ead7ee4186bee5c00269a32439f1c7a9ba4d7dc93fdf0b354adb2f0ac22f787","schema_version":"1.0","event_id":"sha256:0ead7ee4186bee5c00269a32439f1c7a9ba4d7dc93fdf0b354adb2f0ac22f787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LG3CI72ADLMG4XHIWXVFWJZJSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Buffer Starvation with Application to Objective QoE Optimization of Streaming Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NI"],"primary_cat":"cs.PF","authors_text":"Eitan Altman, Majed Haddad, Rachid El-Azouzi, Salaheddine Elayoubi, Tania Jimenez, Yuedong Xu","submitted_at":"2011-07-31T16:10:57Z","abstract_excerpt":"Our purpose in this paper is to characterize buffer starvations for streaming services. The buffer is modeled as an M/M/1 queue, plus the consideration of bursty arrivals. When the buffer is empty, the service restarts after a certain amount of packets are \\emph{prefetched}. With this goal, we propose two approaches to obtain the \\emph{exact distribution} of the number of buffer starvations, one of which is based on \\emph{Ballot theorem}, and the other uses recursive equations. The Ballot theorem approach gives an explicit result. We extend this approach to the scenario with a constant playbac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0187","kind":"arxiv","version":5},"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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQNRjpAD1orVsFSNglk4B1OGcs+6Eq3THRKQT2+tP/cXtUEIAMxxeesKmkISCVE4iK9qZATqOy9YH+lptsFYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:59:45.618852Z"},"content_sha256":"30e775e29d721b6daf9a32f7b9dbbfdeba758e5447d9b1868415a477a861adeb","schema_version":"1.0","event_id":"sha256:30e775e29d721b6daf9a32f7b9dbbfdeba758e5447d9b1868415a477a861adeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/bundle.json","state_url":"https://pith.science/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/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-31T17:59:45Z","links":{"resolver":"https://pith.science/pith/LG3CI72ADLMG4XHIWXVFWJZJSI","bundle":"https://pith.science/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/bundle.json","state":"https://pith.science/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG3CI72ADLMG4XHIWXVFWJZJSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LG3CI72ADLMG4XHIWXVFWJZJSI","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":"544e47bf284263f0de954cd409bb6a4730174ff3a9ebc30fbe042da138e861f0","cross_cats_sorted":["cs.MM","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2011-07-31T16:10:57Z","title_canon_sha256":"8054371daf2487ad29d448310e633843188375c60e1cc01151eaf01a92fd66ef"},"schema_version":"1.0","source":{"id":"1108.0187","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0187","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0187v5","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0187","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"LG3CI72ADLMG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LG3CI72ADLMG4XHI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LG3CI72A","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:30e775e29d721b6daf9a32f7b9dbbfdeba758e5447d9b1868415a477a861adeb","target":"graph","created_at":"2026-05-18T00:59:10Z","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":"Our purpose in this paper is to characterize buffer starvations for streaming services. The buffer is modeled as an M/M/1 queue, plus the consideration of bursty arrivals. When the buffer is empty, the service restarts after a certain amount of packets are \\emph{prefetched}. With this goal, we propose two approaches to obtain the \\emph{exact distribution} of the number of buffer starvations, one of which is based on \\emph{Ballot theorem}, and the other uses recursive equations. The Ballot theorem approach gives an explicit result. We extend this approach to the scenario with a constant playbac","authors_text":"Eitan Altman, Majed Haddad, Rachid El-Azouzi, Salaheddine Elayoubi, Tania Jimenez, Yuedong Xu","cross_cats":["cs.MM","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2011-07-31T16:10:57Z","title":"Analysis of Buffer Starvation with Application to Objective QoE Optimization of Streaming Services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0187","kind":"arxiv","version":5},"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:0ead7ee4186bee5c00269a32439f1c7a9ba4d7dc93fdf0b354adb2f0ac22f787","target":"record","created_at":"2026-05-18T00:59:10Z","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":"544e47bf284263f0de954cd409bb6a4730174ff3a9ebc30fbe042da138e861f0","cross_cats_sorted":["cs.MM","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2011-07-31T16:10:57Z","title_canon_sha256":"8054371daf2487ad29d448310e633843188375c60e1cc01151eaf01a92fd66ef"},"schema_version":"1.0","source":{"id":"1108.0187","kind":"arxiv","version":5}},"canonical_sha256":"59b6247f401ad86e5ce8b5ea5b2729923f94964b4a9cd87b54a83eabecb9ba8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59b6247f401ad86e5ce8b5ea5b2729923f94964b4a9cd87b54a83eabecb9ba8e","first_computed_at":"2026-05-18T00:59:10.214785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.214785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0+7iGevCXoI/bPJbDHz8R8GIi8hJZbxVBVzAoFFG2ZffOLIPmy7qZW9OLJNufjDb7sfCu1DBKgjXaVXAcN2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.215401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0187","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ead7ee4186bee5c00269a32439f1c7a9ba4d7dc93fdf0b354adb2f0ac22f787","sha256:30e775e29d721b6daf9a32f7b9dbbfdeba758e5447d9b1868415a477a861adeb"],"state_sha256":"395400a8abe8c9a683508c9ae45de50b6bef96ec26c7c001720a8b3cba625dd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKHzIEiMSjRbJThyBkr86QkyZ6zTFmfxkHJ1c5XK2cXi6kUDVkBpnv5ztNqHDekveqDxYTXgr0Qao4Bz4StNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:59:45.622151Z","bundle_sha256":"21fa0a84c1786c145eaacd1ca5a5b40e7b0a4c12d89528ff44fd8154d49e433c"}}