{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SVIDWEQFMOXXN3O6VRQRTWX5HK","short_pith_number":"pith:SVIDWEQF","canonical_record":{"source":{"id":"1103.3054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-15T22:13:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09bcc43926e4fd58e3b012c269ef0d3d0310b7b8b4321b9c67859f164ffb53fd","abstract_canon_sha256":"2da36be7e24ac0bb21f0529acbc4b89228f65c6ea8be22679718a686d52c26d9"},"schema_version":"1.0"},"canonical_sha256":"95503b120563af76eddeac6119dafd3a83dd7acb4e2185c95ac1426a2ed07b72","source":{"kind":"arxiv","id":"1103.3054","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3054","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3054v2","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3054","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"SVIDWEQFMOXX","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SVIDWEQFMOXXN3O6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SVIDWEQF","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SVIDWEQFMOXXN3O6VRQRTWX5HK","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-15T22:13:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09bcc43926e4fd58e3b012c269ef0d3d0310b7b8b4321b9c67859f164ffb53fd","abstract_canon_sha256":"2da36be7e24ac0bb21f0529acbc4b89228f65c6ea8be22679718a686d52c26d9"},"schema_version":"1.0"},"canonical_sha256":"95503b120563af76eddeac6119dafd3a83dd7acb4e2185c95ac1426a2ed07b72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:50.906921Z","signature_b64":"SXYXkPQNQ2AnzIcRiRG6KE1onbUZTSWkpQzgtPTbnfD0aFY25ZDGToJ+JgYR2Z+ghqxCspgOVR/Vs6hEUAW0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95503b120563af76eddeac6119dafd3a83dd7acb4e2185c95ac1426a2ed07b72","last_reissued_at":"2026-05-18T04:20:50.906274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:50.906274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3054","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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBd69xYwq7T5/CFlSHQCrS2fPLiTUJ/YeRFmI1pTLGCLSvk9Hw3gTVI3CAIV9dCf7SHg3ElHsRD5NiI8wjf7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:26:29.935982Z"},"content_sha256":"c6a981f67bbf2e65946a0467ab523bc4adbd39c2a89a811db25ce3058e966552","schema_version":"1.0","event_id":"sha256:c6a981f67bbf2e65946a0467ab523bc4adbd39c2a89a811db25ce3058e966552"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SVIDWEQFMOXXN3O6VRQRTWX5HK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Memoryless Finite-State Multiple Access Channels with Asymmetric Noisy State Information at the Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fady Alajaji, Giacomo Como, Nevroz \\c{S}en, Serdar Y\\\"uksel","submitted_at":"2011-03-15T22:13:54Z","abstract_excerpt":"We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner and outer bounds are provided for the capacity of such channels when the state process is independent and identically distributed. The outer bound is attained by observing that the proposed inner bound is tight for the sum-rate capacity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3054","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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMoIUUqQRDh0plEsWlBiNnm1CtXJiKWwZsCNDQvXSwAQi+YsOAvurrKx5QvHxdCArT9toW0++VMaIPjrHbp8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:26:29.936363Z"},"content_sha256":"44705c767991192d9591acc78670c24c6fe83fe54014f10a30862387c4f5fa0e","schema_version":"1.0","event_id":"sha256:44705c767991192d9591acc78670c24c6fe83fe54014f10a30862387c4f5fa0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/bundle.json","state_url":"https://pith.science/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/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-26T05:26:29Z","links":{"resolver":"https://pith.science/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK","bundle":"https://pith.science/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/bundle.json","state":"https://pith.science/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVIDWEQFMOXXN3O6VRQRTWX5HK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SVIDWEQFMOXXN3O6VRQRTWX5HK","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":"2da36be7e24ac0bb21f0529acbc4b89228f65c6ea8be22679718a686d52c26d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-15T22:13:54Z","title_canon_sha256":"09bcc43926e4fd58e3b012c269ef0d3d0310b7b8b4321b9c67859f164ffb53fd"},"schema_version":"1.0","source":{"id":"1103.3054","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3054","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3054v2","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3054","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"SVIDWEQFMOXX","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SVIDWEQFMOXXN3O6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SVIDWEQF","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:44705c767991192d9591acc78670c24c6fe83fe54014f10a30862387c4f5fa0e","target":"graph","created_at":"2026-05-18T04:20:50Z","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 consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner and outer bounds are provided for the capacity of such channels when the state process is independent and identically distributed. The outer bound is attained by observing that the proposed inner bound is tight for the sum-rate capacity.","authors_text":"Fady Alajaji, Giacomo Como, Nevroz \\c{S}en, Serdar Y\\\"uksel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-15T22:13:54Z","title":"On the Capacity of Memoryless Finite-State Multiple Access Channels with Asymmetric Noisy State Information at the Encoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3054","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:c6a981f67bbf2e65946a0467ab523bc4adbd39c2a89a811db25ce3058e966552","target":"record","created_at":"2026-05-18T04:20:50Z","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":"2da36be7e24ac0bb21f0529acbc4b89228f65c6ea8be22679718a686d52c26d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-15T22:13:54Z","title_canon_sha256":"09bcc43926e4fd58e3b012c269ef0d3d0310b7b8b4321b9c67859f164ffb53fd"},"schema_version":"1.0","source":{"id":"1103.3054","kind":"arxiv","version":2}},"canonical_sha256":"95503b120563af76eddeac6119dafd3a83dd7acb4e2185c95ac1426a2ed07b72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95503b120563af76eddeac6119dafd3a83dd7acb4e2185c95ac1426a2ed07b72","first_computed_at":"2026-05-18T04:20:50.906274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:50.906274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SXYXkPQNQ2AnzIcRiRG6KE1onbUZTSWkpQzgtPTbnfD0aFY25ZDGToJ+JgYR2Z+ghqxCspgOVR/Vs6hEUAW0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:50.906921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3054","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a981f67bbf2e65946a0467ab523bc4adbd39c2a89a811db25ce3058e966552","sha256:44705c767991192d9591acc78670c24c6fe83fe54014f10a30862387c4f5fa0e"],"state_sha256":"09c2ded9b5d82aa6b3a5cb4ab9b81a03f8c233756bcbf0904a3e134c0c8b0efd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoTpyTcI9Paz3H3vcsbc5CgQQ2dH3nhf5O7uPy9dfRGBO0iklyUVh55Bt0IXbIrMMoYKLsv/gods12vSARpOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:26:29.938406Z","bundle_sha256":"ea75ddb8f6cb797bdac2ca38a23cd9244026d1d337279ab268cb2ee96fa60106"}}