{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KJUZB4QY2TGD55DWQTZOZTHGPD","short_pith_number":"pith:KJUZB4QY","schema_version":"1.0","canonical_sha256":"526990f218d4cc3ef47684f2eccce678c9802110707767b37acf6b41aa7359a7","source":{"kind":"arxiv","id":"1707.08621","version":1},"attestation_state":"computed","paper":{"title":"Communication versus Computation: Duality for multiple access channels and source coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Michael Gastpar, Sung Hoon Lim","submitted_at":"2017-07-26T19:38:41Z","abstract_excerpt":"Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. K\\\"orner and Marton showed for distributed source coding that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-and-forward has shown that function decoding, in combination with network coding ideas, is a useful building block for end-to-end communication. In both cases, good computation codes are the key component in the coding schemes. In this "},"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":"1707.08621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-26T19:38:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56a59d8d38c8e0d9dbc7ab02c82b8e2019849ddc284fc395e04a92a4b5a93d81","abstract_canon_sha256":"8fbc55055b7bed14dc6a6fecc367214f4ea7aa809f89bec4b2c5eb1cb54ceb16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.562605Z","signature_b64":"FNB60p0U4lJa02K7LC73CtZVbCFkISOSUWEEKRfLyEs3+w4DMswi+emeNwCckZMiA38T6lY8nBU6WqJuXdLlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"526990f218d4cc3ef47684f2eccce678c9802110707767b37acf6b41aa7359a7","last_reissued_at":"2026-05-18T00:39:23.561954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.561954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication versus Computation: Duality for multiple access channels and source coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Michael Gastpar, Sung Hoon Lim","submitted_at":"2017-07-26T19:38:41Z","abstract_excerpt":"Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. K\\\"orner and Marton showed for distributed source coding that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-and-forward has shown that function decoding, in combination with network coding ideas, is a useful building block for end-to-end communication. In both cases, good computation codes are the key component in the coding schemes. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08621","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.08621","created_at":"2026-05-18T00:39:23.562062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08621v1","created_at":"2026-05-18T00:39:23.562062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08621","created_at":"2026-05-18T00:39:23.562062+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJUZB4QY2TGD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJUZB4QY2TGD55DW","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJUZB4QY","created_at":"2026-05-18T12:31:24.725408+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/KJUZB4QY2TGD55DWQTZOZTHGPD","json":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD.json","graph_json":"https://pith.science/api/pith-number/KJUZB4QY2TGD55DWQTZOZTHGPD/graph.json","events_json":"https://pith.science/api/pith-number/KJUZB4QY2TGD55DWQTZOZTHGPD/events.json","paper":"https://pith.science/paper/KJUZB4QY"},"agent_actions":{"view_html":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD","download_json":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD.json","view_paper":"https://pith.science/paper/KJUZB4QY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08621&json=true","fetch_graph":"https://pith.science/api/pith-number/KJUZB4QY2TGD55DWQTZOZTHGPD/graph.json","fetch_events":"https://pith.science/api/pith-number/KJUZB4QY2TGD55DWQTZOZTHGPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD/action/storage_attestation","attest_author":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD/action/author_attestation","sign_citation":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD/action/citation_signature","submit_replication":"https://pith.science/pith/KJUZB4QY2TGD55DWQTZOZTHGPD/action/replication_record"}},"created_at":"2026-05-18T00:39:23.562062+00:00","updated_at":"2026-05-18T00:39:23.562062+00:00"}