{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:554JML3E4NOVTVNC3VBH55WXF3","short_pith_number":"pith:554JML3E","schema_version":"1.0","canonical_sha256":"ef78962f64e35d59d5a2dd427ef6d72ed6daa2cec13f795719ab6be589d53364","source":{"kind":"arxiv","id":"1205.5153","version":1},"attestation_state":"computed","paper":{"title":"Proportional Fair Resource Allocation on an Energy Harvesting Downlink - Part II: Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Elif Uysal-Biyikoglu, Kemal Leblebicioglu, Neyre Tekbiyik, Tolga Girici","submitted_at":"2012-05-23T11:02:45Z","abstract_excerpt":"In this paper, the proportionally fair allocation of time slots in a frame, as well as power level to multiple receivers in an energy harvesting broadcast system, is considered. Energy harvest times in a frame are assumed to be known at the beginning of that frame. The goal is to solve an optimization problem designed to maximize a throughput-based utility function that provides proportional fairness among users. An optimal solution of the problem was obtained by using a Block Coordinate Descent (BCD) method in earlier work (presented in Part I of this study). However, finding the optimal allo"},"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":"1205.5153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T11:02:45Z","cross_cats_sorted":[],"title_canon_sha256":"7f092e2d7416a054562e57d3cec7c04ed9af7d68a812c38e5b6e555a1d40338f","abstract_canon_sha256":"16d5da32788427d13d0252def9df92ea012c8e57aaee31434efe6f4a60dedb5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.012193Z","signature_b64":"gEkTqwpIvALFCDkCMHhN5vKJtdFJ/PkXjJNJ4P9YSFK6K+66OOz4fVcDT9T5uJ90i2Awc8/t4L1FdKzcGsRbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef78962f64e35d59d5a2dd427ef6d72ed6daa2cec13f795719ab6be589d53364","last_reissued_at":"2026-05-18T02:21:10.011709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.011709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proportional Fair Resource Allocation on an Energy Harvesting Downlink - Part II: Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Elif Uysal-Biyikoglu, Kemal Leblebicioglu, Neyre Tekbiyik, Tolga Girici","submitted_at":"2012-05-23T11:02:45Z","abstract_excerpt":"In this paper, the proportionally fair allocation of time slots in a frame, as well as power level to multiple receivers in an energy harvesting broadcast system, is considered. Energy harvest times in a frame are assumed to be known at the beginning of that frame. The goal is to solve an optimization problem designed to maximize a throughput-based utility function that provides proportional fairness among users. An optimal solution of the problem was obtained by using a Block Coordinate Descent (BCD) method in earlier work (presented in Part I of this study). However, finding the optimal allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5153","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.5153","created_at":"2026-05-18T02:21:10.011775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5153v1","created_at":"2026-05-18T02:21:10.011775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5153","created_at":"2026-05-18T02:21:10.011775+00:00"},{"alias_kind":"pith_short_12","alias_value":"554JML3E4NOV","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"554JML3E4NOVTVNC","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"554JML3E","created_at":"2026-05-18T12:26:53.410803+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/554JML3E4NOVTVNC3VBH55WXF3","json":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3.json","graph_json":"https://pith.science/api/pith-number/554JML3E4NOVTVNC3VBH55WXF3/graph.json","events_json":"https://pith.science/api/pith-number/554JML3E4NOVTVNC3VBH55WXF3/events.json","paper":"https://pith.science/paper/554JML3E"},"agent_actions":{"view_html":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3","download_json":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3.json","view_paper":"https://pith.science/paper/554JML3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5153&json=true","fetch_graph":"https://pith.science/api/pith-number/554JML3E4NOVTVNC3VBH55WXF3/graph.json","fetch_events":"https://pith.science/api/pith-number/554JML3E4NOVTVNC3VBH55WXF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3/action/storage_attestation","attest_author":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3/action/author_attestation","sign_citation":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3/action/citation_signature","submit_replication":"https://pith.science/pith/554JML3E4NOVTVNC3VBH55WXF3/action/replication_record"}},"created_at":"2026-05-18T02:21:10.011775+00:00","updated_at":"2026-05-18T02:21:10.011775+00:00"}