{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LTOPHTTOQY7SXNPESAGJEN26ZJ","short_pith_number":"pith:LTOPHTTO","canonical_record":{"source":{"id":"1207.2137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T19:38:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"282289cf5524ea7ec3b218e140198ad0f02cbbd505608bdc461cfe5c8b3edf4a","abstract_canon_sha256":"47a91e32dfb5baaf5e141d0264065252742b1971fc3416dd21452307fdf32ec1"},"schema_version":"1.0"},"canonical_sha256":"5cdcf3ce6e863f2bb5e4900c92375eca4c56102ac6a7788809d5a774251b06b8","source":{"kind":"arxiv","id":"1207.2137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2137","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2137v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2137","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"LTOPHTTOQY7S","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LTOPHTTOQY7SXNPE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LTOPHTTO","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LTOPHTTOQY7SXNPESAGJEN26ZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T19:38:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"282289cf5524ea7ec3b218e140198ad0f02cbbd505608bdc461cfe5c8b3edf4a","abstract_canon_sha256":"47a91e32dfb5baaf5e141d0264065252742b1971fc3416dd21452307fdf32ec1"},"schema_version":"1.0"},"canonical_sha256":"5cdcf3ce6e863f2bb5e4900c92375eca4c56102ac6a7788809d5a774251b06b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.860830Z","signature_b64":"YqNpKHSjjJ3rpHx5RoLcrV0FYN62mxRtTuweBkpENuP/BlJ8rWePZ/Y/qfWOEWcg0k20tBBpmH1RAdz6VqrgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cdcf3ce6e863f2bb5e4900c92375eca4c56102ac6a7788809d5a774251b06b8","last_reissued_at":"2026-05-18T00:57:56.860373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.860373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2137","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQpmE5xBtLbKb4+EteynTnLha2d0bBBuCrniEZfYdcTPzQHfAcQC81Urv6mpXUivSjRN1Gl4isVkpbgUqHrXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:05:41.904043Z"},"content_sha256":"acda131767179f8090146c4bda8215071c41ce6159e7dfe0c5dad821c6cbe2af","schema_version":"1.0","event_id":"sha256:acda131767179f8090146c4bda8215071c41ce6159e7dfe0c5dad821c6cbe2af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LTOPHTTOQY7SXNPESAGJEN26ZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bang Chul Jung, Dohyung Park, Won-Yong Shin","submitted_at":"2012-07-09T19:38:01Z","abstract_excerpt":"We introduce a distributed opportunistic scheduling (DOS) strategy, based on two pre-determined thresholds, for uplink $K$-cell networks with time-invariant channel coefficients. Each base station (BS) opportunistically selects a mobile station (MS) who has a large signal strength of the desired channel link among a set of MSs generating a sufficiently small interference to other BSs. Then, performance on the achievable throughput scaling law is analyzed. As our main result, it is shown that the achievable sum-rate scales as $K\\log(\\text{SNR}\\log N)$ in a high signal-to-noise ratio (SNR) regim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2137","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZFtllBpfZGj7h6ENKDTPXul6VS/QtmyDC8mWXqqMUEifA+l3Aiq64ucOPW2ysbqwJ5GsZS+rDHFhOcDQSRfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:05:41.904409Z"},"content_sha256":"a40b0d6942b38a20f343ad0f86211984bf584f3b4e0bcb83ea1d3c3f388374da","schema_version":"1.0","event_id":"sha256:a40b0d6942b38a20f343ad0f86211984bf584f3b4e0bcb83ea1d3c3f388374da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/bundle.json","state_url":"https://pith.science/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/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-03T21:05:41Z","links":{"resolver":"https://pith.science/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ","bundle":"https://pith.science/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/bundle.json","state":"https://pith.science/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTOPHTTOQY7SXNPESAGJEN26ZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LTOPHTTOQY7SXNPESAGJEN26ZJ","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":"47a91e32dfb5baaf5e141d0264065252742b1971fc3416dd21452307fdf32ec1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T19:38:01Z","title_canon_sha256":"282289cf5524ea7ec3b218e140198ad0f02cbbd505608bdc461cfe5c8b3edf4a"},"schema_version":"1.0","source":{"id":"1207.2137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2137","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2137v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2137","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"LTOPHTTOQY7S","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LTOPHTTOQY7SXNPE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LTOPHTTO","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:a40b0d6942b38a20f343ad0f86211984bf584f3b4e0bcb83ea1d3c3f388374da","target":"graph","created_at":"2026-05-18T00:57:56Z","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 introduce a distributed opportunistic scheduling (DOS) strategy, based on two pre-determined thresholds, for uplink $K$-cell networks with time-invariant channel coefficients. Each base station (BS) opportunistically selects a mobile station (MS) who has a large signal strength of the desired channel link among a set of MSs generating a sufficiently small interference to other BSs. Then, performance on the achievable throughput scaling law is analyzed. As our main result, it is shown that the achievable sum-rate scales as $K\\log(\\text{SNR}\\log N)$ in a high signal-to-noise ratio (SNR) regim","authors_text":"Bang Chul Jung, Dohyung Park, Won-Yong Shin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T19:38:01Z","title":"Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2137","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:acda131767179f8090146c4bda8215071c41ce6159e7dfe0c5dad821c6cbe2af","target":"record","created_at":"2026-05-18T00:57:56Z","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":"47a91e32dfb5baaf5e141d0264065252742b1971fc3416dd21452307fdf32ec1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T19:38:01Z","title_canon_sha256":"282289cf5524ea7ec3b218e140198ad0f02cbbd505608bdc461cfe5c8b3edf4a"},"schema_version":"1.0","source":{"id":"1207.2137","kind":"arxiv","version":1}},"canonical_sha256":"5cdcf3ce6e863f2bb5e4900c92375eca4c56102ac6a7788809d5a774251b06b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cdcf3ce6e863f2bb5e4900c92375eca4c56102ac6a7788809d5a774251b06b8","first_computed_at":"2026-05-18T00:57:56.860373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.860373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YqNpKHSjjJ3rpHx5RoLcrV0FYN62mxRtTuweBkpENuP/BlJ8rWePZ/Y/qfWOEWcg0k20tBBpmH1RAdz6VqrgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.860830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acda131767179f8090146c4bda8215071c41ce6159e7dfe0c5dad821c6cbe2af","sha256:a40b0d6942b38a20f343ad0f86211984bf584f3b4e0bcb83ea1d3c3f388374da"],"state_sha256":"7995465a8c3fec957e981c6ce7a4ebfd4c8120d82796085ab02d4897102deabb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCxE9rQuZLKw9uDYdd78EDzWVQeGZIPawDu9VJdGsFgHcLeCZpUmSxVEQR1AHM/NrWTxtnSFimldTwGF4BRlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:05:41.906401Z","bundle_sha256":"b8fda1848d59bc36942e906fd6f9d0d16ca624d3d27279cc3399d059f6ef833a"}}