{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UXESFS7ADJGK6AA6EQYNU3APVY","short_pith_number":"pith:UXESFS7A","schema_version":"1.0","canonical_sha256":"a5c922cbe01a4caf001e2430da6c0fae2a90ec93faa2c4b6232eaa3cf5e0b787","source":{"kind":"arxiv","id":"1612.01487","version":3},"attestation_state":"computed","paper":{"title":"Capacity Regions of Two-Receiver Broadcast Erasure Channels with Feedback and 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":"2016-12-05T19:19:28Z","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. Two scenarios are considered: (i) when the transmitter has causal knowledge of the channel state (i.e., the state is visible), and (ii) when the channel state is unknown at the transmitter, but observations of it are available at the transmitter through feedback (i.e., the state is hidden). In both scenarios, matching outer and inner bounds on the rates of communication are derived and the capacity region is determined. It is s"},"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":"1612.01487","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-05T19:19:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b1e7badd69ee9ddaccc0910a5facb4e1224a273b6d1e7e6464384409f6b73c8d","abstract_canon_sha256":"3bab25e6d86cc7b49620f6864fa418c210e17750433b5e488b15bb2c4aba6398"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:01.489096Z","signature_b64":"OrhNZWhMhDn2lLSe2v5ZnjBJDh1Ng5LYjlbRyjOYLhcGQyQUiV1v3PKArnnK6ZURNCpKcwOeN4ELfbQp3UzuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c922cbe01a4caf001e2430da6c0fae2a90ec93faa2c4b6232eaa3cf5e0b787","last_reissued_at":"2026-05-18T00:23:01.488491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:01.488491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Regions of Two-Receiver Broadcast Erasure Channels with Feedback and 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":"2016-12-05T19:19:28Z","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. Two scenarios are considered: (i) when the transmitter has causal knowledge of the channel state (i.e., the state is visible), and (ii) when the channel state is unknown at the transmitter, but observations of it are available at the transmitter through feedback (i.e., the state is hidden). In both scenarios, matching outer and inner bounds on the rates of communication are derived and the capacity region is determined. It is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01487","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.01487","created_at":"2026-05-18T00:23:01.488582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01487v3","created_at":"2026-05-18T00:23:01.488582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01487","created_at":"2026-05-18T00:23:01.488582+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXESFS7ADJGK","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXESFS7ADJGK6AA6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXESFS7A","created_at":"2026-05-18T12:30:46.583412+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/UXESFS7ADJGK6AA6EQYNU3APVY","json":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY.json","graph_json":"https://pith.science/api/pith-number/UXESFS7ADJGK6AA6EQYNU3APVY/graph.json","events_json":"https://pith.science/api/pith-number/UXESFS7ADJGK6AA6EQYNU3APVY/events.json","paper":"https://pith.science/paper/UXESFS7A"},"agent_actions":{"view_html":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY","download_json":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY.json","view_paper":"https://pith.science/paper/UXESFS7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01487&json=true","fetch_graph":"https://pith.science/api/pith-number/UXESFS7ADJGK6AA6EQYNU3APVY/graph.json","fetch_events":"https://pith.science/api/pith-number/UXESFS7ADJGK6AA6EQYNU3APVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY/action/storage_attestation","attest_author":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY/action/author_attestation","sign_citation":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY/action/citation_signature","submit_replication":"https://pith.science/pith/UXESFS7ADJGK6AA6EQYNU3APVY/action/replication_record"}},"created_at":"2026-05-18T00:23:01.488582+00:00","updated_at":"2026-05-18T00:23:01.488582+00:00"}