{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SRRQUAQUOA7B3HD5Z3HDV6TSRS","short_pith_number":"pith:SRRQUAQU","canonical_record":{"source":{"id":"1101.2389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T15:42:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a669ca902f41aa0ed2fc6a93db35242d0431e7dc84d74b355350994384aa51ca","abstract_canon_sha256":"35f5a29755c77afebae9dbe8523b0a1d674e44e8c87d7563a1f975054245a976"},"schema_version":"1.0"},"canonical_sha256":"94630a0214703e1d9c7dcece3afa728cae53ebe5ec3b318a35959799e789ea9d","source":{"kind":"arxiv","id":"1101.2389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2389","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2389v2","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2389","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"SRRQUAQUOA7B","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SRRQUAQUOA7B3HD5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SRRQUAQU","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SRRQUAQUOA7B3HD5Z3HDV6TSRS","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T15:42:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a669ca902f41aa0ed2fc6a93db35242d0431e7dc84d74b355350994384aa51ca","abstract_canon_sha256":"35f5a29755c77afebae9dbe8523b0a1d674e44e8c87d7563a1f975054245a976"},"schema_version":"1.0"},"canonical_sha256":"94630a0214703e1d9c7dcece3afa728cae53ebe5ec3b318a35959799e789ea9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.195590Z","signature_b64":"cGhxA8gDlYM7XeDkLCgYvYgGGGiJOnjRWVF/gqJEVAqIGqPT/gbZ80q+VHopRx8213hjbCp+zvT8nsDAefHjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94630a0214703e1d9c7dcece3afa728cae53ebe5ec3b318a35959799e789ea9d","last_reissued_at":"2026-05-18T02:22:58.194776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.194776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2389","source_version":2,"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-18T02:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGqqQ6dZsWncER/p/LeCBFj9kQ1LlTbxSrYRqTrbkzFWAcbRAZHAWhgreVuXnoMHQZy2DQKZ76FGFz1QvCOPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:39:07.083905Z"},"content_sha256":"a01d45c74ce0768802fcebfaa8af52a8c49f6440e17e4d421e2e2ed061de934a","schema_version":"1.0","event_id":"sha256:a01d45c74ce0768802fcebfaa8af52a8c49f6440e17e4d421e2e2ed061de934a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SRRQUAQUOA7B3HD5Z3HDV6TSRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Region of Finite State Multiple-Access Channel with Delayed State Information at the Transmitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Avihay Shirazi, Haim Permuter, Uria Basher","submitted_at":"2011-01-12T15:42:55Z","abstract_excerpt":"A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are assumed to be asymmetric at the transmitters. We apply the result to obtain the capacity region for a finite-state Gaussian MAC, and for a finite-state multiple-access fading channel. We derive power control strategies that maximize the capacity region for these channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2389","kind":"arxiv","version":2},"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-18T02:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFjMI/bWRzIAim8e4aOde5kSdB4EtPiv+s9LOQJnx2uji8eLfliy/yJD2jRJU+fIq/rD+viF2GBpvCKlvlKLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:39:07.084613Z"},"content_sha256":"55c74a383acfde2f2ff71643b8850081214f1b603e6c0bd557ea76bd0a05fcf0","schema_version":"1.0","event_id":"sha256:55c74a383acfde2f2ff71643b8850081214f1b603e6c0bd557ea76bd0a05fcf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/bundle.json","state_url":"https://pith.science/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/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-05-31T16:39:07Z","links":{"resolver":"https://pith.science/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS","bundle":"https://pith.science/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/bundle.json","state":"https://pith.science/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRRQUAQUOA7B3HD5Z3HDV6TSRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SRRQUAQUOA7B3HD5Z3HDV6TSRS","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":"35f5a29755c77afebae9dbe8523b0a1d674e44e8c87d7563a1f975054245a976","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T15:42:55Z","title_canon_sha256":"a669ca902f41aa0ed2fc6a93db35242d0431e7dc84d74b355350994384aa51ca"},"schema_version":"1.0","source":{"id":"1101.2389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2389","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2389v2","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2389","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"SRRQUAQUOA7B","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SRRQUAQUOA7B3HD5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SRRQUAQU","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:55c74a383acfde2f2ff71643b8850081214f1b603e6c0bd557ea76bd0a05fcf0","target":"graph","created_at":"2026-05-18T02:22:58Z","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":"A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are assumed to be asymmetric at the transmitters. We apply the result to obtain the capacity region for a finite-state Gaussian MAC, and for a finite-state multiple-access fading channel. We derive power control strategies that maximize the capacity region for these channels.","authors_text":"Avihay Shirazi, Haim Permuter, Uria Basher","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T15:42:55Z","title":"Capacity Region of Finite State Multiple-Access Channel with Delayed State Information at the Transmitters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2389","kind":"arxiv","version":2},"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:a01d45c74ce0768802fcebfaa8af52a8c49f6440e17e4d421e2e2ed061de934a","target":"record","created_at":"2026-05-18T02:22:58Z","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":"35f5a29755c77afebae9dbe8523b0a1d674e44e8c87d7563a1f975054245a976","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T15:42:55Z","title_canon_sha256":"a669ca902f41aa0ed2fc6a93db35242d0431e7dc84d74b355350994384aa51ca"},"schema_version":"1.0","source":{"id":"1101.2389","kind":"arxiv","version":2}},"canonical_sha256":"94630a0214703e1d9c7dcece3afa728cae53ebe5ec3b318a35959799e789ea9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94630a0214703e1d9c7dcece3afa728cae53ebe5ec3b318a35959799e789ea9d","first_computed_at":"2026-05-18T02:22:58.194776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:58.194776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cGhxA8gDlYM7XeDkLCgYvYgGGGiJOnjRWVF/gqJEVAqIGqPT/gbZ80q+VHopRx8213hjbCp+zvT8nsDAefHjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:58.195590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a01d45c74ce0768802fcebfaa8af52a8c49f6440e17e4d421e2e2ed061de934a","sha256:55c74a383acfde2f2ff71643b8850081214f1b603e6c0bd557ea76bd0a05fcf0"],"state_sha256":"b69a16dfdb4b7371bc91d6d4878e1030f0f717cbd99c6e191c361f2e9c06afd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djQ2neXIr5EsZy2cUfT3myPKewr05LtlETfEAhTU2dYTpEhzHAPU/fOnRu8n3K2nt97RqwjKuIFEZkCPdw6qCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:39:07.089292Z","bundle_sha256":"5e7ff293a033b8a60fe49fee03186feb52aa38b30d022d0f1147d1c67f24b19f"}}