{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PUUY6QHAH3QAVBGBCA7GTHEICG","short_pith_number":"pith:PUUY6QHA","schema_version":"1.0","canonical_sha256":"7d298f40e03ee00a84c1103e699c8811906b9ec9cb5fec8ef2a1197ebaf1bfbc","source":{"kind":"arxiv","id":"1901.02873","version":4},"attestation_state":"computed","paper":{"title":"Waiting before Serving: A Companion to Packet Management in Status Update Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Omur Ozel, Peng Zou, Suresh Subramaniam","submitted_at":"2019-01-09T18:46:44Z","abstract_excerpt":"In this paper, we explore the potential of server waiting before packet transmission in improving the Age of Information (AoI) in status update systems. We consider a non-preemptive queue with Poisson arrivals and independent general service distribution and we incorporate waiting before serving in two packet management schemes: M/GI/1/1 and M/GI/1/$2^*$. In M/GI/1/1 scheme, the server waits for a deterministic time immediately after a packet enters the server. In M/GI/1/$2^*$ scheme, depending on idle or busy system state, the server waits for a deterministic time before starting service of t"},"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":"1901.02873","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:46:44Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"6e32b1d5036e40d0fb818f377ccb933058e55675ce00c330ef536b319624c47a","abstract_canon_sha256":"5216b545ed2bc4d92bc6ea7445ebe8c547641ebc740113be3e2faec28401e68a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:04.650919Z","signature_b64":"B7ZRaZ78z/zuURnoL5y+cUKJQnXhmT+0S0r4lxdCWcP5yRFtl+uERQQmTsavtStKcs4Dt4OvomK0HXwC5ztVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d298f40e03ee00a84c1103e699c8811906b9ec9cb5fec8ef2a1197ebaf1bfbc","last_reissued_at":"2026-05-17T23:48:04.650533Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:04.650533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Waiting before Serving: A Companion to Packet Management in Status Update Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Omur Ozel, Peng Zou, Suresh Subramaniam","submitted_at":"2019-01-09T18:46:44Z","abstract_excerpt":"In this paper, we explore the potential of server waiting before packet transmission in improving the Age of Information (AoI) in status update systems. We consider a non-preemptive queue with Poisson arrivals and independent general service distribution and we incorporate waiting before serving in two packet management schemes: M/GI/1/1 and M/GI/1/$2^*$. In M/GI/1/1 scheme, the server waits for a deterministic time immediately after a packet enters the server. In M/GI/1/$2^*$ scheme, depending on idle or busy system state, the server waits for a deterministic time before starting service of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02873","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":"1901.02873","created_at":"2026-05-17T23:48:04.650589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02873v4","created_at":"2026-05-17T23:48:04.650589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02873","created_at":"2026-05-17T23:48:04.650589+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUUY6QHAH3QA","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUUY6QHAH3QAVBGB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUUY6QHA","created_at":"2026-05-18T12:33:24.271573+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":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG","json":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG.json","graph_json":"https://pith.science/api/pith-number/PUUY6QHAH3QAVBGBCA7GTHEICG/graph.json","events_json":"https://pith.science/api/pith-number/PUUY6QHAH3QAVBGBCA7GTHEICG/events.json","paper":"https://pith.science/paper/PUUY6QHA"},"agent_actions":{"view_html":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG","download_json":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG.json","view_paper":"https://pith.science/paper/PUUY6QHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02873&json=true","fetch_graph":"https://pith.science/api/pith-number/PUUY6QHAH3QAVBGBCA7GTHEICG/graph.json","fetch_events":"https://pith.science/api/pith-number/PUUY6QHAH3QAVBGBCA7GTHEICG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG/action/storage_attestation","attest_author":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG/action/author_attestation","sign_citation":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG/action/citation_signature","submit_replication":"https://pith.science/pith/PUUY6QHAH3QAVBGBCA7GTHEICG/action/replication_record"}},"created_at":"2026-05-17T23:48:04.650589+00:00","updated_at":"2026-05-17T23:48:04.650589+00:00"}