{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H74L66VO66N5V62NXA4FPZ4NFI","short_pith_number":"pith:H74L66VO","canonical_record":{"source":{"id":"1506.07198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-23T21:08:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"690f0de73bcbd00dccb42be7712f0e7afbb8826ba17ac32fc810e527557c6a24","abstract_canon_sha256":"0aaebf95ac811fc05ed36aa1539c64e1f5246bd3bd21de8b5e09957154243b3e"},"schema_version":"1.0"},"canonical_sha256":"3ff8bf7aaef79bdafb4db83857e78d2a06f18895c77f80e6ceba8aef6ed66067","source":{"kind":"arxiv","id":"1506.07198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07198","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07198v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07198","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"H74L66VO66N5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H74L66VO66N5V62N","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H74L66VO","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H74L66VO66N5V62NXA4FPZ4NFI","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-23T21:08:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"690f0de73bcbd00dccb42be7712f0e7afbb8826ba17ac32fc810e527557c6a24","abstract_canon_sha256":"0aaebf95ac811fc05ed36aa1539c64e1f5246bd3bd21de8b5e09957154243b3e"},"schema_version":"1.0"},"canonical_sha256":"3ff8bf7aaef79bdafb4db83857e78d2a06f18895c77f80e6ceba8aef6ed66067","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.633127Z","signature_b64":"oNVMA6Kmn0XePK50VaNRl23Z4Rc2RmJBzniflGVZgUQ4TldW98OD1KcF67p99SkMRuJ1GxSF/Qfpo+i5w9yODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff8bf7aaef79bdafb4db83857e78d2a06f18895c77f80e6ceba8aef6ed66067","last_reissued_at":"2026-05-18T01:39:54.632559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.632559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07198","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYYLaYYTN0+WyK19SRzAymzXvYjMh750v8ZEzWOAmopj/G/L/+QNNp9cqLnUiq+5UIWS+d01uGhWfheuxzzpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:20:57.594225Z"},"content_sha256":"f246b9a05154756db7191e60f72e39998bd5f0b588d3a731d892b25998ad6003","schema_version":"1.0","event_id":"sha256:f246b9a05154756db7191e60f72e39998bd5f0b588d3a731d892b25998ad6003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H74L66VO66N5V62NXA4FPZ4NFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Heindlmaier, Shirin Saeedi Bidokhti","submitted_at":"2015-06-23T21:08:58Z","abstract_excerpt":"The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of this hidden Markov chain are available at the transmitter through feedback. Matching outer and inner bounds are derived and the capacity region is determined. The capacity region does not have a single-letter characterization and is, in this sense, uncomputable. Approximations of the capacity region are provided and two optimal coding algorithms are outlined. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07198","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeWESxnEuIbnGU5I5dqLz2Lw6wraDFvqNspSVhSfa8vE5WoYTlu1dzIiM/7djXPrqo7AtrqlHvk0AtA2nuPFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:20:57.594592Z"},"content_sha256":"66e1a10b0f1334c8f368f832a9560d7e16029674172cb28de1c4fd50e1e8243c","schema_version":"1.0","event_id":"sha256:66e1a10b0f1334c8f368f832a9560d7e16029674172cb28de1c4fd50e1e8243c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H74L66VO66N5V62NXA4FPZ4NFI/bundle.json","state_url":"https://pith.science/pith/H74L66VO66N5V62NXA4FPZ4NFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H74L66VO66N5V62NXA4FPZ4NFI/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-07-01T06:20:57Z","links":{"resolver":"https://pith.science/pith/H74L66VO66N5V62NXA4FPZ4NFI","bundle":"https://pith.science/pith/H74L66VO66N5V62NXA4FPZ4NFI/bundle.json","state":"https://pith.science/pith/H74L66VO66N5V62NXA4FPZ4NFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H74L66VO66N5V62NXA4FPZ4NFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H74L66VO66N5V62NXA4FPZ4NFI","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":"0aaebf95ac811fc05ed36aa1539c64e1f5246bd3bd21de8b5e09957154243b3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-23T21:08:58Z","title_canon_sha256":"690f0de73bcbd00dccb42be7712f0e7afbb8826ba17ac32fc810e527557c6a24"},"schema_version":"1.0","source":{"id":"1506.07198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07198","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07198v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07198","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"H74L66VO66N5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H74L66VO66N5V62N","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H74L66VO","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:66e1a10b0f1334c8f368f832a9560d7e16029674172cb28de1c4fd50e1e8243c","target":"graph","created_at":"2026-05-18T01:39:54Z","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":"The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of this hidden Markov chain are available at the transmitter through feedback. Matching outer and inner bounds are derived and the capacity region is determined. The capacity region does not have a single-letter characterization and is, in this sense, uncomputable. Approximations of the capacity region are provided and two optimal coding algorithms are outlined. ","authors_text":"Michael Heindlmaier, Shirin Saeedi Bidokhti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-23T21:08:58Z","title":"Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07198","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:f246b9a05154756db7191e60f72e39998bd5f0b588d3a731d892b25998ad6003","target":"record","created_at":"2026-05-18T01:39:54Z","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":"0aaebf95ac811fc05ed36aa1539c64e1f5246bd3bd21de8b5e09957154243b3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-23T21:08:58Z","title_canon_sha256":"690f0de73bcbd00dccb42be7712f0e7afbb8826ba17ac32fc810e527557c6a24"},"schema_version":"1.0","source":{"id":"1506.07198","kind":"arxiv","version":1}},"canonical_sha256":"3ff8bf7aaef79bdafb4db83857e78d2a06f18895c77f80e6ceba8aef6ed66067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ff8bf7aaef79bdafb4db83857e78d2a06f18895c77f80e6ceba8aef6ed66067","first_computed_at":"2026-05-18T01:39:54.632559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:54.632559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNVMA6Kmn0XePK50VaNRl23Z4Rc2RmJBzniflGVZgUQ4TldW98OD1KcF67p99SkMRuJ1GxSF/Qfpo+i5w9yODA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:54.633127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f246b9a05154756db7191e60f72e39998bd5f0b588d3a731d892b25998ad6003","sha256:66e1a10b0f1334c8f368f832a9560d7e16029674172cb28de1c4fd50e1e8243c"],"state_sha256":"29aede69854c991fb10322c919be1216b71030b551e49302d7ad24ad7b38df5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rgNT3CETo3P6I1C80OucpqOfswJ2QCS2tEe/lOir1TDJ4pg0LYbqEerPnymK4laBTeqDzHiLP409fwCNaxpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T06:20:57.596690Z","bundle_sha256":"5ce613dfd83fd5ea0ca95d0119d64f186d52624825f295562dcc31ed4e1effbb"}}