{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HLVYNVDLKZEB7FC5ZOEEVWJGEG","short_pith_number":"pith:HLVYNVDL","canonical_record":{"source":{"id":"1305.4403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-19T19:29:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"81e6df5b3324c1883809e13e562e6530a8b624bd24963cee2c764b8d8366acbf","abstract_canon_sha256":"e2de3c0800cdda446d3c735fb3b3004f89445671fe7b3fdb2b4b474b3b4b0e01"},"schema_version":"1.0"},"canonical_sha256":"3aeb86d46b56481f945dcb884ad9262181079d37263e0c5ff3b0b5b43b3d2267","source":{"kind":"arxiv","id":"1305.4403","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4403","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4403v3","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4403","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"HLVYNVDLKZEB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HLVYNVDLKZEB7FC5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HLVYNVDL","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HLVYNVDLKZEB7FC5ZOEEVWJGEG","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-19T19:29:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"81e6df5b3324c1883809e13e562e6530a8b624bd24963cee2c764b8d8366acbf","abstract_canon_sha256":"e2de3c0800cdda446d3c735fb3b3004f89445671fe7b3fdb2b4b474b3b4b0e01"},"schema_version":"1.0"},"canonical_sha256":"3aeb86d46b56481f945dcb884ad9262181079d37263e0c5ff3b0b5b43b3d2267","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.217039Z","signature_b64":"zA+sfxxg1KlJh9WfuSFt6brlFrNK+qUwy1FQvKo7zNqmkdbjKCO83Fbkd02jAMu7qtXaYwccB0ChOoB8BYdGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aeb86d46b56481f945dcb884ad9262181079d37263e0c5ff3b0b5b43b3d2267","last_reissued_at":"2026-05-18T00:58:17.216341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.216341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4403","source_version":3,"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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GG2WhTWX0rFDb4+sDcvVAS4McgsV0ePpbRstCKvvtShF0ZSIlO0tO5kIuJA/QWrP14BoDgvmKhwjyzYWb5ZUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:29:59.271105Z"},"content_sha256":"804f2050b4c6ab301db56c9fb5c7c3db3117ade8a6c79f635f7f526a62c71250","schema_version":"1.0","event_id":"sha256:804f2050b4c6ab301db56c9fb5c7c3db3117ade8a6c79f635f7f526a62c71250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HLVYNVDLKZEB7FC5ZOEEVWJGEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communicating over Filter-and-Forward Relay Networks with Channel Output Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Love, Mayur Agrawal, Venkataramanan Balakrishnan","submitted_at":"2013-05-19T19:29:23Z","abstract_excerpt":"Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the three-terminal relay channel with destination-to-source feedback in the presence of correlated noise. Our lower bound improves on the existing bounds in the literature. We then extend our lower bound to general relay network configurations using an arbitrary number of filter-and-forward relay nodes. Such network configurations are common in many multi-hop communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4403","kind":"arxiv","version":3},"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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ko532kiJsBWbCLgauyLF9FfudBq/ELHNrM49UMrFyUXHnBOPcXJrtlZa7ve3bNmwU5qyTPgQbJVfzLgqHbMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:29:59.271467Z"},"content_sha256":"421c2862ffaafc4b7a6a883bd49929b295ffe65be7fb8d13c2fc2ecacaf2d38f","schema_version":"1.0","event_id":"sha256:421c2862ffaafc4b7a6a883bd49929b295ffe65be7fb8d13c2fc2ecacaf2d38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/bundle.json","state_url":"https://pith.science/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/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-03T20:29:59Z","links":{"resolver":"https://pith.science/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG","bundle":"https://pith.science/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/bundle.json","state":"https://pith.science/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLVYNVDLKZEB7FC5ZOEEVWJGEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HLVYNVDLKZEB7FC5ZOEEVWJGEG","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":"e2de3c0800cdda446d3c735fb3b3004f89445671fe7b3fdb2b4b474b3b4b0e01","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-19T19:29:23Z","title_canon_sha256":"81e6df5b3324c1883809e13e562e6530a8b624bd24963cee2c764b8d8366acbf"},"schema_version":"1.0","source":{"id":"1305.4403","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4403","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4403v3","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4403","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"HLVYNVDLKZEB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HLVYNVDLKZEB7FC5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HLVYNVDL","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:421c2862ffaafc4b7a6a883bd49929b295ffe65be7fb8d13c2fc2ecacaf2d38f","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the three-terminal relay channel with destination-to-source feedback in the presence of correlated noise. Our lower bound improves on the existing bounds in the literature. We then extend our lower bound to general relay network configurations using an arbitrary number of filter-and-forward relay nodes. Such network configurations are common in many multi-hop communi","authors_text":"David Love, Mayur Agrawal, Venkataramanan Balakrishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-19T19:29:23Z","title":"Communicating over Filter-and-Forward Relay Networks with Channel Output Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4403","kind":"arxiv","version":3},"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:804f2050b4c6ab301db56c9fb5c7c3db3117ade8a6c79f635f7f526a62c71250","target":"record","created_at":"2026-05-18T00:58:17Z","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":"e2de3c0800cdda446d3c735fb3b3004f89445671fe7b3fdb2b4b474b3b4b0e01","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-19T19:29:23Z","title_canon_sha256":"81e6df5b3324c1883809e13e562e6530a8b624bd24963cee2c764b8d8366acbf"},"schema_version":"1.0","source":{"id":"1305.4403","kind":"arxiv","version":3}},"canonical_sha256":"3aeb86d46b56481f945dcb884ad9262181079d37263e0c5ff3b0b5b43b3d2267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aeb86d46b56481f945dcb884ad9262181079d37263e0c5ff3b0b5b43b3d2267","first_computed_at":"2026-05-18T00:58:17.216341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.216341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zA+sfxxg1KlJh9WfuSFt6brlFrNK+qUwy1FQvKo7zNqmkdbjKCO83Fbkd02jAMu7qtXaYwccB0ChOoB8BYdGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.217039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4403","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:804f2050b4c6ab301db56c9fb5c7c3db3117ade8a6c79f635f7f526a62c71250","sha256:421c2862ffaafc4b7a6a883bd49929b295ffe65be7fb8d13c2fc2ecacaf2d38f"],"state_sha256":"f371f0bd58ad8617b66c2472c0c721632e4fd626570b9a7e80ec7fbd9bb7ccd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNesPqg6D9Dx8bAecx2lIicjpmfIjXFUFNgm7tyivs2h+rvO6NQjiie/ksKkdLFKo55ey42WL/SbD5Jcum4nBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:29:59.273440Z","bundle_sha256":"4a2c542fb470cf12055f278624e7873a76b3611c8333223f529278b765287c01"}}