{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:32Q4VNEDP5JLYZJVIZ66AZ5CSJ","short_pith_number":"pith:32Q4VNED","canonical_record":{"source":{"id":"1503.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-31T10:19:15Z","cross_cats_sorted":[],"title_canon_sha256":"39fac99d65182c45238b848db4db914dafcee96b6d57b540d84ed25a96cdbb30","abstract_canon_sha256":"2253576f8f1b9eb492ccaea452d1fbf3f4888fb94e84aff6ad652f79074d5468"},"schema_version":"1.0"},"canonical_sha256":"dea1cab4837f52bc6535467de067a2924d65207b14a9a386dc311100bc35c710","source":{"kind":"arxiv","id":"1503.08994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08994","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08994v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08994","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"32Q4VNEDP5JL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"32Q4VNEDP5JLYZJV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"32Q4VNED","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:32Q4VNEDP5JLYZJVIZ66AZ5CSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-31T10:19:15Z","cross_cats_sorted":[],"title_canon_sha256":"39fac99d65182c45238b848db4db914dafcee96b6d57b540d84ed25a96cdbb30","abstract_canon_sha256":"2253576f8f1b9eb492ccaea452d1fbf3f4888fb94e84aff6ad652f79074d5468"},"schema_version":"1.0"},"canonical_sha256":"dea1cab4837f52bc6535467de067a2924d65207b14a9a386dc311100bc35c710","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:18.899622Z","signature_b64":"S9sSzyW8peqojrMtC2P8LmctJBMtZiEN1jzpqAgtecYGHY8BcZq2a7Ay/FR8Kqr+FOCdsJmdX4xC/oiD/isRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea1cab4837f52bc6535467de067a2924d65207b14a9a386dc311100bc35c710","last_reissued_at":"2026-05-18T01:37:18.898923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:18.898923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08994","source_version":2,"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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uw92/AXoHB1xab42Ar5TFeDvqxDT2Iy4L9jw0gLu9F5yK5mSy5lNJ5swXnwrTHk448KSVl2Zn0iZryNULFq8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T16:22:39.642472Z"},"content_sha256":"aad0ddffb23f5c7d7a73d167cc40768e4537818a64f3ada48bec299984452e7e","schema_version":"1.0","event_id":"sha256:aad0ddffb23f5c7d7a73d167cc40768e4537818a64f3ada48bec299984452e7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:32Q4VNEDP5JLYZJVIZ66AZ5CSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Resource Allocation with Joint Carrier Aggregation for Multi-Carrier Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed Abdelhadi, Haya Shajaiah, T. Charles Clancy","submitted_at":"2015-03-31T10:19:15Z","abstract_excerpt":"In this paper, we present a novel approach for robust optimal resource allocation with joint carrier aggregation to allocate multiple carriers resources optimally among users with elastic and inelastic traffic in cellular networks. We use utility proportional fairness allocation policy, where the fairness among users is in utility percentage of the application running on the user equipment (UE). Each UE is assigned an application utility function based on the type of its application. Our objective is to allocate multiple carriers resources optimally among users subscribing for mobile services."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08994","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"},"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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2K1wRTl9feyZUccbFYGW+w434sO/y4GU5j5+vQ78w3OOvLEQfUBwFtVnleAc7CftCC4nJ7MXAbn4vBtaNbAtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T16:22:39.642814Z"},"content_sha256":"f13e0e4fb54dffb7e7c5afd12a0110ee03e6c3f813031e1fb8b3ccbc008cbabe","schema_version":"1.0","event_id":"sha256:f13e0e4fb54dffb7e7c5afd12a0110ee03e6c3f813031e1fb8b3ccbc008cbabe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/bundle.json","state_url":"https://pith.science/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/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-07-04T16:22:39Z","links":{"resolver":"https://pith.science/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ","bundle":"https://pith.science/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/bundle.json","state":"https://pith.science/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32Q4VNEDP5JLYZJVIZ66AZ5CSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:32Q4VNEDP5JLYZJVIZ66AZ5CSJ","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":"2253576f8f1b9eb492ccaea452d1fbf3f4888fb94e84aff6ad652f79074d5468","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-31T10:19:15Z","title_canon_sha256":"39fac99d65182c45238b848db4db914dafcee96b6d57b540d84ed25a96cdbb30"},"schema_version":"1.0","source":{"id":"1503.08994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08994","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08994v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08994","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"32Q4VNEDP5JL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"32Q4VNEDP5JLYZJV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"32Q4VNED","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:f13e0e4fb54dffb7e7c5afd12a0110ee03e6c3f813031e1fb8b3ccbc008cbabe","target":"graph","created_at":"2026-05-18T01:37:18Z","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 present a novel approach for robust optimal resource allocation with joint carrier aggregation to allocate multiple carriers resources optimally among users with elastic and inelastic traffic in cellular networks. We use utility proportional fairness allocation policy, where the fairness among users is in utility percentage of the application running on the user equipment (UE). Each UE is assigned an application utility function based on the type of its application. Our objective is to allocate multiple carriers resources optimally among users subscribing for mobile services.","authors_text":"Ahmed Abdelhadi, Haya Shajaiah, T. Charles Clancy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-31T10:19:15Z","title":"Robust Resource Allocation with Joint Carrier Aggregation for Multi-Carrier Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08994","kind":"arxiv","version":2},"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:aad0ddffb23f5c7d7a73d167cc40768e4537818a64f3ada48bec299984452e7e","target":"record","created_at":"2026-05-18T01:37:18Z","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":"2253576f8f1b9eb492ccaea452d1fbf3f4888fb94e84aff6ad652f79074d5468","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-31T10:19:15Z","title_canon_sha256":"39fac99d65182c45238b848db4db914dafcee96b6d57b540d84ed25a96cdbb30"},"schema_version":"1.0","source":{"id":"1503.08994","kind":"arxiv","version":2}},"canonical_sha256":"dea1cab4837f52bc6535467de067a2924d65207b14a9a386dc311100bc35c710","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea1cab4837f52bc6535467de067a2924d65207b14a9a386dc311100bc35c710","first_computed_at":"2026-05-18T01:37:18.898923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:18.898923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9sSzyW8peqojrMtC2P8LmctJBMtZiEN1jzpqAgtecYGHY8BcZq2a7Ay/FR8Kqr+FOCdsJmdX4xC/oiD/isRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:18.899622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aad0ddffb23f5c7d7a73d167cc40768e4537818a64f3ada48bec299984452e7e","sha256:f13e0e4fb54dffb7e7c5afd12a0110ee03e6c3f813031e1fb8b3ccbc008cbabe"],"state_sha256":"b86ca69e153e1828fc741ff02d0d6e18c400c97186f49681f7bc38fcd2b848ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyAEU/Oa6mmDANj78wWvsxocGONJ/BHtQGyrmQ7NZnsRPWPg+bhdErROZBtcmT4bF4L+iDOoYOjC2mPOJNLMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T16:22:39.645013Z","bundle_sha256":"94a6af4b2f150b45cd233ae90b47f4f25d7811ed54aed0e9a5b2325ff3039fb0"}}