{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4DEHLJETERXIBJBMTVVXDKAU7P","short_pith_number":"pith:4DEHLJET","canonical_record":{"source":{"id":"1811.10829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-27T06:20:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a11c3d3cc4d0d38b43eb051157df395cfc6853d41dfe9a2d6cc10ab56daa3b1","abstract_canon_sha256":"250214ebce84f01c4322362c3a60109ecfafb639503bc11f587e3c884ea5c2a9"},"schema_version":"1.0"},"canonical_sha256":"e0c875a493246e80a42c9d6b71a814fbd7c3a24c4e675cfb7bf142e3bc57ff65","source":{"kind":"arxiv","id":"1811.10829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10829","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10829v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10829","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"4DEHLJETERXI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DEHLJETERXIBJBM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DEHLJET","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4DEHLJETERXIBJBMTVVXDKAU7P","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-27T06:20:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a11c3d3cc4d0d38b43eb051157df395cfc6853d41dfe9a2d6cc10ab56daa3b1","abstract_canon_sha256":"250214ebce84f01c4322362c3a60109ecfafb639503bc11f587e3c884ea5c2a9"},"schema_version":"1.0"},"canonical_sha256":"e0c875a493246e80a42c9d6b71a814fbd7c3a24c4e675cfb7bf142e3bc57ff65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.407172Z","signature_b64":"sDVclUw/X6PeNPBtRPkjBXy/JxN2sfZiiI1+rUD2JUG/M5R9ZaCzFUD18Viw7Y91MEuUEfVTjrLgzDZSXDxDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c875a493246e80a42c9d6b71a814fbd7c3a24c4e675cfb7bf142e3bc57ff65","last_reissued_at":"2026-05-17T23:59:47.406614Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.406614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10829","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iAWFyp5u4MQ1DaDiCcYx7E6qOU7E4wbqeoZG3uX6pNIelc4ep3LtXOsKrAR3ROsI3daJ8Q5isuBZ16FR8o5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:22:37.477550Z"},"content_sha256":"8a468e7a5ffc74624118e0e9cd27a7937700387f96cca3a0742b41e265be6685","schema_version":"1.0","event_id":"sha256:8a468e7a5ffc74624118e0e9cd27a7937700387f96cca3a0742b41e265be6685"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4DEHLJETERXIBJBMTVVXDKAU7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Atilla Eryilmaz, Semih Cayci","submitted_at":"2018-11-27T06:20:03Z","abstract_excerpt":"We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time of decision. To that end, we have developed and investigated an index-based policy UCB-Deadline, which performs dynamic channel allocation decisions that incorporate these traffic requirements and cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10829","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uw2tiySz29H2m+H7k7CJ4tgplE6+/mwEdr6s3QP4MlSZT7IB5sLrlvL+KQT7WJMrBnFXf1skmwIj+ygg7BwrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:22:37.477883Z"},"content_sha256":"1ddb5e9606096214b949299d542c555347cc42a024ce4dc4284a8862c2f52bd2","schema_version":"1.0","event_id":"sha256:1ddb5e9606096214b949299d542c555347cc42a024ce4dc4284a8862c2f52bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DEHLJETERXIBJBMTVVXDKAU7P/bundle.json","state_url":"https://pith.science/pith/4DEHLJETERXIBJBMTVVXDKAU7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DEHLJETERXIBJBMTVVXDKAU7P/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-30T19:22:37Z","links":{"resolver":"https://pith.science/pith/4DEHLJETERXIBJBMTVVXDKAU7P","bundle":"https://pith.science/pith/4DEHLJETERXIBJBMTVVXDKAU7P/bundle.json","state":"https://pith.science/pith/4DEHLJETERXIBJBMTVVXDKAU7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DEHLJETERXIBJBMTVVXDKAU7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4DEHLJETERXIBJBMTVVXDKAU7P","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":"250214ebce84f01c4322362c3a60109ecfafb639503bc11f587e3c884ea5c2a9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-27T06:20:03Z","title_canon_sha256":"8a11c3d3cc4d0d38b43eb051157df395cfc6853d41dfe9a2d6cc10ab56daa3b1"},"schema_version":"1.0","source":{"id":"1811.10829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10829","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10829v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10829","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"4DEHLJETERXI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DEHLJETERXIBJBM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DEHLJET","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:1ddb5e9606096214b949299d542c555347cc42a024ce4dc4284a8862c2f52bd2","target":"graph","created_at":"2026-05-17T23:59:47Z","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 study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time of decision. To that end, we have developed and investigated an index-based policy UCB-Deadline, which performs dynamic channel allocation decisions that incorporate these traffic requirements and cos","authors_text":"Atilla Eryilmaz, Semih Cayci","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-27T06:20:03Z","title":"Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10829","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:8a468e7a5ffc74624118e0e9cd27a7937700387f96cca3a0742b41e265be6685","target":"record","created_at":"2026-05-17T23:59:47Z","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":"250214ebce84f01c4322362c3a60109ecfafb639503bc11f587e3c884ea5c2a9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-27T06:20:03Z","title_canon_sha256":"8a11c3d3cc4d0d38b43eb051157df395cfc6853d41dfe9a2d6cc10ab56daa3b1"},"schema_version":"1.0","source":{"id":"1811.10829","kind":"arxiv","version":1}},"canonical_sha256":"e0c875a493246e80a42c9d6b71a814fbd7c3a24c4e675cfb7bf142e3bc57ff65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0c875a493246e80a42c9d6b71a814fbd7c3a24c4e675cfb7bf142e3bc57ff65","first_computed_at":"2026-05-17T23:59:47.406614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.406614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sDVclUw/X6PeNPBtRPkjBXy/JxN2sfZiiI1+rUD2JUG/M5R9ZaCzFUD18Viw7Y91MEuUEfVTjrLgzDZSXDxDBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.407172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a468e7a5ffc74624118e0e9cd27a7937700387f96cca3a0742b41e265be6685","sha256:1ddb5e9606096214b949299d542c555347cc42a024ce4dc4284a8862c2f52bd2"],"state_sha256":"b90a0cc6bad210af0f87364e13fa474c9b07076c3ac857eee7004bbc14ed9f3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4ETvy0KDkG7yzeH2EYqqJvExTv3J+OaYYry6dhJMBzK77ysWTogNldy/U+d9jc0l75h8mOrQ6tJ6+K6KsJoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:22:37.479858Z","bundle_sha256":"42ebae1c2588a734bf8aeaba29df81f9e52e17f9d4bbec10eb25e3ba41d1cdcd"}}