{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ORBERTJ7WUEKETS6R356HSQY6K","short_pith_number":"pith:ORBERTJ7","canonical_record":{"source":{"id":"1603.03133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-10T03:22:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94082c077259f6e14f66bdbcc2fd2e94fd13a6fe586dacd79579816a021c015b","abstract_canon_sha256":"bc0be5796c3acc44e8cc0555178c6206f7aa93c228157072cd5867d8085458c3"},"schema_version":"1.0"},"canonical_sha256":"744248cd3fb508a24e5e8efbe3ca18f283fa6e8b02612e8b2c7460535437924f","source":{"kind":"arxiv","id":"1603.03133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03133","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03133v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03133","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"ORBERTJ7WUEK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ORBERTJ7WUEKETS6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ORBERTJ7","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ORBERTJ7WUEKETS6R356HSQY6K","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-10T03:22:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94082c077259f6e14f66bdbcc2fd2e94fd13a6fe586dacd79579816a021c015b","abstract_canon_sha256":"bc0be5796c3acc44e8cc0555178c6206f7aa93c228157072cd5867d8085458c3"},"schema_version":"1.0"},"canonical_sha256":"744248cd3fb508a24e5e8efbe3ca18f283fa6e8b02612e8b2c7460535437924f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.586301Z","signature_b64":"wYs48geamD8wFkoF5ONvsuavp1TZ5qAfkrTjDkA2NoNP8L2AnHzK5e3HHAs8KjZpNeBdUiFxTy+3mQ3TeH5JCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"744248cd3fb508a24e5e8efbe3ca18f283fa6e8b02612e8b2c7460535437924f","last_reissued_at":"2026-05-18T00:58:09.585617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.585617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03133","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/j+/hNJOc3r8dKa3j7RZltLvfUE8unCdbUFu4vPuqZiM/B0DT2ZeEL42pugr/ERJTij34MwEBzRJyi+NBjmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:01:48.451495Z"},"content_sha256":"0cc7926aaf8ecbec4a317273217b5ecc2806755fd6bcb1278214a749bed55629","schema_version":"1.0","event_id":"sha256:0cc7926aaf8ecbec4a317273217b5ecc2806755fd6bcb1278214a749bed55629"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ORBERTJ7WUEKETS6R356HSQY6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Packet Scheduling with Finite Blocklength Codes: Convexity Analysis and Efficient Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Shen, Gang Zhu, Shengfeng Xu, Shih-Chun Lin, Tsung-Hui Chang","submitted_at":"2016-03-10T03:22:37Z","abstract_excerpt":"This paper considers an energy-efficient packet scheduling problem over quasi-static block fading channels. The goal is to minimize the total energy for transmitting a sequence of data packets under the first-in-first-out rule and strict delay constraints. Conventionally, such design problem is studied under the assumption that the packet transmission rate can be characterized by the classical Shannon capacity formula, which, however, may provide inaccurate energy consumption estimation, especially when the code blocklength is finite. In this paper, we formulate a new energy-efficient packet s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03133","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLO4KLGnhVbX1b2TUzJMFGw8TpaiT82TXtQCyTg3BmIYo8pl8elDVkvhiFzKJnrmhowBuI49YvOLttVIlg0WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:01:48.452153Z"},"content_sha256":"614f24ad90179099d981f6990bb14a2e3cac93cdbafbf5e49ca9d1a6818ff910","schema_version":"1.0","event_id":"sha256:614f24ad90179099d981f6990bb14a2e3cac93cdbafbf5e49ca9d1a6818ff910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORBERTJ7WUEKETS6R356HSQY6K/bundle.json","state_url":"https://pith.science/pith/ORBERTJ7WUEKETS6R356HSQY6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORBERTJ7WUEKETS6R356HSQY6K/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-27T07:01:48Z","links":{"resolver":"https://pith.science/pith/ORBERTJ7WUEKETS6R356HSQY6K","bundle":"https://pith.science/pith/ORBERTJ7WUEKETS6R356HSQY6K/bundle.json","state":"https://pith.science/pith/ORBERTJ7WUEKETS6R356HSQY6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORBERTJ7WUEKETS6R356HSQY6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ORBERTJ7WUEKETS6R356HSQY6K","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":"bc0be5796c3acc44e8cc0555178c6206f7aa93c228157072cd5867d8085458c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-10T03:22:37Z","title_canon_sha256":"94082c077259f6e14f66bdbcc2fd2e94fd13a6fe586dacd79579816a021c015b"},"schema_version":"1.0","source":{"id":"1603.03133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03133","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03133v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03133","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"ORBERTJ7WUEK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ORBERTJ7WUEKETS6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ORBERTJ7","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:614f24ad90179099d981f6990bb14a2e3cac93cdbafbf5e49ca9d1a6818ff910","target":"graph","created_at":"2026-05-18T00:58:09Z","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 an energy-efficient packet scheduling problem over quasi-static block fading channels. The goal is to minimize the total energy for transmitting a sequence of data packets under the first-in-first-out rule and strict delay constraints. Conventionally, such design problem is studied under the assumption that the packet transmission rate can be characterized by the classical Shannon capacity formula, which, however, may provide inaccurate energy consumption estimation, especially when the code blocklength is finite. In this paper, we formulate a new energy-efficient packet s","authors_text":"Chao Shen, Gang Zhu, Shengfeng Xu, Shih-Chun Lin, Tsung-Hui Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-10T03:22:37Z","title":"Energy-Efficient Packet Scheduling with Finite Blocklength Codes: Convexity Analysis and Efficient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03133","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:0cc7926aaf8ecbec4a317273217b5ecc2806755fd6bcb1278214a749bed55629","target":"record","created_at":"2026-05-18T00:58:09Z","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":"bc0be5796c3acc44e8cc0555178c6206f7aa93c228157072cd5867d8085458c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-10T03:22:37Z","title_canon_sha256":"94082c077259f6e14f66bdbcc2fd2e94fd13a6fe586dacd79579816a021c015b"},"schema_version":"1.0","source":{"id":"1603.03133","kind":"arxiv","version":1}},"canonical_sha256":"744248cd3fb508a24e5e8efbe3ca18f283fa6e8b02612e8b2c7460535437924f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"744248cd3fb508a24e5e8efbe3ca18f283fa6e8b02612e8b2c7460535437924f","first_computed_at":"2026-05-18T00:58:09.585617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.585617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wYs48geamD8wFkoF5ONvsuavp1TZ5qAfkrTjDkA2NoNP8L2AnHzK5e3HHAs8KjZpNeBdUiFxTy+3mQ3TeH5JCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.586301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cc7926aaf8ecbec4a317273217b5ecc2806755fd6bcb1278214a749bed55629","sha256:614f24ad90179099d981f6990bb14a2e3cac93cdbafbf5e49ca9d1a6818ff910"],"state_sha256":"b706ebbb30d15d8720bf0d9f62dad23e41ed0b30bd01e6134b0ec7dfc252213a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GX2zZs3H/LWRtApTXZjz9RalMfaOFaU6Ct+2op1fc9luZ+oEQGdpMaXUUG6LY+IgHZZeU/jU87xCLNU80PPbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:01:48.455709Z","bundle_sha256":"7684f359d9338d07ab2bd42e94ff23b5ce705f1a12d9c509bfa3f5bf48c164e6"}}