{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GRNX5QXEQXU7VYMYAR77AFHKQE","short_pith_number":"pith:GRNX5QXE","schema_version":"1.0","canonical_sha256":"345b7ec2e485e9fae198047ff014ea810ef5628261062ba4e441fe1a81bae2e9","source":{"kind":"arxiv","id":"1704.04155","version":4},"attestation_state":"computed","paper":{"title":"Timely Updates over an Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elie Najm, Emina Soljanin, Jing Zhong, Roy D. Yates","submitted_at":"2017-04-13T14:43:31Z","abstract_excerpt":"Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which the transmission of a k-symbol update continuesuntil k symbols are received. This system is then compared to a fixed redundancy (FR) system in which each update is transmitted as an n symbol packet and the packet is successfully received if and only if at least k symbols are received. If fewer than k symbols are received, the update is discarde"},"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":"1704.04155","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-13T14:43:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0037d1403dbe9eab80541bb23e947d6103360bcd6ebe9fc57b4d31b9e6f34e83","abstract_canon_sha256":"89b89748f43f272fd28d9ab598cafa90fad6ae78f45ea37fce628070d588f87c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:13.762970Z","signature_b64":"9iWGmP+GSMG1iDz6P93wLzJOpTKHoLW012A+zjQcmI+qwxoAlem76FkTf77Yf04pTMOCtqdb2XvpQhOSBzLRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"345b7ec2e485e9fae198047ff014ea810ef5628261062ba4e441fe1a81bae2e9","last_reissued_at":"2026-05-18T00:04:13.762252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:13.762252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timely Updates over an Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elie Najm, Emina Soljanin, Jing Zhong, Roy D. Yates","submitted_at":"2017-04-13T14:43:31Z","abstract_excerpt":"Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which the transmission of a k-symbol update continuesuntil k symbols are received. This system is then compared to a fixed redundancy (FR) system in which each update is transmitted as an n symbol packet and the packet is successfully received if and only if at least k symbols are received. If fewer than k symbols are received, the update is discarde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04155","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":"1704.04155","created_at":"2026-05-18T00:04:13.762366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04155v4","created_at":"2026-05-18T00:04:13.762366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04155","created_at":"2026-05-18T00:04:13.762366+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRNX5QXEQXU7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRNX5QXEQXU7VYMY","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRNX5QXE","created_at":"2026-05-18T12:31:18.294218+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/GRNX5QXEQXU7VYMYAR77AFHKQE","json":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE.json","graph_json":"https://pith.science/api/pith-number/GRNX5QXEQXU7VYMYAR77AFHKQE/graph.json","events_json":"https://pith.science/api/pith-number/GRNX5QXEQXU7VYMYAR77AFHKQE/events.json","paper":"https://pith.science/paper/GRNX5QXE"},"agent_actions":{"view_html":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE","download_json":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE.json","view_paper":"https://pith.science/paper/GRNX5QXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04155&json=true","fetch_graph":"https://pith.science/api/pith-number/GRNX5QXEQXU7VYMYAR77AFHKQE/graph.json","fetch_events":"https://pith.science/api/pith-number/GRNX5QXEQXU7VYMYAR77AFHKQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE/action/storage_attestation","attest_author":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE/action/author_attestation","sign_citation":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE/action/citation_signature","submit_replication":"https://pith.science/pith/GRNX5QXEQXU7VYMYAR77AFHKQE/action/replication_record"}},"created_at":"2026-05-18T00:04:13.762366+00:00","updated_at":"2026-05-18T00:04:13.762366+00:00"}