{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:L6LZ4MLDDVBB3VPWXOON7AENXV","short_pith_number":"pith:L6LZ4MLD","schema_version":"1.0","canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","source":{"kind":"arxiv","id":"1201.1684","version":2},"attestation_state":"computed","paper":{"title":"The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson","submitted_at":"2012-01-09T03:26:47Z","abstract_excerpt":"This paper studies the three-user finite-field multi-way relay channel, where the users exchange messages via a relay. The messages are arbitrarily correlated, and the finite-field channel is linear and is subject to additive noise of arbitrary distribution. The problem is to determine the minimum achievable source-channel rate, defined as channel uses per source symbol needed for reliable communication. We combine Slepian-Wolf source coding and functional-decode-forward channel coding to obtain the solution for two classes of source and channel combinations. Furthermore, for correlated source"},"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":"1201.1684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T03:26:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bf2861424f5943329231b5a28840b021dbafa46e3aaaf3da07301ad117ef559","abstract_canon_sha256":"d6c5bc1f49667dcc2df743f415b7fa06eefbd911f8f993479dab09ceb121f9db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:11.048265Z","signature_b64":"OIEgXhpURF5FIhU12W9JaIsoeyS1w1QpgNIUZwkPwdmr2iRSccKBZC1p/85Wiwij5Av+JHTyChTATDC1LMSFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","last_reissued_at":"2026-05-18T03:13:11.047562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:11.047562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson","submitted_at":"2012-01-09T03:26:47Z","abstract_excerpt":"This paper studies the three-user finite-field multi-way relay channel, where the users exchange messages via a relay. The messages are arbitrarily correlated, and the finite-field channel is linear and is subject to additive noise of arbitrary distribution. The problem is to determine the minimum achievable source-channel rate, defined as channel uses per source symbol needed for reliable communication. We combine Slepian-Wolf source coding and functional-decode-forward channel coding to obtain the solution for two classes of source and channel combinations. Furthermore, for correlated source"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1684","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":"1201.1684","created_at":"2026-05-18T03:13:11.047666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1684v2","created_at":"2026-05-18T03:13:11.047666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1684","created_at":"2026-05-18T03:13:11.047666+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6LZ4MLDDVBB","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6LZ4MLDDVBB3VPW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6LZ4MLD","created_at":"2026-05-18T12:27:14.488303+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/L6LZ4MLDDVBB3VPWXOON7AENXV","json":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV.json","graph_json":"https://pith.science/api/pith-number/L6LZ4MLDDVBB3VPWXOON7AENXV/graph.json","events_json":"https://pith.science/api/pith-number/L6LZ4MLDDVBB3VPWXOON7AENXV/events.json","paper":"https://pith.science/paper/L6LZ4MLD"},"agent_actions":{"view_html":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV","download_json":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV.json","view_paper":"https://pith.science/paper/L6LZ4MLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1684&json=true","fetch_graph":"https://pith.science/api/pith-number/L6LZ4MLDDVBB3VPWXOON7AENXV/graph.json","fetch_events":"https://pith.science/api/pith-number/L6LZ4MLDDVBB3VPWXOON7AENXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/action/storage_attestation","attest_author":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/action/author_attestation","sign_citation":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/action/citation_signature","submit_replication":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/action/replication_record"}},"created_at":"2026-05-18T03:13:11.047666+00:00","updated_at":"2026-05-18T03:13:11.047666+00:00"}