{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:S2W2OTPPVAC76PGSLPKL4P36LB","short_pith_number":"pith:S2W2OTPP","schema_version":"1.0","canonical_sha256":"96ada74defa805ff3cd25bd4be3f7e584e6393072659eab78a2131b516a65839","source":{"kind":"arxiv","id":"1206.5389","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5389","created_at":"2026-05-18T00:58:43.004566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5389v4","created_at":"2026-05-18T00:58:43.004566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5389","created_at":"2026-05-18T00:58:43.004566+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2W2OTPPVAC7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2W2OTPPVAC76PGS","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2W2OTPP","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB","json":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB.json","graph_json":"https://pith.science/api/pith-number/S2W2OTPPVAC76PGSLPKL4P36LB/graph.json","events_json":"https://pith.science/api/pith-number/S2W2OTPPVAC76PGSLPKL4P36LB/events.json","paper":"https://pith.science/paper/S2W2OTPP"},"agent_actions":{"view_html":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB","download_json":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB.json","view_paper":"https://pith.science/paper/S2W2OTPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5389&json=true","fetch_graph":"https://pith.science/api/pith-number/S2W2OTPPVAC76PGSLPKL4P36LB/graph.json","fetch_events":"https://pith.science/api/pith-number/S2W2OTPPVAC76PGSLPKL4P36LB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/action/storage_attestation","attest_author":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/action/author_attestation","sign_citation":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/action/citation_signature","submit_replication":"https://pith.science/pith/S2W2OTPPVAC76PGSLPKL4P36LB/action/replication_record"}},"created_at":"2026-05-18T00:58:43.004566+00:00","updated_at":"2026-05-18T00:58:43.004566+00:00"}