{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IOE5TI7XDCRTLWE64E3VPGKJE5","short_pith_number":"pith:IOE5TI7X","canonical_record":{"source":{"id":"1403.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T02:28:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b1a779943d409111a48d01c27babd3d24087bff7f0b301c3f105e011c26e6221","abstract_canon_sha256":"95313f1d3624f66b3ba51cac68c582f489888dbffb1cbc5065da32057291128f"},"schema_version":"1.0"},"canonical_sha256":"4389d9a3f718a335d89ee137579949274f2b4ec9f4d332d439cf2e12aa7a1362","source":{"kind":"arxiv","id":"1403.4597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4597","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4597v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4597","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"IOE5TI7XDCRT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOE5TI7XDCRTLWE6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOE5TI7X","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IOE5TI7XDCRTLWE64E3VPGKJE5","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T02:28:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b1a779943d409111a48d01c27babd3d24087bff7f0b301c3f105e011c26e6221","abstract_canon_sha256":"95313f1d3624f66b3ba51cac68c582f489888dbffb1cbc5065da32057291128f"},"schema_version":"1.0"},"canonical_sha256":"4389d9a3f718a335d89ee137579949274f2b4ec9f4d332d439cf2e12aa7a1362","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.711214Z","signature_b64":"yJa0O2M7a4sok8HqytJrwZyLnshJx7m2d23f4IzCkNfGWsaei2B9aPasBJ0hm2kMPkMO6CMJN6xhcq8Dij1+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4389d9a3f718a335d89ee137579949274f2b4ec9f4d332d439cf2e12aa7a1362","last_reissued_at":"2026-05-18T02:20:20.710498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.710498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4597","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/a4Fu9YOfkEOp7bmTuz8HhNvf6m4ksSRVoi9pnECeEgvGwsUrqB+PVb8qflaLZ6/1hLBtrZADZluX9+bkNKRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:38:26.988926Z"},"content_sha256":"70c95b7487ab369bb2d48df60bc3d473e54c1c37a5e84b20c8fa13c827a36ee1","schema_version":"1.0","event_id":"sha256:70c95b7487ab369bb2d48df60bc3d473e54c1c37a5e84b20c8fa13c827a36ee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IOE5TI7XDCRTLWE64E3VPGKJE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tianyi Chen, Wei Ni, Xin Wang, Zheng Nan","submitted_at":"2014-03-18T02:28:59Z","abstract_excerpt":"This paper develops a novel approach to obtaining energy-efficient transmission schedules for delay-limited bursty data arrivals under non-ideal circuit power consumption. Assuming a-prior knowledge of packet arrivals, deadlines and channel realizations, we show that the problem can be formulated as a convex program. For both time-invariant and time-varying fading channels, it is revealed that the optimal transmission between any two consecutive channel or data state changing instants, termed epoch, can only take one of the three strategies: (i) no transmission, (ii) transmission with an energ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4597","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfVrtJRzIh9uGOOHNZrUkQxeMMYjHgr2DCwmu56lCSX+Y8ynXMINUA4uZxEfe/JGybhzfITFNRqwFa66vI3vDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:38:26.989255Z"},"content_sha256":"c59ab5d685378951322800d460d4ec3d428c85b58dc3d929c6823fc4ef3d9b25","schema_version":"1.0","event_id":"sha256:c59ab5d685378951322800d460d4ec3d428c85b58dc3d929c6823fc4ef3d9b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/bundle.json","state_url":"https://pith.science/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/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-28T10:38:26Z","links":{"resolver":"https://pith.science/pith/IOE5TI7XDCRTLWE64E3VPGKJE5","bundle":"https://pith.science/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/bundle.json","state":"https://pith.science/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOE5TI7XDCRTLWE64E3VPGKJE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IOE5TI7XDCRTLWE64E3VPGKJE5","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":"95313f1d3624f66b3ba51cac68c582f489888dbffb1cbc5065da32057291128f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T02:28:59Z","title_canon_sha256":"b1a779943d409111a48d01c27babd3d24087bff7f0b301c3f105e011c26e6221"},"schema_version":"1.0","source":{"id":"1403.4597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4597","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4597v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4597","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"IOE5TI7XDCRT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOE5TI7XDCRTLWE6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOE5TI7X","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c59ab5d685378951322800d460d4ec3d428c85b58dc3d929c6823fc4ef3d9b25","target":"graph","created_at":"2026-05-18T02:20:20Z","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 develops a novel approach to obtaining energy-efficient transmission schedules for delay-limited bursty data arrivals under non-ideal circuit power consumption. Assuming a-prior knowledge of packet arrivals, deadlines and channel realizations, we show that the problem can be formulated as a convex program. For both time-invariant and time-varying fading channels, it is revealed that the optimal transmission between any two consecutive channel or data state changing instants, termed epoch, can only take one of the three strategies: (i) no transmission, (ii) transmission with an energ","authors_text":"Tianyi Chen, Wei Ni, Xin Wang, Zheng Nan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T02:28:59Z","title":"Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4597","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:70c95b7487ab369bb2d48df60bc3d473e54c1c37a5e84b20c8fa13c827a36ee1","target":"record","created_at":"2026-05-18T02:20:20Z","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":"95313f1d3624f66b3ba51cac68c582f489888dbffb1cbc5065da32057291128f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T02:28:59Z","title_canon_sha256":"b1a779943d409111a48d01c27babd3d24087bff7f0b301c3f105e011c26e6221"},"schema_version":"1.0","source":{"id":"1403.4597","kind":"arxiv","version":2}},"canonical_sha256":"4389d9a3f718a335d89ee137579949274f2b4ec9f4d332d439cf2e12aa7a1362","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4389d9a3f718a335d89ee137579949274f2b4ec9f4d332d439cf2e12aa7a1362","first_computed_at":"2026-05-18T02:20:20.710498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.710498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJa0O2M7a4sok8HqytJrwZyLnshJx7m2d23f4IzCkNfGWsaei2B9aPasBJ0hm2kMPkMO6CMJN6xhcq8Dij1+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.711214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70c95b7487ab369bb2d48df60bc3d473e54c1c37a5e84b20c8fa13c827a36ee1","sha256:c59ab5d685378951322800d460d4ec3d428c85b58dc3d929c6823fc4ef3d9b25"],"state_sha256":"be6e09cb0ad9773ef6615a99ef79c423e2328890331c66ae5b51075b332bb198"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8gDsCKtfPZfY4pVF3MHQnvMya20nUTOCQU8hQDjO6C/3zLfXRN4iP056mdD9NN9JEwEtRkLUMxPnf7mFJGCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:38:26.991085Z","bundle_sha256":"1752fe2ed2f5ed382773ac98a24661f5d298ef86608d440da9f10b24b36613de"}}