{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BYXSYHGYLP2LUIVCV7K3JCJ5EK","short_pith_number":"pith:BYXSYHGY","canonical_record":{"source":{"id":"1509.07759","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T15:39:03Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"625e6006d22894ea0fceecd3bc3b8d1b4346a7a7974f68aba3b247eb19bf7934","abstract_canon_sha256":"083eb08dbb620fc6bfea2aa0c95b3310e78e65e137951e3610c7be4329de7a9b"},"schema_version":"1.0"},"canonical_sha256":"0e2f2c1cd85bf4ba22a2afd5b4893d22b78e4adedc25232273f5e9818501eac6","source":{"kind":"arxiv","id":"1509.07759","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07759","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07759v2","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07759","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"BYXSYHGYLP2L","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BYXSYHGYLP2LUIVC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BYXSYHGY","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BYXSYHGYLP2LUIVCV7K3JCJ5EK","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07759","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T15:39:03Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"625e6006d22894ea0fceecd3bc3b8d1b4346a7a7974f68aba3b247eb19bf7934","abstract_canon_sha256":"083eb08dbb620fc6bfea2aa0c95b3310e78e65e137951e3610c7be4329de7a9b"},"schema_version":"1.0"},"canonical_sha256":"0e2f2c1cd85bf4ba22a2afd5b4893d22b78e4adedc25232273f5e9818501eac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.941119Z","signature_b64":"sWqnYD+fFjI66VIgLpMm+1EnyTry3aS2hbhtDJgNJyL2Z3UFvrUtUmgXYhp7si4KYsjeM2dZH8n2vxQu4WizCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2f2c1cd85bf4ba22a2afd5b4893d22b78e4adedc25232273f5e9818501eac6","last_reissued_at":"2026-05-18T01:30:33.940462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.940462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07759","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADjaDSKGtxngiDU6Xp1KeuceRUjnsrUl20mWz9iVOzkwjaadVJu/uQsvT6BeSSfyDs2ihJKznVsgfKjkQHiXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:19:40.507187Z"},"content_sha256":"8235d5c361f2c0d16a0c25b2eeda5d44af2f213a67d097ccd5dc77e5267908c1","schema_version":"1.0","event_id":"sha256:8235d5c361f2c0d16a0c25b2eeda5d44af2f213a67d097ccd5dc77e5267908c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BYXSYHGYLP2LUIVCV7K3JCJ5EK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay Optimal Power Aware Opportunistic Scheduling with Mutual Information Accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael J. Neely, Xiaohan Wei","submitted_at":"2015-09-25T15:39:03Z","abstract_excerpt":"This paper considers optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions can change from slot to slot and are unknown to the transmitter. The amount of mutual information accumulated on each slot depends on the random channel realization and the power used. The goal is to minimize average service delay subject to an average power constraint. We formulate this problem as a frame-based stochastic optimization problem and solve it vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07759","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO5hv9lCqrEnV4iUVcPpBeMGlGNmEJXowWeb1PhrmcchndwyPw19gL8Umz3XqgPLNTZNeh/doemryBlkrTv8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:19:40.507933Z"},"content_sha256":"8f58ed6ffeff43dd5b52bd76e55b996c749a6d7ede6015216351fa38f135df0f","schema_version":"1.0","event_id":"sha256:8f58ed6ffeff43dd5b52bd76e55b996c749a6d7ede6015216351fa38f135df0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/bundle.json","state_url":"https://pith.science/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/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-30T09:19:40Z","links":{"resolver":"https://pith.science/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK","bundle":"https://pith.science/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/bundle.json","state":"https://pith.science/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYXSYHGYLP2LUIVCV7K3JCJ5EK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BYXSYHGYLP2LUIVCV7K3JCJ5EK","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":"083eb08dbb620fc6bfea2aa0c95b3310e78e65e137951e3610c7be4329de7a9b","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T15:39:03Z","title_canon_sha256":"625e6006d22894ea0fceecd3bc3b8d1b4346a7a7974f68aba3b247eb19bf7934"},"schema_version":"1.0","source":{"id":"1509.07759","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07759","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07759v2","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07759","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"BYXSYHGYLP2L","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BYXSYHGYLP2LUIVC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BYXSYHGY","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:8f58ed6ffeff43dd5b52bd76e55b996c749a6d7ede6015216351fa38f135df0f","target":"graph","created_at":"2026-05-18T01:30:33Z","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 optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions can change from slot to slot and are unknown to the transmitter. The amount of mutual information accumulated on each slot depends on the random channel realization and the power used. The goal is to minimize average service delay subject to an average power constraint. We formulate this problem as a frame-based stochastic optimization problem and solve it vi","authors_text":"Michael J. Neely, Xiaohan Wei","cross_cats":["cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T15:39:03Z","title":"Delay Optimal Power Aware Opportunistic Scheduling with Mutual Information Accumulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07759","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:8235d5c361f2c0d16a0c25b2eeda5d44af2f213a67d097ccd5dc77e5267908c1","target":"record","created_at":"2026-05-18T01:30:33Z","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":"083eb08dbb620fc6bfea2aa0c95b3310e78e65e137951e3610c7be4329de7a9b","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T15:39:03Z","title_canon_sha256":"625e6006d22894ea0fceecd3bc3b8d1b4346a7a7974f68aba3b247eb19bf7934"},"schema_version":"1.0","source":{"id":"1509.07759","kind":"arxiv","version":2}},"canonical_sha256":"0e2f2c1cd85bf4ba22a2afd5b4893d22b78e4adedc25232273f5e9818501eac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2f2c1cd85bf4ba22a2afd5b4893d22b78e4adedc25232273f5e9818501eac6","first_computed_at":"2026-05-18T01:30:33.940462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:33.940462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sWqnYD+fFjI66VIgLpMm+1EnyTry3aS2hbhtDJgNJyL2Z3UFvrUtUmgXYhp7si4KYsjeM2dZH8n2vxQu4WizCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:33.941119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07759","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8235d5c361f2c0d16a0c25b2eeda5d44af2f213a67d097ccd5dc77e5267908c1","sha256:8f58ed6ffeff43dd5b52bd76e55b996c749a6d7ede6015216351fa38f135df0f"],"state_sha256":"b7a416730764df556151e58919c0dcbe8c2b0cf18fe4656879087e6e1ce80542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynHg6WEN5bxlPyLKjF8HCns+AXrJfw69OkEJ/bwbplKI0F+5UsQ8pi+CEzz6iCtlrFZHf5KHcRO3uV5Bidw5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:19:40.512451Z","bundle_sha256":"82fd3243f2131db8673dbfde0352d35c8366ff0fdf5f5d94ef3765f5358060bb"}}