{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6M6YDMEG7GPGTAPW6EVS3UIRPU","short_pith_number":"pith:6M6YDMEG","canonical_record":{"source":{"id":"1710.01342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T18:38:27Z","cross_cats_sorted":[],"title_canon_sha256":"a32bf25bbc26fdd0725817d1820826bed1a360d169b3df9e79bfda53254f812a","abstract_canon_sha256":"3e568f0a55e76c538cfabed07813ffa24d754b476a0b2920e6d24cda209d200d"},"schema_version":"1.0"},"canonical_sha256":"f33d81b086f99e6981f6f12b2dd1117d099cc31273fe14a0ea4814b87c232637","source":{"kind":"arxiv","id":"1710.01342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01342","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01342v1","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01342","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"6M6YDMEG7GPG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6M6YDMEG7GPGTAPW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6M6YDMEG","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6M6YDMEG7GPGTAPW6EVS3UIRPU","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T18:38:27Z","cross_cats_sorted":[],"title_canon_sha256":"a32bf25bbc26fdd0725817d1820826bed1a360d169b3df9e79bfda53254f812a","abstract_canon_sha256":"3e568f0a55e76c538cfabed07813ffa24d754b476a0b2920e6d24cda209d200d"},"schema_version":"1.0"},"canonical_sha256":"f33d81b086f99e6981f6f12b2dd1117d099cc31273fe14a0ea4814b87c232637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.074099Z","signature_b64":"TJr/93rSjs569/DvaH56lLJThb8sd29CmhcjO46UsSuut6H0LTJT7m8KFp62j2+FYi7Cu1HrtPqOQo9CKEzsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f33d81b086f99e6981f6f12b2dd1117d099cc31273fe14a0ea4814b87c232637","last_reissued_at":"2026-05-18T00:33:43.073403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.073403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01342","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-18T00:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZTOAGexTAtxm7tfX4ugTLSUQ0ZLwtAuL3Qg9JgIm4/bcWHjjZ9fuCvF95OjAJLGgZdlK0fr2w90dvtdQIlBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:33:18.624071Z"},"content_sha256":"68f6a0c40d8904773cd09a9b40729f134f4e590fc3d678d18db4976768a61f08","schema_version":"1.0","event_id":"sha256:68f6a0c40d8904773cd09a9b40729f134f4e590fc3d678d18db4976768a61f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6M6YDMEG7GPGTAPW6EVS3UIRPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Convergence and Adaptation for Utility Optimal Opportunistic Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2017-10-03T18:38:27Z","abstract_excerpt":"This paper considers the fundamental convergence time for opportunistic scheduling over time-varying channels. The channel state probabilities are unknown and algorithms must perform some type of estimation and learning while they make decisions to optimize network utility. Existing schemes can achieve a utility within $\\epsilon$ of optimality, for any desired $\\epsilon>0$, with convergence and adaptation times of $O(1/\\epsilon^2)$. This paper shows that if the utility function is concave and smooth, then $O(\\log(1/\\epsilon)/\\epsilon)$ convergence time is possible via an existing stochastic va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01342","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-18T00:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGrzJx+rhKD4fnwjUBHEdWxGmlcPn3UZNRpLgoPZ8Wc20DL6MiQN03xVKZagvjd80wSKSd2rBni3iTvVmMf/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:33:18.624695Z"},"content_sha256":"fbde267a7e8e4184a3032367ac5ebbb3f736e43331072b85b55d6053436e24ba","schema_version":"1.0","event_id":"sha256:fbde267a7e8e4184a3032367ac5ebbb3f736e43331072b85b55d6053436e24ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/bundle.json","state_url":"https://pith.science/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/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-30T11:33:18Z","links":{"resolver":"https://pith.science/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU","bundle":"https://pith.science/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/bundle.json","state":"https://pith.science/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6M6YDMEG7GPGTAPW6EVS3UIRPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6M6YDMEG7GPGTAPW6EVS3UIRPU","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":"3e568f0a55e76c538cfabed07813ffa24d754b476a0b2920e6d24cda209d200d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T18:38:27Z","title_canon_sha256":"a32bf25bbc26fdd0725817d1820826bed1a360d169b3df9e79bfda53254f812a"},"schema_version":"1.0","source":{"id":"1710.01342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01342","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01342v1","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01342","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"6M6YDMEG7GPG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6M6YDMEG7GPGTAPW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6M6YDMEG","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:fbde267a7e8e4184a3032367ac5ebbb3f736e43331072b85b55d6053436e24ba","target":"graph","created_at":"2026-05-18T00:33:43Z","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":"This paper considers the fundamental convergence time for opportunistic scheduling over time-varying channels. The channel state probabilities are unknown and algorithms must perform some type of estimation and learning while they make decisions to optimize network utility. Existing schemes can achieve a utility within $\\epsilon$ of optimality, for any desired $\\epsilon>0$, with convergence and adaptation times of $O(1/\\epsilon^2)$. This paper shows that if the utility function is concave and smooth, then $O(\\log(1/\\epsilon)/\\epsilon)$ convergence time is possible via an existing stochastic va","authors_text":"Michael J. Neely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T18:38:27Z","title":"Optimal Convergence and Adaptation for Utility Optimal Opportunistic Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01342","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:68f6a0c40d8904773cd09a9b40729f134f4e590fc3d678d18db4976768a61f08","target":"record","created_at":"2026-05-18T00:33:43Z","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":"3e568f0a55e76c538cfabed07813ffa24d754b476a0b2920e6d24cda209d200d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T18:38:27Z","title_canon_sha256":"a32bf25bbc26fdd0725817d1820826bed1a360d169b3df9e79bfda53254f812a"},"schema_version":"1.0","source":{"id":"1710.01342","kind":"arxiv","version":1}},"canonical_sha256":"f33d81b086f99e6981f6f12b2dd1117d099cc31273fe14a0ea4814b87c232637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f33d81b086f99e6981f6f12b2dd1117d099cc31273fe14a0ea4814b87c232637","first_computed_at":"2026-05-18T00:33:43.073403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:43.073403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TJr/93rSjs569/DvaH56lLJThb8sd29CmhcjO46UsSuut6H0LTJT7m8KFp62j2+FYi7Cu1HrtPqOQo9CKEzsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:43.074099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68f6a0c40d8904773cd09a9b40729f134f4e590fc3d678d18db4976768a61f08","sha256:fbde267a7e8e4184a3032367ac5ebbb3f736e43331072b85b55d6053436e24ba"],"state_sha256":"ef7b344040aa1741439f79daaa945dcf073707171e74091e50c062a2149b7b99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE0+kczgPqS6PUkrxW83wp38WGWfdCM4Du9iGl77yFtSCZuRUhCq4Mg5WiEhVVXXk/cWz1t9zjLgL5YjyHVrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:33:18.627852Z","bundle_sha256":"9b90136141b0158b25793f0461f8f2bb036930b7a53588b0b5f06113a2e9873f"}}