{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQHECLZ7CYNN62OSPNFEESGKYN","short_pith_number":"pith:RQHECLZ7","schema_version":"1.0","canonical_sha256":"8c0e412f3f161adf69d27b4a4248cac36a26bf33491a9e5623731c2d72beed45","source":{"kind":"arxiv","id":"1609.07923","version":2},"attestation_state":"computed","paper":{"title":"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":"2016-09-26T11:13:44Z","abstract_excerpt":"We consider a function computation problem in a three node wireless network. Nodes A and B observe two correlated sources $X$ and $Y$ respectively, and want to compute a function $f(X,Y)$. 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$. We allow block coding, and study the achievable region of rate triples under both zero-error and $\\epsilon$-error. As a preparation, we first consider a broadcast network from the relay to A and B. A and B have side information $X$ and $Y$ respe"},"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":"1609.07923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T11:13:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6571e0707dbccabf1dbd00ebeea42e411504b7013ec0dcd011b3ea19167080a6","abstract_canon_sha256":"4f378b7a6f4988d8c1bbcc686d5dd6d289998763c9b1c06f35269f36cca26864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.765138Z","signature_b64":"0WJXF2Rol7SXYr7vsd9j6BNxxX47r8UdM9FeMnqM9jZsd3xGt+kr7xHi9wa0X3EoxrukLfX2JuLpdMHhv+13Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0e412f3f161adf69d27b4a4248cac36a26bf33491a9e5623731c2d72beed45","last_reissued_at":"2026-05-18T00:02:13.764385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.764385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"2016-09-26T11:13:44Z","abstract_excerpt":"We consider a function computation problem in a three node wireless network. Nodes A and B observe two correlated sources $X$ and $Y$ respectively, and want to compute a function $f(X,Y)$. 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$. We allow block coding, and study the achievable region of rate triples under both zero-error and $\\epsilon$-error. As a preparation, we first consider a broadcast network from the relay to A and B. A and B have side information $X$ and $Y$ respe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07923","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":"1609.07923","created_at":"2026-05-18T00:02:13.764481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07923v2","created_at":"2026-05-18T00:02:13.764481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07923","created_at":"2026-05-18T00:02:13.764481+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQHECLZ7CYNN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQHECLZ7CYNN62OS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQHECLZ7","created_at":"2026-05-18T12:30:41.710351+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/RQHECLZ7CYNN62OSPNFEESGKYN","json":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN.json","graph_json":"https://pith.science/api/pith-number/RQHECLZ7CYNN62OSPNFEESGKYN/graph.json","events_json":"https://pith.science/api/pith-number/RQHECLZ7CYNN62OSPNFEESGKYN/events.json","paper":"https://pith.science/paper/RQHECLZ7"},"agent_actions":{"view_html":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN","download_json":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN.json","view_paper":"https://pith.science/paper/RQHECLZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07923&json=true","fetch_graph":"https://pith.science/api/pith-number/RQHECLZ7CYNN62OSPNFEESGKYN/graph.json","fetch_events":"https://pith.science/api/pith-number/RQHECLZ7CYNN62OSPNFEESGKYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN/action/storage_attestation","attest_author":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN/action/author_attestation","sign_citation":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN/action/citation_signature","submit_replication":"https://pith.science/pith/RQHECLZ7CYNN62OSPNFEESGKYN/action/replication_record"}},"created_at":"2026-05-18T00:02:13.764481+00:00","updated_at":"2026-05-18T00:02:13.764481+00:00"}