{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEXE7HUGK3JOTCXHPG2ZLPDEGO","short_pith_number":"pith:CEXE7HUG","canonical_record":{"source":{"id":"1702.02330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d306a157782dbbcc2494095902d4a5b3301d8121a73c2e04ea9c8d848202c27c","abstract_canon_sha256":"b69bca5979a93a57d131d773b7880483508e18a051403c38bc99724d2ac5e10c"},"schema_version":"1.0"},"canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","source":{"kind":"arxiv","id":"1702.02330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02330","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02330v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02330","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"CEXE7HUGK3JO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEXE7HUGK3JOTCXH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEXE7HUG","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEXE7HUGK3JOTCXHPG2ZLPDEGO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d306a157782dbbcc2494095902d4a5b3301d8121a73c2e04ea9c8d848202c27c","abstract_canon_sha256":"b69bca5979a93a57d131d773b7880483508e18a051403c38bc99724d2ac5e10c"},"schema_version":"1.0"},"canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.200257Z","signature_b64":"C4KoG6htv+hOezEtu0u6zYuaMsUbxF1aR15Fi66ZzW4JnYLJ5kaaAHcwa6o4pmTaUxQ48n2FpxYxUGlP00fKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","last_reissued_at":"2026-05-18T00:51:06.199879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.199879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02330","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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yq4eFWGTAzOFG+HmEimQz2hLIR9RHdfHcre5nXquv/8Ancms6oKMhh6h+vgQVLiIEYkpTO/AkTs+siGjo4mOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:45.976967Z"},"content_sha256":"839273a69959c24aea60829b0d5ffe12ba37c1d29660e48333bb0650dbac5165","schema_version":"1.0","event_id":"sha256:839273a69959c24aea60829b0d5ffe12ba37c1d29660e48333bb0650dbac5165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEXE7HUGK3JOTCXHPG2ZLPDEGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Achievable Rate Region for Multiple-Access Channel with States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2017-02-08T09:01:18Z","abstract_excerpt":"The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-$4$ addition. It is shown that the sum-rate $R_1+R_2=1$ bits per channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than $0.32$ are not achievable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02330","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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObKW9rwK2jy+TgtRRXaF7RNcsyh6doe729d5Xf95gpFItYyjy1U2ESY4PAaIV+r418CDiGLve0l11tlLE6XcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:45.977295Z"},"content_sha256":"f4af6cd33d6f5d92083d0a78d0ef6a144ba981520c160c242f70f7aab7744fd5","schema_version":"1.0","event_id":"sha256:f4af6cd33d6f5d92083d0a78d0ef6a144ba981520c160c242f70f7aab7744fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/bundle.json","state_url":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/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-08T15:00:45Z","links":{"resolver":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO","bundle":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/bundle.json","state":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEXE7HUGK3JOTCXHPG2ZLPDEGO","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":"b69bca5979a93a57d131d773b7880483508e18a051403c38bc99724d2ac5e10c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","title_canon_sha256":"d306a157782dbbcc2494095902d4a5b3301d8121a73c2e04ea9c8d848202c27c"},"schema_version":"1.0","source":{"id":"1702.02330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02330","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02330v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02330","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"CEXE7HUGK3JO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEXE7HUGK3JOTCXH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEXE7HUG","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f4af6cd33d6f5d92083d0a78d0ef6a144ba981520c160c242f70f7aab7744fd5","target":"graph","created_at":"2026-05-18T00:51:06Z","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 problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-$4$ addition. It is shown that the sum-rate $R_1+R_2=1$ bits per channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than $0.32$ are not achievable.","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","title":"A New Achievable Rate Region for Multiple-Access Channel with States"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02330","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:839273a69959c24aea60829b0d5ffe12ba37c1d29660e48333bb0650dbac5165","target":"record","created_at":"2026-05-18T00:51:06Z","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":"b69bca5979a93a57d131d773b7880483508e18a051403c38bc99724d2ac5e10c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","title_canon_sha256":"d306a157782dbbcc2494095902d4a5b3301d8121a73c2e04ea9c8d848202c27c"},"schema_version":"1.0","source":{"id":"1702.02330","kind":"arxiv","version":1}},"canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","first_computed_at":"2026-05-18T00:51:06.199879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.199879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C4KoG6htv+hOezEtu0u6zYuaMsUbxF1aR15Fi66ZzW4JnYLJ5kaaAHcwa6o4pmTaUxQ48n2FpxYxUGlP00fKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.200257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:839273a69959c24aea60829b0d5ffe12ba37c1d29660e48333bb0650dbac5165","sha256:f4af6cd33d6f5d92083d0a78d0ef6a144ba981520c160c242f70f7aab7744fd5"],"state_sha256":"8fcf1daf22657501387d8f9254bcd10708781dca6856df465613bacc3eb76757"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwOgF64SMUG/PrA7BKSU/APVB8Nl6VIebtVqpFbNDSpNq3zCct2ULc3SE0RgS8UIAqhcwFNbsCtWEpi3XqiMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:00:45.980109Z","bundle_sha256":"c661bf0ab14ef817d4af26c1e77a9093294b30d9137c76eca2f2ee23406be036"}}