{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UQV2BJBHI2OKEHGHC7RAK7BAH6","short_pith_number":"pith:UQV2BJBH","canonical_record":{"source":{"id":"1002.1781","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-09T20:26:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8f4fe54e54d86494f782c67f94cf7bab3c8680bfebfc5c6444fd4c8456e5f51","abstract_canon_sha256":"872642cdfb9cf65cd9b8b3bd65754f48df0957418af2fcf4650051a170bd19a6"},"schema_version":"1.0"},"canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","source":{"kind":"arxiv","id":"1002.1781","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1781","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1781v2","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1781","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"UQV2BJBHI2OK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UQV2BJBHI2OKEHGH","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UQV2BJBH","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UQV2BJBHI2OKEHGHC7RAK7BAH6","target":"record","payload":{"canonical_record":{"source":{"id":"1002.1781","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-09T20:26:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8f4fe54e54d86494f782c67f94cf7bab3c8680bfebfc5c6444fd4c8456e5f51","abstract_canon_sha256":"872642cdfb9cf65cd9b8b3bd65754f48df0957418af2fcf4650051a170bd19a6"},"schema_version":"1.0"},"canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:50.018855Z","signature_b64":"XWWZrkJhCsXClhDRj3WL+rqlFUnbJOFCPKc1L+HOBluEScXNGL7aUqpraoaEnR35MdnHFOJhB0o9JEQnAd8vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","last_reissued_at":"2026-05-18T04:20:50.018199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:50.018199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.1781","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":"+pxH6XaS4FqlLkqgKkodq0beDLizTOvhfuxJKhkSXxYaNfy1k/5ehZE9aVwSR+zmuvfISAtvUJSKF3l90ERGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:48:09.519212Z"},"content_sha256":"5b12c5e94f004f31dda86a5877f2bf6e100b2f1824a02f8ddc6b1d86bd0cbabb","schema_version":"1.0","event_id":"sha256:5b12c5e94f004f31dda86a5877f2bf6e100b2f1824a02f8ddc6b1d86bd0cbabb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UQV2BJBHI2OKEHGHC7RAK7BAH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ehsan Ardestanizadeh, Michele A. Wigger, Tara Javidi, Young-Han Kim","submitted_at":"2010-02-09T20:26:54Z","abstract_excerpt":"The capacity region of the N-sender Gaussian multiple access channel with feedback is not known in general. This paper studies the class of linear-feedback codes that includes (nonlinear) nonfeedback codes at one extreme and the linear-feedback codes by Schalkwijk and Kailath, Ozarow, and Kramer at the other extreme. The linear-feedback sum-capacity C_L(N,P) under symmetric power constraints P is characterized, the maximum sum-rate achieved by linear-feedback codes when each sender has the equal block power constraint P. In particular, it is shown that Kramer's code achieves this linear-feedba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1781","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":"ygvMz/UuVjwxg4hrfrR0qyGuL1MQG+f33OW0aSxnNJLtc3it4vlK/JaPRPSTZ3tYF2xAXsTLlo2R4nQjeLedAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:48:09.519568Z"},"content_sha256":"553cf38b70f6151181d9177e3fd3bcc6a3953234619bebfe889746e4f26fc4ab","schema_version":"1.0","event_id":"sha256:553cf38b70f6151181d9177e3fd3bcc6a3953234619bebfe889746e4f26fc4ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/bundle.json","state_url":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/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-03T04:48:09Z","links":{"resolver":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6","bundle":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/bundle.json","state":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UQV2BJBHI2OKEHGHC7RAK7BAH6","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":"872642cdfb9cf65cd9b8b3bd65754f48df0957418af2fcf4650051a170bd19a6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-09T20:26:54Z","title_canon_sha256":"b8f4fe54e54d86494f782c67f94cf7bab3c8680bfebfc5c6444fd4c8456e5f51"},"schema_version":"1.0","source":{"id":"1002.1781","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1781","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1781v2","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1781","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"UQV2BJBHI2OK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UQV2BJBHI2OKEHGH","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UQV2BJBH","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:553cf38b70f6151181d9177e3fd3bcc6a3953234619bebfe889746e4f26fc4ab","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":"The capacity region of the N-sender Gaussian multiple access channel with feedback is not known in general. This paper studies the class of linear-feedback codes that includes (nonlinear) nonfeedback codes at one extreme and the linear-feedback codes by Schalkwijk and Kailath, Ozarow, and Kramer at the other extreme. The linear-feedback sum-capacity C_L(N,P) under symmetric power constraints P is characterized, the maximum sum-rate achieved by linear-feedback codes when each sender has the equal block power constraint P. In particular, it is shown that Kramer's code achieves this linear-feedba","authors_text":"Ehsan Ardestanizadeh, Michele A. Wigger, Tara Javidi, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-09T20:26:54Z","title":"Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1781","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:5b12c5e94f004f31dda86a5877f2bf6e100b2f1824a02f8ddc6b1d86bd0cbabb","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":"872642cdfb9cf65cd9b8b3bd65754f48df0957418af2fcf4650051a170bd19a6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-09T20:26:54Z","title_canon_sha256":"b8f4fe54e54d86494f782c67f94cf7bab3c8680bfebfc5c6444fd4c8456e5f51"},"schema_version":"1.0","source":{"id":"1002.1781","kind":"arxiv","version":2}},"canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","first_computed_at":"2026-05-18T04:20:50.018199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:50.018199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWWZrkJhCsXClhDRj3WL+rqlFUnbJOFCPKc1L+HOBluEScXNGL7aUqpraoaEnR35MdnHFOJhB0o9JEQnAd8vAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:50.018855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.1781","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b12c5e94f004f31dda86a5877f2bf6e100b2f1824a02f8ddc6b1d86bd0cbabb","sha256:553cf38b70f6151181d9177e3fd3bcc6a3953234619bebfe889746e4f26fc4ab"],"state_sha256":"81aa627bc85bdb3b7263a66adcd599f116e3fae3cd9d77c350bc3d91a8d3f385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+i9RKeWgU/DKA5G7ZszTgVUc/J8v5lFXX/sILjtmNrmd4d9V03rTGjRa3oLew/fx6u4bOsjUoQoR/Odf2HsVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:48:09.521496Z","bundle_sha256":"a4cf3e3612fd90fc12b8b93c3a413a8a05bcdcf9b2accad59f4c021ff27a78aa"}}