{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:HHVIWDJC6QBAVLGPDB2VCTIWTX","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":"b73700e2a8048e6314d7663cd81bf30e92b2dd8959d360851fc52feb6adc17ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-19T12:41:16Z","title_canon_sha256":"d5892ff91c29fbaf2049d04c950fe6ffb58042bbfb68010b92e42bb736999f7d"},"schema_version":"1.0","source":{"id":"0905.3086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3086","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3086v2","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3086","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"HHVIWDJC6QBA","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HHVIWDJC6QBAVLGP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HHVIWDJC","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:e53057e48078950e49c4cb8c45504274f0ff918244c59e37071249ace46229bd","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"Motivated by fading channels and erasure channels, the problem of reliable communication over deterministic relay networks is studied, in which relay nodes receive a function of the incoming signals and a random network state. An achievable rate is characterized for the case in which destination nodes have full knowledge of the state information. If the relay nodes receive a linear function of the incoming signals and the state in a finite field, then the achievable rate is shown to be optimal, meeting the cut-set upper bound on the capacity. This result generalizes on a unified framework the ","authors_text":"Sae-Young Chung, Sung Hoon Lim, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-19T12:41:16Z","title":"Deterministic Relay Networks with State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3086","kind":"arxiv","version":2},"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:db462ed1d8592c45d3b69def75620ce0d66ac03895e82f216750ca96b0c503a3","target":"record","created_at":"2026-05-18T00:58:20Z","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":"b73700e2a8048e6314d7663cd81bf30e92b2dd8959d360851fc52feb6adc17ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-19T12:41:16Z","title_canon_sha256":"d5892ff91c29fbaf2049d04c950fe6ffb58042bbfb68010b92e42bb736999f7d"},"schema_version":"1.0","source":{"id":"0905.3086","kind":"arxiv","version":2}},"canonical_sha256":"39ea8b0d22f4020aaccf1875514d169de1afec9b2eeef82638250727341a20ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39ea8b0d22f4020aaccf1875514d169de1afec9b2eeef82638250727341a20ce","first_computed_at":"2026-05-18T00:58:20.134505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.134505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oi340XvgaicVYJGJ2uUXthohSMTGHvp3Pp4flBp3LBHORDJ+e/XyLZdZzPqc/x5ouvVYo/+vi6iDh5pp+7/6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.135119Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.3086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db462ed1d8592c45d3b69def75620ce0d66ac03895e82f216750ca96b0c503a3","sha256:e53057e48078950e49c4cb8c45504274f0ff918244c59e37071249ace46229bd"],"state_sha256":"00ab530c1b28ca093dc677848a78c5e62fe71f5f1f7ab059e20944b79bda0439"}