{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:HHVIWDJC6QBAVLGPDB2VCTIWTX","short_pith_number":"pith:HHVIWDJC","canonical_record":{"source":{"id":"0905.3086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-19T12:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5892ff91c29fbaf2049d04c950fe6ffb58042bbfb68010b92e42bb736999f7d","abstract_canon_sha256":"b73700e2a8048e6314d7663cd81bf30e92b2dd8959d360851fc52feb6adc17ee"},"schema_version":"1.0"},"canonical_sha256":"39ea8b0d22f4020aaccf1875514d169de1afec9b2eeef82638250727341a20ce","source":{"kind":"arxiv","id":"0905.3086","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:HHVIWDJC6QBAVLGPDB2VCTIWTX","target":"record","payload":{"canonical_record":{"source":{"id":"0905.3086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-19T12:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5892ff91c29fbaf2049d04c950fe6ffb58042bbfb68010b92e42bb736999f7d","abstract_canon_sha256":"b73700e2a8048e6314d7663cd81bf30e92b2dd8959d360851fc52feb6adc17ee"},"schema_version":"1.0"},"canonical_sha256":"39ea8b0d22f4020aaccf1875514d169de1afec9b2eeef82638250727341a20ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.135119Z","signature_b64":"oi340XvgaicVYJGJ2uUXthohSMTGHvp3Pp4flBp3LBHORDJ+e/XyLZdZzPqc/x5ouvVYo/+vi6iDh5pp+7/6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ea8b0d22f4020aaccf1875514d169de1afec9b2eeef82638250727341a20ce","last_reissued_at":"2026-05-18T00:58:20.134505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.134505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.3086","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhvMPjxzBUxe7yG57ZH4iseDLOa3VIyMXpqC4JnQ5pa1aakotgpK8C0cRLX2+E+21DHNb1HA3jNTdv+ZS7pSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:27:29.274274Z"},"content_sha256":"db462ed1d8592c45d3b69def75620ce0d66ac03895e82f216750ca96b0c503a3","schema_version":"1.0","event_id":"sha256:db462ed1d8592c45d3b69def75620ce0d66ac03895e82f216750ca96b0c503a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:HHVIWDJC6QBAVLGPDB2VCTIWTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Relay Networks with State Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sae-Young Chung, Sung Hoon Lim, Young-Han Kim","submitted_at":"2009-05-19T12:41:16Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3086","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeEqEhutie2+koJdITkVX2s5q+w83QlnWFYFOsGNULRNdQOaeoChE6FjSlRxA2oG1gKQhM+dNkhpPfjP262JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:27:29.274649Z"},"content_sha256":"e53057e48078950e49c4cb8c45504274f0ff918244c59e37071249ace46229bd","schema_version":"1.0","event_id":"sha256:e53057e48078950e49c4cb8c45504274f0ff918244c59e37071249ace46229bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/bundle.json","state_url":"https://pith.science/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T18:27:29Z","links":{"resolver":"https://pith.science/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX","bundle":"https://pith.science/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/bundle.json","state":"https://pith.science/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHVIWDJC6QBAVLGPDB2VCTIWTX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7DMsctJgzCVzJ1I/9TOi57gmSgcqK3iQ/17sSg583EDAAstLEyqMs4tBTRW+PjOFnPlaYXLWAYII3balz9PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:27:29.276805Z","bundle_sha256":"3211a91569966606931ceaa808af0ebb064f70365be83a5b7f483d61e7044b76"}}