{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:37BLG3EGOPOJCMPASQXZ6CY73T","short_pith_number":"pith:37BLG3EG","canonical_record":{"source":{"id":"1202.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:56:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"050fec0a9e9ed0cc5cf12717ec122617ca5f2b45c57bd72a81d03a15115c6019","abstract_canon_sha256":"3594fea4290162380b9941259571988f5b92a287cf7235bd4409771660394101"},"schema_version":"1.0"},"canonical_sha256":"dfc2b36c8673dc9131e0942f9f0b1fdcd32891a6ced8649e3be26b30dbc85d25","source":{"kind":"arxiv","id":"1202.0961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0961","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0961v1","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0961","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"37BLG3EGOPOJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37BLG3EGOPOJCMPA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37BLG3EG","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:37BLG3EGOPOJCMPASQXZ6CY73T","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:56:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"050fec0a9e9ed0cc5cf12717ec122617ca5f2b45c57bd72a81d03a15115c6019","abstract_canon_sha256":"3594fea4290162380b9941259571988f5b92a287cf7235bd4409771660394101"},"schema_version":"1.0"},"canonical_sha256":"dfc2b36c8673dc9131e0942f9f0b1fdcd32891a6ced8649e3be26b30dbc85d25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:05.628836Z","signature_b64":"h4KujwCaFPuEE1oJ71x4ZAukVP23HWn2Vyz55khF3pvHrxSIHtSMNEcXB7NicBFtxhXO4FGvPzHATm/PW0rnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc2b36c8673dc9131e0942f9f0b1fdcd32891a6ced8649e3be26b30dbc85d25","last_reissued_at":"2026-05-18T04:03:05.628034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:05.628034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0961","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:03:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PXf4+P1dLxQpR1tdzqjGMziuS4vAv4XbG3Otsc0OkshVZ+LJkFThj/yAFbSm1tmO0EwBTqq00SMjPQC3BfNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:37:59.952514Z"},"content_sha256":"75348eb36e9d5e9e0a089362a9fe78ce33796af04d204b084abe9b95b89874c0","schema_version":"1.0","event_id":"sha256:75348eb36e9d5e9e0a089362a9fe78ce33796af04d204b084abe9b95b89874c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:37BLG3EGOPOJCMPASQXZ6CY73T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stefano Rini","submitted_at":"2012-02-05T12:56:05Z","abstract_excerpt":"The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the distribution of the messages at the encoders. Using this expression we prove capacity for a class of general cognitive network that we denote as \"very strong interference\" regime. In this regime there is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0961","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:03:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y69Jo3RCBXzwxQofQiXGy+wSgeTlRucLUS1Ia+scaBTjqQPy0Nu/TT942hIM8Y5ZTVfRIIKy2P3nAeTfwP0KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:37:59.953157Z"},"content_sha256":"7d1de5187ec0232bd35d5ce2fe6d765205a754ce03d058bcdd464c2d3eab692b","schema_version":"1.0","event_id":"sha256:7d1de5187ec0232bd35d5ce2fe6d765205a754ce03d058bcdd464c2d3eab692b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37BLG3EGOPOJCMPASQXZ6CY73T/bundle.json","state_url":"https://pith.science/pith/37BLG3EGOPOJCMPASQXZ6CY73T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37BLG3EGOPOJCMPASQXZ6CY73T/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-06T10:37:59Z","links":{"resolver":"https://pith.science/pith/37BLG3EGOPOJCMPASQXZ6CY73T","bundle":"https://pith.science/pith/37BLG3EGOPOJCMPASQXZ6CY73T/bundle.json","state":"https://pith.science/pith/37BLG3EGOPOJCMPASQXZ6CY73T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37BLG3EGOPOJCMPASQXZ6CY73T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:37BLG3EGOPOJCMPASQXZ6CY73T","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":"3594fea4290162380b9941259571988f5b92a287cf7235bd4409771660394101","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:56:05Z","title_canon_sha256":"050fec0a9e9ed0cc5cf12717ec122617ca5f2b45c57bd72a81d03a15115c6019"},"schema_version":"1.0","source":{"id":"1202.0961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0961","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0961v1","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0961","created_at":"2026-05-18T04:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"37BLG3EGOPOJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37BLG3EGOPOJCMPA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37BLG3EG","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7d1de5187ec0232bd35d5ce2fe6d765205a754ce03d058bcdd464c2d3eab692b","target":"graph","created_at":"2026-05-18T04:03: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":"The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the distribution of the messages at the encoders. Using this expression we prove capacity for a class of general cognitive network that we denote as \"very strong interference\" regime. In this regime there is ","authors_text":"Stefano Rini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:56:05Z","title":"On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0961","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:75348eb36e9d5e9e0a089362a9fe78ce33796af04d204b084abe9b95b89874c0","target":"record","created_at":"2026-05-18T04:03: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":"3594fea4290162380b9941259571988f5b92a287cf7235bd4409771660394101","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:56:05Z","title_canon_sha256":"050fec0a9e9ed0cc5cf12717ec122617ca5f2b45c57bd72a81d03a15115c6019"},"schema_version":"1.0","source":{"id":"1202.0961","kind":"arxiv","version":1}},"canonical_sha256":"dfc2b36c8673dc9131e0942f9f0b1fdcd32891a6ced8649e3be26b30dbc85d25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfc2b36c8673dc9131e0942f9f0b1fdcd32891a6ced8649e3be26b30dbc85d25","first_computed_at":"2026-05-18T04:03:05.628034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:05.628034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4KujwCaFPuEE1oJ71x4ZAukVP23HWn2Vyz55khF3pvHrxSIHtSMNEcXB7NicBFtxhXO4FGvPzHATm/PW0rnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:05.628836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75348eb36e9d5e9e0a089362a9fe78ce33796af04d204b084abe9b95b89874c0","sha256:7d1de5187ec0232bd35d5ce2fe6d765205a754ce03d058bcdd464c2d3eab692b"],"state_sha256":"9873f98355b80a4b035115ccc200872175605270a879b850e67deb595483da78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pwf6LaPvB+1K5QgnNROSzopbYKnuPjE7+EoIVAKxcq+lmDmFYuo2hfWv9rnvPZw4AX3RAL+cRWFkafdQ+5L1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:37:59.956637Z","bundle_sha256":"fab5993e60874f7795fe087d683ce6011d7e04d4df55fb42e68d863ac43842b2"}}