{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IQJVD4TNG5WZAC2PP6ZTDX6U7D","short_pith_number":"pith:IQJVD4TN","schema_version":"1.0","canonical_sha256":"441351f26d376d900b4f7fb331dfd4f8dfba9863bc3121190151a07caf93aeb9","source":{"kind":"arxiv","id":"1804.09040","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.09040","created_at":"2026-05-18T00:17:16.178462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09040v2","created_at":"2026-05-18T00:17:16.178462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09040","created_at":"2026-05-18T00:17:16.178462+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQJVD4TNG5WZ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQJVD4TNG5WZAC2P","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQJVD4TN","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D","json":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D.json","graph_json":"https://pith.science/api/pith-number/IQJVD4TNG5WZAC2PP6ZTDX6U7D/graph.json","events_json":"https://pith.science/api/pith-number/IQJVD4TNG5WZAC2PP6ZTDX6U7D/events.json","paper":"https://pith.science/paper/IQJVD4TN"},"agent_actions":{"view_html":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D","download_json":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D.json","view_paper":"https://pith.science/paper/IQJVD4TN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09040&json=true","fetch_graph":"https://pith.science/api/pith-number/IQJVD4TNG5WZAC2PP6ZTDX6U7D/graph.json","fetch_events":"https://pith.science/api/pith-number/IQJVD4TNG5WZAC2PP6ZTDX6U7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/action/storage_attestation","attest_author":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/action/author_attestation","sign_citation":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/action/citation_signature","submit_replication":"https://pith.science/pith/IQJVD4TNG5WZAC2PP6ZTDX6U7D/action/replication_record"}},"created_at":"2026-05-18T00:17:16.178462+00:00","updated_at":"2026-05-18T00:17:16.178462+00:00"}