{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R6IYV2DMRB4NH4LPERXTGSUJAV","short_pith_number":"pith:R6IYV2DM","canonical_record":{"source":{"id":"1612.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-23T03:26:18Z","cross_cats_sorted":[],"title_canon_sha256":"1ece33751665b808e3f9d5a391e1eef3a5d4b3652a3ca2fc38d733e918a41540","abstract_canon_sha256":"2252b006680d7188ab7c626c57ac6a4d230219075fb15cef67161505486db91e"},"schema_version":"1.0"},"canonical_sha256":"8f918ae86c8878d3f16f246f334a89055e4bdfa95901c9de96ccea517fddc2d8","source":{"kind":"arxiv","id":"1612.07862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07862","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07862v1","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07862","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"R6IYV2DMRB4N","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6IYV2DMRB4NH4LP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6IYV2DM","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R6IYV2DMRB4NH4LPERXTGSUJAV","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-23T03:26:18Z","cross_cats_sorted":[],"title_canon_sha256":"1ece33751665b808e3f9d5a391e1eef3a5d4b3652a3ca2fc38d733e918a41540","abstract_canon_sha256":"2252b006680d7188ab7c626c57ac6a4d230219075fb15cef67161505486db91e"},"schema_version":"1.0"},"canonical_sha256":"8f918ae86c8878d3f16f246f334a89055e4bdfa95901c9de96ccea517fddc2d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:05.539903Z","signature_b64":"4BjKvO2Cw8eBkYK8hF9vG6DAMcmtBLR0R0n89JA3oZ+lIC+DieRrlKvD3oQxAdHbModZSHxJ8w/CdVCZLvWWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f918ae86c8878d3f16f246f334a89055e4bdfa95901c9de96ccea517fddc2d8","last_reissued_at":"2026-05-18T00:54:05.539498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:05.539498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07862","source_version":1,"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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LHazaBrWIdX1f3nw914SbM4xcqdkRkTUdRWwhSxO2lcZLj+bHTw44kzYX1o5afKx2/9QZjuGLkAVsbMh267AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:13.853391Z"},"content_sha256":"e0ff4904beb50cfb5ee74d320c523fdd0083b697ca03a690836a4dfcb269c91d","schema_version":"1.0","event_id":"sha256:e0ff4904beb50cfb5ee74d320c523fdd0083b697ca03a690836a4dfcb269c91d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R6IYV2DMRB4NH4LPERXTGSUJAV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Resource Allocation for Cellular Networks with MATLAB Instructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed Abdelhadi, Haya Shajaiah","submitted_at":"2016-12-23T03:26:18Z","abstract_excerpt":"This report presents a more detailed description of the algorithm and simulations published in papers [1, 2]. It includes a step by step description of the algorithm and included the corresponding flow chart. In addition, detailed instructions of the MATLAB code used to simulate the proposed allocation algorithm in [1, 2] is presented. The report starts with a brief motivation of resource allocation problem in wireless networks. Then, some of the prior related work on the subject are mentioned. Finally, we provide the details instructions on MATLAB functions used in our algorithm. More rigorou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07862","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"},"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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIcVzWT4n0Z2omjX0AIWvQwkSutZ/DVmUnr4xZ93JE+oAZPy2+0W14pKvvdkJ3w3wrjrlVNABjfS5bDKtwT3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:13.853753Z"},"content_sha256":"cdc82993140e57312b9effeb961bf1761ca16d7759d41236f13b08650d60081d","schema_version":"1.0","event_id":"sha256:cdc82993140e57312b9effeb961bf1761ca16d7759d41236f13b08650d60081d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/bundle.json","state_url":"https://pith.science/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/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-02T02:28:13Z","links":{"resolver":"https://pith.science/pith/R6IYV2DMRB4NH4LPERXTGSUJAV","bundle":"https://pith.science/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/bundle.json","state":"https://pith.science/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6IYV2DMRB4NH4LPERXTGSUJAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R6IYV2DMRB4NH4LPERXTGSUJAV","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":"2252b006680d7188ab7c626c57ac6a4d230219075fb15cef67161505486db91e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-23T03:26:18Z","title_canon_sha256":"1ece33751665b808e3f9d5a391e1eef3a5d4b3652a3ca2fc38d733e918a41540"},"schema_version":"1.0","source":{"id":"1612.07862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07862","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07862v1","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07862","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"R6IYV2DMRB4N","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6IYV2DMRB4NH4LP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6IYV2DM","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:cdc82993140e57312b9effeb961bf1761ca16d7759d41236f13b08650d60081d","target":"graph","created_at":"2026-05-18T00:54:05Z","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":"This report presents a more detailed description of the algorithm and simulations published in papers [1, 2]. It includes a step by step description of the algorithm and included the corresponding flow chart. In addition, detailed instructions of the MATLAB code used to simulate the proposed allocation algorithm in [1, 2] is presented. The report starts with a brief motivation of resource allocation problem in wireless networks. Then, some of the prior related work on the subject are mentioned. Finally, we provide the details instructions on MATLAB functions used in our algorithm. More rigorou","authors_text":"Ahmed Abdelhadi, Haya Shajaiah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-23T03:26:18Z","title":"Optimal Resource Allocation for Cellular Networks with MATLAB Instructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07862","kind":"arxiv","version":1},"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:e0ff4904beb50cfb5ee74d320c523fdd0083b697ca03a690836a4dfcb269c91d","target":"record","created_at":"2026-05-18T00:54:05Z","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":"2252b006680d7188ab7c626c57ac6a4d230219075fb15cef67161505486db91e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-23T03:26:18Z","title_canon_sha256":"1ece33751665b808e3f9d5a391e1eef3a5d4b3652a3ca2fc38d733e918a41540"},"schema_version":"1.0","source":{"id":"1612.07862","kind":"arxiv","version":1}},"canonical_sha256":"8f918ae86c8878d3f16f246f334a89055e4bdfa95901c9de96ccea517fddc2d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f918ae86c8878d3f16f246f334a89055e4bdfa95901c9de96ccea517fddc2d8","first_computed_at":"2026-05-18T00:54:05.539498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:05.539498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BjKvO2Cw8eBkYK8hF9vG6DAMcmtBLR0R0n89JA3oZ+lIC+DieRrlKvD3oQxAdHbModZSHxJ8w/CdVCZLvWWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:05.539903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ff4904beb50cfb5ee74d320c523fdd0083b697ca03a690836a4dfcb269c91d","sha256:cdc82993140e57312b9effeb961bf1761ca16d7759d41236f13b08650d60081d"],"state_sha256":"c8d0794d8673c3d965ddd64e21a1b8c7980d7ebf408441b401c7af16505f1c24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZftNktx+7LoiZSvEAfchPdd8pvc/gg3DSP2Re6Mx/h+04tzceNQKKSfNsSL7EilTIpKEhH55gXkEWqeHZh4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:28:13.855737Z","bundle_sha256":"9c8f8cc3787dd411e32806a253852c3c55e62e5ef8cdcb124b7c68ad97e90d75"}}