{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DK3K3S2ARUEZ5KP5DC3M5HA4FF","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":"f201f5d98214b9921711865ca66d3da878a2a88f14baacf301776fe8972e8c4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-04T06:58:03Z","title_canon_sha256":"9243cfeb44cefb0276c0bc994c2e9285aee9e1fca1db63b33e0c57e6a94b34da"},"schema_version":"1.0","source":{"id":"1610.00867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00867","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00867v1","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00867","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"DK3K3S2ARUEZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DK3K3S2ARUEZ5KP5","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DK3K3S2A","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:6db8e3da99bed85a5cbbd4421b66e6a565d1b96f52f18bed53bacc35772f9fb3","target":"graph","created_at":"2026-05-18T01:03:13Z","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 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","authors_text":"Bikash Kumar Dey, Jithin Ravi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-04T06:58:03Z","title":"Broadcast Function Computation with Complementary Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00867","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:dfcee3539d8275eec0b9bdb824acdab095aa981ef53535ac86b336868d3aab35","target":"record","created_at":"2026-05-18T01:03:13Z","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":"f201f5d98214b9921711865ca66d3da878a2a88f14baacf301776fe8972e8c4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-04T06:58:03Z","title_canon_sha256":"9243cfeb44cefb0276c0bc994c2e9285aee9e1fca1db63b33e0c57e6a94b34da"},"schema_version":"1.0","source":{"id":"1610.00867","kind":"arxiv","version":1}},"canonical_sha256":"1ab6adcb408d099ea9fd18b6ce9c1c2956c0dc97ecdc22ada41037d82098f100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ab6adcb408d099ea9fd18b6ce9c1c2956c0dc97ecdc22ada41037d82098f100","first_computed_at":"2026-05-18T01:03:13.051577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:13.051577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8AaxrLO4COiCVRk+GbchMx/KdXZxS+fRWp/uyturh0p/oeG1scQxoyjr4zL59gVG5+CQmoM/TqM0ncyDbtfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:13.052004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfcee3539d8275eec0b9bdb824acdab095aa981ef53535ac86b336868d3aab35","sha256:6db8e3da99bed85a5cbbd4421b66e6a565d1b96f52f18bed53bacc35772f9fb3"],"state_sha256":"67bffbb70444bd7587dea5796fad1e2efb582eb01a9c3ca55ecfcb28007f2d2b"}