{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KQR66USOTNKSJT5P4PRRHF2KBD","short_pith_number":"pith:KQR66USO","schema_version":"1.0","canonical_sha256":"5423ef524e9b5524cfafe3e313974a08e07f2ddefb4e8ea41e221e3abca63b2c","source":{"kind":"arxiv","id":"1905.00521","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Coding for Information Freshness in a Two-user Broadcast Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Yang, Songtao Feng","submitted_at":"2019-05-01T22:25:43Z","abstract_excerpt":"In this paper, we investigate the impact of coding on the Age of Information (AoI) in a two-user broadcast symbol erasure channel with feedback. We assume each update consists of $K$ symbols and the source is able to broadcast one symbol in each time slot. Due to random channel noise, the intended symbol at each user will be erased according to an independent and identically distributed (i.i.d.) Bernoulli process. A user is able to successfully decode an update if it accumulates sufficient information and successfully decodes the $K$ symbols of the update. Assuming prefect feedback information"},"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":"1905.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-01T22:25:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b35d41c98fca480da59aaa341199f6cbfa12e83dee5b8a1d992eee6c2c58d83","abstract_canon_sha256":"553177e901ebc3c09bba216e916391422380ae202b9953fea44256a24a67e7cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:11.641690Z","signature_b64":"yXh9/NVd9SnZ/lABfe9MuRLGIS0CybKUEtB8MpcCIcJ2AUQSUvNGkNqXbJDgCwIjcAaq73XGg053QIKFuaS0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5423ef524e9b5524cfafe3e313974a08e07f2ddefb4e8ea41e221e3abca63b2c","last_reissued_at":"2026-05-17T23:47:11.641278Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:11.641278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Coding for Information Freshness in a Two-user Broadcast Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Yang, Songtao Feng","submitted_at":"2019-05-01T22:25:43Z","abstract_excerpt":"In this paper, we investigate the impact of coding on the Age of Information (AoI) in a two-user broadcast symbol erasure channel with feedback. We assume each update consists of $K$ symbols and the source is able to broadcast one symbol in each time slot. Due to random channel noise, the intended symbol at each user will be erased according to an independent and identically distributed (i.i.d.) Bernoulli process. A user is able to successfully decode an update if it accumulates sufficient information and successfully decodes the $K$ symbols of the update. Assuming prefect feedback information"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00521","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.00521","created_at":"2026-05-17T23:47:11.641354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00521v1","created_at":"2026-05-17T23:47:11.641354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00521","created_at":"2026-05-17T23:47:11.641354+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQR66USOTNKS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQR66USOTNKSJT5P","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQR66USO","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00928","citing_title":"Trading Off Computation with Transmission in Status Update Systems","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD","json":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD.json","graph_json":"https://pith.science/api/pith-number/KQR66USOTNKSJT5P4PRRHF2KBD/graph.json","events_json":"https://pith.science/api/pith-number/KQR66USOTNKSJT5P4PRRHF2KBD/events.json","paper":"https://pith.science/paper/KQR66USO"},"agent_actions":{"view_html":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD","download_json":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD.json","view_paper":"https://pith.science/paper/KQR66USO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00521&json=true","fetch_graph":"https://pith.science/api/pith-number/KQR66USOTNKSJT5P4PRRHF2KBD/graph.json","fetch_events":"https://pith.science/api/pith-number/KQR66USOTNKSJT5P4PRRHF2KBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD/action/storage_attestation","attest_author":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD/action/author_attestation","sign_citation":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD/action/citation_signature","submit_replication":"https://pith.science/pith/KQR66USOTNKSJT5P4PRRHF2KBD/action/replication_record"}},"created_at":"2026-05-17T23:47:11.641354+00:00","updated_at":"2026-05-17T23:47:11.641354+00:00"}