{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HX5ULWONC6JA2STMTBU6QMCCPR","short_pith_number":"pith:HX5ULWON","canonical_record":{"source":{"id":"1507.07161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T02:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"04bca942fd0305af7cd3290ad30b96020c73b11abe928570d651976384e1c1fd","abstract_canon_sha256":"695b1fc35b6a986ae294fec7b42df5988562a38b0da5c12e78141a7949ccd6f3"},"schema_version":"1.0"},"canonical_sha256":"3dfb45d9cd17920d4a6c9869e830427c620f0841b50a6c9ec572be6fbd13d886","source":{"kind":"arxiv","id":"1507.07161","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07161","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07161v3","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07161","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"HX5ULWONC6JA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HX5ULWONC6JA2STM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HX5ULWON","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HX5ULWONC6JA2STMTBU6QMCCPR","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T02:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"04bca942fd0305af7cd3290ad30b96020c73b11abe928570d651976384e1c1fd","abstract_canon_sha256":"695b1fc35b6a986ae294fec7b42df5988562a38b0da5c12e78141a7949ccd6f3"},"schema_version":"1.0"},"canonical_sha256":"3dfb45d9cd17920d4a6c9869e830427c620f0841b50a6c9ec572be6fbd13d886","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.200880Z","signature_b64":"bMbO5uCdXi9uR7RybPOok+WKpeinSTP00m8xdo3vr+rRgayxJqdRIlo+mGFCR4cNiDO71Ky7v7lZZq3C/8qWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dfb45d9cd17920d4a6c9869e830427c620f0841b50a6c9ec572be6fbd13d886","last_reissued_at":"2026-05-18T01:01:36.200213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.200213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07161","source_version":3,"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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzOmUQ6YqRFd0eSNCelYa2MihktHlNmcwNS/t+6IV4tlZUYHQ/YHey5EjpEawRor9778VG7xiStXm3+XZcpLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:18:23.186278Z"},"content_sha256":"3bc155d7e57ad47b694f5913a04de52087ab9bfaaa3e0c35389bbd38c4cc9802","schema_version":"1.0","event_id":"sha256:3bc155d7e57ad47b694f5913a04de52087ab9bfaaa3e0c35389bbd38c4cc9802"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HX5ULWONC6JA2STMTBU6QMCCPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Resource Allocation with Frequency Reuse in Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed Abdelhadi, T. Charles Clancy","submitted_at":"2015-07-26T02:17:28Z","abstract_excerpt":"In this paper, we introduce a novel approach for optimal resource allocation with frequency reuse for users with elastic and inelastic traffic in cellular networks. In our model, we represent users' applications running on different user equipments (UE)s by logarithmic and sigmoid utility functions. We applied utility proportional fairness allocation policy, i.e. the resources are allocated among users with fairness in utility percentage of the application running on each mobile station. Our objective is to allocate the cellular system resources to mobile users optimally from a multi-cell netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07161","kind":"arxiv","version":3},"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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmvkSIPZLM323f9uO3vvRamPC9tGM9fnsgsWwDsO1Sl5h6YYRZR1WlJsGBGtuDcJFK7ZNgpgpFFXOEffUDT0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:18:23.186643Z"},"content_sha256":"e744e4f1892e0c4a5bed15b427bf969bf0573687f3f0ae47d5d75592b861c12e","schema_version":"1.0","event_id":"sha256:e744e4f1892e0c4a5bed15b427bf969bf0573687f3f0ae47d5d75592b861c12e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HX5ULWONC6JA2STMTBU6QMCCPR/bundle.json","state_url":"https://pith.science/pith/HX5ULWONC6JA2STMTBU6QMCCPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HX5ULWONC6JA2STMTBU6QMCCPR/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-02T04:18:23Z","links":{"resolver":"https://pith.science/pith/HX5ULWONC6JA2STMTBU6QMCCPR","bundle":"https://pith.science/pith/HX5ULWONC6JA2STMTBU6QMCCPR/bundle.json","state":"https://pith.science/pith/HX5ULWONC6JA2STMTBU6QMCCPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HX5ULWONC6JA2STMTBU6QMCCPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HX5ULWONC6JA2STMTBU6QMCCPR","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":"695b1fc35b6a986ae294fec7b42df5988562a38b0da5c12e78141a7949ccd6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T02:17:28Z","title_canon_sha256":"04bca942fd0305af7cd3290ad30b96020c73b11abe928570d651976384e1c1fd"},"schema_version":"1.0","source":{"id":"1507.07161","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07161","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07161v3","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07161","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"HX5ULWONC6JA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HX5ULWONC6JA2STM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HX5ULWON","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e744e4f1892e0c4a5bed15b427bf969bf0573687f3f0ae47d5d75592b861c12e","target":"graph","created_at":"2026-05-18T01:01:36Z","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":"In this paper, we introduce a novel approach for optimal resource allocation with frequency reuse for users with elastic and inelastic traffic in cellular networks. In our model, we represent users' applications running on different user equipments (UE)s by logarithmic and sigmoid utility functions. We applied utility proportional fairness allocation policy, i.e. the resources are allocated among users with fairness in utility percentage of the application running on each mobile station. Our objective is to allocate the cellular system resources to mobile users optimally from a multi-cell netw","authors_text":"Ahmed Abdelhadi, T. Charles Clancy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T02:17:28Z","title":"An Optimal Resource Allocation with Frequency Reuse in Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07161","kind":"arxiv","version":3},"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:3bc155d7e57ad47b694f5913a04de52087ab9bfaaa3e0c35389bbd38c4cc9802","target":"record","created_at":"2026-05-18T01:01:36Z","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":"695b1fc35b6a986ae294fec7b42df5988562a38b0da5c12e78141a7949ccd6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T02:17:28Z","title_canon_sha256":"04bca942fd0305af7cd3290ad30b96020c73b11abe928570d651976384e1c1fd"},"schema_version":"1.0","source":{"id":"1507.07161","kind":"arxiv","version":3}},"canonical_sha256":"3dfb45d9cd17920d4a6c9869e830427c620f0841b50a6c9ec572be6fbd13d886","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dfb45d9cd17920d4a6c9869e830427c620f0841b50a6c9ec572be6fbd13d886","first_computed_at":"2026-05-18T01:01:36.200213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.200213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bMbO5uCdXi9uR7RybPOok+WKpeinSTP00m8xdo3vr+rRgayxJqdRIlo+mGFCR4cNiDO71Ky7v7lZZq3C/8qWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.200880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07161","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bc155d7e57ad47b694f5913a04de52087ab9bfaaa3e0c35389bbd38c4cc9802","sha256:e744e4f1892e0c4a5bed15b427bf969bf0573687f3f0ae47d5d75592b861c12e"],"state_sha256":"32df34cdbd9404d349e192fbd415dd38f3e6a0897124a1b19cda5909c9e0bcd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+KlCM0UPP6lrHT8DIYkaNb1PtLFwEYdrMS3ZwVATresQjAMEieJUxE8OpXNReV8fMdDC09oNTd+3DrQMHsaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:18:23.188562Z","bundle_sha256":"d517ae332730d1865d90cfe5b5fe1e1d0ccad27fc3bcdddeb0a97136ecbecb67"}}