{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6D6NJ4Q7PURFKX5APT2LBIT5MO","short_pith_number":"pith:6D6NJ4Q7","canonical_record":{"source":{"id":"1708.08178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-08-28T03:53:50Z","cross_cats_sorted":["cs.NI","math.PR"],"title_canon_sha256":"f85d5c2e34862dcfe177027bc3da388c47e83855bbc79431f17fcaaea2f4746c","abstract_canon_sha256":"f1641a51052483a78a3434f6ea3ffc0a1449d3ea75b1aa2cf8a08018085729f0"},"schema_version":"1.0"},"canonical_sha256":"f0fcd4f21f7d22555fa07cf4b0a27d639d57129adc9dab493fb20a2e29289941","source":{"kind":"arxiv","id":"1708.08178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08178","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08178v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08178","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"6D6NJ4Q7PURF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D6NJ4Q7PURFKX5A","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D6NJ4Q7","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6D6NJ4Q7PURFKX5APT2LBIT5MO","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-08-28T03:53:50Z","cross_cats_sorted":["cs.NI","math.PR"],"title_canon_sha256":"f85d5c2e34862dcfe177027bc3da388c47e83855bbc79431f17fcaaea2f4746c","abstract_canon_sha256":"f1641a51052483a78a3434f6ea3ffc0a1449d3ea75b1aa2cf8a08018085729f0"},"schema_version":"1.0"},"canonical_sha256":"f0fcd4f21f7d22555fa07cf4b0a27d639d57129adc9dab493fb20a2e29289941","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:46.105396Z","signature_b64":"fmk8TJY29vGTu+pnNtfy8xL0j3GyGHsQLW5JfGuth1cf6lPTvhtXctxDkNeRMfW0qyAHVqE/6Vi/67jZT+I+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0fcd4f21f7d22555fa07cf4b0a27d639d57129adc9dab493fb20a2e29289941","last_reissued_at":"2026-05-18T00:35:46.104871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:46.104871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08178","source_version":2,"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:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCGS2IzMYsU6NgcVBIwKjvjCy7L/Pl41ttjOXjlUzZ/Q5r3FXeroNpB7LGQi8rFyFV6FyKMo/Sqnxk60ZKWgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:18.776310Z"},"content_sha256":"d8f20b12c932151c1112fe78fe2d53c6927d3aad1364750f69b39cc6646a10b5","schema_version":"1.0","event_id":"sha256:d8f20b12c932151c1112fe78fe2d53c6927d3aad1364750f69b39cc6646a10b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6D6NJ4Q7PURFKX5APT2LBIT5MO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Risk-Sensitive Optimal Control of Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.PR"],"primary_cat":"cs.SY","authors_text":"Eytan Modiano, Rahul Singh, Xueying Guo","submitted_at":"2017-08-28T03:53:50Z","abstract_excerpt":"We consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet transmission incurs a cost $C$, while packet delivery yields a reward of $R$ units. The client maintains a finite buffer of size $B$, and a penalty of $L$ units is imposed upon packet loss which occurs due to finite queueing buffer.\n  We show that the risk-sensitive optimal control policy for such a simple set-up is of threshold type, i.e., it is optimal to carry"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08178","kind":"arxiv","version":2},"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:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMUoncp+w84gnjuBmAeu8sGwBL0LY/GWJrrDlyM9IIjNxhN/Zn3p6flIq1w4Lwcs4D+3tQg9YoqJuyi7K9pxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:18.777027Z"},"content_sha256":"dc066190ed52b73f2a666ed8aae66dfcb9aef58702d545766b65cb6457ad34dc","schema_version":"1.0","event_id":"sha256:dc066190ed52b73f2a666ed8aae66dfcb9aef58702d545766b65cb6457ad34dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/bundle.json","state_url":"https://pith.science/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/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-31T02:56:18Z","links":{"resolver":"https://pith.science/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO","bundle":"https://pith.science/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/bundle.json","state":"https://pith.science/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D6NJ4Q7PURFKX5APT2LBIT5MO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6D6NJ4Q7PURFKX5APT2LBIT5MO","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":"f1641a51052483a78a3434f6ea3ffc0a1449d3ea75b1aa2cf8a08018085729f0","cross_cats_sorted":["cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-08-28T03:53:50Z","title_canon_sha256":"f85d5c2e34862dcfe177027bc3da388c47e83855bbc79431f17fcaaea2f4746c"},"schema_version":"1.0","source":{"id":"1708.08178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08178","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08178v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08178","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"6D6NJ4Q7PURF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D6NJ4Q7PURFKX5A","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D6NJ4Q7","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:dc066190ed52b73f2a666ed8aae66dfcb9aef58702d545766b65cb6457ad34dc","target":"graph","created_at":"2026-05-18T00:35:46Z","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 consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet transmission incurs a cost $C$, while packet delivery yields a reward of $R$ units. The client maintains a finite buffer of size $B$, and a penalty of $L$ units is imposed upon packet loss which occurs due to finite queueing buffer.\n  We show that the risk-sensitive optimal control policy for such a simple set-up is of threshold type, i.e., it is optimal to carry","authors_text":"Eytan Modiano, Rahul Singh, Xueying Guo","cross_cats":["cs.NI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-08-28T03:53:50Z","title":"Risk-Sensitive Optimal Control of Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08178","kind":"arxiv","version":2},"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:d8f20b12c932151c1112fe78fe2d53c6927d3aad1364750f69b39cc6646a10b5","target":"record","created_at":"2026-05-18T00:35:46Z","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":"f1641a51052483a78a3434f6ea3ffc0a1449d3ea75b1aa2cf8a08018085729f0","cross_cats_sorted":["cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-08-28T03:53:50Z","title_canon_sha256":"f85d5c2e34862dcfe177027bc3da388c47e83855bbc79431f17fcaaea2f4746c"},"schema_version":"1.0","source":{"id":"1708.08178","kind":"arxiv","version":2}},"canonical_sha256":"f0fcd4f21f7d22555fa07cf4b0a27d639d57129adc9dab493fb20a2e29289941","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0fcd4f21f7d22555fa07cf4b0a27d639d57129adc9dab493fb20a2e29289941","first_computed_at":"2026-05-18T00:35:46.104871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:46.104871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmk8TJY29vGTu+pnNtfy8xL0j3GyGHsQLW5JfGuth1cf6lPTvhtXctxDkNeRMfW0qyAHVqE/6Vi/67jZT+I+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:46.105396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8f20b12c932151c1112fe78fe2d53c6927d3aad1364750f69b39cc6646a10b5","sha256:dc066190ed52b73f2a666ed8aae66dfcb9aef58702d545766b65cb6457ad34dc"],"state_sha256":"9d45530c8bb398edd3eaf0c09a62e02e8c7757b1c33e5e030f3b8d5321e3db12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxfTvMZWis9BlrHiaj1saQs70kJW6Jy9SWn0luI01mF3jTIlaNDJZ5n1Q8bjXGw5GFlnYW7UxYaIg8EWg+3uBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:56:18.780129Z","bundle_sha256":"6cda8c065568fd7f57a8aaaa9e295317200d60c1a4f36cd305e6766897de1125"}}