{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NSIE2KBVHCB4FCZAJT5L5PBKG3","short_pith_number":"pith:NSIE2KBV","canonical_record":{"source":{"id":"1805.12595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:43:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46201f380e6cbe44c8b1339e7371f9992fbab82cc52a63179005c62bcc30548f","abstract_canon_sha256":"054b3e340a48de60bff3e0b0fc121fd608dded002e094ffbbb0b4f9d813c8b4f"},"schema_version":"1.0"},"canonical_sha256":"6c904d28353883c28b204cfabebc2a36dfddf4e179d7a888604feda05d5a5d93","source":{"kind":"arxiv","id":"1805.12595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12595","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12595v1","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12595","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"NSIE2KBVHCB4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NSIE2KBVHCB4FCZA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NSIE2KBV","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NSIE2KBVHCB4FCZAJT5L5PBKG3","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:43:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46201f380e6cbe44c8b1339e7371f9992fbab82cc52a63179005c62bcc30548f","abstract_canon_sha256":"054b3e340a48de60bff3e0b0fc121fd608dded002e094ffbbb0b4f9d813c8b4f"},"schema_version":"1.0"},"canonical_sha256":"6c904d28353883c28b204cfabebc2a36dfddf4e179d7a888604feda05d5a5d93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:29.864453Z","signature_b64":"RTSmoGH0qfUMWM7fGmOxFHBX1wC8L8YqA5Y/QWmNGZvOUCQDQ+HeAUuYmww8W4GnK0QPb2YM4myDtGL1LBqgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c904d28353883c28b204cfabebc2a36dfddf4e179d7a888604feda05d5a5d93","last_reissued_at":"2026-05-18T00:14:29.863801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:29.863801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12595","source_version":1,"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:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpHA6DWnqS1eiTPqO0WJsey4Pop0FaKdP8T6B835fg6BC1LNZm806F3CgUh/Ha1R2L9IXqycrQxN5IUbGaydBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:27:18.886857Z"},"content_sha256":"48fa1b52b739ee5b0a47087cec84ec8b4114a73f5dd9d3129d3fcdac713b8f7d","schema_version":"1.0","event_id":"sha256:48fa1b52b739ee5b0a47087cec84ec8b4114a73f5dd9d3129d3fcdac713b8f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NSIE2KBVHCB4FCZAJT5L5PBKG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Uzi Pereg, Yossef Steinberg","submitted_at":"2018-05-29T21:43:00Z","abstract_excerpt":"We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained. A second model addressed in this paper is the general case of primitive arbitrarily varying relay channels. We develop lower and upper bounds on the random code capacity, and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12595","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"},"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:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSQo6k92PQaW1X5Q0qhiQJCuOwjv/SBJppeDtmnDSAga0W1txoxw60Rtv0XDsudprXI2F/Ee+h5RQ9CP09MMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:27:18.887501Z"},"content_sha256":"231bf2a1b4510e4fef91e4ba6531178d5583f8397b51fb5d7c66b8c081c86b85","schema_version":"1.0","event_id":"sha256:231bf2a1b4510e4fef91e4ba6531178d5583f8397b51fb5d7c66b8c081c86b85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/bundle.json","state_url":"https://pith.science/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/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-05-21T21:27:18Z","links":{"resolver":"https://pith.science/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3","bundle":"https://pith.science/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/bundle.json","state":"https://pith.science/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSIE2KBVHCB4FCZAJT5L5PBKG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NSIE2KBVHCB4FCZAJT5L5PBKG3","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":"054b3e340a48de60bff3e0b0fc121fd608dded002e094ffbbb0b4f9d813c8b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:43:00Z","title_canon_sha256":"46201f380e6cbe44c8b1339e7371f9992fbab82cc52a63179005c62bcc30548f"},"schema_version":"1.0","source":{"id":"1805.12595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12595","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12595v1","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12595","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"NSIE2KBVHCB4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NSIE2KBVHCB4FCZA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NSIE2KBV","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:231bf2a1b4510e4fef91e4ba6531178d5583f8397b51fb5d7c66b8c081c86b85","target":"graph","created_at":"2026-05-18T00:14:29Z","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 arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained. A second model addressed in this paper is the general case of primitive arbitrarily varying relay channels. We develop lower and upper bounds on the random code capacity, and g","authors_text":"Uzi Pereg, Yossef Steinberg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:43:00Z","title":"The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12595","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:48fa1b52b739ee5b0a47087cec84ec8b4114a73f5dd9d3129d3fcdac713b8f7d","target":"record","created_at":"2026-05-18T00:14:29Z","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":"054b3e340a48de60bff3e0b0fc121fd608dded002e094ffbbb0b4f9d813c8b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:43:00Z","title_canon_sha256":"46201f380e6cbe44c8b1339e7371f9992fbab82cc52a63179005c62bcc30548f"},"schema_version":"1.0","source":{"id":"1805.12595","kind":"arxiv","version":1}},"canonical_sha256":"6c904d28353883c28b204cfabebc2a36dfddf4e179d7a888604feda05d5a5d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c904d28353883c28b204cfabebc2a36dfddf4e179d7a888604feda05d5a5d93","first_computed_at":"2026-05-18T00:14:29.863801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:29.863801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RTSmoGH0qfUMWM7fGmOxFHBX1wC8L8YqA5Y/QWmNGZvOUCQDQ+HeAUuYmww8W4GnK0QPb2YM4myDtGL1LBqgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:29.864453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48fa1b52b739ee5b0a47087cec84ec8b4114a73f5dd9d3129d3fcdac713b8f7d","sha256:231bf2a1b4510e4fef91e4ba6531178d5583f8397b51fb5d7c66b8c081c86b85"],"state_sha256":"5c10435c19b541da5019e4644b3ce9ac3513c8a8f62f2ff69918d4106b03c272"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kS3qmv/AGruzxEX4rUZFu9FvWbNKPYRRetSu+nIt6p6wuI60ybYsmaKndPth5+/VU70H4V7d6wBFRuqZkZZCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:27:18.890245Z","bundle_sha256":"106b7a0f86c85736dc7263bb16ae476a7dbdf469c0d277ab91826fd4e16f61be"}}