{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X4QUIH52I7RQY2TTOIBKVPKLU7","short_pith_number":"pith:X4QUIH52","canonical_record":{"source":{"id":"1312.1437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T05:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"b66861f037399bc05d58f129f45b9647537d2d3bc826556ba13d0fd6f95c7161","abstract_canon_sha256":"8d3667eb725ec25a02c0a81da5034f6f3a9d048b487fa91bcc6fdbabb7a8c2bb"},"schema_version":"1.0"},"canonical_sha256":"bf21441fba47e30c6a737202aabd4ba7d63e5e68c1da38eabd338a47f61e2362","source":{"kind":"arxiv","id":"1312.1437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1437","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1437v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1437","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"X4QUIH52I7RQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X4QUIH52I7RQY2TT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X4QUIH52","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X4QUIH52I7RQY2TTOIBKVPKLU7","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T05:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"b66861f037399bc05d58f129f45b9647537d2d3bc826556ba13d0fd6f95c7161","abstract_canon_sha256":"8d3667eb725ec25a02c0a81da5034f6f3a9d048b487fa91bcc6fdbabb7a8c2bb"},"schema_version":"1.0"},"canonical_sha256":"bf21441fba47e30c6a737202aabd4ba7d63e5e68c1da38eabd338a47f61e2362","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.332502Z","signature_b64":"2IsPNaMJUEdCGKb/7vqp0cKRAPhZiHV8D8KjJ6m9RfqbOfaVVBEV94a1e2IXlc6vzPn+jUF0WtOI9QCLmdUDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf21441fba47e30c6a737202aabd4ba7d63e5e68c1da38eabd338a47f61e2362","last_reissued_at":"2026-05-18T03:05:27.331880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.331880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1437","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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPpK/SsaVJtDR7KunuELy1CnICZADBK14y4GkjQmxjfzKvoNbwRnaftWfGZPP1T+2TVnItfY4s+U5ycobKmjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:52:57.397413Z"},"content_sha256":"31baf738fefa633684d5579bd0e2ba37def1d2082cb6ef853f7798f5af29a871","schema_version":"1.0","event_id":"sha256:31baf738fefa633684d5579bd0e2ba37def1d2082cb6ef853f7798f5af29a871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X4QUIH52I7RQY2TTOIBKVPKLU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Initial Ranging for Prioritized Network Entry in IEEE 802.16 Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Seokjoo Shin, Subodh Pudasaini","submitted_at":"2013-12-05T05:31:19Z","abstract_excerpt":"Prioritized network entry is desirable for establishing preferential network connectivity for the higher priority users when different priority users exist over a given network. In line with such desirability, we propose a simple but efficient priority differentiated initial ranging mechanism considering an Orthogonal Frequency Division Multiple Access (OFDMA) based IEEE 802.16 network. In the proposed mechanism, we introduce an approach that integrates an explicit CDMA-ranging code reservation scheme with a Ranging Slot Selection Window (RSSW) differentiation scheme. Simulation results are pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1437","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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+q0FHPCp0iWx0Yq3kixN6bFicgvY1c1bjGHmdcwJdhwytm6/sChJh65VVWgqfP5T1tG1e2tGFBm6gZpj9QpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:52:57.397753Z"},"content_sha256":"48b2a8d99c7da1f08468aa7dc11cecf5ec3e63e66a47ec83e6ea69e2ce06f86f","schema_version":"1.0","event_id":"sha256:48b2a8d99c7da1f08468aa7dc11cecf5ec3e63e66a47ec83e6ea69e2ce06f86f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/bundle.json","state_url":"https://pith.science/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/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-13T10:52:57Z","links":{"resolver":"https://pith.science/pith/X4QUIH52I7RQY2TTOIBKVPKLU7","bundle":"https://pith.science/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/bundle.json","state":"https://pith.science/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4QUIH52I7RQY2TTOIBKVPKLU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X4QUIH52I7RQY2TTOIBKVPKLU7","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":"8d3667eb725ec25a02c0a81da5034f6f3a9d048b487fa91bcc6fdbabb7a8c2bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T05:31:19Z","title_canon_sha256":"b66861f037399bc05d58f129f45b9647537d2d3bc826556ba13d0fd6f95c7161"},"schema_version":"1.0","source":{"id":"1312.1437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1437","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1437v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1437","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"X4QUIH52I7RQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X4QUIH52I7RQY2TT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X4QUIH52","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:48b2a8d99c7da1f08468aa7dc11cecf5ec3e63e66a47ec83e6ea69e2ce06f86f","target":"graph","created_at":"2026-05-18T03:05:27Z","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":"Prioritized network entry is desirable for establishing preferential network connectivity for the higher priority users when different priority users exist over a given network. In line with such desirability, we propose a simple but efficient priority differentiated initial ranging mechanism considering an Orthogonal Frequency Division Multiple Access (OFDMA) based IEEE 802.16 network. In the proposed mechanism, we introduce an approach that integrates an explicit CDMA-ranging code reservation scheme with a Ranging Slot Selection Window (RSSW) differentiation scheme. Simulation results are pr","authors_text":"Seokjoo Shin, Subodh Pudasaini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T05:31:19Z","title":"Initial Ranging for Prioritized Network Entry in IEEE 802.16 Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1437","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:31baf738fefa633684d5579bd0e2ba37def1d2082cb6ef853f7798f5af29a871","target":"record","created_at":"2026-05-18T03:05:27Z","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":"8d3667eb725ec25a02c0a81da5034f6f3a9d048b487fa91bcc6fdbabb7a8c2bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T05:31:19Z","title_canon_sha256":"b66861f037399bc05d58f129f45b9647537d2d3bc826556ba13d0fd6f95c7161"},"schema_version":"1.0","source":{"id":"1312.1437","kind":"arxiv","version":1}},"canonical_sha256":"bf21441fba47e30c6a737202aabd4ba7d63e5e68c1da38eabd338a47f61e2362","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf21441fba47e30c6a737202aabd4ba7d63e5e68c1da38eabd338a47f61e2362","first_computed_at":"2026-05-18T03:05:27.331880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:27.331880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IsPNaMJUEdCGKb/7vqp0cKRAPhZiHV8D8KjJ6m9RfqbOfaVVBEV94a1e2IXlc6vzPn+jUF0WtOI9QCLmdUDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:27.332502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31baf738fefa633684d5579bd0e2ba37def1d2082cb6ef853f7798f5af29a871","sha256:48b2a8d99c7da1f08468aa7dc11cecf5ec3e63e66a47ec83e6ea69e2ce06f86f"],"state_sha256":"8fd8a14f21e06609c1942a8e7d7a4794eb0c419e1c6abdc94acd26abcb5e6b1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygAZhZyZqLt4p98Ds2PB1DI7AewRUNrqJYKb5fqjtP3oAyWWgwbLaoafHjHAVDapSx/bo59iXZixBxpjTlDeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T10:52:57.400078Z","bundle_sha256":"e63dfd225925546b11d363c952c5ed84bca55149588e641eeb870dcff0d8d379"}}