{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:L32KH5QZ3PB4KBXBPWPNJY2QJ2","short_pith_number":"pith:L32KH5QZ","canonical_record":{"source":{"id":"1008.3421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-20T00:43:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a4334e97103d203135881aab800e1f9d5c51d314c31599bf27e29431c9d79b02","abstract_canon_sha256":"0f71f2392fb48fc0e255ac0b1b12419fd00e6f46c932700f75eed20be7950f64"},"schema_version":"1.0"},"canonical_sha256":"5ef4a3f619dbc3c506e17d9ed4e3504ead437d6d964d25391f81ed9b04db465f","source":{"kind":"arxiv","id":"1008.3421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3421","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3421v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3421","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"L32KH5QZ3PB4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"L32KH5QZ3PB4KBXB","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"L32KH5QZ","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:L32KH5QZ3PB4KBXBPWPNJY2QJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-20T00:43:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a4334e97103d203135881aab800e1f9d5c51d314c31599bf27e29431c9d79b02","abstract_canon_sha256":"0f71f2392fb48fc0e255ac0b1b12419fd00e6f46c932700f75eed20be7950f64"},"schema_version":"1.0"},"canonical_sha256":"5ef4a3f619dbc3c506e17d9ed4e3504ead437d6d964d25391f81ed9b04db465f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.414941Z","signature_b64":"3K8GdqqWzgxFYBLX1RwfRwGUGZs9BieYKMjCy+ryL5YPvPQIjKKpa1NCOGeLjZK3l7eLP6S9ew4Praeq5fTJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef4a3f619dbc3c506e17d9ed4e3504ead437d6d964d25391f81ed9b04db465f","last_reissued_at":"2026-05-18T04:42:02.414558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.414558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3421","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-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvpgX8c+fMM/FXSVx+VvFl+4A631JlexDFYZJM/X1HhUuFLtIMdtqEFcrUVc166bO92jr9XiRviPNtUqu4iYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:09:23.929887Z"},"content_sha256":"7ddc6f897a236f27f971863d7754ba389f3920e9b24375c31b10db1cf9bb43ae","schema_version":"1.0","event_id":"sha256:7ddc6f897a236f27f971863d7754ba389f3920e9b24375c31b10db1cf9bb43ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:L32KH5QZ3PB4KBXBPWPNJY2QJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Utility Maximization over Partially Observable Markovian Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Chih-ping Li, Michael J. Neely","submitted_at":"2010-08-20T00:43:25Z","abstract_excerpt":"We consider a utility maximization problem over partially observable Markov ON/OFF channels. In this network instantaneous channel states are never known, and at most one user is selected for service in every slot according to the partial channel information provided by past observations. Solving the utility maximization problem directly is difficult because it involves solving partially observable Markov decision processes. Instead, we construct an approximate solution by optimizing the network utility only over a good constrained network capacity region rendered by stationary policies. Using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3421","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-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcKRFeiidwAh2nod/NVZ8nLUYZdfqDMYBRaUDIeNkv8hxw6xDbFwDdMO+Qb6ghf32ItcGi7+88XI/nHfdDL6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:09:23.930561Z"},"content_sha256":"8e8836f00196b1ffe759617c6f31f1d5ab4634d1b3e24437b22f7dd3d239b4f5","schema_version":"1.0","event_id":"sha256:8e8836f00196b1ffe759617c6f31f1d5ab4634d1b3e24437b22f7dd3d239b4f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/bundle.json","state_url":"https://pith.science/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/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-28T20:09:23Z","links":{"resolver":"https://pith.science/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2","bundle":"https://pith.science/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/bundle.json","state":"https://pith.science/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L32KH5QZ3PB4KBXBPWPNJY2QJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:L32KH5QZ3PB4KBXBPWPNJY2QJ2","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":"0f71f2392fb48fc0e255ac0b1b12419fd00e6f46c932700f75eed20be7950f64","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-20T00:43:25Z","title_canon_sha256":"a4334e97103d203135881aab800e1f9d5c51d314c31599bf27e29431c9d79b02"},"schema_version":"1.0","source":{"id":"1008.3421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3421","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3421v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3421","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"L32KH5QZ3PB4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"L32KH5QZ3PB4KBXB","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"L32KH5QZ","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:8e8836f00196b1ffe759617c6f31f1d5ab4634d1b3e24437b22f7dd3d239b4f5","target":"graph","created_at":"2026-05-18T04:42:02Z","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 a utility maximization problem over partially observable Markov ON/OFF channels. In this network instantaneous channel states are never known, and at most one user is selected for service in every slot according to the partial channel information provided by past observations. Solving the utility maximization problem directly is difficult because it involves solving partially observable Markov decision processes. Instead, we construct an approximate solution by optimizing the network utility only over a good constrained network capacity region rendered by stationary policies. Using","authors_text":"Chih-ping Li, Michael J. Neely","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-20T00:43:25Z","title":"Network Utility Maximization over Partially Observable Markovian Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3421","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:7ddc6f897a236f27f971863d7754ba389f3920e9b24375c31b10db1cf9bb43ae","target":"record","created_at":"2026-05-18T04:42:02Z","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":"0f71f2392fb48fc0e255ac0b1b12419fd00e6f46c932700f75eed20be7950f64","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-20T00:43:25Z","title_canon_sha256":"a4334e97103d203135881aab800e1f9d5c51d314c31599bf27e29431c9d79b02"},"schema_version":"1.0","source":{"id":"1008.3421","kind":"arxiv","version":1}},"canonical_sha256":"5ef4a3f619dbc3c506e17d9ed4e3504ead437d6d964d25391f81ed9b04db465f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef4a3f619dbc3c506e17d9ed4e3504ead437d6d964d25391f81ed9b04db465f","first_computed_at":"2026-05-18T04:42:02.414558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:02.414558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3K8GdqqWzgxFYBLX1RwfRwGUGZs9BieYKMjCy+ryL5YPvPQIjKKpa1NCOGeLjZK3l7eLP6S9ew4Praeq5fTJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:02.414941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ddc6f897a236f27f971863d7754ba389f3920e9b24375c31b10db1cf9bb43ae","sha256:8e8836f00196b1ffe759617c6f31f1d5ab4634d1b3e24437b22f7dd3d239b4f5"],"state_sha256":"184c3a4e57c5cbbaf5d78d01bde377c60417f9b0cda233fbb89fe6edbfecde46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcx1UhC9QhInIoUatPAli61lvz4cP6lRI0iC6gk+wnr2ihzG+hE3g/MYUD6wD3calX6W3MrtJY4xc6sLnrRpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:09:23.933786Z","bundle_sha256":"ff6b30764cbc503b60b30c426a1c913201f9587c2ab9808a0f7d2f74feec9fab"}}