{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:43UXV3NCXEU4W5F5FKMXQWEZMZ","short_pith_number":"pith:43UXV3NC","schema_version":"1.0","canonical_sha256":"e6e97aeda2b929cb74bd2a997858996679cd71c7b49f608acc58ef4238fbb29e","source":{"kind":"arxiv","id":"1805.11720","version":1},"attestation_state":"computed","paper":{"title":"The Age of Updates in a Simple Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Maatouk, Anthony Ephremides, Mohamad Assaad","submitted_at":"2018-05-29T21:38:11Z","abstract_excerpt":"In this paper, we examine a system where status updates are generated by a source and are forwarded in a First-Come-First-Served (FCFS) manner to the monitor. We consider the case where the server has other tasks to fulfill, a simple example being relaying the packets of another stream. Due to the server's necessity to go on vacations, the age process of the stream of interest becomes complicated to evaluate. By leveraging specific queuing theory tools, we provide a closed form of the average age for both streams which enables us to optimize the generation rate of packets belonging to each str"},"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":"1805.11720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T21:38:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"172deafc842cb48ba5199d7d1adaee3698bab3c01c49dbca42a30ac59793df20","abstract_canon_sha256":"815395ffed9f0a0d73c4cb088629beaa2d84bd75b190d02491da02025c33098c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:36.784668Z","signature_b64":"hB+HA4wVJ2xB3QfsqmYqnqvpSZ3DOL8p9LiAEEMIKlHN6pDnJLscTVDRRIVVVhTCImbUcp5cioJ/0rQ4gRPuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e97aeda2b929cb74bd2a997858996679cd71c7b49f608acc58ef4238fbb29e","last_reissued_at":"2026-05-18T00:14:36.783843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:36.783843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Age of Updates in a Simple Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Maatouk, Anthony Ephremides, Mohamad Assaad","submitted_at":"2018-05-29T21:38:11Z","abstract_excerpt":"In this paper, we examine a system where status updates are generated by a source and are forwarded in a First-Come-First-Served (FCFS) manner to the monitor. We consider the case where the server has other tasks to fulfill, a simple example being relaying the packets of another stream. Due to the server's necessity to go on vacations, the age process of the stream of interest becomes complicated to evaluate. By leveraging specific queuing theory tools, we provide a closed form of the average age for both streams which enables us to optimize the generation rate of packets belonging to each str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11720","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":"1805.11720","created_at":"2026-05-18T00:14:36.783997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11720v1","created_at":"2026-05-18T00:14:36.783997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11720","created_at":"2026-05-18T00:14:36.783997+00:00"},{"alias_kind":"pith_short_12","alias_value":"43UXV3NCXEU4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"43UXV3NCXEU4W5F5","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"43UXV3NC","created_at":"2026-05-18T12:32:05.422762+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":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ","json":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ.json","graph_json":"https://pith.science/api/pith-number/43UXV3NCXEU4W5F5FKMXQWEZMZ/graph.json","events_json":"https://pith.science/api/pith-number/43UXV3NCXEU4W5F5FKMXQWEZMZ/events.json","paper":"https://pith.science/paper/43UXV3NC"},"agent_actions":{"view_html":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ","download_json":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ.json","view_paper":"https://pith.science/paper/43UXV3NC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11720&json=true","fetch_graph":"https://pith.science/api/pith-number/43UXV3NCXEU4W5F5FKMXQWEZMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/43UXV3NCXEU4W5F5FKMXQWEZMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ/action/storage_attestation","attest_author":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ/action/author_attestation","sign_citation":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ/action/citation_signature","submit_replication":"https://pith.science/pith/43UXV3NCXEU4W5F5FKMXQWEZMZ/action/replication_record"}},"created_at":"2026-05-18T00:14:36.783997+00:00","updated_at":"2026-05-18T00:14:36.783997+00:00"}