{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UQV2BJBHI2OKEHGHC7RAK7BAH6","short_pith_number":"pith:UQV2BJBH","schema_version":"1.0","canonical_sha256":"a42ba0a427469ca21cc717e2057c203faa46ac271e41db207007bc9cf0872f40","source":{"kind":"arxiv","id":"1002.1781","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1002.1781","created_at":"2026-05-18T04:20:50.018280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.1781v2","created_at":"2026-05-18T04:20:50.018280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1781","created_at":"2026-05-18T04:20:50.018280+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQV2BJBHI2OK","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQV2BJBHI2OKEHGH","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQV2BJBH","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6","json":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6.json","graph_json":"https://pith.science/api/pith-number/UQV2BJBHI2OKEHGHC7RAK7BAH6/graph.json","events_json":"https://pith.science/api/pith-number/UQV2BJBHI2OKEHGHC7RAK7BAH6/events.json","paper":"https://pith.science/paper/UQV2BJBH"},"agent_actions":{"view_html":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6","download_json":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6.json","view_paper":"https://pith.science/paper/UQV2BJBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.1781&json=true","fetch_graph":"https://pith.science/api/pith-number/UQV2BJBHI2OKEHGHC7RAK7BAH6/graph.json","fetch_events":"https://pith.science/api/pith-number/UQV2BJBHI2OKEHGHC7RAK7BAH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/action/storage_attestation","attest_author":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/action/author_attestation","sign_citation":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/action/citation_signature","submit_replication":"https://pith.science/pith/UQV2BJBHI2OKEHGHC7RAK7BAH6/action/replication_record"}},"created_at":"2026-05-18T04:20:50.018280+00:00","updated_at":"2026-05-18T04:20:50.018280+00:00"}