{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:POIBOVHXMR7D2I5RPPDBOPDGNI","short_pith_number":"pith:POIBOVHX","canonical_record":{"source":{"id":"1702.08052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:06:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e40baf703840e68089c031826f2e4bc9d5a26d199ef55fc38f9dcb295fb0e49","abstract_canon_sha256":"fe6e5258bf94efdc13fbaba955bbebc409ad7c2b825a794a5a6a2f3acc6cb351"},"schema_version":"1.0"},"canonical_sha256":"7b901754f7647e3d23b17bc6173c666a2ce3957049eeeb3197d6e7b0a21aed2b","source":{"kind":"arxiv","id":"1702.08052","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08052","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08052v3","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08052","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"POIBOVHXMR7D","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"POIBOVHXMR7D2I5R","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"POIBOVHX","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:POIBOVHXMR7D2I5RPPDBOPDGNI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:06:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e40baf703840e68089c031826f2e4bc9d5a26d199ef55fc38f9dcb295fb0e49","abstract_canon_sha256":"fe6e5258bf94efdc13fbaba955bbebc409ad7c2b825a794a5a6a2f3acc6cb351"},"schema_version":"1.0"},"canonical_sha256":"7b901754f7647e3d23b17bc6173c666a2ce3957049eeeb3197d6e7b0a21aed2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:41.565676Z","signature_b64":"A7gpoA+pzvCZ62DkgznBRNEh2G7DzOfqTD76oWT7233cmJ2fE9YhGBZ1P2Kx6OWk9RhDg9W6ffE9o+X5nGO8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b901754f7647e3d23b17bc6173c666a2ce3957049eeeb3197d6e7b0a21aed2b","last_reissued_at":"2026-05-18T00:31:41.565149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:41.565149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08052","source_version":3,"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:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDmqxOvzp4VvXGdExqh2I6/pJWuxXbeFKYIb0vZBp6nw+s8ZXPyJY4zumzJeiGWWm0eO+5jQe/utpz4vjEvuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:49:38.963228Z"},"content_sha256":"b01f3d0bb5fac53e7e6ea422afbe9cfcbec7435b8e5ec15e496c80643256c058","schema_version":"1.0","event_id":"sha256:b01f3d0bb5fac53e7e6ea422afbe9cfcbec7435b8e5ec15e496c80643256c058"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:POIBOVHXMR7D2I5RPPDBOPDGNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay-Optimal Probabilistic Scheduling with Arbitrary Arrival and Adaptive Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joohyun Lee, Ness B. Shroff, Wei Chen, Xiang Chen","submitted_at":"2017-02-26T17:06:24Z","abstract_excerpt":"In this paper, we aim to obtain the optimal delay-power tradeoff and the corresponding optimal scheduling policy for an arbitrary i.i.d. arrival process and adaptive transmissions. The number of backlogged packets at the transmitter is known to a scheduler, who has to determine how many backlogged packets to transmit during each time slot. The power consumption is assumed to be convex in transmission rates. Hence, if the scheduler transmits faster, the delay will be reduced but with higher power consumption. To obtain the optimal delay-power tradeoff and the corresponding optimal policy, we mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08052","kind":"arxiv","version":3},"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:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/JLiXgIgHHr2nPWl7o0i2IZo7opiejV9pbIWQ9zdhKhtN4iUzgfbCimXyxvytIQqnb3MloTmQTnLMFHUv5PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:49:38.963587Z"},"content_sha256":"f5d5da5d684232342f362be679034743b85f5e4662adee597ea2ca6c6260490e","schema_version":"1.0","event_id":"sha256:f5d5da5d684232342f362be679034743b85f5e4662adee597ea2ca6c6260490e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/bundle.json","state_url":"https://pith.science/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/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-06-05T17:49:38Z","links":{"resolver":"https://pith.science/pith/POIBOVHXMR7D2I5RPPDBOPDGNI","bundle":"https://pith.science/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/bundle.json","state":"https://pith.science/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POIBOVHXMR7D2I5RPPDBOPDGNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:POIBOVHXMR7D2I5RPPDBOPDGNI","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":"fe6e5258bf94efdc13fbaba955bbebc409ad7c2b825a794a5a6a2f3acc6cb351","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:06:24Z","title_canon_sha256":"6e40baf703840e68089c031826f2e4bc9d5a26d199ef55fc38f9dcb295fb0e49"},"schema_version":"1.0","source":{"id":"1702.08052","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08052","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08052v3","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08052","created_at":"2026-05-18T00:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"POIBOVHXMR7D","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"POIBOVHXMR7D2I5R","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"POIBOVHX","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:f5d5da5d684232342f362be679034743b85f5e4662adee597ea2ca6c6260490e","target":"graph","created_at":"2026-05-18T00:31:41Z","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":"In this paper, we aim to obtain the optimal delay-power tradeoff and the corresponding optimal scheduling policy for an arbitrary i.i.d. arrival process and adaptive transmissions. The number of backlogged packets at the transmitter is known to a scheduler, who has to determine how many backlogged packets to transmit during each time slot. The power consumption is assumed to be convex in transmission rates. Hence, if the scheduler transmits faster, the delay will be reduced but with higher power consumption. To obtain the optimal delay-power tradeoff and the corresponding optimal policy, we mo","authors_text":"Joohyun Lee, Ness B. Shroff, Wei Chen, Xiang Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:06:24Z","title":"Delay-Optimal Probabilistic Scheduling with Arbitrary Arrival and Adaptive Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08052","kind":"arxiv","version":3},"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:b01f3d0bb5fac53e7e6ea422afbe9cfcbec7435b8e5ec15e496c80643256c058","target":"record","created_at":"2026-05-18T00:31:41Z","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":"fe6e5258bf94efdc13fbaba955bbebc409ad7c2b825a794a5a6a2f3acc6cb351","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:06:24Z","title_canon_sha256":"6e40baf703840e68089c031826f2e4bc9d5a26d199ef55fc38f9dcb295fb0e49"},"schema_version":"1.0","source":{"id":"1702.08052","kind":"arxiv","version":3}},"canonical_sha256":"7b901754f7647e3d23b17bc6173c666a2ce3957049eeeb3197d6e7b0a21aed2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b901754f7647e3d23b17bc6173c666a2ce3957049eeeb3197d6e7b0a21aed2b","first_computed_at":"2026-05-18T00:31:41.565149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:41.565149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7gpoA+pzvCZ62DkgznBRNEh2G7DzOfqTD76oWT7233cmJ2fE9YhGBZ1P2Kx6OWk9RhDg9W6ffE9o+X5nGO8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:41.565676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08052","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b01f3d0bb5fac53e7e6ea422afbe9cfcbec7435b8e5ec15e496c80643256c058","sha256:f5d5da5d684232342f362be679034743b85f5e4662adee597ea2ca6c6260490e"],"state_sha256":"ee25a3d97de95151230cfa702f7f801d2db574e748de057439ba64d9ebe456a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gmmpy4ZtepTZf4t09uJB0pw9cHZyQDqUMipuPCUgqkFfFXJO0Z82XCyaemrDlBnblklyHxvdP7PxzInyCWYLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:49:38.966135Z","bundle_sha256":"889fb2c2268bb049170745a8ba75a790ec769e602893bf2aae2acb1dabef5576"}}