{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V4DK6NW6KGNM75GJLLCARDN5RY","short_pith_number":"pith:V4DK6NW6","schema_version":"1.0","canonical_sha256":"af06af36de519acff4c95ac4088dbd8e1def050455dca9ae564109ed72749714","source":{"kind":"arxiv","id":"1601.03461","version":1},"attestation_state":"computed","paper":{"title":"Greedy-Knapsack Algorithm for Optimal Downlink Resource Allocation in LTE Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Borhanuddin Mohd Ali, Kweh Yeah Lun, Mohamed Othman, Nasim Ferdosian","submitted_at":"2016-01-14T01:33:21Z","abstract_excerpt":"The Long Term Evolution (LTE) as a mobile broadband technology supports a wide domain of communication services with different requirements. Therefore, scheduling of all flows from various applications in overload states in which the requested amount of bandwidth exceeds the limited available spectrum resources is a challenging issue. Accordingly, in this paper, a greedy algorithm is presented to evaluate user candidates which are waiting for scheduling and select an optimal set of the users to maximize system performance, without exceeding available bandwidth capacity. The greedy-knapsack alg"},"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":"1601.03461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-14T01:33:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"185350b729a4f40a60bb5c546ed03be0370374f053787e933658a2fa8e569f1a","abstract_canon_sha256":"95b578da0ba602afce4dd2357650f033cbedd782857e116a0e046f4d247b60a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:53.441857Z","signature_b64":"EkE1VpjNIy0naW3C8Eo/IV9sNhwNzvTXAS/CcCDQL+UrvdwFz2G5kYyFwH2JAIKnitt2DhkVJxecUIYmVV0jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af06af36de519acff4c95ac4088dbd8e1def050455dca9ae564109ed72749714","last_reissued_at":"2026-05-18T01:22:53.441187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:53.441187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy-Knapsack Algorithm for Optimal Downlink Resource Allocation in LTE Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Borhanuddin Mohd Ali, Kweh Yeah Lun, Mohamed Othman, Nasim Ferdosian","submitted_at":"2016-01-14T01:33:21Z","abstract_excerpt":"The Long Term Evolution (LTE) as a mobile broadband technology supports a wide domain of communication services with different requirements. Therefore, scheduling of all flows from various applications in overload states in which the requested amount of bandwidth exceeds the limited available spectrum resources is a challenging issue. Accordingly, in this paper, a greedy algorithm is presented to evaluate user candidates which are waiting for scheduling and select an optimal set of the users to maximize system performance, without exceeding available bandwidth capacity. The greedy-knapsack alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03461","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":"1601.03461","created_at":"2026-05-18T01:22:53.441280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03461v1","created_at":"2026-05-18T01:22:53.441280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03461","created_at":"2026-05-18T01:22:53.441280+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4DK6NW6KGNM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4DK6NW6KGNM75GJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4DK6NW6","created_at":"2026-05-18T12:30:46.583412+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/V4DK6NW6KGNM75GJLLCARDN5RY","json":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY.json","graph_json":"https://pith.science/api/pith-number/V4DK6NW6KGNM75GJLLCARDN5RY/graph.json","events_json":"https://pith.science/api/pith-number/V4DK6NW6KGNM75GJLLCARDN5RY/events.json","paper":"https://pith.science/paper/V4DK6NW6"},"agent_actions":{"view_html":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY","download_json":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY.json","view_paper":"https://pith.science/paper/V4DK6NW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03461&json=true","fetch_graph":"https://pith.science/api/pith-number/V4DK6NW6KGNM75GJLLCARDN5RY/graph.json","fetch_events":"https://pith.science/api/pith-number/V4DK6NW6KGNM75GJLLCARDN5RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY/action/storage_attestation","attest_author":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY/action/author_attestation","sign_citation":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY/action/citation_signature","submit_replication":"https://pith.science/pith/V4DK6NW6KGNM75GJLLCARDN5RY/action/replication_record"}},"created_at":"2026-05-18T01:22:53.441280+00:00","updated_at":"2026-05-18T01:22:53.441280+00:00"}