{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S2W2OTPPVAC76PGSLPKL4P36LB","short_pith_number":"pith:S2W2OTPP","canonical_record":{"source":{"id":"1206.5389","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-23T13:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f7c78bdddb8d14c7ee0066a300c409dd763d9bea1c74c1881156eaf26a06e80","abstract_canon_sha256":"cff8d5416ab8da34b2415eb73b2b81a1289eaf2b4c4c961f7f95f7d844fc4217"},"schema_version":"1.0"},"canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","source":{"kind":"arxiv","id":"1206.5389","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5389","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5389v4","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5389","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"S2W2OTPPVAC7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S2W2OTPPVAC76PGS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S2W2OTPP","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S2W2OTPPVAC76PGSLPKL4P36LB","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5389","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-23T13:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f7c78bdddb8d14c7ee0066a300c409dd763d9bea1c74c1881156eaf26a06e80","abstract_canon_sha256":"cff8d5416ab8da34b2415eb73b2b81a1289eaf2b4c4c961f7f95f7d844fc4217"},"schema_version":"1.0"},"canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.004958Z","signature_b64":"34RMEi8dgNO5Fzrq15MtTOySPh+a1xDjtTVwvR9RjGjiHuoF5ao0FoH8mfL7WZ9EZII9wPvq4NX8L8jUV5hDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","last_reissued_at":"2026-05-18T00:58:43.004486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.004486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5389","source_version":4,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87PugL5aPO8/DZSDBz76naCMhgrsZ7vDdTxwb/puoARliG/ziK7G8dOhJY+5k7b2tCy9dkqTu0LScnX92AWuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:46:49.524966Z"},"content_sha256":"1aad2f467fe4f2a63fd0dc57e8f29fd287abc1c57f25cb8b2df024e4f72a3aa2","schema_version":"1.0","event_id":"sha256:1aad2f467fe4f2a63fd0dc57e8f29fd287abc1c57f25cb8b2df024e4f72a3aa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S2W2OTPPVAC76PGSLPKL4P36LB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Networks with in-Block Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Kramer","submitted_at":"2012-06-23T13:05:42Z","abstract_excerpt":"A class of channels is introduced for which there is memory inside blocks of a specified length and no memory across the blocks. The multi-user model is called an information network with in-block memory (NiBM). It is shown that block-fading channels, channels with state known causally at the encoder, and relay networks with delays are NiBMs. A cut-set bound is developed for NiBMs that unifies, strengthens, and generalizes existing cut bounds for discrete memoryless networks. The bound gives new finite-letter capacity expressions for several classes of networks including point-to-point channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5389","kind":"arxiv","version":4},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7UqO2KxfOhpN0ast/PlfHQpWASh69aSh+u3Idv8O+YwWlTt2FU+oZ6mmtGBpMETcM6p+3admFrAuJCEU2fSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:46:49.525533Z"},"content_sha256":"e402e02431efdc0fd0e8107820c7e59cd62cda0fd835de0f65ce3893226a91a0","schema_version":"1.0","event_id":"sha256:e402e02431efdc0fd0e8107820c7e59cd62cda0fd835de0f65ce3893226a91a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/bundle.json","state_url":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2W2OTPPVAC76PGSLPKL4P36LB/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-04T22:46:49Z","links":{"resolver":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB","bundle":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/bundle.json","state":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2W2OTPPVAC76PGSLPKL4P36LB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S2W2OTPPVAC76PGSLPKL4P36LB","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":"cff8d5416ab8da34b2415eb73b2b81a1289eaf2b4c4c961f7f95f7d844fc4217","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-23T13:05:42Z","title_canon_sha256":"6f7c78bdddb8d14c7ee0066a300c409dd763d9bea1c74c1881156eaf26a06e80"},"schema_version":"1.0","source":{"id":"1206.5389","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5389","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5389v4","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5389","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"S2W2OTPPVAC7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S2W2OTPPVAC76PGS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S2W2OTPP","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:e402e02431efdc0fd0e8107820c7e59cd62cda0fd835de0f65ce3893226a91a0","target":"graph","created_at":"2026-05-18T00:58:43Z","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 class of channels is introduced for which there is memory inside blocks of a specified length and no memory across the blocks. The multi-user model is called an information network with in-block memory (NiBM). It is shown that block-fading channels, channels with state known causally at the encoder, and relay networks with delays are NiBMs. A cut-set bound is developed for NiBMs that unifies, strengthens, and generalizes existing cut bounds for discrete memoryless networks. The bound gives new finite-letter capacity expressions for several classes of networks including point-to-point channel","authors_text":"Gerhard Kramer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-23T13:05:42Z","title":"Information Networks with in-Block Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5389","kind":"arxiv","version":4},"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:1aad2f467fe4f2a63fd0dc57e8f29fd287abc1c57f25cb8b2df024e4f72a3aa2","target":"record","created_at":"2026-05-18T00:58:43Z","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":"cff8d5416ab8da34b2415eb73b2b81a1289eaf2b4c4c961f7f95f7d844fc4217","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-23T13:05:42Z","title_canon_sha256":"6f7c78bdddb8d14c7ee0066a300c409dd763d9bea1c74c1881156eaf26a06e80"},"schema_version":"1.0","source":{"id":"1206.5389","kind":"arxiv","version":4}},"canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","first_computed_at":"2026-05-18T00:58:43.004486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.004486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34RMEi8dgNO5Fzrq15MtTOySPh+a1xDjtTVwvR9RjGjiHuoF5ao0FoH8mfL7WZ9EZII9wPvq4NX8L8jUV5hDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.004958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5389","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aad2f467fe4f2a63fd0dc57e8f29fd287abc1c57f25cb8b2df024e4f72a3aa2","sha256:e402e02431efdc0fd0e8107820c7e59cd62cda0fd835de0f65ce3893226a91a0"],"state_sha256":"8c95318b0b22ad5ebf1379cf7e36b310fa842c9e829349e3b652f9826c123c22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0O9BmPN2WpWg749W6G8koPBDqzU5ScbrNL/z5+6YU4Kzz4VbSlPG7IW1qSuPdmHsEN3d6p9jnNh9p0eWBrvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:46:49.528488Z","bundle_sha256":"4e7ecea0a2e2c4df5dd103def3106f9f75fef57e0e3336a41aefecb0906ffd0a"}}