{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IBIINKBVM6TAP5SUIWFPVTXTHP","short_pith_number":"pith:IBIINKBV","canonical_record":{"source":{"id":"1201.1175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-05T14:02:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"70b0ea9cf9172284dbfd52126abf8fe731d35769a1d1beb7bb670cc10a4a6d93","abstract_canon_sha256":"25434c857baf14b094fa341f9d0d5a4766df7252bc9cb3b8faffac6300642501"},"schema_version":"1.0"},"canonical_sha256":"405086a83567a607f654458afacef33bdb4cf2bb9456e60c04a9a8f3cfe48ac3","source":{"kind":"arxiv","id":"1201.1175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1175","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1175v1","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1175","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"IBIINKBVM6TA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IBIINKBVM6TAP5SU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IBIINKBV","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IBIINKBVM6TAP5SUIWFPVTXTHP","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-05T14:02:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"70b0ea9cf9172284dbfd52126abf8fe731d35769a1d1beb7bb670cc10a4a6d93","abstract_canon_sha256":"25434c857baf14b094fa341f9d0d5a4766df7252bc9cb3b8faffac6300642501"},"schema_version":"1.0"},"canonical_sha256":"405086a83567a607f654458afacef33bdb4cf2bb9456e60c04a9a8f3cfe48ac3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:05.852467Z","signature_b64":"Dv0zRqYRwvmZetkgnY9VgTGhSifye91GDedMfFq27gI/MmcBIHsWn1GcjlxJauNHOY5PIdGs/x23cEAS7/ioAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405086a83567a607f654458afacef33bdb4cf2bb9456e60c04a9a8f3cfe48ac3","last_reissued_at":"2026-05-18T04:05:05.851730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:05.851730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1175","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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4Fb8G/8qqYMPrPMMI1YwqEh+GHutpTGTa6//WhFoZZUfRmDGKUNbc/FhDXCMjiSOXyBUMM9Wg/7EezxhlO7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:56:52.650396Z"},"content_sha256":"bd68ccad14cb30252921e426ab637926885b95c8372166708f2b972afaab8e72","schema_version":"1.0","event_id":"sha256:bd68ccad14cb30252921e426ab637926885b95c8372166708f2b972afaab8e72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IBIINKBVM6TAP5SUIWFPVTXTHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Optimal Multi-user Scheduling via Hierarchical Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Mehmet Karaca, Ozgur Ercetin","submitted_at":"2012-01-05T14:02:48Z","abstract_excerpt":"We investigate the network stability problem when two users are scheduled simultaneously. The key idea is to simultaneously transmit to more than one users experiencing different channel conditions by employing hierarchical modulation. For two-user scheduling problem, we develop a throughput-optimal algorithm which can stabilize the network whenever this is possible. In addition, we analytically prove that the proposed algorithm achieves larger achievable rate region compared to the conventional Max-Weight algorithm which employs uniform modulation and transmits a single user. We demonstrate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1175","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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzCoViSYQmiIjTNlF9TFGyU1QFmu0oRKIAewIn9iQbaStROxWL41ojWnPPCPPiT+VDGX3pbheXuU2EvjGqjEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:56:52.650745Z"},"content_sha256":"9700afc92c9e14616d0d9ee33ce7e3fa27848a10d9e5f444ee80ba6a2958746b","schema_version":"1.0","event_id":"sha256:9700afc92c9e14616d0d9ee33ce7e3fa27848a10d9e5f444ee80ba6a2958746b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/bundle.json","state_url":"https://pith.science/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/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-20T11:56:52Z","links":{"resolver":"https://pith.science/pith/IBIINKBVM6TAP5SUIWFPVTXTHP","bundle":"https://pith.science/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/bundle.json","state":"https://pith.science/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBIINKBVM6TAP5SUIWFPVTXTHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IBIINKBVM6TAP5SUIWFPVTXTHP","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":"25434c857baf14b094fa341f9d0d5a4766df7252bc9cb3b8faffac6300642501","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-05T14:02:48Z","title_canon_sha256":"70b0ea9cf9172284dbfd52126abf8fe731d35769a1d1beb7bb670cc10a4a6d93"},"schema_version":"1.0","source":{"id":"1201.1175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1175","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1175v1","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1175","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"IBIINKBVM6TA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IBIINKBVM6TAP5SU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IBIINKBV","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:9700afc92c9e14616d0d9ee33ce7e3fa27848a10d9e5f444ee80ba6a2958746b","target":"graph","created_at":"2026-05-18T04:05:05Z","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 investigate the network stability problem when two users are scheduled simultaneously. The key idea is to simultaneously transmit to more than one users experiencing different channel conditions by employing hierarchical modulation. For two-user scheduling problem, we develop a throughput-optimal algorithm which can stabilize the network whenever this is possible. In addition, we analytically prove that the proposed algorithm achieves larger achievable rate region compared to the conventional Max-Weight algorithm which employs uniform modulation and transmits a single user. We demonstrate t","authors_text":"Mehmet Karaca, Ozgur Ercetin","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-05T14:02:48Z","title":"Throughput Optimal Multi-user Scheduling via Hierarchical Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1175","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:bd68ccad14cb30252921e426ab637926885b95c8372166708f2b972afaab8e72","target":"record","created_at":"2026-05-18T04:05:05Z","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":"25434c857baf14b094fa341f9d0d5a4766df7252bc9cb3b8faffac6300642501","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-05T14:02:48Z","title_canon_sha256":"70b0ea9cf9172284dbfd52126abf8fe731d35769a1d1beb7bb670cc10a4a6d93"},"schema_version":"1.0","source":{"id":"1201.1175","kind":"arxiv","version":1}},"canonical_sha256":"405086a83567a607f654458afacef33bdb4cf2bb9456e60c04a9a8f3cfe48ac3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405086a83567a607f654458afacef33bdb4cf2bb9456e60c04a9a8f3cfe48ac3","first_computed_at":"2026-05-18T04:05:05.851730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:05.851730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dv0zRqYRwvmZetkgnY9VgTGhSifye91GDedMfFq27gI/MmcBIHsWn1GcjlxJauNHOY5PIdGs/x23cEAS7/ioAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:05.852467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd68ccad14cb30252921e426ab637926885b95c8372166708f2b972afaab8e72","sha256:9700afc92c9e14616d0d9ee33ce7e3fa27848a10d9e5f444ee80ba6a2958746b"],"state_sha256":"a9ecb0dc6380eda27a9378f825ae50572701f8a604e12dd528482196613846e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2TeS6PDYAQawqG/MYxMO9Xrur0ysuE2CLBk1W5qgEkXi8rDTNbppC5cc53eecdm5SaiU/OFS3w1Imz9UcRNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:56:52.653171Z","bundle_sha256":"8e08f65a3023124b50c1a7f92ef41d9d6179f08d948c815e92b416f926e793f8"}}