{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WCPVJIKD5WIMMJM32CIOEUPBSE","short_pith_number":"pith:WCPVJIKD","schema_version":"1.0","canonical_sha256":"b09f54a143ed90c6259bd090e251e1912483450b516ea355aa6ba7e687f2ea6a","source":{"kind":"arxiv","id":"1411.6835","version":1},"attestation_state":"computed","paper":{"title":"Zero-Error Function Computation through a Bidirectional Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Jithin Ravi","submitted_at":"2014-11-25T12:30:34Z","abstract_excerpt":"We consider zero error function computation in a three node wireless network. Nodes A and B observe $X$ and $Y$ respectively, and want to compute a function $f(X,Y)$ with zero error. To achieve this, nodes A and B send messages to a relay node C at rates $R_A$ and $R_B$ respectively. The relay C then broadcasts a message to A and B at rate $R_C$ to help them compute $f(X,Y)$ with zero error. We allow block coding, and study the region of rate-triples $(R_A,R_B,R_C)$ that are feasible. The rate region is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We "},"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":"1411.6835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-25T12:30:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b735229537da2c89b3ae1366f4f109e35d8af327391e7b25834c5e11f1364ef5","abstract_canon_sha256":"e34b6c25f50414464b55405e30f66cb0bb27bc2705fd23735483c25ffe60531b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.199713Z","signature_b64":"ry+iPZGsr63GeeJhYV1ONA3X6Cc4jrspO1wYUu8vKMOGZMPTrUpzwgQrQngN9cIEQoD6XsLX9InLz6YIOtDoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b09f54a143ed90c6259bd090e251e1912483450b516ea355aa6ba7e687f2ea6a","last_reissued_at":"2026-05-18T02:32:47.199104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.199104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-Error Function Computation through a Bidirectional Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Jithin Ravi","submitted_at":"2014-11-25T12:30:34Z","abstract_excerpt":"We consider zero error function computation in a three node wireless network. Nodes A and B observe $X$ and $Y$ respectively, and want to compute a function $f(X,Y)$ with zero error. To achieve this, nodes A and B send messages to a relay node C at rates $R_A$ and $R_B$ respectively. The relay C then broadcasts a message to A and B at rate $R_C$ to help them compute $f(X,Y)$ with zero error. We allow block coding, and study the region of rate-triples $(R_A,R_B,R_C)$ that are feasible. The rate region is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6835","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":"1411.6835","created_at":"2026-05-18T02:32:47.199227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6835v1","created_at":"2026-05-18T02:32:47.199227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6835","created_at":"2026-05-18T02:32:47.199227+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCPVJIKD5WIM","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCPVJIKD5WIMMJM3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCPVJIKD","created_at":"2026-05-18T12:28:54.890064+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/WCPVJIKD5WIMMJM32CIOEUPBSE","json":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE.json","graph_json":"https://pith.science/api/pith-number/WCPVJIKD5WIMMJM32CIOEUPBSE/graph.json","events_json":"https://pith.science/api/pith-number/WCPVJIKD5WIMMJM32CIOEUPBSE/events.json","paper":"https://pith.science/paper/WCPVJIKD"},"agent_actions":{"view_html":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE","download_json":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE.json","view_paper":"https://pith.science/paper/WCPVJIKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6835&json=true","fetch_graph":"https://pith.science/api/pith-number/WCPVJIKD5WIMMJM32CIOEUPBSE/graph.json","fetch_events":"https://pith.science/api/pith-number/WCPVJIKD5WIMMJM32CIOEUPBSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE/action/storage_attestation","attest_author":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE/action/author_attestation","sign_citation":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE/action/citation_signature","submit_replication":"https://pith.science/pith/WCPVJIKD5WIMMJM32CIOEUPBSE/action/replication_record"}},"created_at":"2026-05-18T02:32:47.199227+00:00","updated_at":"2026-05-18T02:32:47.199227+00:00"}