{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MVH7JOOUXPMQWJOMFE4KVFAI5N","short_pith_number":"pith:MVH7JOOU","canonical_record":{"source":{"id":"1507.08917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-31T15:40:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2586baeb47309e8a01a2bf5109403ce43a96447f292ce7b95d29f9a7da84168","abstract_canon_sha256":"c571165f55a5a5e963d400cf82a493686948c36b0259be1914fb238a4188f917"},"schema_version":"1.0"},"canonical_sha256":"654ff4b9d4bbd90b25cc2938aa9408eb5a7bf93101d0a8eef82dd51df67aca35","source":{"kind":"arxiv","id":"1507.08917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08917","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08917v1","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08917","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MVH7JOOUXPMQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVH7JOOUXPMQWJOM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVH7JOOU","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MVH7JOOUXPMQWJOMFE4KVFAI5N","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-31T15:40:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2586baeb47309e8a01a2bf5109403ce43a96447f292ce7b95d29f9a7da84168","abstract_canon_sha256":"c571165f55a5a5e963d400cf82a493686948c36b0259be1914fb238a4188f917"},"schema_version":"1.0"},"canonical_sha256":"654ff4b9d4bbd90b25cc2938aa9408eb5a7bf93101d0a8eef82dd51df67aca35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.170225Z","signature_b64":"IFosozrk0Xg524zIQHUcXdML/RjH2ssgq5rQMuF6LyNMbSStQkm8ArVok6jajdVvqI/4mltobrdtHymlkZynDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654ff4b9d4bbd90b25cc2938aa9408eb5a7bf93101d0a8eef82dd51df67aca35","last_reissued_at":"2026-05-18T01:09:46.169737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.169737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08917","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"318wLhde6/Bi3LZDhmeArezCDRYummHqk14D7nwnYpFwVcUtcb72Za2WUiJEsIBjE1ezHwEigb14rMcu7kbeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:32:21.682238Z"},"content_sha256":"61026824d888593bcaabac871b3e6b10770d84f93e7b150423b9cd816a77a4a4","schema_version":"1.0","event_id":"sha256:61026824d888593bcaabac871b3e6b10770d84f93e7b150423b9cd816a77a4a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MVH7JOOUXPMQWJOMFE4KVFAI5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Capacity in Multiple Access Channels with Arbitrary Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\\"urgen Peissig, Marwan Hammouda, Sami Akin","submitted_at":"2015-07-31T15:40:21Z","abstract_excerpt":"In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input signals. We assume that the receiver performs successive decoding with a certain order. Then, we establish the effective capacity region that provides the maximum allowable sustainable arrival rate region at the transmitters' buffers under QoS guarantees. Assuming limited transmission power budgets at the transmitters, we attain the power allocation policies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08917","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmK8JMD5RCiM9fltkcOR14gVcxsraVnoawR7HcQlxtH6tW3s++M9/46CWSng8KLetskTWG3gBSs9YmQUnpW2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:32:21.682847Z"},"content_sha256":"992fe6bbdcc393c9c939ac077e3d470c4cc09d55bf87cc9981856030530095fd","schema_version":"1.0","event_id":"sha256:992fe6bbdcc393c9c939ac077e3d470c4cc09d55bf87cc9981856030530095fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/bundle.json","state_url":"https://pith.science/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/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-07T15:32:21Z","links":{"resolver":"https://pith.science/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N","bundle":"https://pith.science/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/bundle.json","state":"https://pith.science/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVH7JOOUXPMQWJOMFE4KVFAI5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MVH7JOOUXPMQWJOMFE4KVFAI5N","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":"c571165f55a5a5e963d400cf82a493686948c36b0259be1914fb238a4188f917","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-31T15:40:21Z","title_canon_sha256":"b2586baeb47309e8a01a2bf5109403ce43a96447f292ce7b95d29f9a7da84168"},"schema_version":"1.0","source":{"id":"1507.08917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08917","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08917v1","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08917","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MVH7JOOUXPMQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVH7JOOUXPMQWJOM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVH7JOOU","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:992fe6bbdcc393c9c939ac077e3d470c4cc09d55bf87cc9981856030530095fd","target":"graph","created_at":"2026-05-18T01:09:46Z","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":"In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input signals. We assume that the receiver performs successive decoding with a certain order. Then, we establish the effective capacity region that provides the maximum allowable sustainable arrival rate region at the transmitters' buffers under QoS guarantees. Assuming limited transmission power budgets at the transmitters, we attain the power allocation policies","authors_text":"J\\\"urgen Peissig, Marwan Hammouda, Sami Akin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-31T15:40:21Z","title":"Effective Capacity in Multiple Access Channels with Arbitrary Inputs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08917","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:61026824d888593bcaabac871b3e6b10770d84f93e7b150423b9cd816a77a4a4","target":"record","created_at":"2026-05-18T01:09:46Z","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":"c571165f55a5a5e963d400cf82a493686948c36b0259be1914fb238a4188f917","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-31T15:40:21Z","title_canon_sha256":"b2586baeb47309e8a01a2bf5109403ce43a96447f292ce7b95d29f9a7da84168"},"schema_version":"1.0","source":{"id":"1507.08917","kind":"arxiv","version":1}},"canonical_sha256":"654ff4b9d4bbd90b25cc2938aa9408eb5a7bf93101d0a8eef82dd51df67aca35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654ff4b9d4bbd90b25cc2938aa9408eb5a7bf93101d0a8eef82dd51df67aca35","first_computed_at":"2026-05-18T01:09:46.169737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:46.169737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IFosozrk0Xg524zIQHUcXdML/RjH2ssgq5rQMuF6LyNMbSStQkm8ArVok6jajdVvqI/4mltobrdtHymlkZynDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:46.170225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61026824d888593bcaabac871b3e6b10770d84f93e7b150423b9cd816a77a4a4","sha256:992fe6bbdcc393c9c939ac077e3d470c4cc09d55bf87cc9981856030530095fd"],"state_sha256":"e2242036a2863d8b5c24bf9b96a36a1aca873f110d1c40f6e9bb842d4ea61d84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCL66HmtstvCtd5p75nHBR9G4Pf6YgY6tylMUpf+hjOlTuKXuFDI1V5ja7aAIVUl3KyrPVpjhgTWa0ZpatWsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:32:21.686446Z","bundle_sha256":"3410bdcd7a6716a7185d9c3b8871533934069cf9316ee609d2082a09755a5e0a"}}