{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L6LZ4MLDDVBB3VPWXOON7AENXV","short_pith_number":"pith:L6LZ4MLD","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"},"canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","source":{"kind":"arxiv","id":"1201.1684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1684","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1684v2","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1684","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"L6LZ4MLDDVBB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L6LZ4MLDDVBB3VPW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L6LZ4MLD","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L6LZ4MLDDVBB3VPWXOON7AENXV","target":"record","payload":{"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"},"canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","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"},"source_kind":"arxiv","source_id":"1201.1684","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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGp+iRXeEzAEj9IABQKfVSKZW7DnoLap/PmZYDX4ExqNJSv+3yt8dR0wOiGdXXgZlJZwOAfs1Ec1xhGz1/huDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:22:14.746307Z"},"content_sha256":"079545542c9869c042ab9cf51e10958b412c785f582e61d75d168ab7ae2ac3d4","schema_version":"1.0","event_id":"sha256:079545542c9869c042ab9cf51e10958b412c785f582e61d75d168ab7ae2ac3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L6LZ4MLDDVBB3VPWXOON7AENXV","target":"graph","payload":{"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"},"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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6BxlPV7FVmAps/dxy6Gog+1FT867YjqiDEslGDnXbmIyU8vXXpcYhoyLqLQF6jwY2TMtNDS15hQEvHD4dM9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:22:14.746672Z"},"content_sha256":"0fa9a5e237af047142041da564fd6bcb9d9aff81edad2c846eb3637e8a02def2","schema_version":"1.0","event_id":"sha256:0fa9a5e237af047142041da564fd6bcb9d9aff81edad2c846eb3637e8a02def2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/bundle.json","state_url":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/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-01T20:22:14Z","links":{"resolver":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV","bundle":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/bundle.json","state":"https://pith.science/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6LZ4MLDDVBB3VPWXOON7AENXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L6LZ4MLDDVBB3VPWXOON7AENXV","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":"d6c5bc1f49667dcc2df743f415b7fa06eefbd911f8f993479dab09ceb121f9db","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T03:26:47Z","title_canon_sha256":"3bf2861424f5943329231b5a28840b021dbafa46e3aaaf3da07301ad117ef559"},"schema_version":"1.0","source":{"id":"1201.1684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1684","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1684v2","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1684","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"L6LZ4MLDDVBB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L6LZ4MLDDVBB3VPW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L6LZ4MLD","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:0fa9a5e237af047142041da564fd6bcb9d9aff81edad2c846eb3637e8a02def2","target":"graph","created_at":"2026-05-18T03:13:11Z","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":"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","authors_text":"Christopher M. Kellett, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T03:26:47Z","title":"The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1684","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:079545542c9869c042ab9cf51e10958b412c785f582e61d75d168ab7ae2ac3d4","target":"record","created_at":"2026-05-18T03:13:11Z","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":"d6c5bc1f49667dcc2df743f415b7fa06eefbd911f8f993479dab09ceb121f9db","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T03:26:47Z","title_canon_sha256":"3bf2861424f5943329231b5a28840b021dbafa46e3aaaf3da07301ad117ef559"},"schema_version":"1.0","source":{"id":"1201.1684","kind":"arxiv","version":2}},"canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f979e31631d421dd5f6bb9cdf808dbd7f24ae004e7c96e699c09ec5b3c52ffb","first_computed_at":"2026-05-18T03:13:11.047562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:11.047562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OIEgXhpURF5FIhU12W9JaIsoeyS1w1QpgNIUZwkPwdmr2iRSccKBZC1p/85Wiwij5Av+JHTyChTATDC1LMSFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:11.048265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:079545542c9869c042ab9cf51e10958b412c785f582e61d75d168ab7ae2ac3d4","sha256:0fa9a5e237af047142041da564fd6bcb9d9aff81edad2c846eb3637e8a02def2"],"state_sha256":"7634154f7063d986558a9e0ea9dc4e7e970a244d119b5b67c12a5fafc6d0b98a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEoB6StceBYXPjn3UqWqIZWbUPkQLCqzCkbSzGGBYxykfLWBRHau2/czfqueJD0+XGnOlEQg7bL6KfBuAvMIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:22:14.748623Z","bundle_sha256":"9c7c84ab58968598ac6a801fabffe0bf879b61d0810d70eab9ea77b067ddd5a7"}}