{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5OCH3KWVWF332VEBLEN3HHOJCM","short_pith_number":"pith:5OCH3KWV","canonical_record":{"source":{"id":"1004.0534","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-04-04T21:09:37Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"075a268ddd7647735468b11baf53895fda26e44223182ea5fcddac40922d433a","abstract_canon_sha256":"bf62b0671d196e8449fae0c6fc274f2f00b2388add61a4eaf2361a6ad68d2ab6"},"schema_version":"1.0"},"canonical_sha256":"eb847daad5b177bd5481591bb39dc913151391102f457058a1f35f738fbcc11a","source":{"kind":"arxiv","id":"1004.0534","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0534","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0534v6","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0534","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"5OCH3KWVWF33","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5OCH3KWVWF332VEB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5OCH3KWV","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5OCH3KWVWF332VEBLEN3HHOJCM","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0534","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-04-04T21:09:37Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"075a268ddd7647735468b11baf53895fda26e44223182ea5fcddac40922d433a","abstract_canon_sha256":"bf62b0671d196e8449fae0c6fc274f2f00b2388add61a4eaf2361a6ad68d2ab6"},"schema_version":"1.0"},"canonical_sha256":"eb847daad5b177bd5481591bb39dc913151391102f457058a1f35f738fbcc11a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:17.718161Z","signature_b64":"WlcNnFTepGDIRDuZyIN0FmunwokvPPJzrfsYKm0uBH1eIWjBtxmVu3XEmLZS2jf18kTfYcjbhK+9X9n1YDeNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb847daad5b177bd5481591bb39dc913151391102f457058a1f35f738fbcc11a","last_reissued_at":"2026-05-18T02:24:17.717454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:17.717454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0534","source_version":6,"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-18T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbsF0Fg62tQ79WLNy/aVvkpK2YcPK/HpNhBoUbnQ+IiSwnQg0iIF0tBRAevH6SFBv83hlrqALAFbj0yPhNKeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:16:16.216637Z"},"content_sha256":"5020369a811350efa7e00cb1ab943aa70c2a1c2d4babee586ee82a5163ecab32","schema_version":"1.0","event_id":"sha256:5020369a811350efa7e00cb1ab943aa70c2a1c2d4babee586ee82a5163ecab32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5OCH3KWVWF332VEBLEN3HHOJCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Impact of Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Danijela \\v{C}abri\\'c, John Villasenor, Przemys{\\l}aw Pawe{\\l}czak, Sateesh Addepalli, Shaunak Joshi","submitted_at":"2010-04-04T21:09:37Z","abstract_excerpt":"We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DR$_{K}$). The model, developed for a baseline case of two cell network, differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0534","kind":"arxiv","version":6},"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-18T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmA/cGW0nk0fBwk1TiO1niZj/1VLVDa1uFvx3QXxDDJzTGwhlWcdOJYburLRIXPjOmJ9dAOzDYulBwVsxw3RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:16:16.217368Z"},"content_sha256":"bc87911cca3370209f78f68cecf6f2eaf85de3fc915e7ea06fcaa575945b4855","schema_version":"1.0","event_id":"sha256:bc87911cca3370209f78f68cecf6f2eaf85de3fc915e7ea06fcaa575945b4855"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OCH3KWVWF332VEBLEN3HHOJCM/bundle.json","state_url":"https://pith.science/pith/5OCH3KWVWF332VEBLEN3HHOJCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OCH3KWVWF332VEBLEN3HHOJCM/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-05T21:16:16Z","links":{"resolver":"https://pith.science/pith/5OCH3KWVWF332VEBLEN3HHOJCM","bundle":"https://pith.science/pith/5OCH3KWVWF332VEBLEN3HHOJCM/bundle.json","state":"https://pith.science/pith/5OCH3KWVWF332VEBLEN3HHOJCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OCH3KWVWF332VEBLEN3HHOJCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5OCH3KWVWF332VEBLEN3HHOJCM","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":"bf62b0671d196e8449fae0c6fc274f2f00b2388add61a4eaf2361a6ad68d2ab6","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-04-04T21:09:37Z","title_canon_sha256":"075a268ddd7647735468b11baf53895fda26e44223182ea5fcddac40922d433a"},"schema_version":"1.0","source":{"id":"1004.0534","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0534","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0534v6","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0534","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"5OCH3KWVWF33","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5OCH3KWVWF332VEB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5OCH3KWV","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:bc87911cca3370209f78f68cecf6f2eaf85de3fc915e7ea06fcaa575945b4855","target":"graph","created_at":"2026-05-18T02:24:17Z","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":"We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DR$_{K}$). The model, developed for a baseline case of two cell network, differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based ","authors_text":"Danijela \\v{C}abri\\'c, John Villasenor, Przemys{\\l}aw Pawe{\\l}czak, Sateesh Addepalli, Shaunak Joshi","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-04-04T21:09:37Z","title":"Impact of Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0534","kind":"arxiv","version":6},"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:5020369a811350efa7e00cb1ab943aa70c2a1c2d4babee586ee82a5163ecab32","target":"record","created_at":"2026-05-18T02:24:17Z","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":"bf62b0671d196e8449fae0c6fc274f2f00b2388add61a4eaf2361a6ad68d2ab6","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-04-04T21:09:37Z","title_canon_sha256":"075a268ddd7647735468b11baf53895fda26e44223182ea5fcddac40922d433a"},"schema_version":"1.0","source":{"id":"1004.0534","kind":"arxiv","version":6}},"canonical_sha256":"eb847daad5b177bd5481591bb39dc913151391102f457058a1f35f738fbcc11a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb847daad5b177bd5481591bb39dc913151391102f457058a1f35f738fbcc11a","first_computed_at":"2026-05-18T02:24:17.717454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:17.717454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlcNnFTepGDIRDuZyIN0FmunwokvPPJzrfsYKm0uBH1eIWjBtxmVu3XEmLZS2jf18kTfYcjbhK+9X9n1YDeNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:17.718161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0534","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5020369a811350efa7e00cb1ab943aa70c2a1c2d4babee586ee82a5163ecab32","sha256:bc87911cca3370209f78f68cecf6f2eaf85de3fc915e7ea06fcaa575945b4855"],"state_sha256":"f90cbf5016b966730929d182b4cfb104511842afccd410f4a74ec621a686aa50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WoA+sbRKxfwyDFC+N6Fk+Z1x1/7fXyCXhGu68edvY8pELnd6Um/xv9msR6VdK5II8uF2UsW29FF/dxCq1eABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:16:16.221442Z","bundle_sha256":"f35b825fd6b19cc7014af3afc80ccc1831a499e27c7e5334ffce3105736aa349"}}