{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LXHY7JUJFN6OBONOSZJAB5666Z","short_pith_number":"pith:LXHY7JUJ","canonical_record":{"source":{"id":"1004.2299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:20:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b713d01e9c7b8a5bb78a3de9e113e4746cbe649e40fb1ecdf791e0f4c3bbebd","abstract_canon_sha256":"8b83a63088d52d86cd4c7730c5f9ba4f873236f099d769e1354c4c75f2936644"},"schema_version":"1.0"},"canonical_sha256":"5dcf8fa6892b7ce0b9ae965200f7def643c9d31977267e87c741d821138b315d","source":{"kind":"arxiv","id":"1004.2299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2299","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2299v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2299","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"LXHY7JUJFN6O","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LXHY7JUJFN6OBONO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LXHY7JUJ","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LXHY7JUJFN6OBONOSZJAB5666Z","target":"record","payload":{"canonical_record":{"source":{"id":"1004.2299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:20:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b713d01e9c7b8a5bb78a3de9e113e4746cbe649e40fb1ecdf791e0f4c3bbebd","abstract_canon_sha256":"8b83a63088d52d86cd4c7730c5f9ba4f873236f099d769e1354c4c75f2936644"},"schema_version":"1.0"},"canonical_sha256":"5dcf8fa6892b7ce0b9ae965200f7def643c9d31977267e87c741d821138b315d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.685453Z","signature_b64":"Jx3jRaZjNIrhjKvVdY3/yktRV19mF5qcSOgOaf3pXx8Nctgz7Ge2x/HKVwMFkdL6LX92ZLTGeAV9pITX2EjuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dcf8fa6892b7ce0b9ae965200f7def643c9d31977267e87c741d821138b315d","last_reissued_at":"2026-05-18T02:24:16.684779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.684779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.2299","source_version":1,"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:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8KV1tKiBLGM/pSzklUtWnW8ml39kSdGNgD/+BmU67//T7fkqBBGqoqps8j2RkYDcl1xEftRd5XOYpRmnuDNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:39.673222Z"},"content_sha256":"39bb38f7df2fba6ff109e4d848c909d51f20f6656d18342e3eb764c8875ba8a2","schema_version":"1.0","event_id":"sha256:39bb38f7df2fba6ff109e4d848c909d51f20f6656d18342e3eb764c8875ba8a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LXHY7JUJFN6OBONOSZJAB5666Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Coding Strategy for the Binary Multi-Way Relay Channel","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":"2010-04-14T01:20:09Z","abstract_excerpt":"We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2299","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"},"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:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLpCQEWgrMiAx/Jcq1KuqELNYLHrH4gJbtZon7WNBigfYp8wHkzcEH0rkXXUgzbEzcS1MtrbNBvpM8EibyrSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:39.673600Z"},"content_sha256":"b8e40c3dd31a71a72ce8d8e1675992e358705af46c12af5340d9022b694885fc","schema_version":"1.0","event_id":"sha256:b8e40c3dd31a71a72ce8d8e1675992e358705af46c12af5340d9022b694885fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXHY7JUJFN6OBONOSZJAB5666Z/bundle.json","state_url":"https://pith.science/pith/LXHY7JUJFN6OBONOSZJAB5666Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXHY7JUJFN6OBONOSZJAB5666Z/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-01T21:20:39Z","links":{"resolver":"https://pith.science/pith/LXHY7JUJFN6OBONOSZJAB5666Z","bundle":"https://pith.science/pith/LXHY7JUJFN6OBONOSZJAB5666Z/bundle.json","state":"https://pith.science/pith/LXHY7JUJFN6OBONOSZJAB5666Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXHY7JUJFN6OBONOSZJAB5666Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LXHY7JUJFN6OBONOSZJAB5666Z","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":"8b83a63088d52d86cd4c7730c5f9ba4f873236f099d769e1354c4c75f2936644","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:20:09Z","title_canon_sha256":"5b713d01e9c7b8a5bb78a3de9e113e4746cbe649e40fb1ecdf791e0f4c3bbebd"},"schema_version":"1.0","source":{"id":"1004.2299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2299","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2299v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2299","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"LXHY7JUJFN6O","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LXHY7JUJFN6OBONO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LXHY7JUJ","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:b8e40c3dd31a71a72ce8d8e1675992e358705af46c12af5340d9022b694885fc","target":"graph","created_at":"2026-05-18T02:24:16Z","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":"We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users.","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":"2010-04-14T01:20:09Z","title":"An Optimal Coding Strategy for the Binary Multi-Way Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2299","kind":"arxiv","version":1},"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:39bb38f7df2fba6ff109e4d848c909d51f20f6656d18342e3eb764c8875ba8a2","target":"record","created_at":"2026-05-18T02:24:16Z","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":"8b83a63088d52d86cd4c7730c5f9ba4f873236f099d769e1354c4c75f2936644","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:20:09Z","title_canon_sha256":"5b713d01e9c7b8a5bb78a3de9e113e4746cbe649e40fb1ecdf791e0f4c3bbebd"},"schema_version":"1.0","source":{"id":"1004.2299","kind":"arxiv","version":1}},"canonical_sha256":"5dcf8fa6892b7ce0b9ae965200f7def643c9d31977267e87c741d821138b315d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dcf8fa6892b7ce0b9ae965200f7def643c9d31977267e87c741d821138b315d","first_computed_at":"2026-05-18T02:24:16.684779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.684779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jx3jRaZjNIrhjKvVdY3/yktRV19mF5qcSOgOaf3pXx8Nctgz7Ge2x/HKVwMFkdL6LX92ZLTGeAV9pITX2EjuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.685453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39bb38f7df2fba6ff109e4d848c909d51f20f6656d18342e3eb764c8875ba8a2","sha256:b8e40c3dd31a71a72ce8d8e1675992e358705af46c12af5340d9022b694885fc"],"state_sha256":"e0cca8107f0b2dbc5acf7f7250637d2dbef84fc4af498f16c108e0523e36985e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOZo3fPyEwZsqk9CYxABv+JQMNWHDW236Kwixcewsl57aovs1GIyWFeYFt3r13UeG3C5DxWufBjZKp8S3ofNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:20:39.675670Z","bundle_sha256":"0d97194a7748834d6cb3d8348a1372dcfd4cfda22ee1939d39f7d80fee363328"}}