{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I36M6U7HHPCGRPLXKNYZXPXE3S","short_pith_number":"pith:I36M6U7H","canonical_record":{"source":{"id":"1301.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T13:51:03Z","cross_cats_sorted":["math.IT","math.PR","stat.AP"],"title_canon_sha256":"ebfaafd84fa435f1ee6f602c8542c2229c48f77921310e993f2e1a8f80fb349d","abstract_canon_sha256":"5735dfb9d4ed47ecf196300ea1565a3c52d9508b18da230511eb8177215093a8"},"schema_version":"1.0"},"canonical_sha256":"46fccf53e73bc468bd7753719bbee4dc984b3e837251752084f8579e503903b1","source":{"kind":"arxiv","id":"1301.6255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6255","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6255v1","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6255","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"pith_short_12","alias_value":"I36M6U7HHPCG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I36M6U7HHPCGRPLX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I36M6U7H","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I36M6U7HHPCGRPLXKNYZXPXE3S","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T13:51:03Z","cross_cats_sorted":["math.IT","math.PR","stat.AP"],"title_canon_sha256":"ebfaafd84fa435f1ee6f602c8542c2229c48f77921310e993f2e1a8f80fb349d","abstract_canon_sha256":"5735dfb9d4ed47ecf196300ea1565a3c52d9508b18da230511eb8177215093a8"},"schema_version":"1.0"},"canonical_sha256":"46fccf53e73bc468bd7753719bbee4dc984b3e837251752084f8579e503903b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:24.563595Z","signature_b64":"UvDXtUF6u3ZnQimtsX//L9x5YCCxaDt4ixfPIeebBK/LvDPEXhHli9VMATyzQxihJEt7PInxK0+nZ/s558knAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fccf53e73bc468bd7753719bbee4dc984b3e837251752084f8579e503903b1","last_reissued_at":"2026-05-18T03:35:24.563039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:24.563039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6255","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-18T03:35:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8kHLNSZJQrM5ZC5BRM1HbWdMF4uaPQLPJ5fSo621Jgs62ojt4K9EmKriLu7717lVgCtgoW/G+pr659Gs4lRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:50:11.575733Z"},"content_sha256":"89d25c31cfab12be5c49c409e885b4c065160dd9733bd3cccb7aa4521fda5f4f","schema_version":"1.0","event_id":"sha256:89d25c31cfab12be5c49c409e885b4c065160dd9733bd3cccb7aa4521fda5f4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I36M6U7HHPCGRPLXKNYZXPXE3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","stat.AP"],"primary_cat":"cs.IT","authors_text":"Badri Vellambi, Ingmar Land, Ramanan Subramanian","submitted_at":"2013-01-26T13:51:03Z","abstract_excerpt":"A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of Additive White Gaussian Noise links each having an input power constraint. Intermediate nodes are allowed to perform arbitrary encoding/decoding operations, but the block length and the encoding rate are fixed. The bound presented in this paper is fundamental and depends only on the design parameters namely, the network size, block length, transmission rate, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6255","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-18T03:35:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93D91Qb0y+og9dllz+2naL0sFQxmZkQRB/nR33Wqc8fASZ0OvFzNKcLrFSgWiupMcubU2dBK5uEk9v1R0wtkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:50:11.576080Z"},"content_sha256":"15315b2eaf03f135dccb1389453939f8d1eccfc0f08b5e872cb5202e682e6239","schema_version":"1.0","event_id":"sha256:15315b2eaf03f135dccb1389453939f8d1eccfc0f08b5e872cb5202e682e6239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/bundle.json","state_url":"https://pith.science/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/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-20T07:50:11Z","links":{"resolver":"https://pith.science/pith/I36M6U7HHPCGRPLXKNYZXPXE3S","bundle":"https://pith.science/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/bundle.json","state":"https://pith.science/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I36M6U7HHPCGRPLXKNYZXPXE3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I36M6U7HHPCGRPLXKNYZXPXE3S","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":"5735dfb9d4ed47ecf196300ea1565a3c52d9508b18da230511eb8177215093a8","cross_cats_sorted":["math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T13:51:03Z","title_canon_sha256":"ebfaafd84fa435f1ee6f602c8542c2229c48f77921310e993f2e1a8f80fb349d"},"schema_version":"1.0","source":{"id":"1301.6255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6255","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6255v1","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6255","created_at":"2026-05-18T03:35:24Z"},{"alias_kind":"pith_short_12","alias_value":"I36M6U7HHPCG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I36M6U7HHPCGRPLX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I36M6U7H","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:15315b2eaf03f135dccb1389453939f8d1eccfc0f08b5e872cb5202e682e6239","target":"graph","created_at":"2026-05-18T03:35:24Z","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":"A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of Additive White Gaussian Noise links each having an input power constraint. Intermediate nodes are allowed to perform arbitrary encoding/decoding operations, but the block length and the encoding rate are fixed. The bound presented in this paper is fundamental and depends only on the design parameters namely, the network size, block length, transmission rate, an","authors_text":"Badri Vellambi, Ingmar Land, Ramanan Subramanian","cross_cats":["math.IT","math.PR","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T13:51:03Z","title":"Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6255","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:89d25c31cfab12be5c49c409e885b4c065160dd9733bd3cccb7aa4521fda5f4f","target":"record","created_at":"2026-05-18T03:35:24Z","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":"5735dfb9d4ed47ecf196300ea1565a3c52d9508b18da230511eb8177215093a8","cross_cats_sorted":["math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T13:51:03Z","title_canon_sha256":"ebfaafd84fa435f1ee6f602c8542c2229c48f77921310e993f2e1a8f80fb349d"},"schema_version":"1.0","source":{"id":"1301.6255","kind":"arxiv","version":1}},"canonical_sha256":"46fccf53e73bc468bd7753719bbee4dc984b3e837251752084f8579e503903b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46fccf53e73bc468bd7753719bbee4dc984b3e837251752084f8579e503903b1","first_computed_at":"2026-05-18T03:35:24.563039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:24.563039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UvDXtUF6u3ZnQimtsX//L9x5YCCxaDt4ixfPIeebBK/LvDPEXhHli9VMATyzQxihJEt7PInxK0+nZ/s558knAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:24.563595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d25c31cfab12be5c49c409e885b4c065160dd9733bd3cccb7aa4521fda5f4f","sha256:15315b2eaf03f135dccb1389453939f8d1eccfc0f08b5e872cb5202e682e6239"],"state_sha256":"b37d300057be23eb2911a90dd8e42813023e7562e8129772cd0fbb7038e435bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCQFUzeXZ8TmVg5Q7BgrLM/XVvvWFDP113HdaLRKpyNnTSHArV5q+AaZWl1KxFGrK6xwb+nVVxFemcJ1pTo3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:50:11.577993Z","bundle_sha256":"357c1204823c3d93dc2ff4c04ac722ebbcccc4a1ddd4d474753befb7392fc53c"}}