{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QWCOTVUCOUGP4ANRQAIIOJIYDJ","short_pith_number":"pith:QWCOTVUC","canonical_record":{"source":{"id":"1301.4730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc16fc52dd13bc3f63868470da72d8d8b2e552e0fac886d8a9b3f3ed94849490","abstract_canon_sha256":"3bcfe98955de299027c409c7db9591b5f77efe0a4f48b16e065112c3f9d80a97"},"schema_version":"1.0"},"canonical_sha256":"8584e9d682750cfe01b180108725181a69501a37ecaa2734590d7245570764a7","source":{"kind":"arxiv","id":"1301.4730","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4730","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4730v2","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4730","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"QWCOTVUCOUGP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWCOTVUCOUGP4ANR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWCOTVUC","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QWCOTVUCOUGP4ANRQAIIOJIYDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc16fc52dd13bc3f63868470da72d8d8b2e552e0fac886d8a9b3f3ed94849490","abstract_canon_sha256":"3bcfe98955de299027c409c7db9591b5f77efe0a4f48b16e065112c3f9d80a97"},"schema_version":"1.0"},"canonical_sha256":"8584e9d682750cfe01b180108725181a69501a37ecaa2734590d7245570764a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:24.486664Z","signature_b64":"Qeg1H41ST3t02Vtouq3f5LU1jbnFLrZXNFhEnSsi8j2qAlDZZa1qOUL4yo1l6clmnJQeVNNTwiWKtV5P+4fUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8584e9d682750cfe01b180108725181a69501a37ecaa2734590d7245570764a7","last_reissued_at":"2026-05-18T02:43:24.486220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:24.486220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4730","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-18T02:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2CyD2OzWW/3BgXV2/WdGKgSfIIsHZ8ulLtppsAcWWaVhUsdESEzphp7xjdLh2ce84Hfn1IDz1VEq7th71sgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:44.917686Z"},"content_sha256":"9b927ad3ae7c1d7cd1f768794097f9cfb7ff2ce87622e0f5b33c6095244311e5","schema_version":"1.0","event_id":"sha256:9b927ad3ae7c1d7cd1f768794097f9cfb7ff2ce87622e0f5b33c6095244311e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QWCOTVUCOUGP4ANRQAIIOJIYDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Coding Functions for Pairwise Message Sharing on Finite-Field Multi-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","submitted_at":"2013-01-21T02:27:29Z","abstract_excerpt":"This paper considers the finite-field multi-way relay channel with pairwise message sharing, where multiple users exchange messages through a single relay and where the users may share parts of their source messages (meaning that some message parts are known/common to more than one user). In this paper, we design an optimal functional-decode-forward coding scheme that takes the shared messages into account. More specifically, we design an optimal function for the relay to decode (from the users on the uplink) and forward (back to the users on the downlink). We then show that this proposed func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4730","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-18T02:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RdOJC3H0BLVRSJ8JBJxakyIIAGCsAVAkGz7ENRa8eUbWJPhWNaWIJNeqjmOhFM4kALzZHFPf6wVpmC8ErDrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:44.918032Z"},"content_sha256":"eea4c07d4489d467f524cb01025f4793ab12aca595cddd21b7b818754fc0744f","schema_version":"1.0","event_id":"sha256:eea4c07d4489d467f524cb01025f4793ab12aca595cddd21b7b818754fc0744f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/bundle.json","state_url":"https://pith.science/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/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-01T16:29:44Z","links":{"resolver":"https://pith.science/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ","bundle":"https://pith.science/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/bundle.json","state":"https://pith.science/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWCOTVUCOUGP4ANRQAIIOJIYDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QWCOTVUCOUGP4ANRQAIIOJIYDJ","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":"3bcfe98955de299027c409c7db9591b5f77efe0a4f48b16e065112c3f9d80a97","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:27:29Z","title_canon_sha256":"cc16fc52dd13bc3f63868470da72d8d8b2e552e0fac886d8a9b3f3ed94849490"},"schema_version":"1.0","source":{"id":"1301.4730","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4730","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4730v2","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4730","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"QWCOTVUCOUGP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWCOTVUCOUGP4ANR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWCOTVUC","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:eea4c07d4489d467f524cb01025f4793ab12aca595cddd21b7b818754fc0744f","target":"graph","created_at":"2026-05-18T02:43:24Z","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 considers the finite-field multi-way relay channel with pairwise message sharing, where multiple users exchange messages through a single relay and where the users may share parts of their source messages (meaning that some message parts are known/common to more than one user). In this paper, we design an optimal functional-decode-forward coding scheme that takes the shared messages into account. More specifically, we design an optimal function for the relay to decode (from the users on the uplink) and forward (back to the users on the downlink). We then show that this proposed func","authors_text":"Christopher M. Kellett, 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":"2013-01-21T02:27:29Z","title":"Optimal Coding Functions for Pairwise Message Sharing on Finite-Field Multi-Way Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4730","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:9b927ad3ae7c1d7cd1f768794097f9cfb7ff2ce87622e0f5b33c6095244311e5","target":"record","created_at":"2026-05-18T02:43:24Z","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":"3bcfe98955de299027c409c7db9591b5f77efe0a4f48b16e065112c3f9d80a97","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-21T02:27:29Z","title_canon_sha256":"cc16fc52dd13bc3f63868470da72d8d8b2e552e0fac886d8a9b3f3ed94849490"},"schema_version":"1.0","source":{"id":"1301.4730","kind":"arxiv","version":2}},"canonical_sha256":"8584e9d682750cfe01b180108725181a69501a37ecaa2734590d7245570764a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8584e9d682750cfe01b180108725181a69501a37ecaa2734590d7245570764a7","first_computed_at":"2026-05-18T02:43:24.486220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:24.486220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qeg1H41ST3t02Vtouq3f5LU1jbnFLrZXNFhEnSsi8j2qAlDZZa1qOUL4yo1l6clmnJQeVNNTwiWKtV5P+4fUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:24.486664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4730","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b927ad3ae7c1d7cd1f768794097f9cfb7ff2ce87622e0f5b33c6095244311e5","sha256:eea4c07d4489d467f524cb01025f4793ab12aca595cddd21b7b818754fc0744f"],"state_sha256":"be1b82c98b21ed135c35fba73c32e2ff0756fe1aae4588d5eacac3cae9e6ed3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxvtE4fXviCzKJAfOitwDeXaBltI4u/m6KUyziZjmtqP4CJM3/8yoPR083p7FNS91MtLm5Umk4NCgenutNLFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:29:44.920060Z","bundle_sha256":"eca5158bc7e6522d66c0ab7212a47df57b851454e373825a9a1caedf575400d0"}}