{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DSGSRGF7DRWVPACF3HUOPYWDNU","short_pith_number":"pith:DSGSRGF7","canonical_record":{"source":{"id":"1111.2160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"49ad766e987f818c2986acac84f944b64c0c187cf5f37a908a7df678d31ceeef","abstract_canon_sha256":"7e94e5b7586f4f06796e6a718899cb833becd92948775ee28efa004026bf0853"},"schema_version":"1.0"},"canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","source":{"kind":"arxiv","id":"1111.2160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2160","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2160v1","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2160","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"DSGSRGF7DRWV","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DSGSRGF7DRWVPACF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DSGSRGF7","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DSGSRGF7DRWVPACF3HUOPYWDNU","target":"record","payload":{"canonical_record":{"source":{"id":"1111.2160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"49ad766e987f818c2986acac84f944b64c0c187cf5f37a908a7df678d31ceeef","abstract_canon_sha256":"7e94e5b7586f4f06796e6a718899cb833becd92948775ee28efa004026bf0853"},"schema_version":"1.0"},"canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:44.003825Z","signature_b64":"3rh/AB3lERmohxWKd6iDe70VB4J5iYvdwE1DC78C2P3tV+6aNCRd0Rw+0SoEoKJ1WXD2c+x+mBmyzhI1a7aqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","last_reissued_at":"2026-05-18T04:08:44.003411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:44.003411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.2160","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-18T04:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr5Hytg/G3NIa35p0v4IXpulJqEPKTY0OCendErZNcGzUqAX/II72FNFvEVeZn1RFrxAAeUgcmTyTYZk/dHyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:35:25.177397Z"},"content_sha256":"f73a939ec93757d99780c7e8f3806ea09657094cb63e62a68e3a64486cd1e007","schema_version":"1.0","event_id":"sha256:f73a939ec93757d99780c7e8f3806ea09657094cb63e62a68e3a64486cd1e007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DSGSRGF7DRWVPACF3HUOPYWDNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"J. B. Helonde, Rajesh Pande, S. S. Pathak, Sudhir B. Lande","submitted_at":"2011-11-09T10:23:42Z","abstract_excerpt":"This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and pow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2160","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-18T04:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJUg0JHoW2mtTOeGJYXQdLKbjh6iyeAmU86Rc/OxzjnFthdMXHjDL/J/J+BFQEsfES6UNv3WP9ewwjvhSCGUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:35:25.177754Z"},"content_sha256":"fb051c9c531fbb34baad3b818ca0d3ab3d9d857d1cde501bd8696dba97b2a7e6","schema_version":"1.0","event_id":"sha256:fb051c9c531fbb34baad3b818ca0d3ab3d9d857d1cde501bd8696dba97b2a7e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/bundle.json","state_url":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/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-03T10:35:25Z","links":{"resolver":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU","bundle":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/bundle.json","state":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DSGSRGF7DRWVPACF3HUOPYWDNU","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":"7e94e5b7586f4f06796e6a718899cb833becd92948775ee28efa004026bf0853","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","title_canon_sha256":"49ad766e987f818c2986acac84f944b64c0c187cf5f37a908a7df678d31ceeef"},"schema_version":"1.0","source":{"id":"1111.2160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2160","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2160v1","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2160","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"DSGSRGF7DRWV","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DSGSRGF7DRWVPACF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DSGSRGF7","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:fb051c9c531fbb34baad3b818ca0d3ab3d9d857d1cde501bd8696dba97b2a7e6","target":"graph","created_at":"2026-05-18T04:08:44Z","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 paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and pow","authors_text":"J. B. Helonde, Rajesh Pande, S. S. Pathak, Sudhir B. Lande","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","title":"Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2160","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:f73a939ec93757d99780c7e8f3806ea09657094cb63e62a68e3a64486cd1e007","target":"record","created_at":"2026-05-18T04:08:44Z","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":"7e94e5b7586f4f06796e6a718899cb833becd92948775ee28efa004026bf0853","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","title_canon_sha256":"49ad766e987f818c2986acac84f944b64c0c187cf5f37a908a7df678d31ceeef"},"schema_version":"1.0","source":{"id":"1111.2160","kind":"arxiv","version":1}},"canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","first_computed_at":"2026-05-18T04:08:44.003411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:44.003411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rh/AB3lERmohxWKd6iDe70VB4J5iYvdwE1DC78C2P3tV+6aNCRd0Rw+0SoEoKJ1WXD2c+x+mBmyzhI1a7aqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:44.003825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f73a939ec93757d99780c7e8f3806ea09657094cb63e62a68e3a64486cd1e007","sha256:fb051c9c531fbb34baad3b818ca0d3ab3d9d857d1cde501bd8696dba97b2a7e6"],"state_sha256":"c7aeff3fae0fa0f5c8220415389f5af4bcc98198ce440ac01ffde2d665130396"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWDQXK9v0U2wNPgrNpI6m/6/QDgp08ry/Q0DKDmHoV2UgQH/FW34wwA+sCyQapxHx2VtqvpkG0xkpFZJSfQ1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:35:25.179745Z","bundle_sha256":"d0455e0b77dae3714c3714027e02386f987219b9fecfb4ee7fd203195c82eab0"}}