{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DK3K3S2ARUEZ5KP5DC3M5HA4FF","short_pith_number":"pith:DK3K3S2A","schema_version":"1.0","canonical_sha256":"1ab6adcb408d099ea9fd18b6ce9c1c2956c0dc97ecdc22ada41037d82098f100","source":{"kind":"arxiv","id":"1610.00867","version":1},"attestation_state":"computed","paper":{"title":"Broadcast Function Computation with Complementary Side Information","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-10-04T06:58:03Z","abstract_excerpt":"We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources $X$ and $Y$. The encoder encodes $X^n$ and $Y^n$ into a message which is given to two decoders. Decoder 1 and decoder 2 have access to $X$ and $Y$ respectively, and they want to compute two functions $f(X,Y)$ and $g(X,Y)$ respectively using the encoded message and their respective side information. We want to find the optimum (minimum) encoding rate under the zero error and $\\epsilon$-error (i.e. vanishing error) criteria. For the special case"},"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":"1610.00867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-04T06:58:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9243cfeb44cefb0276c0bc994c2e9285aee9e1fca1db63b33e0c57e6a94b34da","abstract_canon_sha256":"f201f5d98214b9921711865ca66d3da878a2a88f14baacf301776fe8972e8c4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:13.052004Z","signature_b64":"V8AaxrLO4COiCVRk+GbchMx/KdXZxS+fRWp/uyturh0p/oeG1scQxoyjr4zL59gVG5+CQmoM/TqM0ncyDbtfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ab6adcb408d099ea9fd18b6ce9c1c2956c0dc97ecdc22ada41037d82098f100","last_reissued_at":"2026-05-18T01:03:13.051577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:13.051577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcast Function Computation with Complementary Side Information","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-10-04T06:58:03Z","abstract_excerpt":"We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources $X$ and $Y$. The encoder encodes $X^n$ and $Y^n$ into a message which is given to two decoders. Decoder 1 and decoder 2 have access to $X$ and $Y$ respectively, and they want to compute two functions $f(X,Y)$ and $g(X,Y)$ respectively using the encoded message and their respective side information. We want to find the optimum (minimum) encoding rate under the zero error and $\\epsilon$-error (i.e. vanishing error) criteria. For the special case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00867","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":"1610.00867","created_at":"2026-05-18T01:03:13.051641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00867v1","created_at":"2026-05-18T01:03:13.051641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00867","created_at":"2026-05-18T01:03:13.051641+00:00"},{"alias_kind":"pith_short_12","alias_value":"DK3K3S2ARUEZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DK3K3S2ARUEZ5KP5","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DK3K3S2A","created_at":"2026-05-18T12:30:12.583610+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/DK3K3S2ARUEZ5KP5DC3M5HA4FF","json":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF.json","graph_json":"https://pith.science/api/pith-number/DK3K3S2ARUEZ5KP5DC3M5HA4FF/graph.json","events_json":"https://pith.science/api/pith-number/DK3K3S2ARUEZ5KP5DC3M5HA4FF/events.json","paper":"https://pith.science/paper/DK3K3S2A"},"agent_actions":{"view_html":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF","download_json":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF.json","view_paper":"https://pith.science/paper/DK3K3S2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00867&json=true","fetch_graph":"https://pith.science/api/pith-number/DK3K3S2ARUEZ5KP5DC3M5HA4FF/graph.json","fetch_events":"https://pith.science/api/pith-number/DK3K3S2ARUEZ5KP5DC3M5HA4FF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF/action/storage_attestation","attest_author":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF/action/author_attestation","sign_citation":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF/action/citation_signature","submit_replication":"https://pith.science/pith/DK3K3S2ARUEZ5KP5DC3M5HA4FF/action/replication_record"}},"created_at":"2026-05-18T01:03:13.051641+00:00","updated_at":"2026-05-18T01:03:13.051641+00:00"}