{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IQJVD4TNG5WZAC2PP6ZTDX6U7D","short_pith_number":"pith:IQJVD4TN","canonical_record":{"source":{"id":"1804.09040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T13:46:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"683ec07ee7edfcdb5b93ec5d741369484e73716aedaaf37bc27167c19e8fc5e3","abstract_canon_sha256":"dc2eab9bf4585aee112f18f15ea192282ab28a525d514ea430bb6fccd7af8511"},"schema_version":"1.0"},"canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","source":{"kind":"arxiv","id":"1804.09040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09040","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09040v2","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09040","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"IQJVD4TNG5WZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IQJVD4TNG5WZAC2P","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IQJVD4TN","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IQJVD4TNG5WZAC2PP6ZTDX6U7D","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T13:46:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"683ec07ee7edfcdb5b93ec5d741369484e73716aedaaf37bc27167c19e8fc5e3","abstract_canon_sha256":"dc2eab9bf4585aee112f18f15ea192282ab28a525d514ea430bb6fccd7af8511"},"schema_version":"1.0"},"canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:16.179024Z","signature_b64":"Orof6Z5Tf2opZZfJhWavczdUqyETS7sXlwzqQajwULnZlFJI/rGEmf1cOnv/F8alMDQ+qJYUSSehWLalJg+wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","last_reissued_at":"2026-05-18T00:17:16.178367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:16.178367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09040","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-18T00:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQUD7R2A91SNE8Te0y5ytuCmnsLym7A6BPIq1jLGAFRVuLsYcdY/zPNl/8axiX+OvoapeEGTkCE/KY299O3HAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:29:12.956500Z"},"content_sha256":"b9eaf5b8217a2c11d82a03b2fb022dcacd0f860ef3e56dad38810bfad2a84ac1","schema_version":"1.0","event_id":"sha256:b9eaf5b8217a2c11d82a03b2fb022dcacd0f860ef3e56dad38810bfad2a84ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IQJVD4TNG5WZAC2PP6ZTDX6U7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal User Scheduling in Energy Harvesting Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adrish Banerjee, Kalpant Pathak, Sanket S. Kalamkar","submitted_at":"2018-04-24T13:46:29Z","abstract_excerpt":"We consider a wireless network where multiple energy harvesting transmitters communicate with the common receiver in a time sharing manner. In each slot, a transmitter can either harvest energy or send its data to the receiver. Given a time deadline, the goal is to maximize the sum-rate of transmitters under random energy arrivals with both perfect and imperfect channel state information (CSI) at the receiver. The original sumrate maximization (SRM) problem is a non-convex mixed integer non-linear program (MINLP). To obtain the optimal scheduling policy, we first reduce the original optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09040","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-18T00:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0adup8FEIqNVmhMjzMKwz8QeQOBxu+4XCRhfq/j1sgPu2kwEoE527goJoDqln4bhKdEpKnWQuXXAnyzGte7uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:29:12.956849Z"},"content_sha256":"67df1510298be98f4a6375eab62d4624fa3dab5b40371a2eaf00bd114220366d","schema_version":"1.0","event_id":"sha256:67df1510298be98f4a6375eab62d4624fa3dab5b40371a2eaf00bd114220366d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/bundle.json","state_url":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/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-03T03:29:12Z","links":{"resolver":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D","bundle":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/bundle.json","state":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IQJVD4TNG5WZAC2PP6ZTDX6U7D","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":"dc2eab9bf4585aee112f18f15ea192282ab28a525d514ea430bb6fccd7af8511","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T13:46:29Z","title_canon_sha256":"683ec07ee7edfcdb5b93ec5d741369484e73716aedaaf37bc27167c19e8fc5e3"},"schema_version":"1.0","source":{"id":"1804.09040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09040","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09040v2","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09040","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"IQJVD4TNG5WZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IQJVD4TNG5WZAC2P","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IQJVD4TN","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:67df1510298be98f4a6375eab62d4624fa3dab5b40371a2eaf00bd114220366d","target":"graph","created_at":"2026-05-18T00:17:16Z","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":"We consider a wireless network where multiple energy harvesting transmitters communicate with the common receiver in a time sharing manner. In each slot, a transmitter can either harvest energy or send its data to the receiver. Given a time deadline, the goal is to maximize the sum-rate of transmitters under random energy arrivals with both perfect and imperfect channel state information (CSI) at the receiver. The original sumrate maximization (SRM) problem is a non-convex mixed integer non-linear program (MINLP). To obtain the optimal scheduling policy, we first reduce the original optimizati","authors_text":"Adrish Banerjee, Kalpant Pathak, Sanket S. Kalamkar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T13:46:29Z","title":"Optimal User Scheduling in Energy Harvesting Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09040","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:b9eaf5b8217a2c11d82a03b2fb022dcacd0f860ef3e56dad38810bfad2a84ac1","target":"record","created_at":"2026-05-18T00:17:16Z","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":"dc2eab9bf4585aee112f18f15ea192282ab28a525d514ea430bb6fccd7af8511","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T13:46:29Z","title_canon_sha256":"683ec07ee7edfcdb5b93ec5d741369484e73716aedaaf37bc27167c19e8fc5e3"},"schema_version":"1.0","source":{"id":"1804.09040","kind":"arxiv","version":2}},"canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","first_computed_at":"2026-05-18T00:17:16.178367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:16.178367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Orof6Z5Tf2opZZfJhWavczdUqyETS7sXlwzqQajwULnZlFJI/rGEmf1cOnv/F8alMDQ+qJYUSSehWLalJg+wCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:16.179024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9eaf5b8217a2c11d82a03b2fb022dcacd0f860ef3e56dad38810bfad2a84ac1","sha256:67df1510298be98f4a6375eab62d4624fa3dab5b40371a2eaf00bd114220366d"],"state_sha256":"f6370f241baab3b737af05d71f446cb424a010718fce2165cd3cabedfaf70ae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eym9kcLNLBc5T1YnToPD0LImFlQiVIzOVnQ3N4fW2FPgh+17WOcWloEqitNMUpWYFeyJsML+wQUIwUqdZGsIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:29:12.958809Z","bundle_sha256":"632abe2fd01775b9f670a1337775b2ce743e3bfcb0db8b9f52efdae65b845830"}}