{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FHJGT2YFBQXUNWNZW42KIOIWIU","short_pith_number":"pith:FHJGT2YF","canonical_record":{"source":{"id":"1610.04364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T08:39:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b3ce8bd4bc4493138de5d587cf9c8ea4a863749532d2bcc047b1beea30da2f9d","abstract_canon_sha256":"d338c0e2a194ddef7c74441915b4df839ba050bfcac23e0ab3c28fcd06cf8387"},"schema_version":"1.0"},"canonical_sha256":"29d269eb050c2f46d9b9b734a43916452c559a22467a0c521bc21a7b4164c145","source":{"kind":"arxiv","id":"1610.04364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04364","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04364v1","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04364","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"FHJGT2YFBQXU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHJGT2YFBQXUNWNZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHJGT2YF","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FHJGT2YFBQXUNWNZW42KIOIWIU","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T08:39:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b3ce8bd4bc4493138de5d587cf9c8ea4a863749532d2bcc047b1beea30da2f9d","abstract_canon_sha256":"d338c0e2a194ddef7c74441915b4df839ba050bfcac23e0ab3c28fcd06cf8387"},"schema_version":"1.0"},"canonical_sha256":"29d269eb050c2f46d9b9b734a43916452c559a22467a0c521bc21a7b4164c145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:15.438414Z","signature_b64":"8dR+ue4W+ZOYhjl1FeV9fc1u6ZXjCFjn//fU8yZD4obXoYFUOTut5YuJ9btVnKi3ZEZKBa4KCT5dTeFrfpL4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d269eb050c2f46d9b9b734a43916452c559a22467a0c521bc21a7b4164c145","last_reissued_at":"2026-05-18T01:02:15.437667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:15.437667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04364","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyeUm5x3ax7RUWM8Ob9vrrB43+gYG/OaQK7KxRIsCuBOWXvq/W5JJFBaoI5BjqEaT/wi9q0PsZPX6pnIvHSwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:26.176396Z"},"content_sha256":"c3bb27e8d44f305bc078d70a2d1cf4f208eb5905ed7c4790da51dd1ca20a1eed","schema_version":"1.0","event_id":"sha256:c3bb27e8d44f305bc078d70a2d1cf4f208eb5905ed7c4790da51dd1ca20a1eed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FHJGT2YFBQXUNWNZW42KIOIWIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay Minimization in Real-time Communications with Joint Buffering and Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2016-10-14T08:39:58Z","abstract_excerpt":"We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case the delay budget should be spent mainly on the erasure code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04364","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DG7ToI7Hvk80Ij+lBreb1yVTjrbzjE31P294fLCCvWeMpdUXLb/rW88fCHQho224jjwzQUc8xY670IrCX1AJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:26.177085Z"},"content_sha256":"33fdcf46b520364331aacfc77ff29f9f05707e62556d9e78ce84e5ba3f474083","schema_version":"1.0","event_id":"sha256:33fdcf46b520364331aacfc77ff29f9f05707e62556d9e78ce84e5ba3f474083"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/bundle.json","state_url":"https://pith.science/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/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-26T17:42:26Z","links":{"resolver":"https://pith.science/pith/FHJGT2YFBQXUNWNZW42KIOIWIU","bundle":"https://pith.science/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/bundle.json","state":"https://pith.science/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHJGT2YFBQXUNWNZW42KIOIWIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FHJGT2YFBQXUNWNZW42KIOIWIU","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":"d338c0e2a194ddef7c74441915b4df839ba050bfcac23e0ab3c28fcd06cf8387","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T08:39:58Z","title_canon_sha256":"b3ce8bd4bc4493138de5d587cf9c8ea4a863749532d2bcc047b1beea30da2f9d"},"schema_version":"1.0","source":{"id":"1610.04364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04364","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04364v1","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04364","created_at":"2026-05-18T01:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"FHJGT2YFBQXU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHJGT2YFBQXUNWNZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHJGT2YF","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:33fdcf46b520364331aacfc77ff29f9f05707e62556d9e78ce84e5ba3f474083","target":"graph","created_at":"2026-05-18T01:02:15Z","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 present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case the delay budget should be spent mainly on the erasure code.","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T08:39:58Z","title":"Delay Minimization in Real-time Communications with Joint Buffering and Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04364","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:c3bb27e8d44f305bc078d70a2d1cf4f208eb5905ed7c4790da51dd1ca20a1eed","target":"record","created_at":"2026-05-18T01:02:15Z","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":"d338c0e2a194ddef7c74441915b4df839ba050bfcac23e0ab3c28fcd06cf8387","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T08:39:58Z","title_canon_sha256":"b3ce8bd4bc4493138de5d587cf9c8ea4a863749532d2bcc047b1beea30da2f9d"},"schema_version":"1.0","source":{"id":"1610.04364","kind":"arxiv","version":1}},"canonical_sha256":"29d269eb050c2f46d9b9b734a43916452c559a22467a0c521bc21a7b4164c145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d269eb050c2f46d9b9b734a43916452c559a22467a0c521bc21a7b4164c145","first_computed_at":"2026-05-18T01:02:15.437667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:15.437667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dR+ue4W+ZOYhjl1FeV9fc1u6ZXjCFjn//fU8yZD4obXoYFUOTut5YuJ9btVnKi3ZEZKBa4KCT5dTeFrfpL4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:15.438414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3bb27e8d44f305bc078d70a2d1cf4f208eb5905ed7c4790da51dd1ca20a1eed","sha256:33fdcf46b520364331aacfc77ff29f9f05707e62556d9e78ce84e5ba3f474083"],"state_sha256":"daed06e6f582a8934aa218919ced5340316e6ca40743e5d248da980d8631f7bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xcbVeeK3Q0TKpDgcWBV/TqFULM9mlna4Kgchr/FZdOjChLHEnQwlfZrYdJKQzlGx77Nip9TB3i9407vhaaqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:42:26.180544Z","bundle_sha256":"4082ff535199ad122df848a4e00ea6a578fcaa03b8c7949ee63b3cea969eabe5"}}